Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r254-tall-162106745900405.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Sudoku-COL-AN02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-162106745900405
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 308K
-rw-r--r-- 1 mcc users 9.4K May 15 08:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K May 15 08:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 15 08:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 15 08:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Mar 28 16:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 28 16:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 13 19:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 13 19:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 13 19:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 13 19:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:52 equiv_pt
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 5 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 6.5K May 5 16:52 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-COL-AN02-00
FORMULA_NAME Sudoku-COL-AN02-01
FORMULA_NAME Sudoku-COL-AN02-02
FORMULA_NAME Sudoku-COL-AN02-03
FORMULA_NAME Sudoku-COL-AN02-04
FORMULA_NAME Sudoku-COL-AN02-05
FORMULA_NAME Sudoku-COL-AN02-06
FORMULA_NAME Sudoku-COL-AN02-07
FORMULA_NAME Sudoku-COL-AN02-08
FORMULA_NAME Sudoku-COL-AN02-09
FORMULA_NAME Sudoku-COL-AN02-10
FORMULA_NAME Sudoku-COL-AN02-11
FORMULA_NAME Sudoku-COL-AN02-12
FORMULA_NAME Sudoku-COL-AN02-13
FORMULA_NAME Sudoku-COL-AN02-14
FORMULA_NAME Sudoku-COL-AN02-15

=== Now, execution of the tool begins

BK_START 1621194015163

Running Version 0
[2021-05-16 19:40:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-16 19:40:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 19:40:16] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
[2021-05-16 19:40:17] [WARNING] Using fallBack plugin, rng conformance not checked
[2021-05-16 19:40:17] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 515 ms
[2021-05-16 19:40:17] [WARNING] Unknown color function,Tuple skipping symmetry detection on parameters for transition select
[2021-05-16 19:40:17] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 20 PT places and 8.0 transition bindings in 14 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
FORMULA Sudoku-COL-AN02-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 19:40:17] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions in 3 ms.
[2021-05-16 19:40:17] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_4152913499707091.dot
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 2 ms. (steps per millisecond=0 )
[2021-05-16 19:40:17] [INFO ] Flatten gal took : 18 ms
[2021-05-16 19:40:17] [INFO ] Flatten gal took : 1 ms
[2021-05-16 19:40:17] [INFO ] Unfolded HLPN to a Petri net with 20 places and 8 transitions in 2 ms.
[2021-05-16 19:40:17] [INFO ] Unfolded HLPN properties in 1 ms.
Successfully produced net in file /tmp/petri1001_15958411521791426377.dot
[2021-05-16 19:40:17] [INFO ] Initial state test concluded for 2 properties.
FORMULA Sudoku-COL-AN02-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 12 out of 20 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 20/20 places, 8/8 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 12 transition count 8
Applied a total of 8 rules in 6 ms. Remains 12 /20 variables (removed 8) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 12 cols
[2021-05-16 19:40:17] [INFO ] Computed 5 place invariants in 5 ms
[2021-05-16 19:40:17] [INFO ] Implicit Places using invariants in 65 ms returned []
// Phase 1: matrix 8 rows 12 cols
[2021-05-16 19:40:17] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-16 19:40:17] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
// Phase 1: matrix 8 rows 12 cols
[2021-05-16 19:40:17] [INFO ] Computed 5 place invariants in 7 ms
[2021-05-16 19:40:17] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Finished structural reductions, in 1 iterations. Remains : 12/20 places, 8/8 transitions.
[2021-05-16 19:40:17] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-16 19:40:17] [INFO ] Flatten gal took : 12 ms
FORMULA Sudoku-COL-AN02-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 19:40:17] [INFO ] Flatten gal took : 6 ms
[2021-05-16 19:40:17] [INFO ] Input system was already deterministic with 8 transitions.
Incomplete random walk after 100000 steps, including 22224 resets, run finished after 424 ms. (steps per millisecond=235 ) properties (out of 4) seen :3
Running SMT prover for 1 properties.
// Phase 1: matrix 8 rows 12 cols
[2021-05-16 19:40:18] [INFO ] Computed 5 place invariants in 2 ms
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
FORMULA Sudoku-COL-AN02-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0 U (G(p0)||(F(G(p0))&&p1)))))], workingDir=/home/mcc/execution]
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 3 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 12 cols
[2021-05-16 19:40:18] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-16 19:40:18] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 8 rows 12 cols
[2021-05-16 19:40:18] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-16 19:40:18] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 26 ms to find 0 implicit places.
[2021-05-16 19:40:18] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 12 cols
[2021-05-16 19:40:18] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-16 19:40:18] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 8/8 transitions.
Stuttering acceptance computed with spot in 125 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN02-02 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s0 1) (LT s5 1) (LT s10 1)) (OR (LT s0 1) (LT s4 1) (LT s8 1)) (OR (LT s2 1) (LT s7 1) (LT s10 1)) (OR (LT s1 1) (LT s5 1) (LT s11 1)) (OR (LT s2 1) (LT s6 1) (LT s8 1)) (OR (LT s1 1) (LT s4 1) (LT s9 1)) (OR (LT s3 1) (LT s7 1) (LT s11 1)) (OR (LT s3 1) (LT s6 1) (LT s9 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 22205 reset in 200 ms.
Product exploration explored 100000 steps with 22149 reset in 171 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 12 transition count 8
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 : [(F (G p0)), (NOT p0)]
Property proved to be true thanks to knowledge :(F (G p0))
FORMULA Sudoku-COL-AN02-02 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property Sudoku-COL-AN02-02 finished in 664 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(!p0)))], workingDir=/home/mcc/execution]
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 12 cols
[2021-05-16 19:40:18] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-16 19:40:18] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 8 rows 12 cols
[2021-05-16 19:40:18] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-16 19:40:18] [INFO ] Implicit Places using invariants and state equation in 13 ms returned []
Implicit Place search using SMT with State Equation took 28 ms to find 0 implicit places.
// Phase 1: matrix 8 rows 12 cols
[2021-05-16 19:40:18] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-16 19:40:18] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 8/8 transitions.
Stuttering acceptance computed with spot in 56 ms :[p0, p0]
Running random walk in product with property : Sudoku-COL-AN02-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (LT s0 1) (LT s5 1) (LT s10 1)) (OR (LT s0 1) (LT s4 1) (LT s8 1)) (OR (LT s2 1) (LT s7 1) (LT s10 1)) (OR (LT s1 1) (LT s5 1) (LT s11 1)) (OR (LT s2 1) (LT s6 1) (LT s8 1)) (OR (LT s1 1) (LT s4 1) (LT s9 1)) (OR (LT s3 1) (LT s7 1) (LT s11 1)) (OR (LT s3 1) (LT s6 1) (LT s9 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 159 ms.
Product exploration explored 100000 steps with 50000 reset in 166 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 12 transition count 8
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 : [(F (G p0)), (NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[p0, p0]
Product exploration explored 100000 steps with 50000 reset in 124 ms.
Product exploration explored 100000 steps with 50000 reset in 99 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 45 ms :[p0, p0]
Support contains 12 out of 12 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2021-05-16 19:40:19] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 12 cols
[2021-05-16 19:40:19] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-16 19:40:19] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 8/8 transitions.
Product exploration explored 100000 steps with 50000 reset in 177 ms.
Product exploration explored 100000 steps with 50000 reset in 177 ms.
[2021-05-16 19:40:20] [INFO ] Flatten gal took : 4 ms
[2021-05-16 19:40:20] [INFO ] Flatten gal took : 2 ms
[2021-05-16 19:40:20] [INFO ] Time to serialize gal into /tmp/LTL14582928883375242875.gal : 1 ms
[2021-05-16 19:40:20] [INFO ] Time to serialize properties into /tmp/LTL13015301798893861966.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL14582928883375242875.gal, -t, CGAL, -LTL, /tmp/LTL13015301798893861966.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL14582928883375242875.gal -t CGAL -LTL /tmp/LTL13015301798893861966.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("((((((((((Rows_0>=1)&&(Cells_1>=1))&&(Columns_2>=1))||(((Rows_0>=1)&&(Cells_0>=1))&&(Columns_0>=1)))||(((Rows_2>=1)&&(Cells_3>=1))&&(Columns_2>=1)))||(((Rows_1>=1)&&(Cells_1>=1))&&(Columns_3>=1)))||(((Rows_2>=1)&&(Cells_2>=1))&&(Columns_0>=1)))||(((Rows_1>=1)&&(Cells_0>=1))&&(Columns_1>=1)))||(((Rows_3>=1)&&(Cells_3>=1))&&(Columns_3>=1)))||(((Rows_3>=1)&&(Cells_2>=1))&&(Columns_1>=1)))"))))
Formula 0 simplified : !XF"((((((((((Rows_0>=1)&&(Cells_1>=1))&&(Columns_2>=1))||(((Rows_0>=1)&&(Cells_0>=1))&&(Columns_0>=1)))||(((Rows_2>=1)&&(Cells_3>=1))&&(Columns_2>=1)))||(((Rows_1>=1)&&(Cells_1>=1))&&(Columns_3>=1)))||(((Rows_2>=1)&&(Cells_2>=1))&&(Columns_0>=1)))||(((Rows_1>=1)&&(Cells_0>=1))&&(Columns_1>=1)))||(((Rows_3>=1)&&(Cells_3>=1))&&(Columns_3>=1)))||(((Rows_3>=1)&&(Cells_2>=1))&&(Columns_1>=1)))"
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/0/8/8
Computing Next relation with stutter on 5 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.020245,16436,1,0,30,731,37,12,310,529,26
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Sudoku-COL-AN02-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property Sudoku-COL-AN02-03 finished in 1377 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((!p0&&X(!p0))))], workingDir=/home/mcc/execution]
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 12 cols
[2021-05-16 19:40:20] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-16 19:40:20] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 8 rows 12 cols
[2021-05-16 19:40:20] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-16 19:40:20] [INFO ] Implicit Places using invariants and state equation in 13 ms returned []
Implicit Place search using SMT with State Equation took 27 ms to find 0 implicit places.
// Phase 1: matrix 8 rows 12 cols
[2021-05-16 19:40:20] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-16 19:40:20] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 8/8 transitions.
Stuttering acceptance computed with spot in 33 ms :[true, p0]
Running random walk in product with property : Sudoku-COL-AN02-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (OR (LT s0 1) (LT s5 1) (LT s10 1)) (OR (LT s0 1) (LT s4 1) (LT s8 1)) (OR (LT s2 1) (LT s7 1) (LT s10 1)) (OR (LT s1 1) (LT s5 1) (LT s11 1)) (OR (LT s2 1) (LT s6 1) (LT s8 1)) (OR (LT s1 1) (LT s4 1) (LT s9 1)) (OR (LT s3 1) (LT s7 1) (LT s11 1)) (OR (LT s3 1) (LT s6 1) (LT s9 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA Sudoku-COL-AN02-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN02-06 finished in 81 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 12 cols
[2021-05-16 19:40:20] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-16 19:40:20] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 8 rows 12 cols
[2021-05-16 19:40:20] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-16 19:40:20] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 27 ms to find 0 implicit places.
[2021-05-16 19:40:20] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 12 cols
[2021-05-16 19:40:20] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-16 19:40:20] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 8/8 transitions.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN02-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s0 1) (LT s5 1) (LT s10 1)) (OR (LT s0 1) (LT s4 1) (LT s8 1)) (OR (LT s2 1) (LT s7 1) (LT s10 1)) (OR (LT s1 1) (LT s5 1) (LT s11 1)) (OR (LT s2 1) (LT s6 1) (LT s8 1)) (OR (LT s1 1) (LT s4 1) (LT s9 1)) (OR (LT s3 1) (LT s7 1) (LT s11 1)) (OR (LT s3 1) (LT s6 1) (LT s9 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 22201 reset in 105 ms.
Product exploration explored 100000 steps with 22279 reset in 114 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 12 transition count 8
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 : [(F (G p0)), (NOT p0)]
Property proved to be true thanks to knowledge :(F (G p0))
FORMULA Sudoku-COL-AN02-07 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property Sudoku-COL-AN02-07 finished in 357 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 12 cols
[2021-05-16 19:40:20] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-16 19:40:20] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 8 rows 12 cols
[2021-05-16 19:40:20] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-16 19:40:20] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 26 ms to find 0 implicit places.
[2021-05-16 19:40:20] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 12 cols
[2021-05-16 19:40:20] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-16 19:40:20] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 8/8 transitions.
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-COL-AN02-08 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(AND (OR (LT s0 1) (LT s5 1) (LT s10 1)) (OR (LT s0 1) (LT s4 1) (LT s8 1)) (OR (LT s2 1) (LT s7 1) (LT s10 1)) (OR (LT s1 1) (LT s5 1) (LT s11 1)) (OR (LT s2 1) (LT s6 1) (LT s8 1)) (OR (LT s1 1) (LT s4 1) (LT s9 1)) (OR (LT s3 1) (LT s7 1) (LT s11 1)) (OR (LT s3 1) (LT s6 1) (LT s9 1))), p0:(AND (OR (LT s0 1) (LT s5 1) (LT s10 1)) (OR (LT s0 1) (LT s4 1) (LT s8 1)) (OR (LT s2 1) (LT s7 1) (LT s10 1)) (OR (LT s1 1) (LT s5 1) (LT s11 1)) (OR (LT s2 1) (LT s6 1) (LT s8 1)) (OR (LT s1 1) (LT s4 1) (LT s9 1)) (OR (LT s3 1) (LT s7 1) (LT s11 1)) (OR (LT s3 1) (LT s6 1) (LT s9 1)) (OR (LT s0 1) (LT s5 1) (LT s10 1)) (OR (LT s0 1) (LT s4 1) (LT s8 1)) (OR (LT s2 1) (LT s7 1) (LT s10 1)) (OR (LT s1 1) (LT s5 1) (LT s11 1)) (OR (LT s2 1) (LT s6 1) (LT s8 1)) (OR (LT s1 1) (LT s4 1) (LT s9 1)) (OR (LT s3 1) (LT s7 1) (LT s11 1)) (OR (LT s3 1) (LT s6 1) (LT s9 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 22196 reset in 429 ms.
Product exploration explored 100000 steps with 22206 reset in 250 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 12 transition count 8
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 : [(F (G p1)), (F (G p0)), (NOT p1), (NOT p0)]
Property proved to be true thanks to knowledge :(F (G p1))
FORMULA Sudoku-COL-AN02-08 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property Sudoku-COL-AN02-08 finished in 943 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 12 cols
[2021-05-16 19:40:21] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-16 19:40:21] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 8 rows 12 cols
[2021-05-16 19:40:21] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-16 19:40:21] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 28 ms to find 0 implicit places.
// Phase 1: matrix 8 rows 12 cols
[2021-05-16 19:40:21] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-16 19:40:21] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 8/8 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN02-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (LT s0 1) (LT s5 1) (LT s10 1)) (OR (LT s0 1) (LT s4 1) (LT s8 1)) (OR (LT s2 1) (LT s7 1) (LT s10 1)) (OR (LT s1 1) (LT s5 1) (LT s11 1)) (OR (LT s2 1) (LT s6 1) (LT s8 1)) (OR (LT s1 1) (LT s4 1) (LT s9 1)) (OR (LT s3 1) (LT s7 1) (LT s11 1)) (OR (LT s3 1) (LT s6 1) (LT s9 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 22240 reset in 98 ms.
Product exploration explored 100000 steps with 22238 reset in 97 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 12 transition count 8
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 : [(F (G p0)), (NOT p0)]
Property proved to be true thanks to knowledge :(F (G p0))
FORMULA Sudoku-COL-AN02-09 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property Sudoku-COL-AN02-09 finished in 355 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 12 cols
[2021-05-16 19:40:21] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-16 19:40:22] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 8 rows 12 cols
[2021-05-16 19:40:22] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-16 19:40:22] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 21 ms to find 0 implicit places.
[2021-05-16 19:40:22] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 12 cols
[2021-05-16 19:40:22] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-16 19:40:22] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 8/8 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN02-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (LT s0 1) (LT s5 1) (LT s10 1)) (OR (LT s0 1) (LT s4 1) (LT s8 1)) (OR (LT s2 1) (LT s7 1) (LT s10 1)) (OR (LT s1 1) (LT s5 1) (LT s11 1)) (OR (LT s2 1) (LT s6 1) (LT s8 1)) (OR (LT s1 1) (LT s4 1) (LT s9 1)) (OR (LT s3 1) (LT s7 1) (LT s11 1)) (OR (LT s3 1) (LT s6 1) (LT s9 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 22188 reset in 92 ms.
Product exploration explored 100000 steps with 22189 reset in 101 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 12 transition count 8
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 : [(F (G p0)), (NOT p0)]
Property proved to be true thanks to knowledge :(F (G p0))
FORMULA Sudoku-COL-AN02-10 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property Sudoku-COL-AN02-10 finished in 343 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(!p0)))], workingDir=/home/mcc/execution]
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 12 cols
[2021-05-16 19:40:22] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-16 19:40:22] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 8 rows 12 cols
[2021-05-16 19:40:22] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-16 19:40:22] [INFO ] Implicit Places using invariants and state equation in 13 ms returned []
Implicit Place search using SMT with State Equation took 22 ms to find 0 implicit places.
[2021-05-16 19:40:22] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 12 cols
[2021-05-16 19:40:22] [INFO ] Computed 5 place invariants in 3 ms
[2021-05-16 19:40:22] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 8/8 transitions.
Stuttering acceptance computed with spot in 49 ms :[p0, p0]
Running random walk in product with property : Sudoku-COL-AN02-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (LT s0 1) (LT s5 1) (LT s10 1)) (OR (LT s0 1) (LT s4 1) (LT s8 1)) (OR (LT s2 1) (LT s7 1) (LT s10 1)) (OR (LT s1 1) (LT s5 1) (LT s11 1)) (OR (LT s2 1) (LT s6 1) (LT s8 1)) (OR (LT s1 1) (LT s4 1) (LT s9 1)) (OR (LT s3 1) (LT s7 1) (LT s11 1)) (OR (LT s3 1) (LT s6 1) (LT s9 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 1 ms.
FORMULA Sudoku-COL-AN02-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN02-11 finished in 103 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 12 cols
[2021-05-16 19:40:22] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-16 19:40:22] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 8 rows 12 cols
[2021-05-16 19:40:22] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-16 19:40:22] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 21 ms to find 0 implicit places.
[2021-05-16 19:40:22] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 12 cols
[2021-05-16 19:40:22] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-16 19:40:22] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 8/8 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN02-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s0 1) (LT s5 1) (LT s10 1)) (OR (LT s0 1) (LT s4 1) (LT s8 1)) (OR (LT s2 1) (LT s7 1) (LT s10 1)) (OR (LT s1 1) (LT s5 1) (LT s11 1)) (OR (LT s2 1) (LT s6 1) (LT s8 1)) (OR (LT s1 1) (LT s4 1) (LT s9 1)) (OR (LT s3 1) (LT s7 1) (LT s11 1)) (OR (LT s3 1) (LT s6 1) (LT s9 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 22248 reset in 110 ms.
Product exploration explored 100000 steps with 22214 reset in 119 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 12 transition count 8
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 : [(F (G p0)), (NOT p0)]
Property proved to be true thanks to knowledge :(F (G p0))
FORMULA Sudoku-COL-AN02-12 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property Sudoku-COL-AN02-12 finished in 356 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 12 cols
[2021-05-16 19:40:22] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-16 19:40:22] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 8 rows 12 cols
[2021-05-16 19:40:22] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-16 19:40:22] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 24 ms to find 0 implicit places.
[2021-05-16 19:40:22] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 12 cols
[2021-05-16 19:40:22] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-16 19:40:22] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 8/8 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN02-13 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s0 1) (LT s5 1) (LT s10 1)) (OR (LT s0 1) (LT s4 1) (LT s8 1)) (OR (LT s2 1) (LT s7 1) (LT s10 1)) (OR (LT s1 1) (LT s5 1) (LT s11 1)) (OR (LT s2 1) (LT s6 1) (LT s8 1)) (OR (LT s1 1) (LT s4 1) (LT s9 1)) (OR (LT s3 1) (LT s7 1) (LT s11 1)) (OR (LT s3 1) (LT s6 1) (LT s9 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 22199 reset in 109 ms.
Product exploration explored 100000 steps with 22253 reset in 136 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 12 transition count 8
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 : [(F (G p0)), (NOT p0)]
Property proved to be true thanks to knowledge :(F (G p0))
FORMULA Sudoku-COL-AN02-13 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property Sudoku-COL-AN02-13 finished in 375 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(!p0))], workingDir=/home/mcc/execution]
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 12 cols
[2021-05-16 19:40:23] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-16 19:40:23] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 8 rows 12 cols
[2021-05-16 19:40:23] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-16 19:40:23] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 24 ms to find 0 implicit places.
[2021-05-16 19:40:23] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 12 cols
[2021-05-16 19:40:23] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-16 19:40:23] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 8/8 transitions.
Stuttering acceptance computed with spot in 31 ms :[p0]
Running random walk in product with property : Sudoku-COL-AN02-14 automaton TGBA [mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s0 1) (LT s5 1) (LT s10 1)) (OR (LT s0 1) (LT s4 1) (LT s8 1)) (OR (LT s2 1) (LT s7 1) (LT s10 1)) (OR (LT s1 1) (LT s5 1) (LT s11 1)) (OR (LT s2 1) (LT s6 1) (LT s8 1)) (OR (LT s1 1) (LT s4 1) (LT s9 1)) (OR (LT s3 1) (LT s7 1) (LT s11 1)) (OR (LT s3 1) (LT s6 1) (LT s9 1)))], 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]]
Initial state of product has no viable successors after 0 steps with 0 reset in 0 ms.
FORMULA Sudoku-COL-AN02-14 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property Sudoku-COL-AN02-14 finished in 81 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 12 cols
[2021-05-16 19:40:23] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-16 19:40:23] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 8 rows 12 cols
[2021-05-16 19:40:23] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-16 19:40:23] [INFO ] Implicit Places using invariants and state equation in 13 ms returned []
Implicit Place search using SMT with State Equation took 23 ms to find 0 implicit places.
// Phase 1: matrix 8 rows 12 cols
[2021-05-16 19:40:23] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-16 19:40:23] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 8/8 transitions.
Stuttering acceptance computed with spot in 53 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN02-15 automaton TGBA [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 (OR (LT s0 1) (LT s5 1) (LT s10 1)) (OR (LT s0 1) (LT s4 1) (LT s8 1)) (OR (LT s2 1) (LT s7 1) (LT s10 1)) (OR (LT s1 1) (LT s5 1) (LT s11 1)) (OR (LT s2 1) (LT s6 1) (LT s8 1)) (OR (LT s1 1) (LT s4 1) (LT s9 1)) (OR (LT s3 1) (LT s7 1) (LT s11 1)) (OR (LT s3 1) (LT s6 1) (LT s9 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, 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 0 ms.
FORMULA Sudoku-COL-AN02-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN02-15 finished in 96 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621194026124

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-COL-AN02"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is Sudoku-COL-AN02, 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 r254-tall-162106745900405"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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