Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r487-tall-167912702900316.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
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 r487-tall-167912702900316
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 104M
-rw-r--r-- 1 mcc users 1.3M Feb 26 09:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 5.7M Feb 26 09:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5M Feb 26 08:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 23M Feb 26 08:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 473K Feb 25 17:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 1.6M Feb 25 17:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4M Feb 25 17:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.6M Feb 25 17:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.6M Feb 26 11:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 12M Feb 26 11:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8M Feb 26 09:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 33M Feb 26 09:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 29K Feb 25 17:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 73K Feb 25 17:17 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 2.7M Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Sudoku-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 1679184511538

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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-PT-BN16
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-19 00:08:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-19 00:08:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 00:08:33] [INFO ] Load time of PNML (sax parser for PT used): 227 ms
[2023-03-19 00:08:33] [INFO ] Transformed 5120 places.
[2023-03-19 00:08:33] [INFO ] Transformed 4096 transitions.
[2023-03-19 00:08:33] [INFO ] Parsed PT model containing 5120 places and 4096 transitions and 20480 arcs in 319 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 185 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Sudoku-PT-BN16-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN16-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN16-LTLFireability-01 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 89 ms. Remains 1024 /5120 variables (removed 4096) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 1024 cols
[2023-03-19 00:08:36] [INFO ] Computed 168 place invariants in 860 ms
[2023-03-19 00:08:37] [INFO ] Implicit Places using invariants in 1227 ms returned []
[2023-03-19 00:08:37] [INFO ] Invariant cache hit.
[2023-03-19 00:08:38] [INFO ] Implicit Places using invariants and state equation in 1068 ms returned []
Implicit Place search using SMT with State Equation took 2321 ms to find 0 implicit places.
[2023-03-19 00:08:38] [INFO ] Invariant cache hit.
[2023-03-19 00:08:39] [INFO ] Dead Transitions using invariants and state equation in 1522 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1024/5120 places, 4096/4096 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3936 ms. Remains : 1024/5120 places, 4096/4096 transitions.
Support contains 1024 out of 1024 places after structural reductions.
[2023-03-19 00:08:41] [INFO ] Flatten gal took : 827 ms
[2023-03-19 00:08:43] [INFO ] Flatten gal took : 487 ms
[2023-03-19 00:08:46] [INFO ] Input system was already deterministic with 4096 transitions.
Finished random walk after 213 steps, including 0 resets, run visited all 21 properties in 122 ms. (steps per millisecond=1 )
FORMULA Sudoku-PT-BN16-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Sudoku-PT-BN16-LTLFireability-02 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.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(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 9 ms. Remains 1024 /1024 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2023-03-19 00:08:47] [INFO ] Invariant cache hit.
[2023-03-19 00:08:47] [INFO ] Implicit Places using invariants in 208 ms returned []
[2023-03-19 00:08:47] [INFO ] Invariant cache hit.
[2023-03-19 00:08:48] [INFO ] Implicit Places using invariants and state equation in 1011 ms returned []
Implicit Place search using SMT with State Equation took 1230 ms to find 0 implicit places.
[2023-03-19 00:08:48] [INFO ] Invariant cache hit.
[2023-03-19 00:08:50] [INFO ] Dead Transitions using invariants and state equation in 1540 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2781 ms. Remains : 1024/1024 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 233 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-PT-BN16-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(AND (OR (LT s97 1) (LT s321 1) (LT s609 1) (LT s785 1)) (OR (LT s185 1) (LT s409 1) (LT s693 1) (LT s857 1)) (OR (LT s119 1) (LT s327 1) (LT s625 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 6 ms.
FORMULA Sudoku-PT-BN16-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN16-LTLFireability-00 finished in 3166 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(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 9 ms. Remains 1024 /1024 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2023-03-19 00:08:50] [INFO ] Invariant cache hit.
[2023-03-19 00:08:50] [INFO ] Implicit Places using invariants in 199 ms returned []
[2023-03-19 00:08:50] [INFO ] Invariant cache hit.
[2023-03-19 00:08:51] [INFO ] Implicit Places using invariants and state equation in 954 ms returned []
Implicit Place search using SMT with State Equation took 1155 ms to find 0 implicit places.
[2023-03-19 00:08:51] [INFO ] Invariant cache hit.
[2023-03-19 00:08:53] [INFO ] Dead Transitions using invariants and state equation in 1462 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2630 ms. Remains : 1024/1024 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-BN16-LTLFireability-03 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:(AND (OR (LT s97 1) (LT s321 1) (LT s609 1) (LT s785 1)) (OR (LT s185 1) (LT s409 1) (LT s693 1) (LT s857 1)) (OR (LT s119 1) (LT s327 1) (LT s625 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 32290 steps with 153 reset in 10006 ms.
Product exploration timeout after 32240 steps with 153 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)...)
Solver returned unknown.
Knowledge obtained : [(NOT p0), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 2 factoid took 63 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-BN16-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-BN16-LTLFireability-03 finished in 27952 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(!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 9 ms. Remains 1024 /1024 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2023-03-19 00:09:18] [INFO ] Invariant cache hit.
[2023-03-19 00:09:18] [INFO ] Implicit Places using invariants in 192 ms returned []
[2023-03-19 00:09:18] [INFO ] Invariant cache hit.
[2023-03-19 00:09:19] [INFO ] Implicit Places using invariants and state equation in 1012 ms returned []
Implicit Place search using SMT with State Equation took 1206 ms to find 0 implicit places.
[2023-03-19 00:09:19] [INFO ] Invariant cache hit.
[2023-03-19 00:09:21] [INFO ] Dead Transitions using invariants and state equation in 1517 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2734 ms. Remains : 1024/1024 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 78 ms :[p0, p0, true]
Running random walk in product with property : Sudoku-PT-BN16-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (OR (LT s97 1) (LT s321 1) (LT s609 1) (LT s785 1)) (OR (LT s185 1) (LT s409 1) (LT s693 1) (LT s857 1)) (OR (LT s119 1) (LT s327 1) (LT s625 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 19400 steps with 9700 reset in 10003 ms.
Product exploration timeout after 19540 steps with 9770 reset in 10005 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)...)
Solver returned unknown.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p0))
Knowledge based reduction with 3 factoid took 57 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-BN16-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-BN16-LTLFireability-06 finished in 27930 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(!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 7 ms. Remains 1024 /1024 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2023-03-19 00:09:46] [INFO ] Invariant cache hit.
[2023-03-19 00:09:46] [INFO ] Implicit Places using invariants in 192 ms returned []
[2023-03-19 00:09:46] [INFO ] Invariant cache hit.
[2023-03-19 00:09:47] [INFO ] Implicit Places using invariants and state equation in 920 ms returned []
Implicit Place search using SMT with State Equation took 1124 ms to find 0 implicit places.
[2023-03-19 00:09:47] [INFO ] Invariant cache hit.
[2023-03-19 00:09:49] [INFO ] Dead Transitions using invariants and state equation in 1520 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2656 ms. Remains : 1024/1024 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 108 ms :[p0, p0, true, p0]
Running random walk in product with property : Sudoku-PT-BN16-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=3, aps=[p0:(AND (OR (LT s97 1) (LT s321 1) (LT s609 1) (LT s785 1)) (OR (LT s185 1) (LT s409 1) (LT s693 1) (LT s857 1)) (OR (LT s119 1) (LT s327 1) (LT s625 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration timeout after 14740 steps with 4913 reset in 10001 ms.
Product exploration timeout after 14880 steps with 4960 reset in 10005 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)...)
Solver returned unknown.
Knowledge obtained : [(NOT p0), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 93 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[p0, p0, true, p0]
Finished random walk after 208 steps, including 0 resets, run visited all 1 properties in 68 ms. (steps per millisecond=3 )
Knowledge obtained : [(NOT p0), (F (G p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 95 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[p0, p0, true, p0]
Stuttering acceptance computed with spot in 124 ms :[p0, p0, true, 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 9 ms. Remains 1024 /1024 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2023-03-19 00:10:15] [INFO ] Invariant cache hit.
[2023-03-19 00:10:15] [INFO ] Implicit Places using invariants in 188 ms returned []
[2023-03-19 00:10:15] [INFO ] Invariant cache hit.
[2023-03-19 00:10:16] [INFO ] Implicit Places using invariants and state equation in 931 ms returned []
Implicit Place search using SMT with State Equation took 1121 ms to find 0 implicit places.
[2023-03-19 00:10:16] [INFO ] Invariant cache hit.
[2023-03-19 00:10:17] [INFO ] Dead Transitions using invariants and state equation in 1467 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2600 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)...)
Solver returned unknown.
Knowledge obtained : [(NOT p0), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 102 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[p0, p0, true, p0]
Finished random walk after 206 steps, including 0 resets, run visited all 1 properties in 77 ms. (steps per millisecond=2 )
Knowledge obtained : [(NOT p0), (F (G p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 113 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[p0, p0, true, p0]
Stuttering acceptance computed with spot in 127 ms :[p0, p0, true, p0]
Stuttering acceptance computed with spot in 118 ms :[p0, p0, true, p0]
Product exploration timeout after 14760 steps with 4920 reset in 10002 ms.
Product exploration timeout after 14850 steps with 4950 reset in 10008 ms.
Applying partial POR strategy [true, false, true, false]
Stuttering acceptance computed with spot in 118 ms :[p0, p0, true, 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 34 ms. Remains 1024 /1024 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2023-03-19 00:10:44] [INFO ] Redundant transitions in 283 ms returned []
[2023-03-19 00:10:44] [INFO ] Invariant cache hit.
[2023-03-19 00:10:45] [INFO ] Dead Transitions using invariants and state equation in 1382 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1704 ms. Remains : 1024/1024 places, 4096/4096 transitions.
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.
[2023-03-19 00:10:45] [INFO ] Invariant cache hit.
[2023-03-19 00:10:46] [INFO ] Implicit Places using invariants in 198 ms returned []
[2023-03-19 00:10:46] [INFO ] Invariant cache hit.
[2023-03-19 00:10:47] [INFO ] Implicit Places using invariants and state equation in 932 ms returned []
Implicit Place search using SMT with State Equation took 1133 ms to find 0 implicit places.
[2023-03-19 00:10:47] [INFO ] Invariant cache hit.
[2023-03-19 00:10:48] [INFO ] Dead Transitions using invariants and state equation in 1410 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2550 ms. Remains : 1024/1024 places, 4096/4096 transitions.
Treatment of property Sudoku-PT-BN16-LTLFireability-07 finished in 62639 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 4 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 296 ms. Remains 1024 /1024 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2023-03-19 00:10:49] [INFO ] Invariant cache hit.
[2023-03-19 00:10:50] [INFO ] Implicit Places using invariants in 1428 ms returned []
[2023-03-19 00:10:50] [INFO ] Invariant cache hit.
[2023-03-19 00:10:54] [INFO ] Implicit Places using invariants and state equation in 4027 ms returned []
Implicit Place search using SMT with State Equation took 5457 ms to find 0 implicit places.
[2023-03-19 00:10:55] [INFO ] Redundant transitions in 258 ms returned []
[2023-03-19 00:10:55] [INFO ] Invariant cache hit.
[2023-03-19 00:10:56] [INFO ] Dead Transitions using invariants and state equation in 1376 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7394 ms. Remains : 1024/1024 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-BN16-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s57 1) (LT s281 1) (LT s565 1) (LT s857 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 timeout after 17310 steps with 273 reset in 10003 ms.
Product exploration timeout after 17160 steps with 278 reset in 10009 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 : [(NOT p0), (F (G p0))]
False Knowledge obtained : [(X (NOT p0)), (X p0)]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 2 factoid took 98 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-BN16-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-BN16-LTLFireability-08 finished in 28425 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((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 278 ms. Remains 1024 /1024 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2023-03-19 00:11:17] [INFO ] Invariant cache hit.
[2023-03-19 00:11:19] [INFO ] Implicit Places using invariants in 1310 ms returned []
[2023-03-19 00:11:19] [INFO ] Invariant cache hit.
[2023-03-19 00:11:23] [INFO ] Implicit Places using invariants and state equation in 4233 ms returned []
Implicit Place search using SMT with State Equation took 5545 ms to find 0 implicit places.
[2023-03-19 00:11:23] [INFO ] Invariant cache hit.
[2023-03-19 00:11:24] [INFO ] Dead Transitions using invariants and state equation in 1404 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7229 ms. Remains : 1024/1024 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-PT-BN16-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (LT s50 1) (LT s306 1) (LT s575 1) (LT s1010 1)), p0:(OR (LT s96 1) (LT s352 1) (LT s616 1) (LT s896 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 18450 steps with 214 reset in 10006 ms.
Product exploration timeout after 17800 steps with 210 reset in 10007 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) (NOT p0)), (F (G p1)), (F (G p0))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1))))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 3 factoid took 134 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-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-BN16-LTLFireability-09 finished in 28349 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 8 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 239 ms. Remains 1024 /1024 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2023-03-19 00:11:46] [INFO ] Invariant cache hit.
[2023-03-19 00:11:47] [INFO ] Implicit Places using invariants in 1291 ms returned []
[2023-03-19 00:11:47] [INFO ] Invariant cache hit.
[2023-03-19 00:11:51] [INFO ] Implicit Places using invariants and state equation in 4368 ms returned []
Implicit Place search using SMT with State Equation took 5671 ms to find 0 implicit places.
[2023-03-19 00:11:52] [INFO ] Redundant transitions in 166 ms returned []
[2023-03-19 00:11:52] [INFO ] Invariant cache hit.
[2023-03-19 00:11:53] [INFO ] Dead Transitions using invariants and state equation in 1397 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7480 ms. Remains : 1024/1024 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-PT-BN16-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (LT s21 1) (LT s261 1) (LT s529 1) (LT s789 1)), p0:(OR (LT s110 1) (LT s334 1) (LT s608 1) (LT s782 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration timeout after 16670 steps with 273 reset in 10006 ms.
Product exploration timeout after 16580 steps with 284 reset in 10008 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) (NOT p0)), (F (G p1)), (F (G p0))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0))))]
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 3 factoid took 182 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-BN16-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-BN16-LTLFireability-10 finished in 28616 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G((p1 U 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 364 ms. Remains 1024 /1024 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2023-03-19 00:12:14] [INFO ] Invariant cache hit.
[2023-03-19 00:12:16] [INFO ] Implicit Places using invariants in 1304 ms returned []
[2023-03-19 00:12:16] [INFO ] Invariant cache hit.
[2023-03-19 00:12:20] [INFO ] Implicit Places using invariants and state equation in 4253 ms returned []
Implicit Place search using SMT with State Equation took 5560 ms to find 0 implicit places.
[2023-03-19 00:12:20] [INFO ] Invariant cache hit.
[2023-03-19 00:12:21] [INFO ] Dead Transitions using invariants and state equation in 1400 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7325 ms. Remains : 1024/1024 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Sudoku-PT-BN16-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 2}], [{ cond=(OR p2 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p0:(OR (AND (GEQ s203 1) (GEQ s491 1) (GEQ s713 1) (GEQ s923 1)) (AND (GEQ s176 1) (GEQ s400 1) (GEQ s693 1) (GEQ s848 1))), p2:(AND (GEQ s176 1) (GEQ s40...], 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 19370 steps with 9685 reset in 10003 ms.
Product exploration timeout after 19360 steps with 9680 reset in 10001 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 p2 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p2) p1))), (F (G (NOT p0))), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 6 factoid took 101 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-BN16-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-BN16-LTLFireability-12 finished in 28459 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&(F(G(p1))||(F(!p2) U p3))))'
Support contains 15 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 218 ms. Remains 1024 /1024 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2023-03-19 00:12:43] [INFO ] Invariant cache hit.
[2023-03-19 00:12:44] [INFO ] Implicit Places using invariants in 1296 ms returned []
[2023-03-19 00:12:44] [INFO ] Invariant cache hit.
[2023-03-19 00:12:49] [INFO ] Implicit Places using invariants and state equation in 4691 ms returned []
Implicit Place search using SMT with State Equation took 5991 ms to find 0 implicit places.
[2023-03-19 00:12:49] [INFO ] Invariant cache hit.
[2023-03-19 00:12:50] [INFO ] Dead Transitions using invariants and state equation in 1397 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7608 ms. Remains : 1024/1024 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 168 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (NOT p0), (AND (NOT p1) (NOT p3)), (AND p2 (NOT p1)), true]
Running random walk in product with property : Sudoku-PT-BN16-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p3), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(AND p1 (NOT p3)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p3:(AND (GEQ s13 1) (GEQ s285 1) (GEQ s519 1) (GEQ s893 1)), p2:(AND (GEQ s140 1) (GEQ s428 1) (GEQ s649 1) (GEQ s924 1)), p0:(OR (LT s79 1) (LT s335 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA Sudoku-PT-BN16-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN16-LTLFireability-13 finished in 7809 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 12 out of 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 233 ms. Remains 1024 /1024 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2023-03-19 00:12:51] [INFO ] Invariant cache hit.
[2023-03-19 00:12:52] [INFO ] Implicit Places using invariants in 1302 ms returned []
[2023-03-19 00:12:52] [INFO ] Invariant cache hit.
[2023-03-19 00:12:56] [INFO ] Implicit Places using invariants and state equation in 4116 ms returned []
Implicit Place search using SMT with State Equation took 5420 ms to find 0 implicit places.
[2023-03-19 00:12:56] [INFO ] Redundant transitions in 165 ms returned []
[2023-03-19 00:12:56] [INFO ] Invariant cache hit.
[2023-03-19 00:12:58] [INFO ] Dead Transitions using invariants and state equation in 1382 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7211 ms. Remains : 1024/1024 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-BN16-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s81 1) (GEQ s369 1) (GEQ s607 1) (GEQ s1009 1) (OR (AND (GEQ s12 1) (GEQ s316 1) (GEQ s527 1) (GEQ s1020 1)) (AND (GEQ s254 1) (GEQ s462 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 216 steps with 0 reset in 67 ms.
FORMULA Sudoku-PT-BN16-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN16-LTLFireability-14 finished in 7325 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((!p0&&X(F(p1)))||G(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 222 ms. Remains 1024 /1024 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2023-03-19 00:12:58] [INFO ] Invariant cache hit.
[2023-03-19 00:12:59] [INFO ] Implicit Places using invariants in 1292 ms returned []
[2023-03-19 00:12:59] [INFO ] Invariant cache hit.
[2023-03-19 00:13:03] [INFO ] Implicit Places using invariants and state equation in 3866 ms returned []
Implicit Place search using SMT with State Equation took 5166 ms to find 0 implicit places.
[2023-03-19 00:13:03] [INFO ] Invariant cache hit.
[2023-03-19 00:13:04] [INFO ] Dead Transitions using invariants and state equation in 1395 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6785 ms. Remains : 1024/1024 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : Sudoku-PT-BN16-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s130 1) (GEQ s386 1) (GEQ s640 1) (GEQ s770 1)), p1:(AND (GEQ s202 1) (GEQ s490 1) (GEQ s712 1) (GEQ s906 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 212 steps with 0 reset in 70 ms.
FORMULA Sudoku-PT-BN16-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN16-LTLFireability-15 finished in 6958 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(!p0)))'
[2023-03-19 00:13:05] [INFO ] Flatten gal took : 219 ms
[2023-03-19 00:13:05] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 31 ms.
[2023-03-19 00:13:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1024 places, 4096 transitions and 16384 arcs took 15 ms.
Total runtime 272436 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT Sudoku-PT-BN16
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/376
LTLFireability

BK_STOP 1679185031047

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/376/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/376/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/376/LTLFireability.xml
/home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin//../BenchKit_head.sh: line 63: 1037 Killed lola --conf=$BIN_DIR/configfiles/ltlfireabilityconf --formula=$DIR/LTLFireability.xml --verdictfile=$DIR/GenericPropertiesVerdict.xml $DIR/model.pnml

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="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
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 r487-tall-167912702900316"
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 ;