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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 95M
-rw-r--r-- 1 mcc users 1.7M Apr 12 13:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 7.3M Apr 12 13:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5M Apr 12 11:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 23M Apr 12 11:56 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 717K Apr 23 08:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 2.4M Apr 23 08:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4M Apr 23 08:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.4M Apr 23 08:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 903K Apr 12 15:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 3.9M Apr 12 15:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4M Apr 12 14:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 31M Apr 12 14:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 29K Apr 23 08:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 72K Apr 23 08:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 2.7M 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-PT-BN16-LTLFireability-00
FORMULA_NAME Sudoku-PT-BN16-LTLFireability-01
FORMULA_NAME Sudoku-PT-BN16-LTLFireability-02
FORMULA_NAME Sudoku-PT-BN16-LTLFireability-03
FORMULA_NAME Sudoku-PT-BN16-LTLFireability-04
FORMULA_NAME Sudoku-PT-BN16-LTLFireability-05
FORMULA_NAME Sudoku-PT-BN16-LTLFireability-06
FORMULA_NAME Sudoku-PT-BN16-LTLFireability-07
FORMULA_NAME Sudoku-PT-BN16-LTLFireability-08
FORMULA_NAME Sudoku-PT-BN16-LTLFireability-09
FORMULA_NAME Sudoku-PT-BN16-LTLFireability-10
FORMULA_NAME Sudoku-PT-BN16-LTLFireability-11
FORMULA_NAME Sudoku-PT-BN16-LTLFireability-12
FORMULA_NAME Sudoku-PT-BN16-LTLFireability-13
FORMULA_NAME Sudoku-PT-BN16-LTLFireability-14
FORMULA_NAME Sudoku-PT-BN16-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717279183523

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-PT-BN16
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 21:59:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 21:59:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 21:59:45] [INFO ] Load time of PNML (sax parser for PT used): 290 ms
[2024-06-01 21:59:45] [INFO ] Transformed 5120 places.
[2024-06-01 21:59:45] [INFO ] Transformed 4096 transitions.
[2024-06-01 21:59:45] [INFO ] Found NUPN structural information;
[2024-06-01 21:59:45] [INFO ] Parsed PT model containing 5120 places and 4096 transitions and 20480 arcs in 418 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 194 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA Sudoku-PT-BN16-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN16-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN16-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 1024 out of 5120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Reduce places removed 4096 places and 0 transitions.
Iterating post reduction 0 with 4096 rules applied. Total rules applied 4096 place count 1024 transition count 4096
Applied a total of 4096 rules in 101 ms. Remains 1024 /5120 variables (removed 4096) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 1024 cols
[2024-06-01 21:59:51] [INFO ] Computed 168 invariants in 787 ms
[2024-06-01 21:59:52] [INFO ] Implicit Places using invariants in 1652 ms returned []
[2024-06-01 21:59:52] [INFO ] Invariant cache hit.
[2024-06-01 22:00:46] [INFO ] Implicit Places using invariants and state equation in 54107 ms returned []
Implicit Place search using SMT with State Equation took 55790 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 2ms
Starting structural reductions in LTL mode, iteration 1 : 1024/5120 places, 4096/4096 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55918 ms. Remains : 1024/5120 places, 4096/4096 transitions.
Support contains 1024 out of 1024 places after structural reductions.
[2024-06-01 22:00:48] [INFO ] Flatten gal took : 884 ms
[2024-06-01 22:00:54] [INFO ] Flatten gal took : 879 ms
[2024-06-01 22:00:59] [INFO ] Input system was already deterministic with 4096 transitions.
Reduction of identical properties reduced properties to check from 23 to 17
RANDOM walk for 2586 steps (12 resets) in 1649 ms. (1 steps per ms) remains 0/17 properties
FORMULA Sudoku-PT-BN16-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1024 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1024 transition count 4096
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' '!(F(G(p0)))'
Support contains 1024 out of 1024 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1024/1024 places, 4096/4096 transitions.
Applied a total of 0 rules in 44 ms. Remains 1024 /1024 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-06-01 22:01:01] [INFO ] Invariant cache hit.
[2024-06-01 22:01:02] [INFO ] Implicit Places using invariants in 284 ms returned []
[2024-06-01 22:01:02] [INFO ] Invariant cache hit.
[2024-06-01 22:01:57] [INFO ] Implicit Places using invariants and state equation in 55001 ms returned []
Implicit Place search using SMT with State Equation took 55288 ms to find 0 implicit places.
[2024-06-01 22:01:57] [INFO ] Redundant transitions in 250 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 55602 ms. Remains : 1024/1024 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 152 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-BN16-LTLFireability-02
Stuttering criterion allowed to conclude after 213 steps with 0 reset in 96 ms.
FORMULA Sudoku-PT-BN16-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN16-LTLFireability-02 finished in 55958 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(p1)||p0) U G(p1)))'
Support contains 1024 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 4096/4096 transitions.
Applied a total of 0 rules in 9 ms. Remains 1024 /1024 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-06-01 22:01:57] [INFO ] Invariant cache hit.
[2024-06-01 22:01:57] [INFO ] Implicit Places using invariants in 294 ms returned []
[2024-06-01 22:01:57] [INFO ] Invariant cache hit.
[2024-06-01 22:02:53] [INFO ] Implicit Places using invariants and state equation in 55649 ms returned []
Implicit Place search using SMT with State Equation took 55949 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 55967 ms. Remains : 1024/1024 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : Sudoku-PT-BN16-LTLFireability-03
Stuttering criterion allowed to conclude after 207 steps with 0 reset in 77 ms.
FORMULA Sudoku-PT-BN16-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN16-LTLFireability-03 finished in 56226 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 1024 out of 1024 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1024/1024 places, 4096/4096 transitions.
Applied a total of 0 rules in 25 ms. Remains 1024 /1024 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-06-01 22:02:53] [INFO ] Invariant cache hit.
[2024-06-01 22:02:54] [INFO ] Implicit Places using invariants in 295 ms returned []
[2024-06-01 22:02:54] [INFO ] Invariant cache hit.
[2024-06-01 22:03:49] [INFO ] Implicit Places using invariants and state equation in 55377 ms returned []
Implicit Place search using SMT with State Equation took 55677 ms to find 0 implicit places.
[2024-06-01 22:03:49] [INFO ] Redundant transitions in 219 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 55930 ms. Remains : 1024/1024 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-BN16-LTLFireability-05
Stuttering criterion allowed to conclude after 209 steps with 0 reset in 73 ms.
FORMULA Sudoku-PT-BN16-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN16-LTLFireability-05 finished in 56135 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((X((F(G((X(p3)||p2)))&&p1))&&p0)))'
Support contains 1024 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 4096/4096 transitions.
Applied a total of 0 rules in 6 ms. Remains 1024 /1024 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-06-01 22:03:50] [INFO ] Invariant cache hit.
[2024-06-01 22:03:50] [INFO ] Implicit Places using invariants in 281 ms returned []
[2024-06-01 22:03:50] [INFO ] Invariant cache hit.
[2024-06-01 22:04:46] [INFO ] Implicit Places using invariants and state equation in 55858 ms returned []
Implicit Place search using SMT with State Equation took 56141 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 56149 ms. Remains : 1024/1024 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : Sudoku-PT-BN16-LTLFireability-06
Stuttering criterion allowed to conclude after 207 steps with 0 reset in 78 ms.
FORMULA Sudoku-PT-BN16-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN16-LTLFireability-06 finished in 56504 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(G((p0&&X(p0))))||F(p1)))'
Support contains 1024 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 4096/4096 transitions.
Applied a total of 0 rules in 8 ms. Remains 1024 /1024 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-06-01 22:04:46] [INFO ] Invariant cache hit.
[2024-06-01 22:04:46] [INFO ] Implicit Places using invariants in 275 ms returned []
[2024-06-01 22:04:46] [INFO ] Invariant cache hit.
[2024-06-01 22:05:42] [INFO ] Implicit Places using invariants and state equation in 55497 ms returned []
Implicit Place search using SMT with State Equation took 55791 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 55800 ms. Remains : 1024/1024 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-PT-BN16-LTLFireability-07
Product exploration timeout after 29810 steps with 141 reset in 10004 ms.
Product exploration timeout after 29380 steps with 139 reset in 10006 ms.
Computed a total of 1024 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1024 transition count 4096
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X p0), (X (NOT p1)), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 24 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-BN16-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-BN16-LTLFireability-07 finished in 83003 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||G(p2)))||p0)))'
Support contains 12 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 4096/4096 transitions.
Applied a total of 0 rules in 296 ms. Remains 1024 /1024 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-06-01 22:06:09] [INFO ] Invariant cache hit.
[2024-06-01 22:06:19] [INFO ] Implicit Places using invariants in 9527 ms returned []
[2024-06-01 22:06:19] [INFO ] Invariant cache hit.
[2024-06-01 22:07:46] [INFO ] Performed 1/1024 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-06-01 22:08:18] [INFO ] Performed 3/1024 implicitness test of which 0 returned IMPLICIT in 64 seconds.
[2024-06-01 22:08:51] [INFO ] Performed 5/1024 implicitness test of which 0 returned IMPLICIT in 96 seconds.
[2024-06-01 22:08:59] [INFO ] Implicit Places using invariants and state equation in 160030 ms returned []
Implicit Place search using SMT with State Equation took 169558 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 169857 ms. Remains : 1024/1024 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 164 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : Sudoku-PT-BN16-LTLFireability-08
Product exploration timeout after 19480 steps with 9740 reset in 10004 ms.
Product exploration timeout after 18880 steps with 9440 reset in 10006 ms.
Computed a total of 1024 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1024 transition count 4096
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 p2) p1), (X p0), (F (G (NOT p0))), (F (G p2)), (F (G (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 18 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-BN16-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-BN16-LTLFireability-08 finished in 191111 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(G(p0)))'
Support contains 8 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 4096/4096 transitions.
Applied a total of 0 rules in 283 ms. Remains 1024 /1024 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-06-01 22:09:20] [INFO ] Invariant cache hit.
[2024-06-01 22:09:30] [INFO ] Implicit Places using invariants in 9843 ms returned []
[2024-06-01 22:09:30] [INFO ] Invariant cache hit.
[2024-06-01 22:10:57] [INFO ] Performed 1/1024 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-06-01 22:11:30] [INFO ] Performed 3/1024 implicitness test of which 0 returned IMPLICIT in 64 seconds.
[2024-06-01 22:12:02] [INFO ] Performed 5/1024 implicitness test of which 0 returned IMPLICIT in 96 seconds.
[2024-06-01 22:12:10] [INFO ] Implicit Places using invariants and state equation in 160026 ms returned []
Implicit Place search using SMT with State Equation took 169871 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 170155 ms. Remains : 1024/1024 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-BN16-LTLFireability-09
Entered a terminal (fully accepting) state of product in 76 steps with 0 reset in 51 ms.
FORMULA Sudoku-PT-BN16-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN16-LTLFireability-09 finished in 170312 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(F((G(p0)&&X(p1)))))))'
Support contains 8 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 4096/4096 transitions.
Applied a total of 0 rules in 141 ms. Remains 1024 /1024 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-06-01 22:12:11] [INFO ] Invariant cache hit.
[2024-06-01 22:12:20] [INFO ] Implicit Places using invariants in 9422 ms returned []
[2024-06-01 22:12:20] [INFO ] Invariant cache hit.
[2024-06-01 22:13:48] [INFO ] Performed 1/1024 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-06-01 22:14:20] [INFO ] Performed 3/1024 implicitness test of which 0 returned IMPLICIT in 64 seconds.
[2024-06-01 22:14:52] [INFO ] Performed 5/1024 implicitness test of which 0 returned IMPLICIT in 96 seconds.
[2024-06-01 22:15:00] [INFO ] Implicit Places using invariants and state equation in 160025 ms returned []
Implicit Place search using SMT with State Equation took 169448 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 169590 ms. Remains : 1024/1024 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 228 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Sudoku-PT-BN16-LTLFireability-10
Product exploration timeout after 30090 steps with 185 reset in 10001 ms.
Product exploration timeout after 30760 steps with 174 reset in 10003 ms.
Computed a total of 1024 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1024 transition count 4096
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 216 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 438 steps (0 resets) in 395 ms. (1 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) p1))), (F p0)]
Knowledge based reduction with 3 factoid took 169 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 192 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 217 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2024-06-01 22:15:22] [INFO ] Invariant cache hit.
[2024-06-01 22:15:31] [INFO ] [Real]Absence check using 0 positive and 168 generalized place invariants in 5649 ms returned sat
[2024-06-01 22:15:37] [INFO ] [Real]Absence check using state equation in 5948 ms returned unknown
Could not prove EG (NOT p0)
Support contains 8 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 4096/4096 transitions.
Applied a total of 0 rules in 300 ms. Remains 1024 /1024 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-06-01 22:15:38] [INFO ] Invariant cache hit.
[2024-06-01 22:15:47] [INFO ] Implicit Places using invariants in 9613 ms returned []
[2024-06-01 22:15:47] [INFO ] Invariant cache hit.
[2024-06-01 22:17:16] [INFO ] Performed 1/1024 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-06-01 22:17:48] [INFO ] Performed 3/1024 implicitness test of which 0 returned IMPLICIT in 64 seconds.
[2024-06-01 22:18:20] [INFO ] Performed 5/1024 implicitness test of which 0 returned IMPLICIT in 96 seconds.
[2024-06-01 22:18:27] [INFO ] Implicit Places using invariants and state equation in 160027 ms returned []
Implicit Place search using SMT with State Equation took 169640 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 169942 ms. Remains : 1024/1024 places, 4096/4096 transitions.
Computed a total of 1024 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1024 transition count 4096
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 220 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 1144 steps (5 resets) in 661 ms. (1 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) p1))), (F p0)]
Knowledge based reduction with 3 factoid took 189 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 228 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 214 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2024-06-01 22:18:29] [INFO ] Invariant cache hit.
[2024-06-01 22:18:39] [INFO ] [Real]Absence check using 0 positive and 168 generalized place invariants in 5569 ms returned sat
[2024-06-01 22:18:44] [INFO ] [Real]Absence check using state equation in 5894 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 217 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration timeout after 30920 steps with 185 reset in 10007 ms.
Product exploration timeout after 30220 steps with 187 reset in 10001 ms.
Support contains 8 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 4096/4096 transitions.
Applied a total of 0 rules in 149 ms. Remains 1024 /1024 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-06-01 22:19:05] [INFO ] Invariant cache hit.
[2024-06-01 22:19:14] [INFO ] Implicit Places using invariants in 9516 ms returned []
[2024-06-01 22:19:14] [INFO ] Invariant cache hit.
[2024-06-01 22:20:42] [INFO ] Performed 1/1024 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-06-01 22:21:14] [INFO ] Performed 3/1024 implicitness test of which 0 returned IMPLICIT in 64 seconds.
[2024-06-01 22:21:47] [INFO ] Performed 5/1024 implicitness test of which 0 returned IMPLICIT in 96 seconds.
[2024-06-01 22:21:55] [INFO ] Implicit Places using invariants and state equation in 160034 ms returned []
Implicit Place search using SMT with State Equation took 169553 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 169705 ms. Remains : 1024/1024 places, 4096/4096 transitions.
Treatment of property Sudoku-PT-BN16-LTLFireability-10 finished in 585799 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(((!p1 U (p2 U X(p2)))&&p0))))'
Support contains 12 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 4096/4096 transitions.
Applied a total of 0 rules in 150 ms. Remains 1024 /1024 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-06-01 22:21:56] [INFO ] Invariant cache hit.
[2024-06-01 22:22:06] [INFO ] Implicit Places using invariants in 9718 ms returned []
[2024-06-01 22:22:06] [INFO ] Invariant cache hit.
[2024-06-01 22:23:33] [INFO ] Performed 1/1024 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-06-01 22:24:06] [INFO ] Performed 3/1024 implicitness test of which 0 returned IMPLICIT in 64 seconds.
[2024-06-01 22:24:38] [INFO ] Performed 5/1024 implicitness test of which 0 returned IMPLICIT in 96 seconds.
[2024-06-01 22:24:46] [INFO ] Implicit Places using invariants and state equation in 160024 ms returned []
Implicit Place search using SMT with State Equation took 169745 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 169896 ms. Remains : 1024/1024 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : Sudoku-PT-BN16-LTLFireability-11
Stuttering criterion allowed to conclude after 241 steps with 11 reset in 93 ms.
FORMULA Sudoku-PT-BN16-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN16-LTLFireability-11 finished in 170163 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(p0)))&&(F(p2)||p1))))'
Support contains 12 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 4096/4096 transitions.
Applied a total of 0 rules in 159 ms. Remains 1024 /1024 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-06-01 22:24:47] [INFO ] Invariant cache hit.
[2024-06-01 22:24:56] [INFO ] Implicit Places using invariants in 9494 ms returned []
[2024-06-01 22:24:56] [INFO ] Invariant cache hit.
[2024-06-01 22:26:26] [INFO ] Performed 1/1024 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-06-01 22:26:58] [INFO ] Performed 3/1024 implicitness test of which 0 returned IMPLICIT in 64 seconds.
[2024-06-01 22:27:30] [INFO ] Performed 5/1024 implicitness test of which 0 returned IMPLICIT in 97 seconds.
[2024-06-01 22:27:36] [INFO ] Implicit Places using invariants and state equation in 160033 ms returned []
Implicit Place search using SMT with State Equation took 169529 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 169693 ms. Remains : 1024/1024 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 224 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), (NOT p0), (NOT p0), true]
Running random walk in product with property : Sudoku-PT-BN16-LTLFireability-13
Entered a terminal (fully accepting) state of product in 193 steps with 7 reset in 100 ms.
FORMULA Sudoku-PT-BN16-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN16-LTLFireability-13 finished in 170044 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||F(p1))))'
Support contains 8 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 4096/4096 transitions.
Applied a total of 0 rules in 151 ms. Remains 1024 /1024 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-06-01 22:27:37] [INFO ] Invariant cache hit.
[2024-06-01 22:27:45] [INFO ] Implicit Places using invariants in 8888 ms returned []
[2024-06-01 22:27:45] [INFO ] Invariant cache hit.
[2024-06-01 22:29:12] [INFO ] Performed 1/1024 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-06-01 22:29:44] [INFO ] Performed 3/1024 implicitness test of which 0 returned IMPLICIT in 64 seconds.
[2024-06-01 22:30:17] [INFO ] Performed 5/1024 implicitness test of which 0 returned IMPLICIT in 96 seconds.
[2024-06-01 22:30:25] [INFO ] Implicit Places using invariants and state equation in 160030 ms returned []
Implicit Place search using SMT with State Equation took 168920 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
Finished structural reductions in LTL mode , in 1 iterations and 169076 ms. Remains : 1024/1024 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-PT-BN16-LTLFireability-14
Product exploration timeout after 18500 steps with 6614 reset in 10001 ms.
Product exploration timeout after 18860 steps with 6935 reset in 10002 ms.
Computed a total of 1024 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1024 transition count 4096
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 17 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-BN16-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-BN16-LTLFireability-14 finished in 190208 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(F((p1&&F(p2))))||p0)))'
Support contains 12 out of 1024 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1024/1024 places, 4096/4096 transitions.
Applied a total of 0 rules in 190 ms. Remains 1024 /1024 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-06-01 22:30:47] [INFO ] Invariant cache hit.
[2024-06-01 22:30:56] [INFO ] Implicit Places using invariants in 8839 ms returned []
[2024-06-01 22:30:56] [INFO ] Invariant cache hit.
[2024-06-01 22:32:24] [INFO ] Performed 1/1024 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-06-01 22:32:56] [INFO ] Performed 4/1024 implicitness test of which 0 returned IMPLICIT in 64 seconds.
[2024-06-01 22:33:28] [INFO ] Performed 6/1024 implicitness test of which 0 returned IMPLICIT in 96 seconds.
[2024-06-01 22:33:36] [INFO ] Implicit Places using invariants and state equation in 160035 ms returned []
Implicit Place search using SMT with State Equation took 168875 ms to find 0 implicit places.
[2024-06-01 22:33:36] [INFO ] Redundant transitions in 169 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 169244 ms. Remains : 1024/1024 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 105 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : Sudoku-PT-BN16-LTLFireability-15
Product exploration timeout after 17570 steps with 244 reset in 10001 ms.
Product exploration timeout after 18180 steps with 239 reset in 10002 ms.
Computed a total of 1024 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1024 transition count 4096
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (F (G p0)), (F (G p1)), (F (G p2))]
False Knowledge obtained : [(X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X p2), (X (NOT p2)), (X (NOT p1)), (X p1)]
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 90 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-BN16-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-BN16-LTLFireability-15 finished in 190516 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(F((G(p0)&&X(p1)))))))'
Found a Shortening insensitive property : Sudoku-PT-BN16-LTLFireability-10
Stuttering acceptance computed with spot in 223 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 8 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1024/1024 places, 4096/4096 transitions.
Applied a total of 0 rules in 165 ms. Remains 1024 /1024 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-06-01 22:33:58] [INFO ] Invariant cache hit.
[2024-06-01 22:34:07] [INFO ] Implicit Places using invariants in 9553 ms returned []
[2024-06-01 22:34:07] [INFO ] Invariant cache hit.
[2024-06-01 22:35:35] [INFO ] Performed 1/1024 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-06-01 22:36:07] [INFO ] Performed 3/1024 implicitness test of which 0 returned IMPLICIT in 64 seconds.
[2024-06-01 22:36:46] [INFO ] Performed 6/1024 implicitness test of which 0 returned IMPLICIT in 103 seconds.
[2024-06-01 22:36:47] [INFO ] Implicit Places using invariants and state equation in 160023 ms returned []
Implicit Place search using SMT with State Equation took 169576 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 169743 ms. Remains : 1024/1024 places, 4096/4096 transitions.
Running random walk in product with property : Sudoku-PT-BN16-LTLFireability-10
Product exploration timeout after 30410 steps with 182 reset in 10008 ms.
Product exploration timeout after 29690 steps with 185 reset in 10002 ms.
Computed a total of 1024 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1024 transition count 4096
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 439 steps (1 resets) in 297 ms. (1 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) p1))), (F p0)]
Knowledge based reduction with 3 factoid took 198 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 240 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 224 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2024-06-01 22:37:09] [INFO ] Invariant cache hit.
[2024-06-01 22:37:18] [INFO ] [Real]Absence check using 0 positive and 168 generalized place invariants in 5670 ms returned sat
[2024-06-01 22:37:24] [INFO ] [Real]Absence check using state equation in 5838 ms returned unknown
Could not prove EG (NOT p0)
Support contains 8 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 4096/4096 transitions.
Applied a total of 0 rules in 149 ms. Remains 1024 /1024 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-06-01 22:37:24] [INFO ] Invariant cache hit.
[2024-06-01 22:37:34] [INFO ] Implicit Places using invariants in 9371 ms returned []
[2024-06-01 22:37:34] [INFO ] Invariant cache hit.
[2024-06-01 22:39:02] [INFO ] Performed 1/1024 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-06-01 22:39:34] [INFO ] Performed 3/1024 implicitness test of which 0 returned IMPLICIT in 64 seconds.
[2024-06-01 22:40:07] [INFO ] Performed 5/1024 implicitness test of which 0 returned IMPLICIT in 96 seconds.
[2024-06-01 22:40:14] [INFO ] Implicit Places using invariants and state equation in 160027 ms returned []
Implicit Place search using SMT with State Equation took 169400 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 169553 ms. Remains : 1024/1024 places, 4096/4096 transitions.
Computed a total of 1024 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1024 transition count 4096
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 333 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 952 steps (3 resets) in 529 ms. (1 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) p1))), (F p0)]
Knowledge based reduction with 3 factoid took 201 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 224 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 214 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2024-06-01 22:40:16] [INFO ] Invariant cache hit.
[2024-06-01 22:40:25] [INFO ] [Real]Absence check using 0 positive and 168 generalized place invariants in 5527 ms returned sat
[2024-06-01 22:40:31] [INFO ] [Real]Absence check using state equation in 6161 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 203 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration timeout after 30420 steps with 187 reset in 10003 ms.
Product exploration timeout after 29900 steps with 177 reset in 10004 ms.
Support contains 8 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 4096/4096 transitions.
Applied a total of 0 rules in 149 ms. Remains 1024 /1024 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-06-01 22:40:51] [INFO ] Invariant cache hit.
[2024-06-01 22:41:01] [INFO ] Implicit Places using invariants in 9148 ms returned []
[2024-06-01 22:41:01] [INFO ] Invariant cache hit.
[2024-06-01 22:42:29] [INFO ] Performed 1/1024 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-06-01 22:43:01] [INFO ] Performed 3/1024 implicitness test of which 0 returned IMPLICIT in 64 seconds.
[2024-06-01 22:43:33] [INFO ] Performed 5/1024 implicitness test of which 0 returned IMPLICIT in 96 seconds.
[2024-06-01 22:43:41] [INFO ] Implicit Places using invariants and state equation in 160024 ms returned []
Implicit Place search using SMT with State Equation took 169173 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
Finished structural reductions in LTL mode , in 1 iterations and 169327 ms. Remains : 1024/1024 places, 4096/4096 transitions.
Treatment of property Sudoku-PT-BN16-LTLFireability-10 finished in 585129 ms.
[2024-06-01 22:43:42] [INFO ] Flatten gal took : 205 ms
[2024-06-01 22:43:42] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-06-01 22:43:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1024 places, 4096 transitions and 16384 arcs took 18 ms.
Total runtime 2638382 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA Sudoku-PT-BN16-LTLFireability-10 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717281826803

--------------------
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
ltl formula name Sudoku-PT-BN16-LTLFireability-10
ltl formula formula --ltl=/tmp/1471/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 1024 places, 4096 transitions and 16384 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.830 real 0.140 user 0.160 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1471/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1471/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1471/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1471/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): There are 1025 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1025, there are 4335 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~216!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 174
pnml2lts-mc( 0/ 4): unique states count: 877
pnml2lts-mc( 0/ 4): unique transitions count: 1171744
pnml2lts-mc( 0/ 4): - self-loop count: 17
pnml2lts-mc( 0/ 4): - claim dead count: 880
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 880
pnml2lts-mc( 0/ 4): - cum. max stack depth: 710
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 880 states 1184036 transitions, fanout: 1345.495
pnml2lts-mc( 0/ 4): Total exploration time 1.520 sec (1.510 sec minimum, 1.517 sec on average)
pnml2lts-mc( 0/ 4): States per second: 579, Transitions per second: 778971
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 23.4MB, 25.7 B/state, compr.: 0.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 2.0%/25.0%
pnml2lts-mc( 0/ 4): Stored 4215 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 23.4MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

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

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