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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 7.0K Feb 26 08:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 26 08:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 08:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 08:45 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 3.6K Feb 25 17:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 26 09:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 178K Feb 26 09:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Feb 26 08:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 26 08:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 6.5K 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-COL-AN07-LTLFireability-00
FORMULA_NAME Sudoku-COL-AN07-LTLFireability-01
FORMULA_NAME Sudoku-COL-AN07-LTLFireability-02
FORMULA_NAME Sudoku-COL-AN07-LTLFireability-03
FORMULA_NAME Sudoku-COL-AN07-LTLFireability-04
FORMULA_NAME Sudoku-COL-AN07-LTLFireability-05
FORMULA_NAME Sudoku-COL-AN07-LTLFireability-06
FORMULA_NAME Sudoku-COL-AN07-LTLFireability-07
FORMULA_NAME Sudoku-COL-AN07-LTLFireability-08
FORMULA_NAME Sudoku-COL-AN07-LTLFireability-09
FORMULA_NAME Sudoku-COL-AN07-LTLFireability-10
FORMULA_NAME Sudoku-COL-AN07-LTLFireability-11
FORMULA_NAME Sudoku-COL-AN07-LTLFireability-12
FORMULA_NAME Sudoku-COL-AN07-LTLFireability-13
FORMULA_NAME Sudoku-COL-AN07-LTLFireability-14
FORMULA_NAME Sudoku-COL-AN07-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679159253985

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-COL-AN07
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-18 17:07:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-18 17:07:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 17:07:35] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-18 17:07:35] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-18 17:07:35] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 358 ms
[2023-03-18 17:07:36] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 490 PT places and 343.0 transition bindings in 262 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2023-03-18 17:07:36] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 4 ms.
[2023-03-18 17:07:36] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 5 properties that can be checked using skeleton over-approximation.
FORMULA Sudoku-COL-AN07-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN07-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN07-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN07-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN07-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
[2023-03-18 17:07:36] [INFO ] Flatten gal took : 10 ms
[2023-03-18 17:07:36] [INFO ] Flatten gal took : 1 ms
Domain [N(7), N(7)] of place Rows breaks symmetries in sort N
[2023-03-18 17:07:36] [INFO ] Unfolded HLPN to a Petri net with 490 places and 343 transitions 1372 arcs in 21 ms.
[2023-03-18 17:07:36] [INFO ] Unfolded 11 HLPN properties in 1 ms.
Initial state reduction rules removed 3 formulas.
FORMULA Sudoku-COL-AN07-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN07-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN07-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 147 out of 490 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Reduce places removed 343 places and 0 transitions.
Iterating post reduction 0 with 343 rules applied. Total rules applied 343 place count 147 transition count 343
Applied a total of 343 rules in 18 ms. Remains 147 /490 variables (removed 343) and now considering 343/343 (removed 0) transitions.
// Phase 1: matrix 343 rows 147 cols
[2023-03-18 17:07:36] [INFO ] Computed 20 place invariants in 37 ms
[2023-03-18 17:07:36] [INFO ] Implicit Places using invariants in 210 ms returned []
[2023-03-18 17:07:36] [INFO ] Invariant cache hit.
[2023-03-18 17:07:36] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 385 ms to find 0 implicit places.
[2023-03-18 17:07:36] [INFO ] Invariant cache hit.
[2023-03-18 17:07:37] [INFO ] Dead Transitions using invariants and state equation in 193 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 147/490 places, 343/343 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 599 ms. Remains : 147/490 places, 343/343 transitions.
Support contains 147 out of 147 places after structural reductions.
[2023-03-18 17:07:37] [INFO ] Flatten gal took : 82 ms
[2023-03-18 17:07:37] [INFO ] Flatten gal took : 71 ms
[2023-03-18 17:07:37] [INFO ] Input system was already deterministic with 343 transitions.
Finished random walk after 44 steps, including 0 resets, run visited all 1 properties in 11 ms. (steps per millisecond=4 )
Computed a total of 147 stabilizing places and 343 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 147 transition count 343
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' '!(F((p0||X(X(p0)))))'
Support contains 147 out of 147 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 147/147 places, 343/343 transitions.
Applied a total of 0 rules in 8 ms. Remains 147 /147 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2023-03-18 17:07:38] [INFO ] Invariant cache hit.
[2023-03-18 17:07:38] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-18 17:07:38] [INFO ] Invariant cache hit.
[2023-03-18 17:07:38] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
[2023-03-18 17:07:38] [INFO ] Redundant transitions in 20 ms returned []
[2023-03-18 17:07:38] [INFO ] Invariant cache hit.
[2023-03-18 17:07:38] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 356 ms. Remains : 147/147 places, 343/343 transitions.
Stuttering acceptance computed with spot in 133 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN07-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s4 1) (LT s49 1) (LT s102 1)) (OR (LT s30 1) (LT s78 1) (LT s107 1)) (OR (LT s23 1) (LT s76 1) (LT s142 1)) (OR (LT s39 1) (LT s88 1) (LT ...], 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 2347 reset in 1966 ms.
Product exploration explored 100000 steps with 2349 reset in 1923 ms.
Computed a total of 147 stabilizing places and 343 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 147 transition count 343
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 155 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-COL-AN07-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN07-LTLFireability-00 finished in 5013 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 0 out of 147 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 147/147 places, 343/343 transitions.
Applied a total of 0 rules in 8 ms. Remains 147 /147 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2023-03-18 17:07:43] [INFO ] Invariant cache hit.
[2023-03-18 17:07:43] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-18 17:07:43] [INFO ] Invariant cache hit.
[2023-03-18 17:07:43] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
[2023-03-18 17:07:43] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-18 17:07:43] [INFO ] Invariant cache hit.
[2023-03-18 17:07:43] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 285 ms. Remains : 147/147 places, 343/343 transitions.
Stuttering acceptance computed with spot in 10 ms :[false]
Running random walk in product with property : Sudoku-COL-AN07-LTLFireability-03 automaton TGBA Formula[mat=[[]], initial=0, aps=[], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Initial state of product has no viable successors after 0 steps with 0 reset in 0 ms.
FORMULA Sudoku-COL-AN07-LTLFireability-03 TRUE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN07-LTLFireability-03 finished in 324 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||X(G(p0))))))'
Support contains 147 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 343/343 transitions.
Applied a total of 0 rules in 1 ms. Remains 147 /147 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2023-03-18 17:07:43] [INFO ] Invariant cache hit.
[2023-03-18 17:07:43] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-18 17:07:43] [INFO ] Invariant cache hit.
[2023-03-18 17:07:43] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
[2023-03-18 17:07:43] [INFO ] Invariant cache hit.
[2023-03-18 17:07:43] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 261 ms. Remains : 147/147 places, 343/343 transitions.
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN07-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p0:(AND (OR (LT s4 1) (LT s49 1) (LT s102 1)) (OR (LT s30 1) (LT s78 1) (LT s107 1)) (OR (LT s23 1) (LT s76 1) (LT s142 1)) (OR (LT s39 1) (LT s88 1) (LT ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA Sudoku-COL-AN07-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN07-LTLFireability-04 finished in 415 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 147 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 343/343 transitions.
Applied a total of 0 rules in 2 ms. Remains 147 /147 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2023-03-18 17:07:43] [INFO ] Invariant cache hit.
[2023-03-18 17:07:43] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-18 17:07:43] [INFO ] Invariant cache hit.
[2023-03-18 17:07:44] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
[2023-03-18 17:07:44] [INFO ] Invariant cache hit.
[2023-03-18 17:07:44] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 267 ms. Remains : 147/147 places, 343/343 transitions.
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN07-LTLFireability-05 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 (OR (LT s4 1) (LT s49 1) (LT s102 1)) (OR (LT s30 1) (LT s78 1) (LT s107 1)) (OR (LT s23 1) (LT s76 1) (LT s142 1)) (OR (LT s39 1) (LT s88 1) (LT ...], 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 1 steps with 0 reset in 1 ms.
FORMULA Sudoku-COL-AN07-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN07-LTLFireability-05 finished in 370 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 147 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 343/343 transitions.
Applied a total of 0 rules in 2 ms. Remains 147 /147 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2023-03-18 17:07:44] [INFO ] Invariant cache hit.
[2023-03-18 17:07:44] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-18 17:07:44] [INFO ] Invariant cache hit.
[2023-03-18 17:07:44] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
[2023-03-18 17:07:44] [INFO ] Invariant cache hit.
[2023-03-18 17:07:44] [INFO ] Dead Transitions using invariants and state equation in 133 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 280 ms. Remains : 147/147 places, 343/343 transitions.
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN07-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(AND (OR (LT s4 1) (LT s49 1) (LT s102 1)) (OR (LT s30 1) (LT s78 1) (LT s107 1)) (OR (LT s23 1) (LT s76 1) (LT s142 1)) (OR (LT s39 1) (LT s88 1) (LT ...], 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][false, false, false, false]]
Product exploration explored 100000 steps with 2346 reset in 1913 ms.
Product exploration explored 100000 steps with 2348 reset in 1958 ms.
Computed a total of 147 stabilizing places and 343 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 147 transition count 343
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), true, (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 3 factoid took 63 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN07-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN07-LTLFireability-07 finished in 4747 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||X(F(!p0))))))'
Support contains 0 out of 147 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 147/147 places, 343/343 transitions.
Applied a total of 0 rules in 6 ms. Remains 147 /147 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2023-03-18 17:07:49] [INFO ] Invariant cache hit.
[2023-03-18 17:07:49] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-18 17:07:49] [INFO ] Invariant cache hit.
[2023-03-18 17:07:49] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
[2023-03-18 17:07:49] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-18 17:07:49] [INFO ] Invariant cache hit.
[2023-03-18 17:07:49] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 288 ms. Remains : 147/147 places, 343/343 transitions.
Stuttering acceptance computed with spot in 10 ms :[false]
Running random walk in product with property : Sudoku-COL-AN07-LTLFireability-09 automaton TGBA Formula[mat=[[]], initial=0, aps=[], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Initial state of product has no viable successors after 0 steps with 0 reset in 0 ms.
FORMULA Sudoku-COL-AN07-LTLFireability-09 TRUE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN07-LTLFireability-09 finished in 326 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 147 out of 147 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 147/147 places, 343/343 transitions.
Applied a total of 0 rules in 5 ms. Remains 147 /147 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2023-03-18 17:07:49] [INFO ] Invariant cache hit.
[2023-03-18 17:07:49] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-18 17:07:49] [INFO ] Invariant cache hit.
[2023-03-18 17:07:49] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
[2023-03-18 17:07:49] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-18 17:07:49] [INFO ] Invariant cache hit.
[2023-03-18 17:07:49] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 287 ms. Remains : 147/147 places, 343/343 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN07-LTLFireability-12 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 (OR (LT s4 1) (LT s49 1) (LT s102 1)) (OR (LT s30 1) (LT s78 1) (LT s107 1)) (OR (LT s23 1) (LT s76 1) (LT s142 1)) (OR (LT s39 1) (LT s88 1) (LT ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 2349 reset in 2124 ms.
Product exploration explored 100000 steps with 2351 reset in 2123 ms.
Computed a total of 147 stabilizing places and 343 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 147 transition count 343
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 85 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN07-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN07-LTLFireability-12 finished in 5065 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)&&X(G(p0))))'
Support contains 147 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 343/343 transitions.
Applied a total of 0 rules in 2 ms. Remains 147 /147 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2023-03-18 17:07:54] [INFO ] Invariant cache hit.
[2023-03-18 17:07:54] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-18 17:07:54] [INFO ] Invariant cache hit.
[2023-03-18 17:07:54] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
[2023-03-18 17:07:54] [INFO ] Invariant cache hit.
[2023-03-18 17:07:54] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 264 ms. Remains : 147/147 places, 343/343 transitions.
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), true]
Running random walk in product with property : Sudoku-COL-AN07-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (OR (LT s4 1) (LT s49 1) (LT s102 1)) (OR (LT s30 1) (LT s78 1) (LT s107 1)) (OR (LT s23 1) (LT s76 1) (LT s142 1)) (OR (LT s39 1) (LT s88 1) (LT ...], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Sudoku-COL-AN07-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN07-LTLFireability-13 finished in 368 ms.
All properties solved by simple procedures.
Total runtime 19436 ms.
ITS solved all properties within timeout

BK_STOP 1679159276099

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

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