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.r489-tall-167912706200012.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 ltsminxred
Input is Sudoku-COL-AN02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r489-tall-167912706200012
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 5.8K Feb 26 09:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Feb 26 09:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 09:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 09:02 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.8K Feb 25 17:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 09:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 157K Feb 26 09:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 09:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 115K Feb 26 09:02 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-AN02-LTLFireability-00
FORMULA_NAME Sudoku-COL-AN02-LTLFireability-01
FORMULA_NAME Sudoku-COL-AN02-LTLFireability-02
FORMULA_NAME Sudoku-COL-AN02-LTLFireability-03
FORMULA_NAME Sudoku-COL-AN02-LTLFireability-04
FORMULA_NAME Sudoku-COL-AN02-LTLFireability-05
FORMULA_NAME Sudoku-COL-AN02-LTLFireability-06
FORMULA_NAME Sudoku-COL-AN02-LTLFireability-07
FORMULA_NAME Sudoku-COL-AN02-LTLFireability-08
FORMULA_NAME Sudoku-COL-AN02-LTLFireability-09
FORMULA_NAME Sudoku-COL-AN02-LTLFireability-10
FORMULA_NAME Sudoku-COL-AN02-LTLFireability-11
FORMULA_NAME Sudoku-COL-AN02-LTLFireability-12
FORMULA_NAME Sudoku-COL-AN02-LTLFireability-13
FORMULA_NAME Sudoku-COL-AN02-LTLFireability-14
FORMULA_NAME Sudoku-COL-AN02-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679169805756

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-COL-AN02
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-18 20:03:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-18 20:03:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 20:03:27] [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 20:03:27] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-18 20:03:27] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 361 ms
[2023-03-18 20:03:27] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 20 PT places and 8.0 transition bindings in 17 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
FORMULA Sudoku-COL-AN02-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 20:03:27] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 4 ms.
[2023-03-18 20:03:27] [INFO ] Skeletonized 15 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 2 properties that can be checked using skeleton over-approximation.
FORMULA Sudoku-COL-AN02-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN02-LTLFireability-05 TRUE 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 20:03:27] [INFO ] Flatten gal took : 11 ms
[2023-03-18 20:03:27] [INFO ] Flatten gal took : 1 ms
Domain [N(2), N(2)] of place Rows breaks symmetries in sort N
[2023-03-18 20:03:27] [INFO ] Unfolded HLPN to a Petri net with 20 places and 8 transitions 32 arcs in 4 ms.
[2023-03-18 20:03:27] [INFO ] Unfolded 13 HLPN properties in 0 ms.
Initial state reduction rules removed 3 formulas.
FORMULA Sudoku-COL-AN02-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN02-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN02-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 12 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 8/8 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 12 transition count 8
Applied a total of 8 rules in 6 ms. Remains 12 /20 variables (removed 8) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 12 cols
[2023-03-18 20:03:28] [INFO ] Computed 5 place invariants in 8 ms
[2023-03-18 20:03:28] [INFO ] Implicit Places using invariants in 105 ms returned []
[2023-03-18 20:03:28] [INFO ] Invariant cache hit.
[2023-03-18 20:03:28] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
[2023-03-18 20:03:28] [INFO ] Invariant cache hit.
[2023-03-18 20:03:28] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 12/20 places, 8/8 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 312 ms. Remains : 12/20 places, 8/8 transitions.
Support contains 12 out of 12 places after structural reductions.
[2023-03-18 20:03:28] [INFO ] Flatten gal took : 5 ms
[2023-03-18 20:03:28] [INFO ] Flatten gal took : 7 ms
[2023-03-18 20:03:28] [INFO ] Input system was already deterministic with 8 transitions.
Finished random walk after 2 steps, including 0 resets, run visited all 2 properties in 10 ms. (steps per millisecond=0 )
FORMULA Sudoku-COL-AN02-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 12 stabilizing places and 8 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 12 transition count 8
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(X(X(F(p0)))))'
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-18 20:03:28] [INFO ] Invariant cache hit.
[2023-03-18 20:03:28] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-18 20:03:28] [INFO ] Invariant cache hit.
[2023-03-18 20:03:28] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2023-03-18 20:03:28] [INFO ] Invariant cache hit.
[2023-03-18 20:03:28] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 88 ms. Remains : 12/12 places, 8/8 transitions.
Stuttering acceptance computed with spot in 264 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN02-LTLFireability-00 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:(OR (AND (GEQ s0 1) (GEQ s5 1) (GEQ s10 1)) (AND (GEQ s0 1) (GEQ s4 1) (GEQ s8 1)) (AND (GEQ s1 1) (GEQ s5 1) (GEQ s11 1)) (AND (GEQ s2 1) (GEQ s7 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][false, false, false, false]]
Stuttering criterion allowed to conclude after 34 steps with 8 reset in 5 ms.
FORMULA Sudoku-COL-AN02-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN02-LTLFireability-00 finished in 443 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((p0&&X(F(!p0)))))))'
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-18 20:03:28] [INFO ] Invariant cache hit.
[2023-03-18 20:03:29] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-18 20:03:29] [INFO ] Invariant cache hit.
[2023-03-18 20:03:29] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2023-03-18 20:03:29] [INFO ] Invariant cache hit.
[2023-03-18 20:03:29] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 92 ms. Remains : 12/12 places, 8/8 transitions.
Stuttering acceptance computed with spot in 109 ms :[p0, true, true]
Running random walk in product with property : Sudoku-COL-AN02-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 0}, { cond=(NOT p0), acceptance={0} source=2 dest: 1}]], initial=1, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s5 1) (GEQ s10 1)) (AND (GEQ s0 1) (GEQ s4 1) (GEQ s8 1)) (AND (GEQ s1 1) (GEQ s5 1) (GEQ s11 1)) (AND (GEQ s2 1) (GEQ s7 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 22210 reset in 225 ms.
Product exploration explored 100000 steps with 22229 reset in 126 ms.
Computed a total of 12 stabilizing places and 8 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 12 transition count 8
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :p0
Knowledge based reduction with 3 factoid took 151 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN02-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN02-LTLFireability-01 finished in 810 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 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 5 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-18 20:03:29] [INFO ] Invariant cache hit.
[2023-03-18 20:03:29] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-18 20:03:29] [INFO ] Invariant cache hit.
[2023-03-18 20:03:29] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2023-03-18 20:03:29] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 20:03:29] [INFO ] Invariant cache hit.
[2023-03-18 20:03:29] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 91 ms. Remains : 12/12 places, 8/8 transitions.
Stuttering acceptance computed with spot in 31 ms :[p0]
Running random walk in product with property : Sudoku-COL-AN02-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s5 1) (GEQ s10 1)) (AND (GEQ s0 1) (GEQ s4 1) (GEQ s8 1)) (AND (GEQ s1 1) (GEQ s5 1) (GEQ s11 1)) (AND (GEQ s2 1) (GEQ s7 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 22206 reset in 144 ms.
Product exploration explored 100000 steps with 22216 reset in 147 ms.
Computed a total of 12 stabilizing places and 8 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 12 transition count 8
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
Knowledge based reduction with 3 factoid took 122 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-AN02-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN02-LTLFireability-02 finished in 580 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 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-18 20:03:30] [INFO ] Invariant cache hit.
[2023-03-18 20:03:30] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-18 20:03:30] [INFO ] Invariant cache hit.
[2023-03-18 20:03:30] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-03-18 20:03:30] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 20:03:30] [INFO ] Invariant cache hit.
[2023-03-18 20:03:30] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 83 ms. Remains : 12/12 places, 8/8 transitions.
Stuttering acceptance computed with spot in 31 ms :[p0]
Running random walk in product with property : Sudoku-COL-AN02-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s5 1) (GEQ s10 1)) (AND (GEQ s0 1) (GEQ s4 1) (GEQ s8 1)) (AND (GEQ s1 1) (GEQ s5 1) (GEQ s11 1)) (AND (GEQ s2 1) (GEQ s7 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 22228 reset in 100 ms.
Product exploration explored 100000 steps with 22181 reset in 84 ms.
Computed a total of 12 stabilizing places and 8 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 12 transition count 8
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
Knowledge based reduction with 3 factoid took 140 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-AN02-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN02-LTLFireability-06 finished in 482 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((p0&&G(F(p0)))))))'
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-18 20:03:30] [INFO ] Invariant cache hit.
[2023-03-18 20:03:30] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-18 20:03:30] [INFO ] Invariant cache hit.
[2023-03-18 20:03:30] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2023-03-18 20:03:30] [INFO ] Invariant cache hit.
[2023-03-18 20:03:30] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 92 ms. Remains : 12/12 places, 8/8 transitions.
Stuttering acceptance computed with spot in 264 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN02-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=p0, acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 5}, { cond=(NOT p0), acceptance={} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s5 1) (GEQ s10 1)) (AND (GEQ s0 1) (GEQ s4 1) (GEQ s8 1)) (AND (GEQ s1 1) (GEQ s5 1) (GEQ s11 1)) (AND (GEQ s2 1) (GEQ s7 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA Sudoku-COL-AN02-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN02-LTLFireability-07 finished in 371 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 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-18 20:03:31] [INFO ] Invariant cache hit.
[2023-03-18 20:03:31] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-18 20:03:31] [INFO ] Invariant cache hit.
[2023-03-18 20:03:31] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2023-03-18 20:03:31] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 20:03:31] [INFO ] Invariant cache hit.
[2023-03-18 20:03:31] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 84 ms. Remains : 12/12 places, 8/8 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN02-LTLFireability-08 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 s0 1) (GEQ s5 1) (GEQ s10 1)) (AND (GEQ s0 1) (GEQ s4 1) (GEQ s8 1)) (AND (GEQ s1 1) (GEQ s5 1) (GEQ s11 1)) (AND (GEQ s2 1) (GEQ s7 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 4 steps with 0 reset in 0 ms.
FORMULA Sudoku-COL-AN02-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN02-LTLFireability-08 finished in 168 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(!p0))))'
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-18 20:03:31] [INFO ] Invariant cache hit.
[2023-03-18 20:03:31] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-18 20:03:31] [INFO ] Invariant cache hit.
[2023-03-18 20:03:31] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2023-03-18 20:03:31] [INFO ] Invariant cache hit.
[2023-03-18 20:03:31] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 88 ms. Remains : 12/12 places, 8/8 transitions.
Stuttering acceptance computed with spot in 127 ms :[true, p0, p0, p0]
Running random walk in product with property : Sudoku-COL-AN02-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s5 1) (GEQ s10 1)) (AND (GEQ s0 1) (GEQ s4 1) (GEQ s8 1)) (AND (GEQ s1 1) (GEQ s5 1) (GEQ s11 1)) (AND (GEQ s2 1) (GEQ s7 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 1 reset in 0 ms.
FORMULA Sudoku-COL-AN02-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN02-LTLFireability-10 finished in 234 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(X(X(G(!p1))))||p0) U X(p1)))'
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-18 20:03:31] [INFO ] Invariant cache hit.
[2023-03-18 20:03:31] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-18 20:03:31] [INFO ] Invariant cache hit.
[2023-03-18 20:03:31] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2023-03-18 20:03:31] [INFO ] Invariant cache hit.
[2023-03-18 20:03:31] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 81 ms. Remains : 12/12 places, 8/8 transitions.
Stuttering acceptance computed with spot in 209 ms :[(NOT p1), (NOT p1), (NOT p1), p1, true, true]
Running random walk in product with property : Sudoku-COL-AN02-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 3}, { cond=(NOT p1), acceptance={} source=5 dest: 4}]], initial=0, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s5 1) (GEQ s10 1)) (AND (GEQ s0 1) (GEQ s4 1) (GEQ s8 1)) (AND (GEQ s1 1) (GEQ s5 1) (GEQ s11 1)) (AND (GEQ s2 1) (GEQ s7 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, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 110 ms.
Product exploration explored 100000 steps with 50000 reset in 96 ms.
Computed a total of 12 stabilizing places and 8 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 12 transition count 8
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), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1))]
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 7 factoid took 269 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN02-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN02-LTLFireability-14 finished in 821 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 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-18 20:03:32] [INFO ] Invariant cache hit.
[2023-03-18 20:03:32] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-18 20:03:32] [INFO ] Invariant cache hit.
[2023-03-18 20:03:32] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2023-03-18 20:03:32] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 20:03:32] [INFO ] Invariant cache hit.
[2023-03-18 20:03:32] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 189 ms. Remains : 12/12 places, 8/8 transitions.
Stuttering acceptance computed with spot in 32 ms :[p0]
Running random walk in product with property : Sudoku-COL-AN02-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s5 1) (GEQ s10 1)) (AND (GEQ s0 1) (GEQ s4 1) (GEQ s8 1)) (AND (GEQ s1 1) (GEQ s5 1) (GEQ s11 1)) (AND (GEQ s2 1) (GEQ s7 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 22262 reset in 125 ms.
Product exploration explored 100000 steps with 22232 reset in 110 ms.
Computed a total of 12 stabilizing places and 8 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 12 transition count 8
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
Knowledge based reduction with 3 factoid took 125 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-AN02-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN02-LTLFireability-15 finished in 635 ms.
All properties solved by simple procedures.
Total runtime 5930 ms.
ITS solved all properties within timeout

BK_STOP 1679169814403

--------------------
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-AN02"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is Sudoku-COL-AN02, 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 r489-tall-167912706200012"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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