Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r536-tall-171690532400452.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is Sudoku-COL-AN06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r536-tall-171690532400452
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 7.6K Apr 12 10:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Apr 12 10:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 12 10:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 12 10:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 11:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 155K Apr 12 11:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 10:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Apr 12 10:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 08:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 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-AN06-LTLFireability-00
FORMULA_NAME Sudoku-COL-AN06-LTLFireability-01
FORMULA_NAME Sudoku-COL-AN06-LTLFireability-02
FORMULA_NAME Sudoku-COL-AN06-LTLFireability-03
FORMULA_NAME Sudoku-COL-AN06-LTLFireability-04
FORMULA_NAME Sudoku-COL-AN06-LTLFireability-05
FORMULA_NAME Sudoku-COL-AN06-LTLFireability-06
FORMULA_NAME Sudoku-COL-AN06-LTLFireability-07
FORMULA_NAME Sudoku-COL-AN06-LTLFireability-08
FORMULA_NAME Sudoku-COL-AN06-LTLFireability-09
FORMULA_NAME Sudoku-COL-AN06-LTLFireability-10
FORMULA_NAME Sudoku-COL-AN06-LTLFireability-11
FORMULA_NAME Sudoku-COL-AN06-LTLFireability-12
FORMULA_NAME Sudoku-COL-AN06-LTLFireability-13
FORMULA_NAME Sudoku-COL-AN06-LTLFireability-14
FORMULA_NAME Sudoku-COL-AN06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717256847080

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-AN06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 15:47:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 15:47:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 15:47:28] [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.
[2024-06-01 15:47:28] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 15:47:28] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 546 ms
[2024-06-01 15:47:29] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 324 PT places and 216.0 transition bindings in 11 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
FORMULA Sudoku-COL-AN06-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 15:47:29] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 5 ms.
[2024-06-01 15:47:29] [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 3 properties that can be checked using skeleton over-approximation.
FORMULA Sudoku-COL-AN06-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN06-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN06-LTLFireability-12 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).
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
[2024-06-01 15:47:29] [INFO ] Flatten gal took : 17 ms
[2024-06-01 15:47:29] [INFO ] Flatten gal took : 1 ms
Domain [N(6), N(6)] of place Rows breaks symmetries in sort N
[2024-06-01 15:47:29] [INFO ] Unfolded HLPN to a Petri net with 324 places and 216 transitions 864 arcs in 29 ms.
[2024-06-01 15:47:29] [INFO ] Unfolded 12 HLPN properties in 1 ms.
Initial state reduction rules removed 2 formulas.
FORMULA Sudoku-COL-AN06-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN06-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 108 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Reduce places removed 216 places and 0 transitions.
Iterating post reduction 0 with 216 rules applied. Total rules applied 216 place count 108 transition count 216
Applied a total of 216 rules in 18 ms. Remains 108 /324 variables (removed 216) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 108 cols
[2024-06-01 15:47:29] [INFO ] Computed 17 invariants in 39 ms
[2024-06-01 15:47:29] [INFO ] Implicit Places using invariants in 283 ms returned []
[2024-06-01 15:47:29] [INFO ] Invariant cache hit.
[2024-06-01 15:47:29] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 454 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 3ms
Starting structural reductions in LTL mode, iteration 1 : 108/324 places, 216/216 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 487 ms. Remains : 108/324 places, 216/216 transitions.
Support contains 108 out of 108 places after structural reductions.
[2024-06-01 15:47:30] [INFO ] Flatten gal took : 107 ms
[2024-06-01 15:47:30] [INFO ] Flatten gal took : 73 ms
[2024-06-01 15:47:30] [INFO ] Input system was already deterministic with 216 transitions.
RANDOM walk for 126 steps (0 resets) in 37 ms. (3 steps per ms) remains 0/1 properties
FORMULA Sudoku-COL-AN06-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Sudoku-COL-AN06-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Sudoku-COL-AN06-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 108 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 108 transition count 216
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.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 108 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 216/216 transitions.
Applied a total of 0 rules in 6 ms. Remains 108 /108 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-06-01 15:47:31] [INFO ] Invariant cache hit.
[2024-06-01 15:47:31] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-06-01 15:47:31] [INFO ] Invariant cache hit.
[2024-06-01 15:47:31] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
[2024-06-01 15:47:31] [INFO ] Redundant transitions in 7 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 316 ms. Remains : 108/108 places, 216/216 transitions.
Stuttering acceptance computed with spot in 193 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN06-LTLFireability-03
Stuttering criterion allowed to conclude after 30 steps with 0 reset in 5 ms.
FORMULA Sudoku-COL-AN06-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN06-LTLFireability-03 finished in 587 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F(p0))))))'
Support contains 108 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 216/216 transitions.
Applied a total of 0 rules in 2 ms. Remains 108 /108 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-06-01 15:47:31] [INFO ] Invariant cache hit.
[2024-06-01 15:47:31] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-06-01 15:47:31] [INFO ] Invariant cache hit.
[2024-06-01 15:47:31] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 169 ms. Remains : 108/108 places, 216/216 transitions.
Stuttering acceptance computed with spot in 209 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN06-LTLFireability-04
Product exploration explored 100000 steps with 20000 reset in 2524 ms.
Product exploration explored 100000 steps with 20000 reset in 2523 ms.
Computed a total of 108 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 108 transition count 216
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, (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 91 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 204 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 116 steps (0 resets) in 18 ms. (6 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 88 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 217 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 108 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 216/216 transitions.
Applied a total of 0 rules in 2 ms. Remains 108 /108 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-06-01 15:47:38] [INFO ] Invariant cache hit.
[2024-06-01 15:47:38] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-06-01 15:47:38] [INFO ] Invariant cache hit.
[2024-06-01 15:47:38] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 136 ms. Remains : 108/108 places, 216/216 transitions.
Computed a total of 108 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 108 transition count 216
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, (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 108 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 125 steps (0 resets) in 10 ms. (11 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 85 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 204 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 206 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 20000 reset in 2424 ms.
Product exploration explored 100000 steps with 20000 reset in 2458 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 214 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 108 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 216/216 transitions.
Applied a total of 0 rules in 3 ms. Remains 108 /108 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-06-01 15:47:44] [INFO ] Redundant transitions in 7 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 17 ms. Remains : 108/108 places, 216/216 transitions.
Support contains 108 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 216/216 transitions.
Applied a total of 0 rules in 2 ms. Remains 108 /108 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-06-01 15:47:44] [INFO ] Invariant cache hit.
[2024-06-01 15:47:44] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-06-01 15:47:44] [INFO ] Invariant cache hit.
[2024-06-01 15:47:44] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 155 ms. Remains : 108/108 places, 216/216 transitions.
Treatment of property Sudoku-COL-AN06-LTLFireability-04 finished in 13253 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!p0)))'
Support contains 108 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 216/216 transitions.
Applied a total of 0 rules in 3 ms. Remains 108 /108 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-06-01 15:47:44] [INFO ] Invariant cache hit.
[2024-06-01 15:47:45] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-06-01 15:47:45] [INFO ] Invariant cache hit.
[2024-06-01 15:47:45] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
[2024-06-01 15:47:45] [INFO ] Redundant transitions in 2 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 237 ms. Remains : 108/108 places, 216/216 transitions.
Stuttering acceptance computed with spot in 70 ms :[p0, p0]
Running random walk in product with property : Sudoku-COL-AN06-LTLFireability-08
Product exploration explored 100000 steps with 3188 reset in 1332 ms.
Product exploration explored 100000 steps with 3185 reset in 1362 ms.
Computed a total of 108 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 108 transition count 216
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 (Minato strategy)
Knowledge based reduction with 4 factoid took 23 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-COL-AN06-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN06-LTLFireability-08 finished in 3210 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 108 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 216/216 transitions.
Applied a total of 0 rules in 4 ms. Remains 108 /108 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-06-01 15:47:48] [INFO ] Invariant cache hit.
[2024-06-01 15:47:48] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-06-01 15:47:48] [INFO ] Invariant cache hit.
[2024-06-01 15:47:48] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
[2024-06-01 15:47:48] [INFO ] Redundant transitions in 3 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 134 ms. Remains : 108/108 places, 216/216 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN06-LTLFireability-09
Stuttering criterion allowed to conclude after 29 steps with 0 reset in 1 ms.
FORMULA Sudoku-COL-AN06-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN06-LTLFireability-09 finished in 185 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||(p0 U X((p0&&X(p0))))))'
Support contains 108 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 216/216 transitions.
Applied a total of 0 rules in 1 ms. Remains 108 /108 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-06-01 15:47:48] [INFO ] Invariant cache hit.
[2024-06-01 15:47:48] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-06-01 15:47:48] [INFO ] Invariant cache hit.
[2024-06-01 15:47:48] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 115 ms. Remains : 108/108 places, 216/216 transitions.
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN06-LTLFireability-10
Product exploration explored 100000 steps with 50000 reset in 1651 ms.
Product exploration explored 100000 steps with 50000 reset in 1669 ms.
Computed a total of 108 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 108 transition count 216
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 (Minato strategy)
Knowledge based reduction with 4 factoid took 34 ms. Reduced automaton from 5 states, 7 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN06-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN06-LTLFireability-10 finished in 3806 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(!p0))))'
Support contains 108 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 216/216 transitions.
Applied a total of 0 rules in 1 ms. Remains 108 /108 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-06-01 15:47:52] [INFO ] Invariant cache hit.
[2024-06-01 15:47:52] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-06-01 15:47:52] [INFO ] Invariant cache hit.
[2024-06-01 15:47:52] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 118 ms. Remains : 108/108 places, 216/216 transitions.
Stuttering acceptance computed with spot in 143 ms :[true, p0, p0, p0]
Running random walk in product with property : Sudoku-COL-AN06-LTLFireability-11
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA Sudoku-COL-AN06-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN06-LTLFireability-11 finished in 284 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G(p0))||G(!p0)))))'
Support contains 108 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 216/216 transitions.
Applied a total of 0 rules in 1 ms. Remains 108 /108 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-06-01 15:47:52] [INFO ] Invariant cache hit.
[2024-06-01 15:47:52] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-06-01 15:47:52] [INFO ] Invariant cache hit.
[2024-06-01 15:47:52] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 145 ms. Remains : 108/108 places, 216/216 transitions.
Stuttering acceptance computed with spot in 163 ms :[false, (NOT p0), false, false]
Running random walk in product with property : Sudoku-COL-AN06-LTLFireability-13
Stuttering criterion allowed to conclude after 32 steps with 0 reset in 2 ms.
FORMULA Sudoku-COL-AN06-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN06-LTLFireability-13 finished in 334 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F(p0))))))'
Found a Shortening insensitive property : Sudoku-COL-AN06-LTLFireability-04
Stuttering acceptance computed with spot in 208 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 108 out of 108 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 108/108 places, 216/216 transitions.
Applied a total of 0 rules in 4 ms. Remains 108 /108 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-06-01 15:47:53] [INFO ] Invariant cache hit.
[2024-06-01 15:47:53] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-06-01 15:47:53] [INFO ] Invariant cache hit.
[2024-06-01 15:47:53] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LI_LTL mode , in 1 iterations and 115 ms. Remains : 108/108 places, 216/216 transitions.
Running random walk in product with property : Sudoku-COL-AN06-LTLFireability-04
Product exploration explored 100000 steps with 20000 reset in 2400 ms.
Product exploration explored 100000 steps with 20000 reset in 2465 ms.
Computed a total of 108 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 108 transition count 216
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, (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 79 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 122 steps (0 resets) in 12 ms. (9 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 111 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 201 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 108 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 216/216 transitions.
Applied a total of 0 rules in 2 ms. Remains 108 /108 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-06-01 15:47:59] [INFO ] Invariant cache hit.
[2024-06-01 15:47:59] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-06-01 15:47:59] [INFO ] Invariant cache hit.
[2024-06-01 15:47:59] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 137 ms. Remains : 108/108 places, 216/216 transitions.
Computed a total of 108 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 108 transition count 216
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, (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 90 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 121 steps (0 resets) in 16 ms. (7 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 93 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 209 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 168 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 186 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 20000 reset in 2407 ms.
Product exploration explored 100000 steps with 20000 reset in 2456 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 199 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 108 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 216/216 transitions.
Applied a total of 0 rules in 2 ms. Remains 108 /108 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-06-01 15:48:05] [INFO ] Redundant transitions in 1 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 14 ms. Remains : 108/108 places, 216/216 transitions.
Support contains 108 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 216/216 transitions.
Applied a total of 0 rules in 1 ms. Remains 108 /108 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-06-01 15:48:05] [INFO ] Invariant cache hit.
[2024-06-01 15:48:05] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-06-01 15:48:05] [INFO ] Invariant cache hit.
[2024-06-01 15:48:05] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 160 ms. Remains : 108/108 places, 216/216 transitions.
Treatment of property Sudoku-COL-AN06-LTLFireability-04 finished in 12886 ms.
[2024-06-01 15:48:05] [INFO ] Flatten gal took : 17 ms
[2024-06-01 15:48:05] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2024-06-01 15:48:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 108 places, 216 transitions and 648 arcs took 4 ms.
Total runtime 37390 ms.
There are residual formulas that ITS could not solve within timeout

BK_TIME_CONFINEMENT_REACHED

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024

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-AN06"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is Sudoku-COL-AN06, 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 r536-tall-171690532400452"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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