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.r489-tall-167912706600308.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 ltsminxred
Input is Sudoku-PT-BN09, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r489-tall-167912706600308
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 18M
-rw-r--r-- 1 mcc users 187K Feb 26 09:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 910K Feb 26 09:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 825K Feb 26 09:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 3.6M Feb 26 09:08 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 153K Feb 25 17:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 544K Feb 25 17:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 413K Feb 25 17:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 1.4M Feb 25 17:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 427K Feb 26 09:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 2.1M Feb 26 09:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.3M Feb 26 09:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 5.6M Feb 26 09:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 17:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 26K 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 499K 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-BN09-LTLFireability-00
FORMULA_NAME Sudoku-PT-BN09-LTLFireability-01
FORMULA_NAME Sudoku-PT-BN09-LTLFireability-02
FORMULA_NAME Sudoku-PT-BN09-LTLFireability-03
FORMULA_NAME Sudoku-PT-BN09-LTLFireability-04
FORMULA_NAME Sudoku-PT-BN09-LTLFireability-05
FORMULA_NAME Sudoku-PT-BN09-LTLFireability-06
FORMULA_NAME Sudoku-PT-BN09-LTLFireability-07
FORMULA_NAME Sudoku-PT-BN09-LTLFireability-08
FORMULA_NAME Sudoku-PT-BN09-LTLFireability-09
FORMULA_NAME Sudoku-PT-BN09-LTLFireability-10
FORMULA_NAME Sudoku-PT-BN09-LTLFireability-11
FORMULA_NAME Sudoku-PT-BN09-LTLFireability-12
FORMULA_NAME Sudoku-PT-BN09-LTLFireability-13
FORMULA_NAME Sudoku-PT-BN09-LTLFireability-14
FORMULA_NAME Sudoku-PT-BN09-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679232519879

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-PT-BN09
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-19 13:28:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-19 13:28:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 13:28:41] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2023-03-19 13:28:41] [INFO ] Transformed 1053 places.
[2023-03-19 13:28:41] [INFO ] Transformed 729 transitions.
[2023-03-19 13:28:41] [INFO ] Parsed PT model containing 1053 places and 729 transitions and 3645 arcs in 166 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 73 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA Sudoku-PT-BN09-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN09-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN09-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN09-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN09-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN09-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 324 out of 1053 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Reduce places removed 729 places and 0 transitions.
Iterating post reduction 0 with 729 rules applied. Total rules applied 729 place count 324 transition count 729
Applied a total of 729 rules in 32 ms. Remains 324 /1053 variables (removed 729) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 324 cols
[2023-03-19 13:28:42] [INFO ] Computed 75 place invariants in 78 ms
[2023-03-19 13:28:42] [INFO ] Implicit Places using invariants in 252 ms returned []
[2023-03-19 13:28:42] [INFO ] Invariant cache hit.
[2023-03-19 13:28:42] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 544 ms to find 0 implicit places.
[2023-03-19 13:28:42] [INFO ] Invariant cache hit.
[2023-03-19 13:28:43] [INFO ] Dead Transitions using invariants and state equation in 332 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 324/1053 places, 729/729 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 914 ms. Remains : 324/1053 places, 729/729 transitions.
Support contains 324 out of 324 places after structural reductions.
[2023-03-19 13:28:43] [INFO ] Flatten gal took : 177 ms
[2023-03-19 13:28:44] [INFO ] Flatten gal took : 204 ms
[2023-03-19 13:28:45] [INFO ] Input system was already deterministic with 729 transitions.
Incomplete random walk after 10000 steps, including 151 resets, run finished after 655 ms. (steps per millisecond=15 ) properties (out of 18) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 3908 ms. (steps per millisecond=2 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 13:28:49] [INFO ] Invariant cache hit.
[2023-03-19 13:28:52] [INFO ] After 185ms 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 0 ms.
FORMULA Sudoku-PT-BN09-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Sudoku-PT-BN09-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 8 simplifications.
FORMULA Sudoku-PT-BN09-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 324 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 324 transition count 729
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' '!(G(F(p0)))'
Support contains 324 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 729/729 transitions.
Applied a total of 0 rules in 11 ms. Remains 324 /324 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2023-03-19 13:28:52] [INFO ] Invariant cache hit.
[2023-03-19 13:28:52] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-19 13:28:52] [INFO ] Invariant cache hit.
[2023-03-19 13:28:52] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
[2023-03-19 13:28:52] [INFO ] Redundant transitions in 43 ms returned []
[2023-03-19 13:28:52] [INFO ] Invariant cache hit.
[2023-03-19 13:28:53] [INFO ] Dead Transitions using invariants and state equation in 370 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 712 ms. Remains : 324/324 places, 729/729 transitions.
Stuttering acceptance computed with spot in 166 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-BN09-LTLFireability-01 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:(AND (OR (LT s0 1) (LT s90 1) (LT s166 1) (LT s279 1)) (OR (LT s21 1) (LT s102 1) (LT s188 1) (LT s318 1)) (OR (LT s46 1) (LT s118 1) (LT s212 1) (LT s...], 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 1510 reset in 5660 ms.
Product exploration explored 100000 steps with 1508 reset in 5601 ms.
Computed a total of 324 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 324 transition count 729
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), (X (NOT p0)), (X (X (NOT p0))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 102 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-BN09-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-BN09-LTLFireability-01 finished in 14930 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 324 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 729/729 transitions.
Applied a total of 0 rules in 9 ms. Remains 324 /324 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2023-03-19 13:29:07] [INFO ] Invariant cache hit.
[2023-03-19 13:29:07] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-19 13:29:07] [INFO ] Invariant cache hit.
[2023-03-19 13:29:07] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
[2023-03-19 13:29:07] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-19 13:29:07] [INFO ] Invariant cache hit.
[2023-03-19 13:29:07] [INFO ] Dead Transitions using invariants and state equation in 273 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 612 ms. Remains : 324/324 places, 729/729 transitions.
Stuttering acceptance computed with spot in 65 ms :[p0, p0]
Running random walk in product with property : Sudoku-PT-BN09-LTLFireability-04 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:(AND (OR (LT s0 1) (LT s90 1) (LT s166 1) (LT s279 1)) (OR (LT s21 1) (LT s102 1) (LT s188 1) (LT s318 1)) (OR (LT s46 1) (LT s118 1) (LT s212 1) (LT s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 65 steps with 0 reset in 4 ms.
FORMULA Sudoku-PT-BN09-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN09-LTLFireability-04 finished in 722 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)))'
Support contains 4 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 729/729 transitions.
Applied a total of 0 rules in 72 ms. Remains 324 /324 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2023-03-19 13:29:08] [INFO ] Invariant cache hit.
[2023-03-19 13:29:08] [INFO ] Implicit Places using invariants in 323 ms returned []
[2023-03-19 13:29:08] [INFO ] Invariant cache hit.
[2023-03-19 13:29:09] [INFO ] Implicit Places using invariants and state equation in 691 ms returned []
Implicit Place search using SMT with State Equation took 1018 ms to find 0 implicit places.
[2023-03-19 13:29:09] [INFO ] Invariant cache hit.
[2023-03-19 13:29:09] [INFO ] Dead Transitions using invariants and state equation in 274 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1365 ms. Remains : 324/324 places, 729/729 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-BN09-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 (GEQ s44 1) (GEQ s134 1) (GEQ s206 1) (GEQ s323 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 81 steps with 9 reset in 6 ms.
FORMULA Sudoku-PT-BN09-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN09-LTLFireability-08 finished in 1474 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 4 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 729/729 transitions.
Applied a total of 0 rules in 30 ms. Remains 324 /324 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2023-03-19 13:29:09] [INFO ] Invariant cache hit.
[2023-03-19 13:29:09] [INFO ] Implicit Places using invariants in 317 ms returned []
[2023-03-19 13:29:09] [INFO ] Invariant cache hit.
[2023-03-19 13:29:10] [INFO ] Implicit Places using invariants and state equation in 670 ms returned []
Implicit Place search using SMT with State Equation took 989 ms to find 0 implicit places.
[2023-03-19 13:29:10] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-19 13:29:10] [INFO ] Invariant cache hit.
[2023-03-19 13:29:10] [INFO ] Dead Transitions using invariants and state equation in 265 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1302 ms. Remains : 324/324 places, 729/729 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-BN09-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s74 1) (LT s137 1) (LT s234 1) (LT s245 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1511 reset in 5258 ms.
Product exploration explored 100000 steps with 1510 reset in 5348 ms.
Computed a total of 324 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 324 transition count 729
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 p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 2 factoid took 142 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-BN09-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-BN09-LTLFireability-11 finished in 14505 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((F(p0)&&X(G(p1)))))'
Support contains 7 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 729/729 transitions.
Applied a total of 0 rules in 44 ms. Remains 324 /324 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2023-03-19 13:29:24] [INFO ] Invariant cache hit.
[2023-03-19 13:29:24] [INFO ] Implicit Places using invariants in 333 ms returned []
[2023-03-19 13:29:24] [INFO ] Invariant cache hit.
[2023-03-19 13:29:25] [INFO ] Implicit Places using invariants and state equation in 685 ms returned []
Implicit Place search using SMT with State Equation took 1020 ms to find 0 implicit places.
[2023-03-19 13:29:25] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-19 13:29:25] [INFO ] Invariant cache hit.
[2023-03-19 13:29:25] [INFO ] Dead Transitions using invariants and state equation in 269 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1348 ms. Remains : 324/324 places, 729/729 transitions.
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Sudoku-PT-BN09-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s24 1) (LT s87 1) (LT s182 1) (LT s267 1)), p1:(OR (LT s20 1) (LT s83 1) (LT s182 1) (LT s263 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 4195 reset in 8800 ms.
Product exploration explored 100000 steps with 4227 reset in 8618 ms.
Computed a total of 324 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 324 transition count 729
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (G p0)), (F (G p1))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p0), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 3 factoid took 327 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-BN09-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-BN09-LTLFireability-12 finished in 21345 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(!(X(p0) U !p1)))||(p2 U X(p3))))'
Support contains 16 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 729/729 transitions.
Applied a total of 0 rules in 20 ms. Remains 324 /324 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2023-03-19 13:29:45] [INFO ] Invariant cache hit.
[2023-03-19 13:29:45] [INFO ] Implicit Places using invariants in 309 ms returned []
[2023-03-19 13:29:45] [INFO ] Invariant cache hit.
[2023-03-19 13:29:46] [INFO ] Implicit Places using invariants and state equation in 662 ms returned []
Implicit Place search using SMT with State Equation took 973 ms to find 0 implicit places.
[2023-03-19 13:29:46] [INFO ] Invariant cache hit.
[2023-03-19 13:29:46] [INFO ] Dead Transitions using invariants and state equation in 269 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1263 ms. Remains : 324/324 places, 729/729 transitions.
Stuttering acceptance computed with spot in 502 ms :[true, (AND (NOT p1) (NOT p3)), (NOT p1), (AND (NOT p1) p0), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) p0 (NOT p3)), (AND p0 (NOT p1) (NOT p3)), (NOT p3), (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : Sudoku-PT-BN09-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 10}, { cond=p2, acceptance={} source=1 dest: 11}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 0}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p3) p1), acceptance={} source=4 dest: 3}], [{ cond=(AND (NOT p2) (NOT p3) p1), acceptance={} source=5 dest: 6}, { cond=(AND p2 (NOT p3) p1), acceptance={} source=5 dest: 7}, { cond=(AND p2 (NOT p3) (NOT p1)), acceptance={} source=5 dest: 8}, { cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={} source=5 dest: 9}], [{ cond=(AND (NOT p3) (NOT p1) p0), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p3) p1 p0), acceptance={} source=6 dest: 3}], [{ cond=(AND (NOT p2) (NOT p3) p1 p0), acceptance={} source=7 dest: 6}, { cond=(AND p2 (NOT p3) p1 p0), acceptance={} source=7 dest: 7}, { cond=(AND p2 (NOT p3) (NOT p1) p0), acceptance={} source=7 dest: 8}, { cond=(AND (NOT p2) (NOT p3) (NOT p1) p0), acceptance={} source=7 dest: 9}], [{ cond=(AND p2 (NOT p3)), acceptance={0} source=8 dest: 8}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=8 dest: 9}], [{ cond=(NOT p3), acceptance={} source=9 dest: 0}], [{ cond=(NOT p3), acceptance={} source=10 dest: 2}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=11 dest: 4}, { cond=(AND p2 (NOT p3)), acceptance={} source=11 dest: 5}]], initial=1, aps=[p2:(AND (GEQ s36 1) (GEQ s108 1) (GEQ s198 1) (GEQ s243 1)), p1:(AND (GEQ s17 1) (GEQ s107 1) (GEQ s179 1) (GEQ s323 1)), p0:(AND (GEQ s49 1) (GEQ s130 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, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 68 steps with 21 reset in 8 ms.
FORMULA Sudoku-PT-BN09-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN09-LTLFireability-13 finished in 1803 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(p0)||(X(!p1)&&F(!p2))||G(!p1)))))'
Support contains 12 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 729/729 transitions.
Applied a total of 0 rules in 20 ms. Remains 324 /324 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2023-03-19 13:29:47] [INFO ] Invariant cache hit.
[2023-03-19 13:29:47] [INFO ] Implicit Places using invariants in 303 ms returned []
[2023-03-19 13:29:47] [INFO ] Invariant cache hit.
[2023-03-19 13:29:48] [INFO ] Implicit Places using invariants and state equation in 655 ms returned []
Implicit Place search using SMT with State Equation took 960 ms to find 0 implicit places.
[2023-03-19 13:29:48] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-19 13:29:48] [INFO ] Invariant cache hit.
[2023-03-19 13:29:48] [INFO ] Dead Transitions using invariants and state equation in 261 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1261 ms. Remains : 324/324 places, 729/729 transitions.
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p0) p1), (AND (NOT p0) p2 p1), (AND (NOT p0) p1)]
Running random walk in product with property : Sudoku-PT-BN09-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) p2) (AND p2 p1)), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(AND p0 p2 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p2 p1), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) p2 p1), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND p0 p1), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s38 1) (GEQ s128 1) (GEQ s206 1) (GEQ s317 1)), p2:(AND (GEQ s7 1) (GEQ s88 1) (GEQ s164 1) (GEQ s268 1)), p1:(AND (GEQ s8 1) (GEQ s98 1) (GE...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 4695 reset in 9251 ms.
Product exploration explored 100000 steps with 4777 reset in 9587 ms.
Computed a total of 324 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 324 transition count 729
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 (NOT (AND (NOT p0) p2 (NOT p1)))), (F (G (NOT p0))), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p2 p1)), (X (NOT (AND p0 p2 p1))), (X (AND (NOT p0) p2 p1)), (X (NOT (AND (NOT p0) p2 p1))), (X (AND p0 p2 (NOT p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p0 p2 p1)))), (X (X (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1)))))]
Property proved to be true thanks to knowledge :(F (G (NOT p1)))
Knowledge based reduction with 5 factoid took 740 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-BN09-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-BN09-LTLFireability-15 finished in 23223 ms.
All properties solved by simple procedures.
Total runtime 89002 ms.
ITS solved all properties within timeout

BK_STOP 1679232611611

--------------------
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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is Sudoku-PT-BN09, 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 r489-tall-167912706600308"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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