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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 432K
-rw-r--r-- 1 mcc users 7.1K Apr 12 11:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Apr 12 11:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 12 11:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 12 11:04 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.8K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1K Apr 12 12:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 12 12:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Apr 12 11:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Apr 12 11: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-AN12-LTLFireability-00
FORMULA_NAME Sudoku-COL-AN12-LTLFireability-01
FORMULA_NAME Sudoku-COL-AN12-LTLFireability-02
FORMULA_NAME Sudoku-COL-AN12-LTLFireability-03
FORMULA_NAME Sudoku-COL-AN12-LTLFireability-04
FORMULA_NAME Sudoku-COL-AN12-LTLFireability-05
FORMULA_NAME Sudoku-COL-AN12-LTLFireability-06
FORMULA_NAME Sudoku-COL-AN12-LTLFireability-07
FORMULA_NAME Sudoku-COL-AN12-LTLFireability-08
FORMULA_NAME Sudoku-COL-AN12-LTLFireability-09
FORMULA_NAME Sudoku-COL-AN12-LTLFireability-10
FORMULA_NAME Sudoku-COL-AN12-LTLFireability-11
FORMULA_NAME Sudoku-COL-AN12-LTLFireability-12
FORMULA_NAME Sudoku-COL-AN12-LTLFireability-13
FORMULA_NAME Sudoku-COL-AN12-LTLFireability-14
FORMULA_NAME Sudoku-COL-AN12-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717260929178

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-AN12
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 16:55:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 16:55:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 16:55:30] [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 16:55:30] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 16:55:30] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 484 ms
[2024-06-01 16:55:30] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 2160 PT places and 1728.0 transition bindings in 13 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2024-06-01 16:55:31] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 4 ms.
[2024-06-01 16:55:31] [INFO ] Skeletonized 16 HLPN properties in 3 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 1 properties that can be checked using skeleton over-approximation.
FORMULA Sudoku-COL-AN12-LTLFireability-08 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 16:55:31] [INFO ] Flatten gal took : 11 ms
[2024-06-01 16:55:31] [INFO ] Flatten gal took : 1 ms
Domain [N(12), N(12)] of place Rows breaks symmetries in sort N
[2024-06-01 16:55:31] [INFO ] Unfolded HLPN to a Petri net with 2160 places and 1728 transitions 6912 arcs in 45 ms.
[2024-06-01 16:55:31] [INFO ] Unfolded 15 HLPN properties in 10 ms.
Initial state reduction rules removed 1 formulas.
FORMULA Sudoku-COL-AN12-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 432 out of 2160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Reduce places removed 1728 places and 0 transitions.
Iterating post reduction 0 with 1728 rules applied. Total rules applied 1728 place count 432 transition count 1728
Applied a total of 1728 rules in 50 ms. Remains 432 /2160 variables (removed 1728) and now considering 1728/1728 (removed 0) transitions.
// Phase 1: matrix 1728 rows 432 cols
[2024-06-01 16:55:34] [INFO ] Computed 35 invariants in 115 ms
[2024-06-01 16:55:34] [INFO ] Implicit Places using invariants in 516 ms returned []
[2024-06-01 16:55:34] [INFO ] Invariant cache hit.
[2024-06-01 16:55:35] [INFO ] Implicit Places using invariants and state equation in 1283 ms returned []
Implicit Place search using SMT with State Equation took 1841 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
Starting structural reductions in LTL mode, iteration 1 : 432/2160 places, 1728/1728 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1906 ms. Remains : 432/2160 places, 1728/1728 transitions.
Support contains 432 out of 432 places after structural reductions.
[2024-06-01 16:55:37] [INFO ] Flatten gal took : 499 ms
[2024-06-01 16:55:41] [INFO ] Flatten gal took : 588 ms
[2024-06-01 16:55:45] [INFO ] Input system was already deterministic with 1728 transitions.
Reduction of identical properties reduced properties to check from 6 to 1
RANDOM walk for 494 steps (0 resets) in 367 ms. (1 steps per ms) remains 0/1 properties
FORMULA Sudoku-COL-AN12-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Sudoku-COL-AN12-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 432 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 432 transition count 1728
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' '!(X((p0&&X(X(G(p0))))))'
Support contains 432 out of 432 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 432/432 places, 1728/1728 transitions.
Applied a total of 0 rules in 4 ms. Remains 432 /432 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2024-06-01 16:55:47] [INFO ] Invariant cache hit.
[2024-06-01 16:55:47] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-06-01 16:55:47] [INFO ] Invariant cache hit.
[2024-06-01 16:55:48] [INFO ] Implicit Places using invariants and state equation in 938 ms returned []
Implicit Place search using SMT with State Equation took 1019 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 1028 ms. Remains : 432/432 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 274 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN12-LTLFireability-00
Entered a terminal (fully accepting) state of product in 125 steps with 0 reset in 17 ms.
FORMULA Sudoku-COL-AN12-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN12-LTLFireability-00 finished in 1539 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((F(!p0)&&F(G((X(!p0)||p1))))))'
Support contains 432 out of 432 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 432/432 places, 1728/1728 transitions.
Applied a total of 0 rules in 6 ms. Remains 432 /432 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2024-06-01 16:55:48] [INFO ] Invariant cache hit.
[2024-06-01 16:55:48] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-01 16:55:48] [INFO ] Invariant cache hit.
[2024-06-01 16:55:49] [INFO ] Implicit Places using invariants and state equation in 934 ms returned []
Implicit Place search using SMT with State Equation took 1009 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 1015 ms. Remains : 432/432 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 196 ms :[p0, p0, p0, (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : Sudoku-COL-AN12-LTLFireability-03
Product exploration timeout after 94640 steps with 750 reset in 10001 ms.
Product exploration timeout after 95180 steps with 755 reset in 10002 ms.
Computed a total of 432 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 432 transition count 1728
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 p1), (X p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X p0)), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 42 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN12-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN12-LTLFireability-03 finished in 41174 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' '!((p0 U X(p0)))'
Support contains 432 out of 432 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 432/432 places, 1728/1728 transitions.
Applied a total of 0 rules in 4 ms. Remains 432 /432 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2024-06-01 16:56:29] [INFO ] Invariant cache hit.
[2024-06-01 16:56:29] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-06-01 16:56:29] [INFO ] Invariant cache hit.
[2024-06-01 16:56:30] [INFO ] Implicit Places using invariants and state equation in 907 ms returned []
Implicit Place search using SMT with State Equation took 987 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 992 ms. Remains : 432/432 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN12-LTLFireability-04
Product exploration timeout after 65180 steps with 32590 reset in 10002 ms.
Product exploration timeout after 65350 steps with 32675 reset in 10001 ms.
Computed a total of 432 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 432 transition count 1728
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 39 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN12-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN12-LTLFireability-04 finished in 38795 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)&&F(p0))))'
Support contains 432 out of 432 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 432/432 places, 1728/1728 transitions.
Applied a total of 0 rules in 18 ms. Remains 432 /432 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2024-06-01 16:57:08] [INFO ] Invariant cache hit.
[2024-06-01 16:57:08] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-01 16:57:08] [INFO ] Invariant cache hit.
[2024-06-01 16:57:09] [INFO ] Implicit Places using invariants and state equation in 911 ms returned []
Implicit Place search using SMT with State Equation took 989 ms to find 0 implicit places.
[2024-06-01 16:57:09] [INFO ] Redundant transitions in 87 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1102 ms. Remains : 432/432 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 108 ms :[true, p0, (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN12-LTLFireability-06
Product exploration timeout after 98350 steps with 779 reset in 10001 ms.
Product exploration timeout after 97730 steps with 775 reset in 10001 ms.
Computed a total of 432 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 432 transition count 1728
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 : []
Knowledge based reduction with 4 factoid took 76 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 494 steps (0 resets) in 88 ms. (5 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 4 factoid took 106 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN12-LTLFireability-06 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN12-LTLFireability-06 finished in 39306 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(p1)||p0)))'
Support contains 432 out of 432 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 432/432 places, 1728/1728 transitions.
Applied a total of 0 rules in 4 ms. Remains 432 /432 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2024-06-01 16:57:47] [INFO ] Invariant cache hit.
[2024-06-01 16:57:48] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-06-01 16:57:48] [INFO ] Invariant cache hit.
[2024-06-01 16:57:48] [INFO ] Implicit Places using invariants and state equation in 886 ms returned []
Implicit Place search using SMT with State Equation took 969 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 975 ms. Remains : 432/432 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), true, (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-COL-AN12-LTLFireability-07
Product exploration timeout after 66060 steps with 33030 reset in 10001 ms.
Product exploration timeout after 64970 steps with 32485 reset in 10001 ms.
Computed a total of 432 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 432 transition count 1728
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 p0), (X (X p1)), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 16 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN12-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN12-LTLFireability-07 finished in 39103 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((F(G(p1))&&p0)))'
Support contains 432 out of 432 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 432/432 places, 1728/1728 transitions.
Applied a total of 0 rules in 12 ms. Remains 432 /432 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2024-06-01 16:58:27] [INFO ] Invariant cache hit.
[2024-06-01 16:58:27] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-06-01 16:58:27] [INFO ] Invariant cache hit.
[2024-06-01 16:58:28] [INFO ] Implicit Places using invariants and state equation in 932 ms returned []
Implicit Place search using SMT with State Equation took 1035 ms to find 0 implicit places.
[2024-06-01 16:58:28] [INFO ] Redundant transitions in 24 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1081 ms. Remains : 432/432 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN12-LTLFireability-09
Stuttering criterion allowed to conclude after 122 steps with 0 reset in 17 ms.
FORMULA Sudoku-COL-AN12-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN12-LTLFireability-09 finished in 1263 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(G(p0)) U p0)))'
Support contains 432 out of 432 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 432/432 places, 1728/1728 transitions.
Applied a total of 0 rules in 11 ms. Remains 432 /432 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2024-06-01 16:58:28] [INFO ] Invariant cache hit.
[2024-06-01 16:58:28] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-06-01 16:58:28] [INFO ] Invariant cache hit.
[2024-06-01 16:58:29] [INFO ] Implicit Places using invariants and state equation in 886 ms returned []
Implicit Place search using SMT with State Equation took 975 ms to find 0 implicit places.
[2024-06-01 16:58:29] [INFO ] Redundant transitions in 78 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 1090 ms. Remains : 432/432 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN12-LTLFireability-10
Stuttering criterion allowed to conclude after 124 steps with 0 reset in 13 ms.
FORMULA Sudoku-COL-AN12-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN12-LTLFireability-10 finished in 1160 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(((X(!p2)&&p1)||p0)))'
Support contains 432 out of 432 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 432/432 places, 1728/1728 transitions.
Applied a total of 0 rules in 3 ms. Remains 432 /432 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2024-06-01 16:58:29] [INFO ] Invariant cache hit.
[2024-06-01 16:58:29] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-06-01 16:58:29] [INFO ] Invariant cache hit.
[2024-06-01 16:58:30] [INFO ] Implicit Places using invariants and state equation in 906 ms returned []
Implicit Place search using SMT with State Equation took 987 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 991 ms. Remains : 432/432 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 80 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR p2 (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : Sudoku-COL-AN12-LTLFireability-11
Product exploration timeout after 88050 steps with 698 reset in 10001 ms.
Product exploration timeout after 87870 steps with 697 reset in 10002 ms.
Computed a total of 432 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 432 transition count 1728
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 (NOT p1) p2), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p2)))), (X (OR (AND (NOT p0) (NOT p1)) p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (OR (AND (NOT p0) (NOT p1)) p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p0)), (X (X (NOT p1))), (F (G (NOT p0))), (F (G p1)), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 20 factoid took 131 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 76 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR p2 (AND (NOT p0) (NOT p1)))]
Reduction of identical properties reduced properties to check from 8 to 4
RANDOM walk for 40000 steps (316 resets) in 5913 ms. (6 steps per ms) remains 2/4 properties
BEST_FIRST walk for 21856 steps (4 resets) in 21240 ms. (1 steps per ms) remains 2/2 properties
BEST_FIRST walk for 26008 steps (4 resets) in 21541 ms. (1 steps per ms) remains 2/2 properties
[2024-06-01 16:59:26] [INFO ] Invariant cache hit.
Problem apf1 is UNSAT
Problem apf2 is UNSAT
After SMT solving in domain Real declared 432/2160 variables, and 0 constraints, problems are : Problem set: 2 solved, 0 unsolved in 182 ms.
Refiners :[Generalized P Invariants (flows): 0/35 constraints, State Equation: 0/432 constraints, PredecessorRefiner: 0/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 10170ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p2)))), (X (OR (AND (NOT p0) (NOT p1)) p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (OR (AND (NOT p0) (NOT p1)) p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p0)), (X (X (NOT p1))), (F (G (NOT p0))), (F (G p1)), (F (G (NOT p2))), (G (OR (NOT p0) p2)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT (OR p0 p2 (NOT p1)))), (F (NOT (OR (AND (NOT p0) (NOT p1)) p2))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p2)), (F p1)]
Knowledge based reduction with 22 factoid took 332 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 88 ms :[true, (AND (NOT p0) p2), p2]
Stuttering acceptance computed with spot in 76 ms :[true, (AND (NOT p0) p2), p2]
Support contains 432 out of 432 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 432/432 places, 1728/1728 transitions.
Applied a total of 0 rules in 7 ms. Remains 432 /432 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2024-06-01 16:59:37] [INFO ] Invariant cache hit.
[2024-06-01 16:59:37] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-06-01 16:59:37] [INFO ] Invariant cache hit.
[2024-06-01 16:59:38] [INFO ] Implicit Places using invariants and state equation in 936 ms returned []
Implicit Place search using SMT with State Equation took 1016 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 1025 ms. Remains : 432/432 places, 1728/1728 transitions.
Computed a total of 432 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 432 transition count 1728
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 p2), (X p2), (X p0), (X (X p2)), (X (X p0)), (F (G (NOT p0))), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 116 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 83 ms :[true, (AND (NOT p0) p2), p2]
Reduction of identical properties reduced properties to check from 2 to 1
RANDOM walk for 504 steps (0 resets) in 88 ms. (5 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p2), (X p2), (X p0), (X (X p2)), (X (X p0)), (F (G (NOT p0))), (F (G (NOT p2)))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 153 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 70 ms :[true, (AND (NOT p0) p2), p2]
Stuttering acceptance computed with spot in 88 ms :[true, (AND (NOT p0) p2), p2]
Stuttering acceptance computed with spot in 83 ms :[true, (AND (NOT p0) p2), p2]
Product exploration timeout after 92910 steps with 737 reset in 10002 ms.
Product exploration timeout after 92710 steps with 734 reset in 10001 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 84 ms :[true, (AND (NOT p0) p2), p2]
Support contains 432 out of 432 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 432/432 places, 1728/1728 transitions.
Applied a total of 0 rules in 15 ms. Remains 432 /432 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2024-06-01 17:00:18] [INFO ] Redundant transitions in 22 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 44 ms. Remains : 432/432 places, 1728/1728 transitions.
Support contains 432 out of 432 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 432/432 places, 1728/1728 transitions.
Applied a total of 0 rules in 3 ms. Remains 432 /432 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2024-06-01 17:00:18] [INFO ] Invariant cache hit.
[2024-06-01 17:00:18] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-06-01 17:00:18] [INFO ] Invariant cache hit.
[2024-06-01 17:00:19] [INFO ] Implicit Places using invariants and state equation in 895 ms returned []
Implicit Place search using SMT with State Equation took 975 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 979 ms. Remains : 432/432 places, 1728/1728 transitions.
Treatment of property Sudoku-COL-AN12-LTLFireability-11 finished in 111265 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))'
Support contains 432 out of 432 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 432/432 places, 1728/1728 transitions.
Applied a total of 0 rules in 4 ms. Remains 432 /432 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2024-06-01 17:00:20] [INFO ] Invariant cache hit.
[2024-06-01 17:00:20] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-06-01 17:00:20] [INFO ] Invariant cache hit.
[2024-06-01 17:00:21] [INFO ] Implicit Places using invariants and state equation in 980 ms returned []
Implicit Place search using SMT with State Equation took 1065 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 1071 ms. Remains : 432/432 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : Sudoku-COL-AN12-LTLFireability-12
Product exploration timeout after 64400 steps with 32200 reset in 10001 ms.
Product exploration timeout after 65110 steps with 32555 reset in 10002 ms.
Computed a total of 432 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 432 transition count 1728
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 : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 18 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN12-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN12-LTLFireability-12 finished in 22217 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&&X(X(F(p0))))))'
Support contains 432 out of 432 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 432/432 places, 1728/1728 transitions.
Applied a total of 0 rules in 3 ms. Remains 432 /432 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2024-06-01 17:00:42] [INFO ] Invariant cache hit.
[2024-06-01 17:00:43] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-06-01 17:00:43] [INFO ] Invariant cache hit.
[2024-06-01 17:00:43] [INFO ] Implicit Places using invariants and state equation in 890 ms returned []
Implicit Place search using SMT with State Equation took 972 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 975 ms. Remains : 432/432 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : Sudoku-COL-AN12-LTLFireability-13
Product exploration timeout after 44860 steps with 11215 reset in 10001 ms.
Product exploration timeout after 44310 steps with 11077 reset in 10001 ms.
Computed a total of 432 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 432 transition count 1728
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 : []
Knowledge based reduction with 3 factoid took 66 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 494 steps (0 resets) in 94 ms. (5 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 432 out of 432 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 432/432 places, 1728/1728 transitions.
Applied a total of 0 rules in 3 ms. Remains 432 /432 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2024-06-01 17:01:05] [INFO ] Invariant cache hit.
[2024-06-01 17:01:05] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-06-01 17:01:05] [INFO ] Invariant cache hit.
[2024-06-01 17:01:06] [INFO ] Implicit Places using invariants and state equation in 901 ms returned []
Implicit Place search using SMT with State Equation took 991 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 994 ms. Remains : 432/432 places, 1728/1728 transitions.
Computed a total of 432 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 432 transition count 1728
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 64 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 503 steps (0 resets) in 82 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 68 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration timeout after 44900 steps with 11225 reset in 10002 ms.
Product exploration timeout after 44480 steps with 11120 reset in 10001 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 432 out of 432 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 432/432 places, 1728/1728 transitions.
Applied a total of 0 rules in 8 ms. Remains 432 /432 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2024-06-01 17:01:29] [INFO ] Redundant transitions in 21 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 33 ms. Remains : 432/432 places, 1728/1728 transitions.
Support contains 432 out of 432 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 432/432 places, 1728/1728 transitions.
Applied a total of 0 rules in 2 ms. Remains 432 /432 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2024-06-01 17:01:29] [INFO ] Invariant cache hit.
[2024-06-01 17:01:29] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-06-01 17:01:29] [INFO ] Invariant cache hit.
[2024-06-01 17:01:30] [INFO ] Implicit Places using invariants and state equation in 900 ms returned []
Implicit Place search using SMT with State Equation took 1009 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 1011 ms. Remains : 432/432 places, 1728/1728 transitions.
Treatment of property Sudoku-COL-AN12-LTLFireability-13 finished in 48125 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' '!((p0 U (F(!p0)&&X((G(p0)||(p0&&G(F(!p0))))))))'
Support contains 432 out of 432 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 432/432 places, 1728/1728 transitions.
Applied a total of 0 rules in 2 ms. Remains 432 /432 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2024-06-01 17:01:31] [INFO ] Invariant cache hit.
[2024-06-01 17:01:31] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-06-01 17:01:31] [INFO ] Invariant cache hit.
[2024-06-01 17:01:32] [INFO ] Implicit Places using invariants and state equation in 918 ms returned []
Implicit Place search using SMT with State Equation took 1029 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 1031 ms. Remains : 432/432 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 304 ms :[true, (NOT p0), p0, (NOT p0), true, false, false, p0]
Running random walk in product with property : Sudoku-COL-AN12-LTLFireability-14
Product exploration timeout after 93560 steps with 742 reset in 10001 ms.
Product exploration timeout after 92920 steps with 737 reset in 10001 ms.
Computed a total of 432 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 432 transition count 1728
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 22 ms. Reduced automaton from 8 states, 15 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN12-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN12-LTLFireability-14 finished in 38878 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 432 out of 432 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 432/432 places, 1728/1728 transitions.
Applied a total of 0 rules in 9 ms. Remains 432 /432 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2024-06-01 17:02:09] [INFO ] Invariant cache hit.
[2024-06-01 17:02:10] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-06-01 17:02:10] [INFO ] Invariant cache hit.
[2024-06-01 17:02:10] [INFO ] Implicit Places using invariants and state equation in 894 ms returned []
Implicit Place search using SMT with State Equation took 1029 ms to find 0 implicit places.
[2024-06-01 17:02:11] [INFO ] Redundant transitions in 22 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1069 ms. Remains : 432/432 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 39 ms :[p0]
Running random walk in product with property : Sudoku-COL-AN12-LTLFireability-15
Product exploration timeout after 93110 steps with 738 reset in 10001 ms.
Product exploration timeout after 91680 steps with 727 reset in 10001 ms.
Computed a total of 432 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 432 transition count 1728
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 11 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-AN12-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN12-LTLFireability-15 finished in 38575 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(((X(!p2)&&p1)||p0)))'
Found a Lengthening insensitive property : Sudoku-COL-AN12-LTLFireability-11
Stuttering acceptance computed with spot in 89 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR p2 (AND (NOT p0) (NOT p1)))]
Support contains 432 out of 432 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 432/432 places, 1728/1728 transitions.
Applied a total of 0 rules in 6 ms. Remains 432 /432 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2024-06-01 17:02:48] [INFO ] Invariant cache hit.
[2024-06-01 17:02:48] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-01 17:02:48] [INFO ] Invariant cache hit.
[2024-06-01 17:02:49] [INFO ] Implicit Places using invariants and state equation in 919 ms returned []
Implicit Place search using SMT with State Equation took 1012 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 1026 ms. Remains : 432/432 places, 1728/1728 transitions.
Running random walk in product with property : Sudoku-COL-AN12-LTLFireability-11
Product exploration timeout after 86140 steps with 683 reset in 10003 ms.
Product exploration timeout after 86000 steps with 682 reset in 10001 ms.
Computed a total of 432 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 432 transition count 1728
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 (NOT p1) p2), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p2)))), (X (OR (AND (NOT p0) (NOT p1)) p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (OR (AND (NOT p0) (NOT p1)) p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p0)), (X (X (NOT p1))), (F (G (NOT p0))), (F (G p1)), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 20 factoid took 103 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 70 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR p2 (AND (NOT p0) (NOT p1)))]
Reduction of identical properties reduced properties to check from 8 to 4
RANDOM walk for 40000 steps (316 resets) in 8212 ms. (4 steps per ms) remains 2/4 properties
BEST_FIRST walk for 20160 steps (3 resets) in 21725 ms. (0 steps per ms) remains 2/2 properties
BEST_FIRST walk for 21162 steps (4 resets) in 22012 ms. (0 steps per ms) remains 2/2 properties
[2024-06-01 17:03:46] [INFO ] Invariant cache hit.
Problem apf1 is UNSAT
Problem apf2 is UNSAT
After SMT solving in domain Real declared 432/2160 variables, and 0 constraints, problems are : Problem set: 2 solved, 0 unsolved in 193 ms.
Refiners :[Generalized P Invariants (flows): 0/35 constraints, State Equation: 0/432 constraints, PredecessorRefiner: 0/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 10264ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p2)))), (X (OR (AND (NOT p0) (NOT p1)) p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (OR (AND (NOT p0) (NOT p1)) p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p0)), (X (X (NOT p1))), (F (G (NOT p0))), (F (G p1)), (F (G (NOT p2))), (G (OR (NOT p0) p2)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT (OR p0 p2 (NOT p1)))), (F (NOT (OR (AND (NOT p0) (NOT p1)) p2))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p2)), (F p1)]
Knowledge based reduction with 22 factoid took 295 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 86 ms :[true, (AND (NOT p0) p2), p2]
Stuttering acceptance computed with spot in 87 ms :[true, (AND (NOT p0) p2), p2]
Support contains 432 out of 432 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 432/432 places, 1728/1728 transitions.
Applied a total of 0 rules in 3 ms. Remains 432 /432 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2024-06-01 17:03:57] [INFO ] Invariant cache hit.
[2024-06-01 17:03:57] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-06-01 17:03:57] [INFO ] Invariant cache hit.
[2024-06-01 17:03:58] [INFO ] Implicit Places using invariants and state equation in 978 ms returned []
Implicit Place search using SMT with State Equation took 1062 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 1067 ms. Remains : 432/432 places, 1728/1728 transitions.
Computed a total of 432 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 432 transition count 1728
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 p2), (X p2), (X p0), (X (X p2)), (X (X p0)), (F (G (NOT p0))), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 127 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 79 ms :[true, (AND (NOT p0) p2), p2]
Reduction of identical properties reduced properties to check from 2 to 1
RANDOM walk for 501 steps (0 resets) in 106 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p2), (X p2), (X p0), (X (X p2)), (X (X p0)), (F (G (NOT p0))), (F (G (NOT p2)))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 150 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 73 ms :[true, (AND (NOT p0) p2), p2]
Stuttering acceptance computed with spot in 72 ms :[true, (AND (NOT p0) p2), p2]
Stuttering acceptance computed with spot in 93 ms :[true, (AND (NOT p0) p2), p2]
Product exploration timeout after 92710 steps with 736 reset in 10002 ms.
Product exploration timeout after 92080 steps with 730 reset in 10001 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 77 ms :[true, (AND (NOT p0) p2), p2]
Support contains 432 out of 432 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 432/432 places, 1728/1728 transitions.
Applied a total of 0 rules in 10 ms. Remains 432 /432 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2024-06-01 17:04:39] [INFO ] Redundant transitions in 22 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 44 ms. Remains : 432/432 places, 1728/1728 transitions.
Support contains 432 out of 432 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 432/432 places, 1728/1728 transitions.
Applied a total of 0 rules in 3 ms. Remains 432 /432 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2024-06-01 17:04:39] [INFO ] Invariant cache hit.
[2024-06-01 17:04:39] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-01 17:04:39] [INFO ] Invariant cache hit.
[2024-06-01 17:04:40] [INFO ] Implicit Places using invariants and state equation in 908 ms returned []
Implicit Place search using SMT with State Equation took 987 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 992 ms. Remains : 432/432 places, 1728/1728 transitions.
Treatment of property Sudoku-COL-AN12-LTLFireability-11 finished in 112478 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&&X(X(F(p0))))))'
[2024-06-01 17:04:41] [INFO ] Flatten gal took : 144 ms
[2024-06-01 17:04:41] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 46 ms.
[2024-06-01 17:04:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 432 places, 1728 transitions and 5184 arcs took 9 ms.
Total runtime 551051 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : Sudoku-COL-AN12-LTLFireability-11
Could not compute solution for formula : Sudoku-COL-AN12-LTLFireability-13

BK_STOP 1717263267525

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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
ltl formula name Sudoku-COL-AN12-LTLFireability-11
ltl formula formula --ltl=/tmp/1394/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 432 places, 1728 transitions and 5184 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.160 real 0.040 user 0.060 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1394/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1394/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1394/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1394/ltl_0_
pnml2lts-mc( 1/ 4), ** error **: stack overflow
pnml2lts-mc( 0/ 4), ** error **: stack overflow
pnml2lts-mc( 2/ 4), ** error **: stack overflow
pnml2lts-mc( 3/ 4), ** error **: stack overflow
ltl formula name Sudoku-COL-AN12-LTLFireability-13
ltl formula formula --ltl=/tmp/1394/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 432 places, 1728 transitions and 5184 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.170 real 0.040 user 0.070 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1394/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1394/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1394/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1394/ltl_1_

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

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