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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.3M
-rw-r--r-- 1 mcc users 40K Feb 26 09:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 230K Feb 26 09:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 104K Feb 26 09:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 488K Feb 26 09:33 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 18K Feb 25 17:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 25 17:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 31K Feb 25 17:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 110K Feb 25 17:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 88K Feb 26 09:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 496K Feb 26 09:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 268K Feb 26 09:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.3M Feb 26 09:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 17:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 11K 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 53K 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-BN04-LTLFireability-00
FORMULA_NAME Sudoku-PT-BN04-LTLFireability-01
FORMULA_NAME Sudoku-PT-BN04-LTLFireability-02
FORMULA_NAME Sudoku-PT-BN04-LTLFireability-03
FORMULA_NAME Sudoku-PT-BN04-LTLFireability-04
FORMULA_NAME Sudoku-PT-BN04-LTLFireability-05
FORMULA_NAME Sudoku-PT-BN04-LTLFireability-06
FORMULA_NAME Sudoku-PT-BN04-LTLFireability-07
FORMULA_NAME Sudoku-PT-BN04-LTLFireability-08
FORMULA_NAME Sudoku-PT-BN04-LTLFireability-09
FORMULA_NAME Sudoku-PT-BN04-LTLFireability-10
FORMULA_NAME Sudoku-PT-BN04-LTLFireability-11
FORMULA_NAME Sudoku-PT-BN04-LTLFireability-12
FORMULA_NAME Sudoku-PT-BN04-LTLFireability-13
FORMULA_NAME Sudoku-PT-BN04-LTLFireability-14
FORMULA_NAME Sudoku-PT-BN04-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679182364590

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-BN04
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-18 23:32:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-18 23:32:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 23:32:46] [INFO ] Load time of PNML (sax parser for PT used): 37 ms
[2023-03-18 23:32:46] [INFO ] Transformed 128 places.
[2023-03-18 23:32:46] [INFO ] Transformed 64 transitions.
[2023-03-18 23:32:46] [INFO ] Parsed PT model containing 128 places and 64 transitions and 320 arcs in 94 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA Sudoku-PT-BN04-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN04-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN04-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 64 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 64 transition count 64
Applied a total of 64 rules in 10 ms. Remains 64 /128 variables (removed 64) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 64 cols
[2023-03-18 23:32:46] [INFO ] Computed 24 place invariants in 21 ms
[2023-03-18 23:32:46] [INFO ] Implicit Places using invariants in 153 ms returned []
[2023-03-18 23:32:46] [INFO ] Invariant cache hit.
[2023-03-18 23:32:46] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
[2023-03-18 23:32:46] [INFO ] Invariant cache hit.
[2023-03-18 23:32:46] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 64/128 places, 64/64 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 367 ms. Remains : 64/128 places, 64/64 transitions.
Support contains 64 out of 64 places after structural reductions.
[2023-03-18 23:32:47] [INFO ] Flatten gal took : 31 ms
[2023-03-18 23:32:47] [INFO ] Flatten gal took : 22 ms
[2023-03-18 23:32:47] [INFO ] Input system was already deterministic with 64 transitions.
Finished random walk after 11 steps, including 0 resets, run visited all 18 properties in 12 ms. (steps per millisecond=0 )
Computed a total of 64 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 64 transition count 64
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 64 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 64/64 transitions.
Applied a total of 0 rules in 3 ms. Remains 64 /64 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2023-03-18 23:32:47] [INFO ] Invariant cache hit.
[2023-03-18 23:32:47] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-18 23:32:47] [INFO ] Invariant cache hit.
[2023-03-18 23:32:47] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2023-03-18 23:32:47] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 23:32:47] [INFO ] Invariant cache hit.
[2023-03-18 23:32:47] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 145 ms. Remains : 64/64 places, 64/64 transitions.
Stuttering acceptance computed with spot in 338 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-BN04-LTLFireability-00 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 s7 1) (GEQ s23 1) (GEQ s38 1) (GEQ s59 1)) (AND (GEQ s14 1) (GEQ s30 1) (GEQ s46 1) (GEQ s58 1)) (AND (GEQ s15 1) (GEQ s27 1) (GEQ s44 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 2 ms.
FORMULA Sudoku-PT-BN04-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN04-LTLFireability-00 finished in 531 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 64 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 64/64 transitions.
Applied a total of 0 rules in 3 ms. Remains 64 /64 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2023-03-18 23:32:48] [INFO ] Invariant cache hit.
[2023-03-18 23:32:48] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-18 23:32:48] [INFO ] Invariant cache hit.
[2023-03-18 23:32:48] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
[2023-03-18 23:32:48] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 23:32:48] [INFO ] Invariant cache hit.
[2023-03-18 23:32:48] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 331 ms. Remains : 64/64 places, 64/64 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-BN04-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s7 1) (GEQ s23 1) (GEQ s38 1) (GEQ s59 1)) (AND (GEQ s14 1) (GEQ s30 1) (GEQ s46 1) (GEQ s58 1)) (AND (GEQ s15 1) (GEQ s27 1) (GEQ s44 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 2 ms.
FORMULA Sudoku-PT-BN04-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN04-LTLFireability-01 finished in 413 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 64 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 64/64 transitions.
Applied a total of 0 rules in 3 ms. Remains 64 /64 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2023-03-18 23:32:48] [INFO ] Invariant cache hit.
[2023-03-18 23:32:48] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-18 23:32:48] [INFO ] Invariant cache hit.
[2023-03-18 23:32:48] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
[2023-03-18 23:32:48] [INFO ] Invariant cache hit.
[2023-03-18 23:32:48] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 176 ms. Remains : 64/64 places, 64/64 transitions.
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-BN04-LTLFireability-04 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:(OR (AND (GEQ s7 1) (GEQ s23 1) (GEQ s38 1) (GEQ s59 1)) (AND (GEQ s14 1) (GEQ s30 1) (GEQ s46 1) (GEQ s58 1)) (AND (GEQ s15 1) (GEQ s27 1) (GEQ s44 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 12 steps with 0 reset in 2 ms.
FORMULA Sudoku-PT-BN04-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN04-LTLFireability-04 finished in 288 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(!p0))'
Support contains 64 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 64 /64 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2023-03-18 23:32:48] [INFO ] Invariant cache hit.
[2023-03-18 23:32:48] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-18 23:32:48] [INFO ] Invariant cache hit.
[2023-03-18 23:32:48] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2023-03-18 23:32:48] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 23:32:48] [INFO ] Invariant cache hit.
[2023-03-18 23:32:48] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 141 ms. Remains : 64/64 places, 64/64 transitions.
Stuttering acceptance computed with spot in 31 ms :[p0]
Running random walk in product with property : Sudoku-PT-BN04-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s7 1) (GEQ s23 1) (GEQ s38 1) (GEQ s59 1)) (AND (GEQ s14 1) (GEQ s30 1) (GEQ s46 1) (GEQ s58 1)) (AND (GEQ s15 1) (GEQ s27 1) (GEQ s44 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 7176 reset in 688 ms.
Product exploration explored 100000 steps with 7173 reset in 633 ms.
Computed a total of 64 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 64 transition count 64
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 :(F (G (NOT p0)))
Knowledge based reduction with 4 factoid took 87 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-BN04-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-BN04-LTLFireability-05 finished in 1690 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(!p0))'
Support contains 64 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 64 /64 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2023-03-18 23:32:50] [INFO ] Invariant cache hit.
[2023-03-18 23:32:50] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-18 23:32:50] [INFO ] Invariant cache hit.
[2023-03-18 23:32:50] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
[2023-03-18 23:32:50] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 23:32:50] [INFO ] Invariant cache hit.
[2023-03-18 23:32:50] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 182 ms. Remains : 64/64 places, 64/64 transitions.
Stuttering acceptance computed with spot in 39 ms :[p0]
Running random walk in product with property : Sudoku-PT-BN04-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s7 1) (GEQ s23 1) (GEQ s38 1) (GEQ s59 1)) (AND (GEQ s14 1) (GEQ s30 1) (GEQ s46 1) (GEQ s58 1)) (AND (GEQ s15 1) (GEQ s27 1) (GEQ s44 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 7174 reset in 534 ms.
Product exploration explored 100000 steps with 7178 reset in 558 ms.
Computed a total of 64 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 64 transition count 64
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 :(F (G (NOT p0)))
Knowledge based reduction with 4 factoid took 110 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-BN04-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-BN04-LTLFireability-06 finished in 1497 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 64 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 64/64 transitions.
Applied a total of 0 rules in 3 ms. Remains 64 /64 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2023-03-18 23:32:51] [INFO ] Invariant cache hit.
[2023-03-18 23:32:52] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-18 23:32:52] [INFO ] Invariant cache hit.
[2023-03-18 23:32:52] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
[2023-03-18 23:32:52] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 23:32:52] [INFO ] Invariant cache hit.
[2023-03-18 23:32:52] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 226 ms. Remains : 64/64 places, 64/64 transitions.
Stuttering acceptance computed with spot in 65 ms :[p0, p0]
Running random walk in product with property : Sudoku-PT-BN04-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s7 1) (GEQ s23 1) (GEQ s38 1) (GEQ s59 1)) (AND (GEQ s14 1) (GEQ s30 1) (GEQ s46 1) (GEQ s58 1)) (AND (GEQ s15 1) (GEQ s27 1) (GEQ s44 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 7183 reset in 547 ms.
Product exploration explored 100000 steps with 7181 reset in 579 ms.
Computed a total of 64 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 64 transition count 64
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 :(F (G (NOT p0)))
Knowledge based reduction with 4 factoid took 269 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-BN04-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-BN04-LTLFireability-07 finished in 1774 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p1)||X(F(p2))||p0)))'
Support contains 12 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 64/64 transitions.
Applied a total of 0 rules in 11 ms. Remains 64 /64 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2023-03-18 23:32:53] [INFO ] Invariant cache hit.
[2023-03-18 23:32:53] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-18 23:32:53] [INFO ] Invariant cache hit.
[2023-03-18 23:32:53] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
[2023-03-18 23:32:53] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 23:32:53] [INFO ] Invariant cache hit.
[2023-03-18 23:32:53] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 249 ms. Remains : 64/64 places, 64/64 transitions.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Sudoku-PT-BN04-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s5 1) (LT s17 1) (LT s37 1) (LT s53 1)), p1:(AND (GEQ s12 1) (GEQ s24 1) (GEQ s44 1) (GEQ s48 1) (GEQ s2 1) (GEQ s22 1) (GEQ s34 1) (GEQ s58 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 84 steps with 5 reset in 2 ms.
FORMULA Sudoku-PT-BN04-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN04-LTLFireability-08 finished in 342 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 4 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 64/64 transitions.
Applied a total of 0 rules in 9 ms. Remains 64 /64 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2023-03-18 23:32:54] [INFO ] Invariant cache hit.
[2023-03-18 23:32:54] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-18 23:32:54] [INFO ] Invariant cache hit.
[2023-03-18 23:32:54] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
[2023-03-18 23:32:54] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 23:32:54] [INFO ] Invariant cache hit.
[2023-03-18 23:32:54] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 238 ms. Remains : 64/64 places, 64/64 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-BN04-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s2 1) (GEQ s22 1) (GEQ s34 1) (GEQ s58 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 0 ms.
FORMULA Sudoku-PT-BN04-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN04-LTLFireability-09 finished in 299 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(p0)||X(F(p1))))'
Support contains 8 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 64/64 transitions.
Applied a total of 0 rules in 3 ms. Remains 64 /64 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2023-03-18 23:32:54] [INFO ] Invariant cache hit.
[2023-03-18 23:32:54] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-18 23:32:54] [INFO ] Invariant cache hit.
[2023-03-18 23:32:54] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
[2023-03-18 23:32:54] [INFO ] Invariant cache hit.
[2023-03-18 23:32:54] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 241 ms. Remains : 64/64 places, 64/64 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-PT-BN04-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s1 1) (GEQ s17 1) (GEQ s33 1) (GEQ s53 1)), p0:(AND (GEQ s4 1) (GEQ s16 1) (GEQ s37 1) (GEQ s52 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 26 steps with 7 reset in 0 ms.
FORMULA Sudoku-PT-BN04-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN04-LTLFireability-11 finished in 359 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 U (G(p1)&&p2))||p0)))))'
Support contains 15 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 64 /64 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2023-03-18 23:32:54] [INFO ] Invariant cache hit.
[2023-03-18 23:32:54] [INFO ] Implicit Places using invariants in 91 ms returned []
[2023-03-18 23:32:54] [INFO ] Invariant cache hit.
[2023-03-18 23:32:54] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
[2023-03-18 23:32:54] [INFO ] Invariant cache hit.
[2023-03-18 23:32:55] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 256 ms. Remains : 64/64 places, 64/64 transitions.
Stuttering acceptance computed with spot in 243 ms :[true, (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : Sudoku-PT-BN04-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 0}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND p2 p1), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=2 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(OR (AND p0 p1) (AND p2 p1)), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 2}]], initial=4, aps=[p2:(AND (GEQ s7 1) (GEQ s23 1) (GEQ s39 1) (GEQ s63 1)), p1:(AND (GEQ s5 1) (GEQ s21 1) (GEQ s38 1) (GEQ s57 1)), p0:(OR (LT s13 1) (LT s29 1) (LT s47 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 64 steps with 4 reset in 1 ms.
FORMULA Sudoku-PT-BN04-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN04-LTLFireability-12 finished in 532 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 4 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 64/64 transitions.
Applied a total of 0 rules in 3 ms. Remains 64 /64 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2023-03-18 23:32:55] [INFO ] Invariant cache hit.
[2023-03-18 23:32:55] [INFO ] Implicit Places using invariants in 76 ms returned []
[2023-03-18 23:32:55] [INFO ] Invariant cache hit.
[2023-03-18 23:32:55] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
[2023-03-18 23:32:55] [INFO ] Invariant cache hit.
[2023-03-18 23:32:55] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 230 ms. Remains : 64/64 places, 64/64 transitions.
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-BN04-LTLFireability-13 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 s6 1) (GEQ s22 1) (GEQ s38 1) (GEQ s58 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 6 steps with 0 reset in 0 ms.
FORMULA Sudoku-PT-BN04-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN04-LTLFireability-13 finished in 331 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(((((p2||F(p3))&&p1) U !p4)||p0))))'
Support contains 6 out of 64 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 64/64 transitions.
Applied a total of 0 rules in 3 ms. Remains 64 /64 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2023-03-18 23:32:55] [INFO ] Invariant cache hit.
[2023-03-18 23:32:55] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-18 23:32:55] [INFO ] Invariant cache hit.
[2023-03-18 23:32:55] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
[2023-03-18 23:32:55] [INFO ] Invariant cache hit.
[2023-03-18 23:32:55] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 212 ms. Remains : 64/64 places, 64/64 transitions.
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) p4), (AND (NOT p0) p4)]
Running random walk in product with property : Sudoku-PT-BN04-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p4), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s8 1) (LT s28 1) (LT s42 1) (LT s56 1)), p4:(AND (GEQ s8 1) (GEQ s28 1) (GEQ s43 1) (GEQ s60 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 22799 reset in 714 ms.
Product exploration explored 100000 steps with 23105 reset in 729 ms.
Computed a total of 64 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 64 transition count 64
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 p0) p4), (F (G p0)), (F (G (NOT p4)))]
False Knowledge obtained : [(X (AND (NOT p0) p4)), (X (NOT (AND (NOT p0) p4))), (X (X (AND (NOT p0) p4))), (X (X (NOT (AND (NOT p0) p4))))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 3 factoid took 144 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-BN04-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-BN04-LTLFireability-14 finished in 1962 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(((!p0 U X(p0))||X(G(p1)))))'
Support contains 8 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 64/64 transitions.
Applied a total of 0 rules in 3 ms. Remains 64 /64 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2023-03-18 23:32:57] [INFO ] Invariant cache hit.
[2023-03-18 23:32:57] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-18 23:32:57] [INFO ] Invariant cache hit.
[2023-03-18 23:32:57] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
[2023-03-18 23:32:57] [INFO ] Invariant cache hit.
[2023-03-18 23:32:57] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 226 ms. Remains : 64/64 places, 64/64 transitions.
Stuttering acceptance computed with spot in 183 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : Sudoku-PT-BN04-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=2, aps=[p0:(AND (GEQ s6 1) (GEQ s22 1) (GEQ s39 1) (GEQ s62 1)), p1:(OR (LT s3 1) (LT s19 1) (LT s33 1) (LT s55 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 34 steps with 2 reset in 0 ms.
FORMULA Sudoku-PT-BN04-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN04-LTLFireability-15 finished in 421 ms.
All properties solved by simple procedures.
Total runtime 11744 ms.
ITS solved all properties within timeout

BK_STOP 1679182379308

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Sudoku-PT-BN04"
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-BN04, 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-167912702900300"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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