Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r417-tall-171690556400403.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is Sudoku-PT-AN10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r417-tall-171690556400403
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 24M
-rw-r--r-- 1 mcc users 502K Apr 12 10:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 2.4M Apr 12 10:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.2M Apr 12 10:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 5.6M Apr 12 10:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 182K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 634K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 425K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 1.6M Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 620K Apr 12 11:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 2.9M Apr 12 11:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.3M Apr 12 10:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 6.3M Apr 12 10:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 31K Apr 23 08:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 564K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Sudoku-PT-AN10-LTLFireability-00
FORMULA_NAME Sudoku-PT-AN10-LTLFireability-01
FORMULA_NAME Sudoku-PT-AN10-LTLFireability-02
FORMULA_NAME Sudoku-PT-AN10-LTLFireability-03
FORMULA_NAME Sudoku-PT-AN10-LTLFireability-04
FORMULA_NAME Sudoku-PT-AN10-LTLFireability-05
FORMULA_NAME Sudoku-PT-AN10-LTLFireability-06
FORMULA_NAME Sudoku-PT-AN10-LTLFireability-07
FORMULA_NAME Sudoku-PT-AN10-LTLFireability-08
FORMULA_NAME Sudoku-PT-AN10-LTLFireability-09
FORMULA_NAME Sudoku-PT-AN10-LTLFireability-10
FORMULA_NAME Sudoku-PT-AN10-LTLFireability-11
FORMULA_NAME Sudoku-PT-AN10-LTLFireability-12
FORMULA_NAME Sudoku-PT-AN10-LTLFireability-13
FORMULA_NAME Sudoku-PT-AN10-LTLFireability-14
FORMULA_NAME Sudoku-PT-AN10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717151595884

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-PT-AN10
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-31 10:33:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-31 10:33:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 10:33:17] [INFO ] Load time of PNML (sax parser for PT used): 112 ms
[2024-05-31 10:33:17] [INFO ] Transformed 1300 places.
[2024-05-31 10:33:17] [INFO ] Transformed 1000 transitions.
[2024-05-31 10:33:17] [INFO ] Found NUPN structural information;
[2024-05-31 10:33:17] [INFO ] Parsed PT model containing 1300 places and 1000 transitions and 4000 arcs in 184 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 88 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA Sudoku-PT-AN10-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN10-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN10-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN10-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN10-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN10-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN10-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 300 out of 1300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Reduce places removed 1000 places and 0 transitions.
Iterating post reduction 0 with 1000 rules applied. Total rules applied 1000 place count 300 transition count 1000
Applied a total of 1000 rules in 30 ms. Remains 300 /1300 variables (removed 1000) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 300 cols
[2024-05-31 10:33:18] [INFO ] Computed 29 invariants in 63 ms
[2024-05-31 10:33:19] [INFO ] Implicit Places using invariants in 240 ms returned []
[2024-05-31 10:33:19] [INFO ] Invariant cache hit.
[2024-05-31 10:33:19] [INFO ] Implicit Places using invariants and state equation in 365 ms returned []
Implicit Place search using SMT with State Equation took 630 ms to find 0 implicit places.
[2024-05-31 10:33:19] [INFO ] Invariant cache hit.
[2024-05-31 10:33:20] [INFO ] Dead Transitions using invariants and state equation in 581 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 300/1300 places, 1000/1000 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1244 ms. Remains : 300/1300 places, 1000/1000 transitions.
Support contains 300 out of 300 places after structural reductions.
[2024-05-31 10:33:20] [INFO ] Flatten gal took : 179 ms
[2024-05-31 10:33:21] [INFO ] Flatten gal took : 165 ms
[2024-05-31 10:33:21] [INFO ] Input system was already deterministic with 1000 transitions.
Finished random walk after 89 steps, including 0 resets, run visited all 15 properties in 35 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 1 ms.
Computed a total of 300 stabilizing places and 1000 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 300 transition count 1000
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 300 out of 300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 11 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2024-05-31 10:33:24] [INFO ] Invariant cache hit.
[2024-05-31 10:33:24] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-31 10:33:24] [INFO ] Invariant cache hit.
[2024-05-31 10:33:24] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
[2024-05-31 10:33:24] [INFO ] Redundant transitions in 51 ms returned []
[2024-05-31 10:33:24] [INFO ] Invariant cache hit.
[2024-05-31 10:33:25] [INFO ] Dead Transitions using invariants and state equation in 514 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 931 ms. Remains : 300/300 places, 1000/1000 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 153 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN10-LTLFireability-00 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 (AND (EQ s82 1) (EQ s181 1) (EQ s212 1)) (AND (EQ s15 1) (EQ s119 1) (EQ s295 1)) (AND (EQ s24 1) (EQ s121 1) (EQ s214 1)) (AND (EQ s73 1) (EQ s179...], 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 86 steps with 0 reset in 11 ms.
FORMULA Sudoku-PT-AN10-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN10-LTLFireability-00 finished in 1173 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))&&F(p1)))'
Support contains 300 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 3 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2024-05-31 10:33:25] [INFO ] Invariant cache hit.
[2024-05-31 10:33:25] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-31 10:33:25] [INFO ] Invariant cache hit.
[2024-05-31 10:33:25] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
[2024-05-31 10:33:25] [INFO ] Invariant cache hit.
[2024-05-31 10:33:26] [INFO ] Dead Transitions using invariants and state equation in 555 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 906 ms. Remains : 300/300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 190 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), true]
Running random walk in product with property : Sudoku-PT-AN10-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (OR (EQ s82 0) (EQ s181 0) (EQ s212 0)) (OR (EQ s15 0) (EQ s119 0) (EQ s295 0)) (OR (EQ s24 0) (EQ s121 0) (EQ s214 0)) (OR (EQ s73 0) (EQ s179 0)...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 2219 reset in 6189 ms.
Product exploration explored 100000 steps with 2283 reset in 6275 ms.
Computed a total of 300 stabilizing places and 1000 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 300 transition count 1000
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X (NOT p1))), (X (X p0)), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 34 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN10-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN10-LTLFireability-02 finished in 17816 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F((G(p2)||p1)))))'
Support contains 300 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 15 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2024-05-31 10:33:43] [INFO ] Invariant cache hit.
[2024-05-31 10:33:43] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-31 10:33:43] [INFO ] Invariant cache hit.
[2024-05-31 10:33:43] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
[2024-05-31 10:33:43] [INFO ] Invariant cache hit.
[2024-05-31 10:33:43] [INFO ] Dead Transitions using invariants and state equation in 524 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 928 ms. Remains : 300/300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 2768 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Sudoku-PT-AN10-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (OR (EQ s82 0) (EQ s181 0) (EQ s212 0)) (OR (EQ s15 0) (EQ s119 0) (EQ s295 0)) (OR (EQ s24 0) (EQ s121 0) (EQ s214 0)) (OR (EQ s73 0) (EQ s179 0)...], 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 explored 100000 steps with 50000 reset in 9185 ms.
Product exploration explored 100000 steps with 50000 reset in 9181 ms.
Computed a total of 300 stabilizing places and 1000 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 300 transition count 1000
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (G p0)), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 23 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN10-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN10-LTLFireability-05 finished in 26504 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(!p0)))'
Support contains 300 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 6 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2024-05-31 10:34:09] [INFO ] Invariant cache hit.
[2024-05-31 10:34:09] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-31 10:34:09] [INFO ] Invariant cache hit.
[2024-05-31 10:34:09] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
[2024-05-31 10:34:09] [INFO ] Invariant cache hit.
[2024-05-31 10:34:10] [INFO ] Dead Transitions using invariants and state equation in 526 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 867 ms. Remains : 300/300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 160 ms :[p0, p0, true, p0]
Running random walk in product with property : Sudoku-PT-AN10-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=3, aps=[p0:(OR (AND (EQ s82 1) (EQ s181 1) (EQ s212 1)) (AND (EQ s15 1) (EQ s119 1) (EQ s295 1)) (AND (EQ s24 1) (EQ s121 1) (EQ s214 1)) (AND (EQ s73 1) (EQ s179...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 3 ms.
FORMULA Sudoku-PT-AN10-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN10-LTLFireability-06 finished in 1071 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(F(X((X(X(X(p0))) U p0)))))))'
Support contains 300 out of 300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 11 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2024-05-31 10:34:10] [INFO ] Invariant cache hit.
[2024-05-31 10:34:10] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-31 10:34:10] [INFO ] Invariant cache hit.
[2024-05-31 10:34:10] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
[2024-05-31 10:34:10] [INFO ] Redundant transitions in 12 ms returned []
[2024-05-31 10:34:10] [INFO ] Invariant cache hit.
[2024-05-31 10:34:11] [INFO ] Dead Transitions using invariants and state equation in 540 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 899 ms. Remains : 300/300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN10-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (EQ s82 1) (EQ s181 1) (EQ s212 1)) (AND (EQ s15 1) (EQ s119 1) (EQ s295 1)) (AND (EQ s24 1) (EQ s121 1) (EQ s214 1)) (AND (EQ s73 1) (EQ s179...], 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 88 steps with 0 reset in 9 ms.
FORMULA Sudoku-PT-AN10-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN10-LTLFireability-07 finished in 1013 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((X(!p0) U ((!p1&&X(!p0))||X(G(!p0))))||(p2&&(G(!p3)||(!p3&&F(!p4)))))))'
Support contains 12 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 101 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2024-05-31 10:34:11] [INFO ] Invariant cache hit.
[2024-05-31 10:34:12] [INFO ] Implicit Places using invariants in 805 ms returned []
[2024-05-31 10:34:12] [INFO ] Invariant cache hit.
[2024-05-31 10:34:14] [INFO ] Implicit Places using invariants and state equation in 1606 ms returned []
Implicit Place search using SMT with State Equation took 2424 ms to find 0 implicit places.
[2024-05-31 10:34:14] [INFO ] Invariant cache hit.
[2024-05-31 10:34:14] [INFO ] Dead Transitions using invariants and state equation in 512 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3040 ms. Remains : 300/300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 325 ms :[(OR (AND p0 (NOT p2)) (AND p0 p3)), (AND p0 p3 p4), (OR (AND p0 (NOT p2)) (AND p0 p3)), (AND p0 p3 p4), (OR (AND p0 (NOT p2) p4) (AND p0 p3 p4)), (OR (AND p0 (NOT p2) p4) (AND p0 p3 p4))]
Running random walk in product with property : Sudoku-PT-AN10-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p1) (NOT p2) p0) (AND (NOT p1) p3 p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p1) p2 (NOT p3) p4 p0), acceptance={} source=0 dest: 1}, { cond=(OR (AND p1 (NOT p2) p0) (AND p1 p3 p0)), acceptance={0, 1} source=0 dest: 2}, { cond=(AND p1 p2 (NOT p3) p4 p0), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p3) p4 p0), acceptance={1} source=1 dest: 1}, { cond=(AND p1 (NOT p3) p4 p0), acceptance={1} source=1 dest: 3}, { cond=(AND (NOT p1) p3 p4 p0), acceptance={0, 1} source=1 dest: 4}, { cond=(AND p1 p3 p4 p0), acceptance={0, 1} source=1 dest: 5}], [{ cond=(OR (AND (NOT p1) (NOT p2) (NOT p0)) (AND (NOT p1) p3 (NOT p0))), acceptance={0} source=2 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p2) p0) (AND (NOT p1) p3 p0)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p1) p2 (NOT p3) p4), acceptance={} source=2 dest: 1}, { cond=(OR (AND p1 (NOT p2) (NOT p0)) (AND p1 p3 (NOT p0))), acceptance={0} source=2 dest: 2}, { cond=(OR (AND p1 (NOT p2) p0) (AND p1 p3 p0)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p1 p2 (NOT p3) p4), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p3) p4 (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p3) p4 p0), acceptance={1} source=3 dest: 1}, { cond=(AND p1 (NOT p3) p4 (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p3) p4 p0), acceptance={1} source=3 dest: 3}, { cond=(AND (NOT p1) p3 p4 (NOT p0)), acceptance={0} source=3 dest: 4}, { cond=(AND (NOT p1) p3 p4 p0), acceptance={0, 1} source=3 dest: 4}, { cond=(AND p1 p3 p4 (NOT p0)), acceptance={0} source=3 dest: 5}, { cond=(AND p1 p3 p4 p0), acceptance={0, 1} source=3 dest: 5}], [{ cond=(AND (NOT p1) p2 (NOT p3) p4 p0), acceptance={1} source=4 dest: 1}, { cond=(AND p1 p2 (NOT p3) p4 p0), acceptance={1} source=4 dest: 3}, { cond=(OR (AND (NOT p1) (NOT p2) p4 p0) (AND (NOT p1) p3 p4 p0)), acceptance={0, 1} source=4 dest: 4}, { cond=(OR (AND p1 (NOT p2) p4 p0) (AND p1 p3 p4 p0)), acceptance={0, 1} source=4 dest: 5}], [{ cond=(AND (NOT p1) p2 (NOT p3) p4 (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p3) p4 p0), acceptance={1} source=5 dest: 1}, { cond=(AND p1 p2 (NOT p3) p4 (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND p1 p2 (NOT p3) p4 p0), acceptance={1} source=5 dest: 3}, { cond=(OR (AND (NOT p1) (NOT p2) p4 (NOT p0)) (AND (NOT p1) p3 p4 (NOT p0))), acceptance={0} source=5 dest: 4}, { cond=(OR (AND (NOT p1) (NOT p2) p4 p0) (AND (NOT p1) p3 p4 p0)), acceptance={0, 1} source=5 dest: 4}, { cond=(OR (AND p1 (NOT p2) p4 (NOT p0)) (AND p1 p3 p4 (NOT p0))), acceptance={0} source=5 dest: 5}, { cond=(OR (AND p1 (NOT p2) p4 p0) (AND p1 p3 p4 p0)), acceptance={0, 1} source=5 dest: 5}]], initial=2, aps=[p1:(AND (EQ s33 1) (EQ s138 1) (EQ s283 1)), p2:(OR (EQ s94 0) (EQ s196 0) (EQ s264 0)), p0:(AND (EQ s20 1) (EQ s123 1) (EQ s230 1)), p3:(AND (EQ s94 1) (...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration timeout after 89110 steps with 3223 reset in 10001 ms.
Product exploration timeout after 88420 steps with 3195 reset in 10002 ms.
Computed a total of 300 stabilizing places and 1000 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 300 transition count 1000
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p2) p0 p3 p4), (X (NOT (AND (NOT p1) p2 (NOT p3) p4))), (X (NOT (AND (NOT p1) (NOT p3) p4 p0))), (X (NOT (OR (AND (NOT p1) (NOT p2) (NOT p0)) (AND (NOT p1) p3 (NOT p0))))), (X (NOT (AND (NOT p1) p3 p4 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p3) p4 (NOT p0)))), (X (NOT (AND (NOT p1) p2 (NOT p3) p4 p0))), (X (NOT (AND p1 (NOT p3) p4 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p3) p4 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3) p4 (NOT p0))))), (F (G (NOT p1))), (F (G p2)), (F (G (NOT p0))), (F (G (NOT p3))), (F (G (NOT p4)))]
False Knowledge obtained : [(X (OR (AND p1 (NOT p2) p0) (AND p1 p3 p0))), (X (NOT (OR (AND p1 (NOT p2) p0) (AND p1 p3 p0)))), (X (AND p1 p2 (NOT p3) p4)), (X (NOT (AND p1 p2 (NOT p3) p4))), (X (OR (AND p1 (NOT p2) (NOT p0)) (AND p1 p3 (NOT p0)))), (X (NOT (OR (AND p1 (NOT p2) (NOT p0)) (AND p1 p3 (NOT p0))))), (X (AND (NOT p1) p3 p4 p0)), (X (NOT (AND (NOT p1) p3 p4 p0))), (X (OR (AND (NOT p1) (NOT p2) p0) (AND (NOT p1) p3 p0))), (X (NOT (OR (AND (NOT p1) (NOT p2) p0) (AND (NOT p1) p3 p0)))), (X (AND p1 (NOT p3) p4 p0)), (X (NOT (AND p1 (NOT p3) p4 p0))), (X (AND p1 p3 p4 (NOT p0))), (X (NOT (AND p1 p3 p4 (NOT p0)))), (X (AND p1 p2 (NOT p3) p4 p0)), (X (NOT (AND p1 p2 (NOT p3) p4 p0))), (X (AND p1 p3 p4 p0)), (X (NOT (AND p1 p3 p4 p0))), (X (X (OR (AND p1 (NOT p2) p0) (AND p1 p3 p0)))), (X (X (NOT (OR (AND p1 (NOT p2) p0) (AND p1 p3 p0))))), (X (X (AND (NOT p1) p2 (NOT p3) p4))), (X (X (NOT (AND (NOT p1) p2 (NOT p3) p4)))), (X (X (OR (AND (NOT p1) (NOT p2) p4 (NOT p0)) (AND (NOT p1) p3 p4 (NOT p0))))), (X (X (NOT (OR (AND (NOT p1) (NOT p2) p4 (NOT p0)) (AND (NOT p1) p3 p4 (NOT p0)))))), (X (X (AND (NOT p1) (NOT p3) p4 p0))), (X (X (NOT (AND (NOT p1) (NOT p3) p4 p0)))), (X (X (OR (AND (NOT p1) (NOT p2) (NOT p0)) (AND (NOT p1) p3 (NOT p0))))), (X (X (NOT (OR (AND (NOT p1) (NOT p2) (NOT p0)) (AND (NOT p1) p3 (NOT p0)))))), (X (X (AND p1 p2 (NOT p3) p4))), (X (X (NOT (AND p1 p2 (NOT p3) p4)))), (X (X (AND (NOT p1) p3 p4 (NOT p0)))), (X (X (NOT (AND (NOT p1) p3 p4 (NOT p0))))), (X (X (OR (AND p1 (NOT p2) p4 p0) (AND p1 p3 p4 p0)))), (X (X (NOT (OR (AND p1 (NOT p2) p4 p0) (AND p1 p3 p4 p0))))), (X (X (OR (AND p1 (NOT p2) (NOT p0)) (AND p1 p3 (NOT p0))))), (X (X (NOT (OR (AND p1 (NOT p2) (NOT p0)) (AND p1 p3 (NOT p0)))))), (X (X (AND (NOT p1) p3 p4 p0))), (X (X (NOT (AND (NOT p1) p3 p4 p0)))), (X (X (OR (AND p1 (NOT p2) p4 (NOT p0)) (AND p1 p3 p4 (NOT p0))))), (X (X (NOT (OR (AND p1 (NOT p2) p4 (NOT p0)) (AND p1 p3 p4 (NOT p0)))))), (X (X (OR (AND (NOT p1) (NOT p2) p0) (AND (NOT p1) p3 p0)))), (X (X (NOT (OR (AND (NOT p1) (NOT p2) p0) (AND (NOT p1) p3 p0))))), (X (X (AND (NOT p1) p2 (NOT p3) p4 p0))), (X (X (NOT (AND (NOT p1) p2 (NOT p3) p4 p0)))), (X (X (AND p1 (NOT p3) p4 (NOT p0)))), (X (X (NOT (AND p1 (NOT p3) p4 (NOT p0))))), (X (X (OR (AND (NOT p1) (NOT p2) p4 p0) (AND (NOT p1) p3 p4 p0)))), (X (X (NOT (OR (AND (NOT p1) (NOT p2) p4 p0) (AND (NOT p1) p3 p4 p0))))), (X (X (AND p1 (NOT p3) p4 p0))), (X (X (NOT (AND p1 (NOT p3) p4 p0)))), (X (X (AND p1 p3 p4 (NOT p0)))), (X (X (NOT (AND p1 p3 p4 (NOT p0))))), (X (X (AND p1 p2 (NOT p3) p4 p0))), (X (X (NOT (AND p1 p2 (NOT p3) p4 p0)))), (X (X (AND p1 p3 p4 p0))), (X (X (NOT (AND p1 p3 p4 p0)))), (X (X (AND p1 p2 (NOT p3) p4 (NOT p0)))), (X (X (NOT (AND p1 p2 (NOT p3) p4 (NOT p0)))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 15 factoid took 28 ms. Reduced automaton from 6 states, 34 edges and 5 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN10-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN10-LTLFireability-08 finished in 27288 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 19 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2024-05-31 10:34:38] [INFO ] Invariant cache hit.
[2024-05-31 10:34:39] [INFO ] Implicit Places using invariants in 933 ms returned []
[2024-05-31 10:34:39] [INFO ] Invariant cache hit.
[2024-05-31 10:34:41] [INFO ] Implicit Places using invariants and state equation in 1439 ms returned []
Implicit Place search using SMT with State Equation took 2403 ms to find 0 implicit places.
[2024-05-31 10:34:41] [INFO ] Invariant cache hit.
[2024-05-31 10:34:41] [INFO ] Dead Transitions using invariants and state equation in 492 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2933 ms. Remains : 300/300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN10-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s27 1) (EQ s125 1) (EQ s257 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 80 steps with 0 reset in 10 ms.
FORMULA Sudoku-PT-AN10-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN10-LTLFireability-10 finished in 3079 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (F(p2)&&X(X(p3))&&p1)))'
Support contains 12 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 16 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2024-05-31 10:34:41] [INFO ] Invariant cache hit.
[2024-05-31 10:34:42] [INFO ] Implicit Places using invariants in 783 ms returned []
[2024-05-31 10:34:42] [INFO ] Invariant cache hit.
[2024-05-31 10:34:44] [INFO ] Implicit Places using invariants and state equation in 1602 ms returned []
Implicit Place search using SMT with State Equation took 2424 ms to find 0 implicit places.
[2024-05-31 10:34:44] [INFO ] Invariant cache hit.
[2024-05-31 10:34:44] [INFO ] Dead Transitions using invariants and state equation in 529 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2995 ms. Remains : 300/300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 510 ms :[(OR (NOT p1) (NOT p2) (NOT p3)), true, (NOT p2), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (AND (NOT p2) (NOT p3)), (NOT p3), (NOT p3)]
Running random walk in product with property : Sudoku-PT-AN10-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND p1 p0), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 6}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 7}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 8}, { cond=(AND p1 p0), acceptance={} source=4 dest: 9}], [{ cond=(NOT p3), acceptance={} source=5 dest: 1}], [{ cond=(AND (NOT p1) p0 (NOT p3)), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=6 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=6 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p3)), acceptance={} source=6 dest: 3}, { cond=(AND p1 p0 (NOT p3)), acceptance={} source=6 dest: 4}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=7 dest: 2}], [{ cond=(NOT p3), acceptance={} source=8 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=9 dest: 5}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={} source=9 dest: 6}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=9 dest: 7}, { cond=(AND p1 (NOT p0) (NOT p3)), acceptance={} source=9 dest: 8}, { cond=(AND p1 p0 (NOT p3)), acceptance={} source=9 dest: 9}]], initial=0, aps=[p1:(AND (EQ s87 1) (EQ s184 1) (EQ s247 1)), p0:(AND (EQ s32 1) (EQ s132 1) (EQ s222 1)), p2:(AND (EQ s9 1) (EQ s108 1) (EQ s289 1)), p3:(AND (EQ s71 1) (...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 93 steps with 2 reset in 7 ms.
FORMULA Sudoku-PT-AN10-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN10-LTLFireability-13 finished in 3536 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(F(p1)))))'
Support contains 6 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 18 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2024-05-31 10:34:45] [INFO ] Invariant cache hit.
[2024-05-31 10:34:46] [INFO ] Implicit Places using invariants in 812 ms returned []
[2024-05-31 10:34:46] [INFO ] Invariant cache hit.
[2024-05-31 10:34:47] [INFO ] Implicit Places using invariants and state equation in 1485 ms returned []
Implicit Place search using SMT with State Equation took 2329 ms to find 0 implicit places.
[2024-05-31 10:34:47] [INFO ] Invariant cache hit.
[2024-05-31 10:34:48] [INFO ] Dead Transitions using invariants and state equation in 489 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2837 ms. Remains : 300/300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN10-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s75 0) (EQ s174 0) (EQ s245 0)), p1:(AND (EQ s30 1) (EQ s130 1) (EQ s200 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Sudoku-PT-AN10-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN10-LTLFireability-15 finished in 2985 ms.
All properties solved by simple procedures.
Total runtime 90983 ms.

BK_STOP 1717151694471

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Sudoku-PT-AN10"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is Sudoku-PT-AN10, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r417-tall-171690556400403"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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