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.r417-tall-171690556400408.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 gold2023
Input is Sudoku-PT-AN11, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r417-tall-171690556400408
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 44M
-rw-r--r-- 1 mcc users 603K Apr 12 12:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 2.9M Apr 12 12:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.3M Apr 12 11:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 6.3M Apr 12 11:47 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 354K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 1.2M Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 616K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 2.3M Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.1M Apr 12 13:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 5.1M Apr 12 13:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.6M Apr 12 12:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18M Apr 12 12:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 82K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 203K Apr 23 08:00 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 746K 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-AN11-LTLFireability-00
FORMULA_NAME Sudoku-PT-AN11-LTLFireability-01
FORMULA_NAME Sudoku-PT-AN11-LTLFireability-02
FORMULA_NAME Sudoku-PT-AN11-LTLFireability-03
FORMULA_NAME Sudoku-PT-AN11-LTLFireability-04
FORMULA_NAME Sudoku-PT-AN11-LTLFireability-05
FORMULA_NAME Sudoku-PT-AN11-LTLFireability-06
FORMULA_NAME Sudoku-PT-AN11-LTLFireability-07
FORMULA_NAME Sudoku-PT-AN11-LTLFireability-08
FORMULA_NAME Sudoku-PT-AN11-LTLFireability-09
FORMULA_NAME Sudoku-PT-AN11-LTLFireability-10
FORMULA_NAME Sudoku-PT-AN11-LTLFireability-11
FORMULA_NAME Sudoku-PT-AN11-LTLFireability-12
FORMULA_NAME Sudoku-PT-AN11-LTLFireability-13
FORMULA_NAME Sudoku-PT-AN11-LTLFireability-14
FORMULA_NAME Sudoku-PT-AN11-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717152400622

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-PT-AN11
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-31 10:46:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-31 10:46:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 10:46:42] [INFO ] Load time of PNML (sax parser for PT used): 122 ms
[2024-05-31 10:46:42] [INFO ] Transformed 1694 places.
[2024-05-31 10:46:42] [INFO ] Transformed 1331 transitions.
[2024-05-31 10:46:42] [INFO ] Found NUPN structural information;
[2024-05-31 10:46:42] [INFO ] Parsed PT model containing 1694 places and 1331 transitions and 5324 arcs in 202 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 96 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA Sudoku-PT-AN11-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 363 out of 1694 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Reduce places removed 1331 places and 0 transitions.
Iterating post reduction 0 with 1331 rules applied. Total rules applied 1331 place count 363 transition count 1331
Applied a total of 1331 rules in 34 ms. Remains 363 /1694 variables (removed 1331) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 363 cols
[2024-05-31 10:46:44] [INFO ] Computed 32 invariants in 73 ms
[2024-05-31 10:46:45] [INFO ] Implicit Places using invariants in 262 ms returned []
[2024-05-31 10:46:45] [INFO ] Invariant cache hit.
[2024-05-31 10:46:45] [INFO ] Implicit Places using invariants and state equation in 361 ms returned []
Implicit Place search using SMT with State Equation took 646 ms to find 0 implicit places.
[2024-05-31 10:46:45] [INFO ] Invariant cache hit.
[2024-05-31 10:46:46] [INFO ] Dead Transitions using invariants and state equation in 751 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 363/1694 places, 1331/1331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1434 ms. Remains : 363/1694 places, 1331/1331 transitions.
Support contains 363 out of 363 places after structural reductions.
[2024-05-31 10:46:46] [INFO ] Flatten gal took : 282 ms
[2024-05-31 10:46:48] [INFO ] Flatten gal took : 325 ms
[2024-05-31 10:46:50] [INFO ] Input system was already deterministic with 1331 transitions.
Incomplete random walk after 10000 steps, including 94 resets, run finished after 981 ms. (steps per millisecond=10 ) properties (out of 20) seen :19
Interrupted Best-First random walk after 7538 steps, including 1 resets, run timeout after 5067 ms. (steps per millisecond=1 ) properties seen 0
Running SMT prover for 1 properties.
[2024-05-31 10:46:57] [INFO ] Invariant cache hit.
[2024-05-31 10:47:01] [INFO ] After 502ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
FORMULA Sudoku-PT-AN11-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
FORMULA Sudoku-PT-AN11-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 363 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 363 transition count 1331
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.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((G(F(p1))||(!p1&&F(p1))))||p0)))'
Support contains 363 out of 363 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 363/363 places, 1331/1331 transitions.
Applied a total of 0 rules in 13 ms. Remains 363 /363 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2024-05-31 10:47:01] [INFO ] Invariant cache hit.
[2024-05-31 10:47:02] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-31 10:47:02] [INFO ] Invariant cache hit.
[2024-05-31 10:47:02] [INFO ] Implicit Places using invariants and state equation in 357 ms returned []
Implicit Place search using SMT with State Equation took 447 ms to find 0 implicit places.
[2024-05-31 10:47:02] [INFO ] Redundant transitions in 75 ms returned []
[2024-05-31 10:47:02] [INFO ] Invariant cache hit.
[2024-05-31 10:47:03] [INFO ] Dead Transitions using invariants and state equation in 801 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1342 ms. Remains : 363/363 places, 1331/1331 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 233 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p1) p0), (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN11-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (EQ s51 1) (EQ s172 1) (EQ s326 1)) (AND (EQ s104 1) (EQ s223 1) (EQ s280 1)) (AND (EQ s69 1) (EQ s195 1) (EQ s333 1)) (AND (EQ s6 1) (EQ s130...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 105 steps with 0 reset in 18 ms.
FORMULA Sudoku-PT-AN11-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN11-LTLFireability-00 finished in 1694 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!p0)))'
Support contains 363 out of 363 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 363/363 places, 1331/1331 transitions.
Applied a total of 0 rules in 11 ms. Remains 363 /363 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2024-05-31 10:47:03] [INFO ] Invariant cache hit.
[2024-05-31 10:47:03] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-31 10:47:03] [INFO ] Invariant cache hit.
[2024-05-31 10:47:04] [INFO ] Implicit Places using invariants and state equation in 312 ms returned []
Implicit Place search using SMT with State Equation took 384 ms to find 0 implicit places.
[2024-05-31 10:47:04] [INFO ] Redundant transitions in 57 ms returned []
[2024-05-31 10:47:04] [INFO ] Invariant cache hit.
[2024-05-31 10:47:04] [INFO ] Dead Transitions using invariants and state equation in 773 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1233 ms. Remains : 363/363 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 73 ms :[p0, p0]
Running random walk in product with property : Sudoku-PT-AN11-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (EQ s51 1) (EQ s172 1) (EQ s326 1)) (AND (EQ s104 1) (EQ s223 1) (EQ s280 1)) (AND (EQ s69 1) (EQ s195 1) (EQ s333 1)) (AND (EQ s6 1) (EQ s130...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 947 reset in 8153 ms.
Product exploration explored 100000 steps with 947 reset in 8127 ms.
Computed a total of 363 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 363 transition count 1331
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 24 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN11-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN11-LTLFireability-02 finished in 26685 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 363 out of 363 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 363/363 places, 1331/1331 transitions.
Applied a total of 0 rules in 2 ms. Remains 363 /363 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2024-05-31 10:47:30] [INFO ] Invariant cache hit.
[2024-05-31 10:47:30] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-31 10:47:30] [INFO ] Invariant cache hit.
[2024-05-31 10:47:30] [INFO ] Implicit Places using invariants and state equation in 319 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
[2024-05-31 10:47:30] [INFO ] Invariant cache hit.
[2024-05-31 10:47:31] [INFO ] Dead Transitions using invariants and state equation in 718 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1126 ms. Remains : 363/363 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 139 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN11-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (AND (EQ s51 1) (EQ s172 1) (EQ s326 1)) (AND (EQ s104 1) (EQ s223 1) (EQ s280 1)) (AND (EQ s69 1) (EQ s195 1) (EQ s333 1)) (AND (EQ s6 1) (EQ s130...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 106 steps with 0 reset in 10 ms.
FORMULA Sudoku-PT-AN11-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN11-LTLFireability-03 finished in 1307 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 363 out of 363 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 363/363 places, 1331/1331 transitions.
Applied a total of 0 rules in 5 ms. Remains 363 /363 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2024-05-31 10:47:31] [INFO ] Invariant cache hit.
[2024-05-31 10:47:31] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-31 10:47:31] [INFO ] Invariant cache hit.
[2024-05-31 10:47:32] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
[2024-05-31 10:47:32] [INFO ] Invariant cache hit.
[2024-05-31 10:47:32] [INFO ] Dead Transitions using invariants and state equation in 702 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1095 ms. Remains : 363/363 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 201 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN11-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (AND (EQ s51 1) (EQ s172 1) (EQ s326 1)) (AND (EQ s104 1) (EQ s223 1) (EQ s280 1)) (AND (EQ s69 1) (EQ s195 1) (EQ s333 1)) (AND (EQ s6 1) (EQ s130...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 61830 steps with 20610 reset in 10003 ms.
Product exploration timeout after 60210 steps with 20070 reset in 10001 ms.
Computed a total of 363 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 363 transition count 1331
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 (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 21 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-PT-AN11-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN11-LTLFireability-04 finished in 30286 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 363 out of 363 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 363/363 places, 1331/1331 transitions.
Applied a total of 0 rules in 3 ms. Remains 363 /363 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2024-05-31 10:48:01] [INFO ] Invariant cache hit.
[2024-05-31 10:48:01] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-31 10:48:01] [INFO ] Invariant cache hit.
[2024-05-31 10:48:02] [INFO ] Implicit Places using invariants and state equation in 308 ms returned []
Implicit Place search using SMT with State Equation took 384 ms to find 0 implicit places.
[2024-05-31 10:48:02] [INFO ] Invariant cache hit.
[2024-05-31 10:48:02] [INFO ] Dead Transitions using invariants and state equation in 708 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1096 ms. Remains : 363/363 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN11-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (EQ s51 1) (EQ s172 1) (EQ s326 1)) (AND (EQ s104 1) (EQ s223 1) (EQ s280 1)) (AND (EQ s69 1) (EQ s195 1) (EQ s333 1)) (AND (EQ s6 1) (EQ s130...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration timeout after 79520 steps with 39760 reset in 10001 ms.
Product exploration timeout after 78100 steps with 39050 reset in 10001 ms.
Computed a total of 363 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 363 transition count 1331
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 15 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN11-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN11-LTLFireability-05 finished in 30118 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 363 out of 363 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 363/363 places, 1331/1331 transitions.
Applied a total of 0 rules in 3 ms. Remains 363 /363 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2024-05-31 10:48:32] [INFO ] Invariant cache hit.
[2024-05-31 10:48:32] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-31 10:48:32] [INFO ] Invariant cache hit.
[2024-05-31 10:48:32] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 388 ms to find 0 implicit places.
[2024-05-31 10:48:32] [INFO ] Invariant cache hit.
[2024-05-31 10:48:33] [INFO ] Dead Transitions using invariants and state equation in 697 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1089 ms. Remains : 363/363 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN11-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (EQ s51 1) (EQ s172 1) (EQ s326 1)) (AND (EQ s104 1) (EQ s223 1) (EQ s280 1)) (AND (EQ s69 1) (EQ s195 1) (EQ s333 1)) (AND (EQ s6 1) (EQ s130...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration timeout after 78830 steps with 39415 reset in 10001 ms.
Product exploration timeout after 80140 steps with 40070 reset in 10001 ms.
Computed a total of 363 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 363 transition count 1331
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 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN11-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN11-LTLFireability-06 finished in 29957 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(p1))))'
Support contains 363 out of 363 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 363/363 places, 1331/1331 transitions.
Applied a total of 0 rules in 2 ms. Remains 363 /363 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2024-05-31 10:49:01] [INFO ] Invariant cache hit.
[2024-05-31 10:49:02] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-31 10:49:02] [INFO ] Invariant cache hit.
[2024-05-31 10:49:02] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
[2024-05-31 10:49:02] [INFO ] Invariant cache hit.
[2024-05-31 10:49:03] [INFO ] Dead Transitions using invariants and state equation in 741 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1114 ms. Remains : 363/363 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-PT-AN11-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}]], initial=0, aps=[p1:(OR (AND (EQ s51 1) (EQ s172 1) (EQ s326 1)) (AND (EQ s104 1) (EQ s223 1) (EQ s280 1)) (AND (EQ s69 1) (EQ s195 1) (EQ s333 1)) (AND (EQ s6 1) (EQ s130...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 81340 steps with 40670 reset in 10001 ms.
Product exploration timeout after 79870 steps with 39935 reset in 10001 ms.
Computed a total of 363 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 363 transition count 1331
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 p1 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p1)), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 25 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-AN11-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN11-LTLFireability-07 finished in 29988 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 363 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 363/363 places, 1331/1331 transitions.
Applied a total of 0 rules in 74 ms. Remains 363 /363 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2024-05-31 10:49:32] [INFO ] Invariant cache hit.
[2024-05-31 10:49:33] [INFO ] Implicit Places using invariants in 1207 ms returned []
[2024-05-31 10:49:33] [INFO ] Invariant cache hit.
[2024-05-31 10:49:36] [INFO ] Implicit Places using invariants and state equation in 2953 ms returned []
Implicit Place search using SMT with State Equation took 4162 ms to find 0 implicit places.
[2024-05-31 10:49:36] [INFO ] Invariant cache hit.
[2024-05-31 10:49:36] [INFO ] Dead Transitions using invariants and state equation in 732 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4970 ms. Remains : 363/363 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN11-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s104 1) (EQ s229 1) (EQ s346 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 129 steps with 14 reset in 17 ms.
FORMULA Sudoku-PT-AN11-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN11-LTLFireability-08 finished in 5072 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 6 out of 363 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 363/363 places, 1331/1331 transitions.
Applied a total of 0 rules in 33 ms. Remains 363 /363 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2024-05-31 10:49:37] [INFO ] Invariant cache hit.
[2024-05-31 10:49:38] [INFO ] Implicit Places using invariants in 1215 ms returned []
[2024-05-31 10:49:38] [INFO ] Invariant cache hit.
[2024-05-31 10:49:40] [INFO ] Implicit Places using invariants and state equation in 2228 ms returned []
Implicit Place search using SMT with State Equation took 3445 ms to find 0 implicit places.
[2024-05-31 10:49:40] [INFO ] Redundant transitions in 23 ms returned []
[2024-05-31 10:49:40] [INFO ] Invariant cache hit.
[2024-05-31 10:49:41] [INFO ] Dead Transitions using invariants and state equation in 745 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4255 ms. Remains : 363/363 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN11-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s40 0) (EQ s163 0) (EQ s348 0) (AND (EQ s84 1) (EQ s199 1) (EQ s260 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1254 reset in 9030 ms.
Product exploration explored 100000 steps with 1258 reset in 9171 ms.
Computed a total of 363 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 363 transition count 1331
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 p0))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 58 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN11-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN11-LTLFireability-10 finished in 30557 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U G(p1))||X(p2)))'
Support contains 9 out of 363 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 363/363 places, 1331/1331 transitions.
Applied a total of 0 rules in 25 ms. Remains 363 /363 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2024-05-31 10:50:07] [INFO ] Invariant cache hit.
[2024-05-31 10:50:08] [INFO ] Implicit Places using invariants in 1252 ms returned []
[2024-05-31 10:50:08] [INFO ] Invariant cache hit.
[2024-05-31 10:50:11] [INFO ] Implicit Places using invariants and state equation in 3049 ms returned []
Implicit Place search using SMT with State Equation took 4309 ms to find 0 implicit places.
[2024-05-31 10:50:11] [INFO ] Invariant cache hit.
[2024-05-31 10:50:12] [INFO ] Dead Transitions using invariants and state equation in 713 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5050 ms. Remains : 363/363 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 292 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN11-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=2 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=6 dest: 5}, { cond=(AND p1 p0), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p1) p0), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(AND (EQ s38 1) (EQ s160 1) (EQ s313 1)), p0:(OR (AND (EQ s48 1) (EQ s174 1) (EQ s345 1)) (AND (EQ s83 1) (EQ s207 1) (EQ s347 1))), p2:(OR (EQ s48 0) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 38 steps with 0 reset in 16 ms.
FORMULA Sudoku-PT-AN11-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN11-LTLFireability-11 finished in 5385 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(((X(F(!p0))&&G(!p1))||G(F(!p0)))) U X(G(!p1))))'
Support contains 6 out of 363 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 363/363 places, 1331/1331 transitions.
Applied a total of 0 rules in 23 ms. Remains 363 /363 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2024-05-31 10:50:13] [INFO ] Invariant cache hit.
[2024-05-31 10:50:14] [INFO ] Implicit Places using invariants in 1261 ms returned []
[2024-05-31 10:50:14] [INFO ] Invariant cache hit.
[2024-05-31 10:50:17] [INFO ] Implicit Places using invariants and state equation in 3725 ms returned []
Implicit Place search using SMT with State Equation took 4989 ms to find 0 implicit places.
[2024-05-31 10:50:17] [INFO ] Invariant cache hit.
[2024-05-31 10:50:18] [INFO ] Dead Transitions using invariants and state equation in 775 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5788 ms. Remains : 363/363 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 203 ms :[(AND p0 p1), p1, p0, (AND p0 (NOT p1))]
Running random walk in product with property : Sudoku-PT-AN11-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p0:(AND (EQ s57 1) (EQ s182 1) (EQ s310 1)), p1:(AND (EQ s52 1) (EQ s169 1) (EQ s294 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration timeout after 68880 steps with 3801 reset in 10001 ms.
Product exploration timeout after 68130 steps with 3812 reset in 10001 ms.
Computed a total of 363 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 363 transition count 1331
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), true, (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X p1), (X (NOT p1)), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 11 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN11-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN11-LTLFireability-13 finished in 34035 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((X(X(p0))&&F(p1)))&&(G(p2) U !p3)))'
Support contains 9 out of 363 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 363/363 places, 1331/1331 transitions.
Applied a total of 0 rules in 24 ms. Remains 363 /363 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2024-05-31 10:50:47] [INFO ] Invariant cache hit.
[2024-05-31 10:50:48] [INFO ] Implicit Places using invariants in 1192 ms returned []
[2024-05-31 10:50:48] [INFO ] Invariant cache hit.
[2024-05-31 10:50:50] [INFO ] Implicit Places using invariants and state equation in 2734 ms returned []
Implicit Place search using SMT with State Equation took 3932 ms to find 0 implicit places.
[2024-05-31 10:50:50] [INFO ] Invariant cache hit.
[2024-05-31 10:50:51] [INFO ] Dead Transitions using invariants and state equation in 723 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4683 ms. Remains : 363/363 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 253 ms :[(OR (NOT p0) (NOT p1) p3), true, (OR (NOT p0) (NOT p1)), (NOT p2), p3, (NOT p0), (NOT p1), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN11-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND p3 (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p3) p2), acceptance={} source=0 dest: 2}, { cond=(AND p3 p2), acceptance={} source=0 dest: 3}, { cond=(AND p3 p2), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 5}, { cond=(NOT p1), acceptance={} source=2 dest: 6}], [{ cond=(NOT p2), acceptance={} source=3 dest: 1}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(AND p3 (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND p3 p2), acceptance={0} source=4 dest: 3}, { cond=(AND p3 p2), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 7}], [{ cond=(NOT p1), acceptance={0} source=6 dest: 6}], [{ cond=(NOT p0), acceptance={} source=7 dest: 1}]], initial=0, aps=[p3:(AND (EQ s51 1) (EQ s170 1) (EQ s304 1)), p2:(AND (EQ s75 1) (EQ s195 1) (EQ s339 1)), p1:(AND (EQ s114 1) (EQ s233 1) (EQ s268 1)), p0:(OR (EQ s114 0)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 2 ms.
FORMULA Sudoku-PT-AN11-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN11-LTLFireability-14 finished in 4963 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(!(p0 U !((X(p2)||p3)&&p1))))'
Support contains 9 out of 363 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 363/363 places, 1331/1331 transitions.
Applied a total of 0 rules in 23 ms. Remains 363 /363 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2024-05-31 10:50:51] [INFO ] Invariant cache hit.
[2024-05-31 10:50:53] [INFO ] Implicit Places using invariants in 1195 ms returned []
[2024-05-31 10:50:53] [INFO ] Invariant cache hit.
[2024-05-31 10:50:56] [INFO ] Implicit Places using invariants and state equation in 2919 ms returned []
Implicit Place search using SMT with State Equation took 4122 ms to find 0 implicit places.
[2024-05-31 10:50:56] [INFO ] Invariant cache hit.
[2024-05-31 10:50:56] [INFO ] Dead Transitions using invariants and state equation in 717 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4864 ms. Remains : 363/363 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 82 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3)))]
Running random walk in product with property : Sudoku-PT-AN11-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p3)), acceptance={0} source=0 dest: 1}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s75 1) (EQ s191 1) (EQ s295 1)), p1:(AND (EQ s75 1) (EQ s191 1) (EQ s295 1) (EQ s67 1) (EQ s196 1) (EQ s342 1)), p3:(AND (EQ s31 1) (EQ s151 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 104 steps with 0 reset in 9 ms.
FORMULA Sudoku-PT-AN11-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN11-LTLFireability-15 finished in 4972 ms.
All properties solved by simple procedures.
Total runtime 254347 ms.

BK_STOP 1717152658252

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-AN11"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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 gold2023"
echo " Input is Sudoku-PT-AN11, 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 r417-tall-171690556400408"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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