About the Execution of 2023-gold for Sudoku-COL-AN04
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16223.863 | 3600000.00 | 3723842.00 | 315899.90 | FFTFFTFFFFFFTFF? | normal |
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-171690556100272.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-COL-AN04, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r417-tall-171690556100272
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 7.2K Apr 12 11:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 12 11:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 12 11:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 12 11:20 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 3.6K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 11:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K Apr 12 11:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Apr 12 11:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Apr 12 11:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 08:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 6.5K 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-COL-AN04-LTLCardinality-00
FORMULA_NAME Sudoku-COL-AN04-LTLCardinality-01
FORMULA_NAME Sudoku-COL-AN04-LTLCardinality-02
FORMULA_NAME Sudoku-COL-AN04-LTLCardinality-03
FORMULA_NAME Sudoku-COL-AN04-LTLCardinality-04
FORMULA_NAME Sudoku-COL-AN04-LTLCardinality-05
FORMULA_NAME Sudoku-COL-AN04-LTLCardinality-06
FORMULA_NAME Sudoku-COL-AN04-LTLCardinality-07
FORMULA_NAME Sudoku-COL-AN04-LTLCardinality-08
FORMULA_NAME Sudoku-COL-AN04-LTLCardinality-09
FORMULA_NAME Sudoku-COL-AN04-LTLCardinality-10
FORMULA_NAME Sudoku-COL-AN04-LTLCardinality-11
FORMULA_NAME Sudoku-COL-AN04-LTLCardinality-12
FORMULA_NAME Sudoku-COL-AN04-LTLCardinality-13
FORMULA_NAME Sudoku-COL-AN04-LTLCardinality-14
FORMULA_NAME Sudoku-COL-AN04-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1717132424924
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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-COL-AN04
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202304061127
[2024-05-31 05:13:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-31 05:13:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 05:13:46] [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.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-31 05:13:46] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-31 05:13:47] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 605 ms
[2024-05-31 05:13:47] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 112 PT places and 64.0 transition bindings in 14 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
[2024-05-31 05:13:47] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 5 ms.
[2024-05-31 05:13:47] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 3 formulas.
FORMULA Sudoku-COL-AN04-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN04-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN04-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 13 properties that can be checked using skeleton over-approximation.
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Incomplete random walk after 10007 steps, including 555 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 20) seen :15
Incomplete Best-First random walk after 10007 steps, including 555 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10007 steps, including 555 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10007 steps, including 555 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10007 steps, including 555 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10007 steps, including 555 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1 rows 4 cols
[2024-05-31 05:13:47] [INFO ] Computed 3 invariants in 5 ms
[2024-05-31 05:13:47] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 05:13:47] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:3
[2024-05-31 05:13:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 05:13:47] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :1
[2024-05-31 05:13:47] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2024-05-31 05:13:47] [INFO ] After 44ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :1
Fused 5 Parikh solutions to 1 different solutions.
Finished Parikh walk after 9 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=9 )
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 4 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4/4 places, 1/1 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 2 transition count 1
Applied a total of 2 rules in 6 ms. Remains 2 /4 variables (removed 2) and now considering 1/1 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 2/4 places, 1/1 transitions.
Incomplete random walk after 10007 steps, including 555 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10007 steps, including 555 resets, run finished after 6 ms. (steps per millisecond=1667 ) properties (out of 1) seen :0
Finished probabilistic random walk after 16 steps, run visited all 1 properties in 12 ms. (steps per millisecond=1 )
Probabilistic random walk after 16 steps, saw 10 distinct states, run finished after 12 ms. (steps per millisecond=1 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 3 atomic propositions for a total of 13 simplifications.
FORMULA Sudoku-COL-AN04-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN04-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN04-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-31 05:13:47] [INFO ] Flatten gal took : 12 ms
[2024-05-31 05:13:47] [INFO ] Flatten gal took : 1 ms
Domain [N(4), N(4)] of place Rows breaks symmetries in sort N
[2024-05-31 05:13:47] [INFO ] Unfolded HLPN to a Petri net with 112 places and 64 transitions 256 arcs in 7 ms.
[2024-05-31 05:13:47] [INFO ] Unfolded 10 HLPN properties in 0 ms.
Support contains 112 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 112 /112 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 112 cols
[2024-05-31 05:13:47] [INFO ] Computed 48 invariants in 5 ms
[2024-05-31 05:13:48] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-31 05:13:48] [INFO ] Invariant cache hit.
[2024-05-31 05:13:48] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
[2024-05-31 05:13:48] [INFO ] Invariant cache hit.
[2024-05-31 05:13:48] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 267 ms. Remains : 112/112 places, 64/64 transitions.
Support contains 112 out of 112 places after structural reductions.
[2024-05-31 05:13:48] [INFO ] Flatten gal took : 14 ms
[2024-05-31 05:13:48] [INFO ] Flatten gal took : 11 ms
[2024-05-31 05:13:48] [INFO ] Input system was already deterministic with 64 transitions.
Incomplete random walk after 10000 steps, including 692 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 17) seen :16
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-31 05:13:48] [INFO ] Invariant cache hit.
[2024-05-31 05:13:48] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 05:13:48] [INFO ] [Nat]Absence check using 48 positive place invariants in 7 ms returned sat
[2024-05-31 05:13:48] [INFO ] After 49ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA Sudoku-COL-AN04-LTLCardinality-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
FORMULA Sudoku-COL-AN04-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 112 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 112 transition count 64
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' '!(X(G(p0)))'
Support contains 16 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 48 transition count 64
Applied a total of 64 rules in 4 ms. Remains 48 /112 variables (removed 64) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 48 cols
[2024-05-31 05:13:48] [INFO ] Computed 11 invariants in 10 ms
[2024-05-31 05:13:48] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-31 05:13:48] [INFO ] Invariant cache hit.
[2024-05-31 05:13:49] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
[2024-05-31 05:13:49] [INFO ] Invariant cache hit.
[2024-05-31 05:13:49] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 48/112 places, 64/64 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 192 ms. Remains : 48/112 places, 64/64 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 189 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN04-LTLCardinality-00 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:(LEQ 3 (ADD s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47))], 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 27 steps with 1 reset in 5 ms.
FORMULA Sudoku-COL-AN04-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN04-LTLCardinality-00 finished in 432 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) U (X(G(p0))||(X(p0)&&G(p1)))))&&F(p2)))'
Support contains 80 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Applied a total of 0 rules in 3 ms. Remains 112 /112 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 112 cols
[2024-05-31 05:13:49] [INFO ] Computed 48 invariants in 2 ms
[2024-05-31 05:13:49] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-31 05:13:49] [INFO ] Invariant cache hit.
[2024-05-31 05:13:49] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
[2024-05-31 05:13:49] [INFO ] Invariant cache hit.
[2024-05-31 05:13:49] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 214 ms. Remains : 112/112 places, 64/64 transitions.
Stuttering acceptance computed with spot in 342 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) p0)]
Running random walk in product with property : Sudoku-COL-AN04-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 2}, { cond=true, acceptance={} source=2 dest: 3}, { cond=(AND p1 p0), acceptance={} source=2 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={1} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=4 dest: 2}, { cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=(AND p1 p0), acceptance={} source=4 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={1} source=4 dest: 4}, { cond=p1, acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0, 1} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p1) p0), acceptance={} source=7 dest: 5}, { cond=(AND p1 p0), acceptance={} source=7 dest: 7}]], initial=0, aps=[p2:(LEQ 3 (ADD s80 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95)), p1:(GT 2 (ADD s80 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s9...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA Sudoku-COL-AN04-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN04-LTLCardinality-03 finished in 583 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((p0||X((p1||(p0 U (p2||G(p0))))))))'
Support contains 96 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 112 /112 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-05-31 05:13:49] [INFO ] Invariant cache hit.
[2024-05-31 05:13:49] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-31 05:13:49] [INFO ] Invariant cache hit.
[2024-05-31 05:13:50] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
[2024-05-31 05:13:50] [INFO ] Invariant cache hit.
[2024-05-31 05:13:50] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 178 ms. Remains : 112/112 places, 64/64 transitions.
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : Sudoku-COL-AN04-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT (ADD s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s5...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 10000 reset in 872 ms.
Product exploration explored 100000 steps with 10000 reset in 823 ms.
Computed a total of 112 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 112 transition count 64
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 284 ms. Reduced automaton from 2 states, 2 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p1) (NOT p2))]
Finished random walk after 9 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=9 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
Knowledge based reduction with 6 factoid took 339 ms. Reduced automaton from 1 states, 1 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p1) (NOT p2))]
[2024-05-31 05:13:52] [INFO ] Invariant cache hit.
[2024-05-31 05:13:52] [INFO ] [Real]Absence check using 48 positive place invariants in 12 ms returned sat
[2024-05-31 05:13:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 05:13:52] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-31 05:13:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 05:13:52] [INFO ] [Nat]Absence check using 48 positive place invariants in 13 ms returned sat
[2024-05-31 05:13:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 05:13:52] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2024-05-31 05:13:53] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-31 05:13:53] [INFO ] Added : 0 causal constraints over 0 iterations in 21 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1) (NOT p2))
Support contains 96 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Applied a total of 0 rules in 3 ms. Remains 112 /112 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-05-31 05:13:53] [INFO ] Invariant cache hit.
[2024-05-31 05:13:53] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-31 05:13:53] [INFO ] Invariant cache hit.
[2024-05-31 05:13:53] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
[2024-05-31 05:13:53] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-31 05:13:53] [INFO ] Invariant cache hit.
[2024-05-31 05:13:53] [INFO ] Dead Transitions using invariants and state equation in 187 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 473 ms. Remains : 112/112 places, 64/64 transitions.
Computed a total of 112 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 112 transition count 64
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 391 ms. Reduced automaton from 1 states, 1 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p0) (NOT p1) (NOT p2))]
Finished random walk after 9 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=9 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
Knowledge based reduction with 6 factoid took 371 ms. Reduced automaton from 1 states, 1 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 33 ms :[(AND (NOT p0) (NOT p1) (NOT p2))]
[2024-05-31 05:13:54] [INFO ] Invariant cache hit.
[2024-05-31 05:13:54] [INFO ] [Real]Absence check using 48 positive place invariants in 10 ms returned sat
[2024-05-31 05:13:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 05:13:54] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-31 05:13:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 05:13:54] [INFO ] [Nat]Absence check using 48 positive place invariants in 15 ms returned sat
[2024-05-31 05:13:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 05:13:54] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2024-05-31 05:13:54] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-31 05:13:54] [INFO ] Added : 0 causal constraints over 0 iterations in 15 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering criterion allowed to conclude after 71398 steps with 7139 reset in 566 ms.
FORMULA Sudoku-COL-AN04-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN04-LTLCardinality-04 finished in 5536 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' '!(G(F((p0 U (p1||G(p0))))))'
Support contains 80 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Applied a total of 0 rules in 11 ms. Remains 112 /112 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-05-31 05:13:55] [INFO ] Invariant cache hit.
[2024-05-31 05:13:55] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-31 05:13:55] [INFO ] Invariant cache hit.
[2024-05-31 05:13:55] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
[2024-05-31 05:13:55] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-31 05:13:55] [INFO ] Invariant cache hit.
[2024-05-31 05:13:55] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 211 ms. Remains : 112/112 places, 64/64 transitions.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-COL-AN04-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GT (ADD s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s...], 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 9990 reset in 953 ms.
Stuttering criterion allowed to conclude after 50953 steps with 5090 reset in 500 ms.
FORMULA Sudoku-COL-AN04-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN04-LTLCardinality-06 finished in 1762 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(p0) U X(X(X(G(p1))))))'
Support contains 32 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 48 transition count 64
Applied a total of 64 rules in 2 ms. Remains 48 /112 variables (removed 64) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 48 cols
[2024-05-31 05:13:57] [INFO ] Computed 11 invariants in 2 ms
[2024-05-31 05:13:57] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-31 05:13:57] [INFO ] Invariant cache hit.
[2024-05-31 05:13:57] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2024-05-31 05:13:57] [INFO ] Invariant cache hit.
[2024-05-31 05:13:57] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 48/112 places, 64/64 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 127 ms. Remains : 48/112 places, 64/64 transitions.
Stuttering acceptance computed with spot in 205 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN04-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(LEQ 3 (ADD s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31)), p1:(LEQ 1 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 42 steps with 2 reset in 1 ms.
FORMULA Sudoku-COL-AN04-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN04-LTLCardinality-07 finished in 359 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((p0&&G(F((!p1&&X(!p1)))))))'
Support contains 16 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 48 transition count 64
Applied a total of 64 rules in 4 ms. Remains 48 /112 variables (removed 64) and now considering 64/64 (removed 0) transitions.
[2024-05-31 05:13:57] [INFO ] Invariant cache hit.
[2024-05-31 05:13:57] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-31 05:13:57] [INFO ] Invariant cache hit.
[2024-05-31 05:13:57] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
[2024-05-31 05:13:57] [INFO ] Invariant cache hit.
[2024-05-31 05:13:57] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 48/112 places, 64/64 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 152 ms. Remains : 48/112 places, 64/64 transitions.
Stuttering acceptance computed with spot in 222 ms :[(OR (NOT p0) p1), p1, p1, (NOT p0), p1]
Running random walk in product with property : Sudoku-COL-AN04-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=p1, acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 4}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={0} source=4 dest: 1}]], initial=0, aps=[p1:(LEQ 1 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15)), p0:(LEQ 2 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 1 ms.
FORMULA Sudoku-COL-AN04-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN04-LTLCardinality-10 finished in 394 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||G((p1||X(X(p2))))) U G(!p0)))'
Support contains 96 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Applied a total of 0 rules in 5 ms. Remains 112 /112 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 112 cols
[2024-05-31 05:13:57] [INFO ] Computed 48 invariants in 1 ms
[2024-05-31 05:13:58] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-31 05:13:58] [INFO ] Invariant cache hit.
[2024-05-31 05:13:58] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2024-05-31 05:13:58] [INFO ] Invariant cache hit.
[2024-05-31 05:13:58] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 182 ms. Remains : 112/112 places, 64/64 transitions.
Stuttering acceptance computed with spot in 202 ms :[p0, (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), true]
Running random walk in product with property : Sudoku-COL-AN04-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15) (ADD s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 10 steps with 0 reset in 0 ms.
FORMULA Sudoku-COL-AN04-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN04-LTLCardinality-14 finished in 413 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' '!(G(F((!p0||G(p1)))))'
Support contains 96 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Applied a total of 0 rules in 8 ms. Remains 112 /112 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-05-31 05:13:58] [INFO ] Invariant cache hit.
[2024-05-31 05:13:58] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-31 05:13:58] [INFO ] Invariant cache hit.
[2024-05-31 05:13:58] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2024-05-31 05:13:58] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-31 05:13:58] [INFO ] Invariant cache hit.
[2024-05-31 05:13:58] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 186 ms. Remains : 112/112 places, 64/64 transitions.
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : Sudoku-COL-AN04-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GT 1 (ADD s96 s97 s98 s99 s100 s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111)), p0:(GT (ADD s80 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s...], 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 11090 reset in 717 ms.
Product exploration explored 100000 steps with 11090 reset in 739 ms.
Computed a total of 112 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 112 transition count 64
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 (AND (NOT p1) p0)), (X (NOT (AND p1 p0))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p1 p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 156 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 690 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-31 05:14:00] [INFO ] Invariant cache hit.
[2024-05-31 05:14:00] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 05:14:00] [INFO ] [Nat]Absence check using 48 positive place invariants in 7 ms returned sat
[2024-05-31 05:14:00] [INFO ] After 35ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (AND (NOT p1) p0)), (X (NOT (AND p1 p0))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p1 p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 8 factoid took 243 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[p0, p0]
Stuttering acceptance computed with spot in 68 ms :[p0, p0]
[2024-05-31 05:14:01] [INFO ] Invariant cache hit.
[2024-05-31 05:14:01] [INFO ] [Real]Absence check using 48 positive place invariants in 7 ms returned sat
[2024-05-31 05:14:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 05:14:01] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2024-05-31 05:14:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 05:14:01] [INFO ] [Nat]Absence check using 48 positive place invariants in 10 ms returned sat
[2024-05-31 05:14:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 05:14:01] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2024-05-31 05:14:01] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-31 05:14:01] [INFO ] Added : 0 causal constraints over 0 iterations in 20 ms. Result :sat
Could not prove EG p0
Support contains 80 out of 112 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Applied a total of 0 rules in 3 ms. Remains 112 /112 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-05-31 05:14:01] [INFO ] Invariant cache hit.
[2024-05-31 05:14:01] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-31 05:14:01] [INFO ] Invariant cache hit.
[2024-05-31 05:14:01] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
[2024-05-31 05:14:01] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-31 05:14:01] [INFO ] Invariant cache hit.
[2024-05-31 05:14:01] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 194 ms. Remains : 112/112 places, 64/64 transitions.
Computed a total of 112 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 112 transition count 64
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 : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 94 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[p0, p0]
Finished random walk after 8 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=8 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 116 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[p0, p0]
Stuttering acceptance computed with spot in 86 ms :[p0, p0]
[2024-05-31 05:14:02] [INFO ] Invariant cache hit.
[2024-05-31 05:14:02] [INFO ] [Real]Absence check using 48 positive place invariants in 7 ms returned sat
[2024-05-31 05:14:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 05:14:02] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-31 05:14:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 05:14:02] [INFO ] [Nat]Absence check using 48 positive place invariants in 9 ms returned sat
[2024-05-31 05:14:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 05:14:02] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2024-05-31 05:14:02] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-31 05:14:02] [INFO ] Added : 0 causal constraints over 0 iterations in 14 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 83 ms :[p0, p0]
Product exploration explored 100000 steps with 11080 reset in 681 ms.
Product exploration explored 100000 steps with 11079 reset in 673 ms.
Built C files in :
/tmp/ltsmin6927378258335440927
[2024-05-31 05:14:03] [INFO ] Computing symmetric may disable matrix : 64 transitions.
[2024-05-31 05:14:03] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 05:14:03] [INFO ] Computing symmetric may enable matrix : 64 transitions.
[2024-05-31 05:14:03] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 05:14:03] [INFO ] Computing Do-Not-Accords matrix : 64 transitions.
[2024-05-31 05:14:03] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 05:14:03] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6927378258335440927
Running compilation step : cd /tmp/ltsmin6927378258335440927;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 288 ms.
Running link step : cd /tmp/ltsmin6927378258335440927;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin6927378258335440927;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13421039186075399062.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 80 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Applied a total of 0 rules in 10 ms. Remains 112 /112 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-05-31 05:14:19] [INFO ] Invariant cache hit.
[2024-05-31 05:14:19] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-31 05:14:19] [INFO ] Invariant cache hit.
[2024-05-31 05:14:19] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
[2024-05-31 05:14:19] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-31 05:14:19] [INFO ] Invariant cache hit.
[2024-05-31 05:14:19] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 193 ms. Remains : 112/112 places, 64/64 transitions.
Built C files in :
/tmp/ltsmin1258989572770480601
[2024-05-31 05:14:19] [INFO ] Computing symmetric may disable matrix : 64 transitions.
[2024-05-31 05:14:19] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 05:14:19] [INFO ] Computing symmetric may enable matrix : 64 transitions.
[2024-05-31 05:14:19] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 05:14:19] [INFO ] Computing Do-Not-Accords matrix : 64 transitions.
[2024-05-31 05:14:19] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 05:14:19] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1258989572770480601
Running compilation step : cd /tmp/ltsmin1258989572770480601;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 180 ms.
Running link step : cd /tmp/ltsmin1258989572770480601;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin1258989572770480601;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8896413683131148758.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-31 05:14:34] [INFO ] Flatten gal took : 8 ms
[2024-05-31 05:14:34] [INFO ] Flatten gal took : 7 ms
[2024-05-31 05:14:34] [INFO ] Time to serialize gal into /tmp/LTL3175301778156971630.gal : 3 ms
[2024-05-31 05:14:34] [INFO ] Time to serialize properties into /tmp/LTL16423039686954906268.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3175301778156971630.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15576984131536820980.hoa' '-atoms' '/tmp/LTL16423039686954906268.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL16423039686954906268.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15576984131536820980.hoa
Detected timeout of ITS tools.
[2024-05-31 05:14:49] [INFO ] Flatten gal took : 7 ms
[2024-05-31 05:14:49] [INFO ] Flatten gal took : 5 ms
[2024-05-31 05:14:49] [INFO ] Time to serialize gal into /tmp/LTL12865664925662661333.gal : 3 ms
[2024-05-31 05:14:49] [INFO ] Time to serialize properties into /tmp/LTL16237765187696386028.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12865664925662661333.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16237765187696386028.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F(("(((((Cells_0+Cells_1)+(Cells_2+Cells_3))+((Cells_4+Cells_5)+(Cells_6+Cells_7)))+(((Cells_8+Cells_9)+(Cells_10+Cells_11))+((Ce...1102
Formula 0 simplified : G(F!"(((((Columns_0+Columns_1)+(Columns_2+Columns_3))+((Columns_4+Columns_5)+(Columns_6+Columns_7)))+(((Columns_8+Columns_9)+(Column...1095
Detected timeout of ITS tools.
[2024-05-31 05:15:04] [INFO ] Flatten gal took : 6 ms
[2024-05-31 05:15:04] [INFO ] Applying decomposition
[2024-05-31 05:15:04] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph17907467849964699673.txt' '-o' '/tmp/graph17907467849964699673.bin' '-w' '/tmp/graph17907467849964699673.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph17907467849964699673.bin' '-l' '-1' '-v' '-w' '/tmp/graph17907467849964699673.weights' '-q' '0' '-e' '0.001'
[2024-05-31 05:15:04] [INFO ] Decomposing Gal with order
[2024-05-31 05:15:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 05:15:04] [INFO ] Removed a total of 48 redundant transitions.
[2024-05-31 05:15:04] [INFO ] Flatten gal took : 32 ms
[2024-05-31 05:15:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 64 labels/synchronizations in 5 ms.
[2024-05-31 05:15:04] [INFO ] Time to serialize gal into /tmp/LTL9391265101275246166.gal : 1 ms
[2024-05-31 05:15:04] [INFO ] Time to serialize properties into /tmp/LTL18379376464920459375.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9391265101275246166.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18379376464920459375.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F(("(((((gu0.Cells_0+gu0.Cells_1)+(gu0.Cells_2+gu0.Cells_3))+((gu0.Cells_4+gu0.Cells_5)+(gu0.Cells_6+gu0.Cells_7)))+(((gu0.Cells_...1486
Formula 0 simplified : G(F!"(((((gu1.Columns_0+gu1.Columns_1)+(gu1.Columns_2+gu1.Columns_3))+((gu1.Columns_4+gu1.Columns_5)+(gu1.Columns_6+gu1.Columns_7)))...1479
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2744511777727546227
[2024-05-31 05:15:19] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2744511777727546227
Running compilation step : cd /tmp/ltsmin2744511777727546227;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 170 ms.
Running link step : cd /tmp/ltsmin2744511777727546227;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin2744511777727546227;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(((LTLAPp0==true)||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Sudoku-COL-AN04-LTLCardinality-15 finished in 96627 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' '!(G(F((!p0||G(p1)))))'
[2024-05-31 05:15:35] [INFO ] Flatten gal took : 13 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6424830912841624246
[2024-05-31 05:15:35] [INFO ] Computing symmetric may disable matrix : 64 transitions.
[2024-05-31 05:15:35] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 05:15:35] [INFO ] Computing symmetric may enable matrix : 64 transitions.
[2024-05-31 05:15:35] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 05:15:35] [INFO ] Applying decomposition
[2024-05-31 05:15:35] [INFO ] Computing Do-Not-Accords matrix : 64 transitions.
[2024-05-31 05:15:35] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 05:15:35] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6424830912841624246
Running compilation step : cd /tmp/ltsmin6424830912841624246;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-31 05:15:35] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph3818453515836421720.txt' '-o' '/tmp/graph3818453515836421720.bin' '-w' '/tmp/graph3818453515836421720.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph3818453515836421720.bin' '-l' '-1' '-v' '-w' '/tmp/graph3818453515836421720.weights' '-q' '0' '-e' '0.001'
[2024-05-31 05:15:35] [INFO ] Decomposing Gal with order
[2024-05-31 05:15:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 05:15:36] [INFO ] Removed a total of 48 redundant transitions.
[2024-05-31 05:15:36] [INFO ] Flatten gal took : 21 ms
[2024-05-31 05:15:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 64 labels/synchronizations in 2 ms.
[2024-05-31 05:15:36] [INFO ] Time to serialize gal into /tmp/LTLCardinality1734258577797886743.gal : 1 ms
[2024-05-31 05:15:36] [INFO ] Time to serialize properties into /tmp/LTLCardinality9956726254066665920.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality1734258577797886743.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality9956726254066665920.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 1 LTL properties
Checking formula 0 : !((G(F(("(((((gu0.Cells_0+gu0.Cells_1)+(gu0.Cells_2+gu0.Cells_3))+((gu0.Cells_4+gu0.Cells_5)+(gu0.Cells_6+gu0.Cells_7)))+(((gu0.Cells_...1486
Formula 0 simplified : G(F!"(((((gu1.Columns_0+gu1.Columns_1)+(gu1.Columns_2+gu1.Columns_3))+((gu1.Columns_4+gu1.Columns_5)+(gu1.Columns_6+gu1.Columns_7)))...1479
Compilation finished in 204 ms.
Running link step : cd /tmp/ltsmin6424830912841624246;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin6424830912841624246;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((!(LTLAPp0==true)||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.009: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.010: Initializing POR dependencies: labels 66, guards 64
pins2lts-mc-linux64( 0/ 8), 0.018: LTL layer: formula: [](<>((!(LTLAPp0==true)||[]((LTLAPp1==true)))))
pins2lts-mc-linux64( 0/ 8), 0.018: "[](<>((!(LTLAPp0==true)||[]((LTLAPp1==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.018: Using Spin LTL semantics
pins2lts-mc-linux64( 4/ 8), 0.020: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.019: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.020: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.019: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.020: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.020: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.020: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.025: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.026: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.029: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.029: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.030: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.037: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.037: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.037: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.045: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.045: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.045: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.047: buchi has 3 states
pins2lts-mc-linux64( 0/ 8), 0.060: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.079: There are 67 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.079: State length is 113, there are 70 groups
pins2lts-mc-linux64( 0/ 8), 0.079: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.079: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.079: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.079: Visible groups: 0 / 70, labels: 2 / 67
pins2lts-mc-linux64( 0/ 8), 0.079: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.079: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 4/ 8), 0.133: [Blue] ~9 levels ~960 states ~4464 transitions
pins2lts-mc-linux64( 4/ 8), 0.155: [Blue] ~9 levels ~1920 states ~6104 transitions
pins2lts-mc-linux64( 4/ 8), 0.199: [Blue] ~9 levels ~3840 states ~10656 transitions
pins2lts-mc-linux64( 2/ 8), 0.271: [Blue] ~9 levels ~7680 states ~19160 transitions
pins2lts-mc-linux64( 0/ 8), 0.433: [Blue] ~9 levels ~15360 states ~44352 transitions
pins2lts-mc-linux64( 0/ 8), 0.690: [Blue] ~9 levels ~30720 states ~87944 transitions
pins2lts-mc-linux64( 0/ 8), 1.090: [Blue] ~9 levels ~61440 states ~190408 transitions
pins2lts-mc-linux64( 6/ 8), 1.804: [Blue] ~9 levels ~122880 states ~436552 transitions
pins2lts-mc-linux64( 6/ 8), 3.049: [Blue] ~9 levels ~245760 states ~939336 transitions
pins2lts-mc-linux64( 7/ 8), 5.328: [Blue] ~9 levels ~491520 states ~1956128 transitions
pins2lts-mc-linux64( 7/ 8), 9.394: [Blue] ~9 levels ~983040 states ~4366768 transitions
pins2lts-mc-linux64( 7/ 8), 17.135: [Blue] ~9 levels ~1966080 states ~9131760 transitions
pins2lts-mc-linux64( 0/ 8), 32.958: [Blue] ~9 levels ~3932160 states ~19806016 transitions
pins2lts-mc-linux64( 0/ 8), 66.147: [Blue] ~9 levels ~7864320 states ~42471864 transitions
pins2lts-mc-linux64( 1/ 8), 127.915: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 128.014:
pins2lts-mc-linux64( 0/ 8), 128.014: Explored 13844579 states 82562606 transitions, fanout: 5.964
pins2lts-mc-linux64( 0/ 8), 128.014: Total exploration time 127.900 sec (127.820 sec minimum, 127.859 sec on average)
pins2lts-mc-linux64( 0/ 8), 128.014: States per second: 108245, Transitions per second: 645525
pins2lts-mc-linux64( 0/ 8), 128.014:
pins2lts-mc-linux64( 0/ 8), 128.014: State space has 13845365 states, 13844207 are accepting
pins2lts-mc-linux64( 0/ 8), 128.014: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 128.014: blue states: 13844579 (99.99%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 128.014: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 128.014: all-red states: 13844207 (99.99%), bogus 313 (0.00%)
pins2lts-mc-linux64( 0/ 8), 128.014:
pins2lts-mc-linux64( 0/ 8), 128.014: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 128.014:
pins2lts-mc-linux64( 0/ 8), 128.014: Queue width: 8B, total height: 72, memory: 0.00MB
pins2lts-mc-linux64( 0/ 8), 128.014: Tree memory: 361.6MB, 27.4 B/state, compr.: 6.0%
pins2lts-mc-linux64( 0/ 8), 128.014: Tree fill ratio (roots/leafs): 10.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 128.014: Stored 64 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 128.015: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 128.015: Est. total memory use: 361.6MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin6424830912841624246;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((!(LTLAPp0==true)||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin6424830912841624246;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((!(LTLAPp0==true)||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2024-05-31 05:36:13] [INFO ] Applying decomposition
[2024-05-31 05:36:14] [INFO ] Flatten gal took : 116 ms
[2024-05-31 05:36:14] [INFO ] Decomposing Gal with order
[2024-05-31 05:36:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 05:36:14] [INFO ] Removed a total of 84 redundant transitions.
[2024-05-31 05:36:14] [INFO ] Flatten gal took : 210 ms
[2024-05-31 05:36:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2024-05-31 05:36:14] [INFO ] Time to serialize gal into /tmp/LTLCardinality1546496461501525991.gal : 63 ms
[2024-05-31 05:36:14] [INFO ] Time to serialize properties into /tmp/LTLCardinality11361503994883791305.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality1546496461501525991.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality11361503994883791305.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !((G(F(("(((((gNN0.Cells_0+gNN1.Cells_1)+(gNN2.Cells_2+gNN3.Cells_3))+((gNN4.Cells_4+gNN5.Cells_5)+(gNN6.Cells_6+gNN7.Cells_7)))+(((gN...1712
Formula 0 simplified : G(F!"(((((gNN0.Columns_0+gNN1.Columns_1)+(gNN2.Columns_2+gNN3.Columns_3))+((gNN4.Columns_4+gNN5.Columns_5)+(gNN6.Columns_6+gNN7.Colu...1705
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 409584 deadlock states
Detected timeout of ITS tools.
[2024-05-31 05:57:49] [INFO ] Flatten gal took : 307 ms
[2024-05-31 05:57:49] [INFO ] Input system was already deterministic with 64 transitions.
[2024-05-31 05:57:49] [INFO ] Transformed 112 places.
[2024-05-31 05:57:49] [INFO ] Transformed 64 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-31 05:57:49] [INFO ] Time to serialize gal into /tmp/LTLCardinality6700373784712877391.gal : 5 ms
[2024-05-31 05:57:49] [INFO ] Time to serialize properties into /tmp/LTLCardinality1394772236019196822.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality6700373784712877391.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality1394772236019196822.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F(("(((((Cells_0+Cells_1)+(Cells_2+Cells_3))+((Cells_4+Cells_5)+(Cells_6+Cells_7)))+(((Cells_8+Cells_9)+(Cells_10+Cells_11))+((Ce...1102
Formula 0 simplified : G(F!"(((((Columns_0+Columns_1)+(Columns_2+Columns_3))+((Columns_4+Columns_5)+(Columns_6+Columns_7)))+(((Columns_8+Columns_9)+(Column...1095
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 164360 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15917400 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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-COL-AN04"
export BK_EXAMINATION="LTLCardinality"
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-COL-AN04, examination is LTLCardinality"
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-171690556100272"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-COL-AN04.tgz
mv Sudoku-COL-AN04 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;