fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r489-tall-167912706500268
Last Updated
May 14, 2023

About the Execution of LTSMin+red for Sudoku-PT-AN14

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
949.911 186847.00 206652.00 956.70 FTFFFFTTFTTTTFFT normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 66M
-rw-r--r-- 1 mcc users 1.2M Feb 26 09:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 5.5M Feb 26 09:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.6M Feb 26 08:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 7.0M Feb 26 08:55 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 361K Feb 25 17:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 1.2M Feb 25 17:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.4M Feb 25 17:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 4.6M Feb 25 17:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.9M Feb 26 10:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 8.4M Feb 26 10:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.4M Feb 26 09:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 26M Feb 26 09:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 134K Feb 25 17:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 325K 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 1.5M 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-AN14-LTLFireability-00
FORMULA_NAME Sudoku-PT-AN14-LTLFireability-01
FORMULA_NAME Sudoku-PT-AN14-LTLFireability-02
FORMULA_NAME Sudoku-PT-AN14-LTLFireability-03
FORMULA_NAME Sudoku-PT-AN14-LTLFireability-04
FORMULA_NAME Sudoku-PT-AN14-LTLFireability-05
FORMULA_NAME Sudoku-PT-AN14-LTLFireability-06
FORMULA_NAME Sudoku-PT-AN14-LTLFireability-07
FORMULA_NAME Sudoku-PT-AN14-LTLFireability-08
FORMULA_NAME Sudoku-PT-AN14-LTLFireability-09
FORMULA_NAME Sudoku-PT-AN14-LTLFireability-10
FORMULA_NAME Sudoku-PT-AN14-LTLFireability-11
FORMULA_NAME Sudoku-PT-AN14-LTLFireability-12
FORMULA_NAME Sudoku-PT-AN14-LTLFireability-13
FORMULA_NAME Sudoku-PT-AN14-LTLFireability-14
FORMULA_NAME Sudoku-PT-AN14-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679225430189

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-AN14
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-19 11:30:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-19 11:30:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 11:30:31] [INFO ] Load time of PNML (sax parser for PT used): 178 ms
[2023-03-19 11:30:31] [INFO ] Transformed 3332 places.
[2023-03-19 11:30:31] [INFO ] Transformed 2744 transitions.
[2023-03-19 11:30:31] [INFO ] Parsed PT model containing 3332 places and 2744 transitions and 10976 arcs in 357 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 147 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA Sudoku-PT-AN14-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN14-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN14-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN14-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN14-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN14-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 588 out of 3332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Reduce places removed 2744 places and 0 transitions.
Iterating post reduction 0 with 2744 rules applied. Total rules applied 2744 place count 588 transition count 2744
Applied a total of 2744 rules in 59 ms. Remains 588 /3332 variables (removed 2744) and now considering 2744/2744 (removed 0) transitions.
// Phase 1: matrix 2744 rows 588 cols
[2023-03-19 11:30:34] [INFO ] Computed 41 place invariants in 209 ms
[2023-03-19 11:30:34] [INFO ] Implicit Places using invariants in 445 ms returned []
[2023-03-19 11:30:34] [INFO ] Invariant cache hit.
[2023-03-19 11:30:35] [INFO ] Implicit Places using invariants and state equation in 760 ms returned []
Implicit Place search using SMT with State Equation took 1229 ms to find 0 implicit places.
[2023-03-19 11:30:35] [INFO ] Invariant cache hit.
[2023-03-19 11:30:36] [INFO ] Dead Transitions using invariants and state equation in 905 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 588/3332 places, 2744/2744 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2194 ms. Remains : 588/3332 places, 2744/2744 transitions.
Support contains 588 out of 588 places after structural reductions.
[2023-03-19 11:30:37] [INFO ] Flatten gal took : 325 ms
[2023-03-19 11:30:38] [INFO ] Flatten gal took : 273 ms
[2023-03-19 11:30:39] [INFO ] Input system was already deterministic with 2744 transitions.
Finished random walk after 173 steps, including 0 resets, run visited all 15 properties in 74 ms. (steps per millisecond=2 )
FORMULA Sudoku-PT-AN14-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 588 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 588 transition count 2744
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' '!(F(p0))'
Support contains 588 out of 588 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 588/588 places, 2744/2744 transitions.
Applied a total of 0 rules in 26 ms. Remains 588 /588 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2023-03-19 11:30:39] [INFO ] Invariant cache hit.
[2023-03-19 11:30:39] [INFO ] Implicit Places using invariants in 93 ms returned []
[2023-03-19 11:30:39] [INFO ] Invariant cache hit.
[2023-03-19 11:30:40] [INFO ] Implicit Places using invariants and state equation in 742 ms returned []
Implicit Place search using SMT with State Equation took 838 ms to find 0 implicit places.
[2023-03-19 11:30:40] [INFO ] Redundant transitions in 145 ms returned []
[2023-03-19 11:30:40] [INFO ] Invariant cache hit.
[2023-03-19 11:30:41] [INFO ] Dead Transitions using invariants and state equation in 878 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1896 ms. Remains : 588/588 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 132 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN14-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s134 1) (LT s328 1) (LT s484 1)) (OR (LT s113 1) (LT s316 1) (LT s505 1)) (OR (LT s113 1) (LT s320 1) (LT s561 1)) (OR (LT s134 1) (LT s33...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration timeout after 57580 steps with 333 reset in 10001 ms.
Product exploration timeout after 57920 steps with 336 reset in 10001 ms.
Computed a total of 588 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 588 transition count 2744
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)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN14-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN14-LTLFireability-01 finished in 24418 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 588 out of 588 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 588/588 places, 2744/2744 transitions.
Applied a total of 0 rules in 23 ms. Remains 588 /588 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2023-03-19 11:31:04] [INFO ] Invariant cache hit.
[2023-03-19 11:31:04] [INFO ] Implicit Places using invariants in 95 ms returned []
[2023-03-19 11:31:04] [INFO ] Invariant cache hit.
[2023-03-19 11:31:04] [INFO ] Implicit Places using invariants and state equation in 713 ms returned []
Implicit Place search using SMT with State Equation took 811 ms to find 0 implicit places.
[2023-03-19 11:31:05] [INFO ] Redundant transitions in 145 ms returned []
[2023-03-19 11:31:05] [INFO ] Invariant cache hit.
[2023-03-19 11:31:05] [INFO ] Dead Transitions using invariants and state equation in 843 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1834 ms. Remains : 588/588 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 38 ms :[p0]
Running random walk in product with property : Sudoku-PT-AN14-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s134 1) (LT s328 1) (LT s484 1)) (OR (LT s113 1) (LT s316 1) (LT s505 1)) (OR (LT s113 1) (LT s320 1) (LT s561 1)) (OR (LT s134 1) (LT s33...], 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 173 steps with 0 reset in 37 ms.
FORMULA Sudoku-PT-AN14-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN14-LTLFireability-05 finished in 1963 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 588 out of 588 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 588/588 places, 2744/2744 transitions.
Applied a total of 0 rules in 6 ms. Remains 588 /588 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2023-03-19 11:31:06] [INFO ] Invariant cache hit.
[2023-03-19 11:31:06] [INFO ] Implicit Places using invariants in 90 ms returned []
[2023-03-19 11:31:06] [INFO ] Invariant cache hit.
[2023-03-19 11:31:06] [INFO ] Implicit Places using invariants and state equation in 706 ms returned []
Implicit Place search using SMT with State Equation took 803 ms to find 0 implicit places.
[2023-03-19 11:31:06] [INFO ] Invariant cache hit.
[2023-03-19 11:31:07] [INFO ] Dead Transitions using invariants and state equation in 848 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1660 ms. Remains : 588/588 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 68 ms :[p0, p0]
Running random walk in product with property : Sudoku-PT-AN14-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (LT s134 1) (LT s328 1) (LT s484 1)) (OR (LT s113 1) (LT s316 1) (LT s505 1)) (OR (LT s113 1) (LT s320 1) (LT s561 1)) (OR (LT s134 1) (LT s33...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration timeout after 36990 steps with 18495 reset in 10002 ms.
Product exploration timeout after 36780 steps with 18390 reset in 10002 ms.
Computed a total of 588 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 588 transition count 2744
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)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p0))
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN14-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN14-LTLFireability-07 finished in 24145 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(G((G(F((G(!p0)||(!p1&&X(!p1))))) U p0))))'
Support contains 6 out of 588 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 588/588 places, 2744/2744 transitions.
Applied a total of 0 rules in 151 ms. Remains 588 /588 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2023-03-19 11:31:30] [INFO ] Invariant cache hit.
[2023-03-19 11:31:31] [INFO ] Implicit Places using invariants in 611 ms returned []
[2023-03-19 11:31:31] [INFO ] Invariant cache hit.
[2023-03-19 11:31:38] [INFO ] Implicit Places using invariants and state equation in 7853 ms returned []
Implicit Place search using SMT with State Equation took 8467 ms to find 0 implicit places.
[2023-03-19 11:31:38] [INFO ] Invariant cache hit.
[2023-03-19 11:31:39] [INFO ] Dead Transitions using invariants and state equation in 835 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9454 ms. Remains : 588/588 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 299 ms :[(NOT p0), (NOT p0), (AND p0 p1), (NOT p0), (AND p0 p1), (AND p0 p1)]
Running random walk in product with property : Sudoku-PT-AN14-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND p0 p1), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 5}, { cond=(AND p0 p1), acceptance={0} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 5}, { cond=(AND p0 p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s102 1) (GEQ s305 1) (GEQ s550 1)), p1:(AND (GEQ s149 1) (GEQ s341 1) (GEQ s471 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration timeout after 58090 steps with 337 reset in 10001 ms.
Stuttering criterion allowed to conclude after 868 steps with 4 reset in 151 ms.
FORMULA Sudoku-PT-AN14-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN14-LTLFireability-08 finished in 19944 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))||G(p1)))'
Support contains 6 out of 588 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 588/588 places, 2744/2744 transitions.
Applied a total of 0 rules in 64 ms. Remains 588 /588 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2023-03-19 11:31:50] [INFO ] Invariant cache hit.
[2023-03-19 11:31:50] [INFO ] Implicit Places using invariants in 632 ms returned []
[2023-03-19 11:31:50] [INFO ] Invariant cache hit.
[2023-03-19 11:31:59] [INFO ] Implicit Places using invariants and state equation in 8917 ms returned []
Implicit Place search using SMT with State Equation took 9551 ms to find 0 implicit places.
[2023-03-19 11:31:59] [INFO ] Redundant transitions in 52 ms returned []
[2023-03-19 11:31:59] [INFO ] Invariant cache hit.
[2023-03-19 11:32:00] [INFO ] Dead Transitions using invariants and state equation in 841 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10520 ms. Remains : 588/588 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN14-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(OR (LT s154 1) (LT s353 1) (LT s434 1)), p0:(OR (LT s28 1) (LT s226 1) (LT s420 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration timeout after 31840 steps with 580 reset in 10002 ms.
Product exploration timeout after 30860 steps with 578 reset in 10001 ms.
Computed a total of 588 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 588 transition count 2744
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 (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p0), (X p1), (X (NOT p1))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 3 factoid took 192 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-AN14-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN14-LTLFireability-09 finished in 31304 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(((p2&&G(p3))||p1))||p0))))'
Support contains 9 out of 588 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 588/588 places, 2744/2744 transitions.
Applied a total of 0 rules in 133 ms. Remains 588 /588 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2023-03-19 11:32:21] [INFO ] Invariant cache hit.
[2023-03-19 11:32:22] [INFO ] Implicit Places using invariants in 606 ms returned []
[2023-03-19 11:32:22] [INFO ] Invariant cache hit.
[2023-03-19 11:32:30] [INFO ] Implicit Places using invariants and state equation in 8430 ms returned []
Implicit Place search using SMT with State Equation took 9037 ms to find 0 implicit places.
[2023-03-19 11:32:30] [INFO ] Invariant cache hit.
[2023-03-19 11:32:31] [INFO ] Dead Transitions using invariants and state equation in 834 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10006 ms. Remains : 588/588 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 122 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3)))]
Running random walk in product with property : Sudoku-PT-AN14-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p0) (NOT p3))), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p2 p3), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), acceptance={0} source=1 dest: 0}, { cond=(OR (AND p1 (NOT p0) p3) (AND (NOT p0) p2 p3)), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p1:(OR (LT s106 1) (LT s295 1) (LT s414 1)), p0:(OR (LT s125 1) (LT s318 1) (LT s545 1)), p2:(OR (LT s125 1) (LT s318 1) (LT s545 1)), p3:(OR (LT s185 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 30560 steps with 591 reset in 10003 ms.
Product exploration timeout after 30550 steps with 581 reset in 10003 ms.
Computed a total of 588 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 588 transition count 2744
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) (NOT p2) (NOT p3)), (X (NOT (AND (NOT p1) (NOT p0) p2 p3))), (F (G p1)), (F (G p0)), (F (G p2)), (F (G p3))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p0) (NOT p3)))), (X (NOT (OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p0) (NOT p3)))))]
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 6 factoid took 211 ms. Reduced automaton from 3 states, 6 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN14-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN14-LTLFireability-10 finished in 30813 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 3 out of 588 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 588/588 places, 2744/2744 transitions.
Applied a total of 0 rules in 60 ms. Remains 588 /588 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2023-03-19 11:32:52] [INFO ] Invariant cache hit.
[2023-03-19 11:32:52] [INFO ] Implicit Places using invariants in 600 ms returned []
[2023-03-19 11:32:52] [INFO ] Invariant cache hit.
[2023-03-19 11:33:01] [INFO ] Implicit Places using invariants and state equation in 8529 ms returned []
Implicit Place search using SMT with State Equation took 9131 ms to find 0 implicit places.
[2023-03-19 11:33:01] [INFO ] Redundant transitions in 52 ms returned []
[2023-03-19 11:33:01] [INFO ] Invariant cache hit.
[2023-03-19 11:33:02] [INFO ] Dead Transitions using invariants and state equation in 821 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10078 ms. Remains : 588/588 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN14-LTLFireability-12 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 s33 1) (LT s227 1) (LT s439 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 timeout after 60740 steps with 352 reset in 10001 ms.
Product exploration timeout after 60480 steps with 351 reset in 10004 ms.
Computed a total of 588 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 588 transition count 2744
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))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 2 factoid took 84 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-AN14-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN14-LTLFireability-12 finished in 30648 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((p0||G(p1))))'
Support contains 6 out of 588 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 588/588 places, 2744/2744 transitions.
Applied a total of 0 rules in 56 ms. Remains 588 /588 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2023-03-19 11:33:23] [INFO ] Invariant cache hit.
[2023-03-19 11:33:23] [INFO ] Implicit Places using invariants in 614 ms returned []
[2023-03-19 11:33:23] [INFO ] Invariant cache hit.
[2023-03-19 11:33:26] [INFO ] Implicit Places using invariants and state equation in 3366 ms returned []
Implicit Place search using SMT with State Equation took 3983 ms to find 0 implicit places.
[2023-03-19 11:33:27] [INFO ] Redundant transitions in 57 ms returned []
[2023-03-19 11:33:27] [INFO ] Invariant cache hit.
[2023-03-19 11:33:27] [INFO ] Dead Transitions using invariants and state equation in 827 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4936 ms. Remains : 588/588 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-PT-AN14-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=2, aps=[p1:(OR (LT s15 1) (LT s215 1) (LT s463 1)), p0:(AND (GEQ s129 1) (GEQ s331 1) (GEQ s521 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 4 ms.
FORMULA Sudoku-PT-AN14-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN14-LTLFireability-13 finished in 5045 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(G((!p0&&X((!p0 U (p1||F(p2)||G(!p0))))))))'
Support contains 3 out of 588 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 588/588 places, 2744/2744 transitions.
Applied a total of 0 rules in 46 ms. Remains 588 /588 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2023-03-19 11:33:28] [INFO ] Invariant cache hit.
[2023-03-19 11:33:28] [INFO ] Implicit Places using invariants in 607 ms returned []
[2023-03-19 11:33:28] [INFO ] Invariant cache hit.
[2023-03-19 11:33:34] [INFO ] Implicit Places using invariants and state equation in 6260 ms returned []
Implicit Place search using SMT with State Equation took 6868 ms to find 0 implicit places.
[2023-03-19 11:33:34] [INFO ] Invariant cache hit.
[2023-03-19 11:33:35] [INFO ] Dead Transitions using invariants and state equation in 825 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7740 ms. Remains : 588/588 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 80 ms :[true, p0, p0]
Running random walk in product with property : Sudoku-PT-AN14-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s164 1) (GEQ s360 1) (GEQ s542 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA Sudoku-PT-AN14-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN14-LTLFireability-14 finished in 7845 ms.
All properties solved by simple procedures.
Total runtime 184256 ms.
ITS solved all properties within timeout

BK_STOP 1679225617036

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

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