Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r487-tall-167912702700155.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is Sudoku-COL-BN16, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r487-tall-167912702700155
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 900K
-rw-r--r-- 1 mcc users 7.4K Feb 26 09:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 26 09:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 26 08:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 08:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 11:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Feb 26 11:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 26 09:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 09:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:17 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 446K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679170412711

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=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-COL-BN16
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-18 20:13:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-18 20:13:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 20:13:34] [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.
[2023-03-18 20:13:34] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-18 20:13:34] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 537 ms
[2023-03-18 20:13:34] [INFO ] Imported 5 HL places and 1 HL transitions for a total of 5120 PT places and 65536.0 transition bindings in 26 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2023-03-18 20:13:34] [INFO ] Built PT skeleton of HLPN with 5 places and 1 transitions 5 arcs in 5 ms.
[2023-03-18 20:13:34] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 8 formulas.
FORMULA Sudoku-COL-BN16-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN16-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN16-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN16-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN16-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN16-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN16-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN16-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 5 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5 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 8 properties that can be checked using skeleton over-approximation.
Computed a total of 5 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5 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 10061 steps, including 38 resets, run finished after 26 ms. (steps per millisecond=386 ) properties (out of 16) seen :10
Incomplete Best-First random walk after 10061 steps, including 38 resets, run finished after 21 ms. (steps per millisecond=479 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10061 steps, including 38 resets, run finished after 13 ms. (steps per millisecond=773 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10061 steps, including 38 resets, run finished after 23 ms. (steps per millisecond=437 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10061 steps, including 38 resets, run finished after 9 ms. (steps per millisecond=1117 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10061 steps, including 38 resets, run finished after 9 ms. (steps per millisecond=1117 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10061 steps, including 38 resets, run finished after 9 ms. (steps per millisecond=1117 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1 rows 5 cols
[2023-03-18 20:13:34] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-18 20:13:35] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-18 20:13:35] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-18 20:13:35] [INFO ] After 83ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :0
Fused 6 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 6 atomic propositions for a total of 8 simplifications.
FORMULA Sudoku-COL-BN16-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN16-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN16-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 20:13:35] [INFO ] Flatten gal took : 15 ms
[2023-03-18 20:13:35] [INFO ] Flatten gal took : 1 ms
Domain [N(16), N(16)] of place Rows breaks symmetries in sort N
[2023-03-18 20:13:35] [INFO ] Unfolded HLPN to a Petri net with 5120 places and 4096 transitions 20480 arcs in 153 ms.
[2023-03-18 20:13:35] [INFO ] Unfolded 5 HLPN properties in 3 ms.
Support contains 5120 out of 5120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 44 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 5120 cols
[2023-03-18 20:13:35] [INFO ] Computed 1024 place invariants in 75 ms
[2023-03-18 20:13:37] [INFO ] Implicit Places using invariants in 1696 ms returned []
[2023-03-18 20:13:37] [INFO ] Invariant cache hit.
[2023-03-18 20:13:37] [INFO ] Implicit Places using invariants and state equation in 479 ms returned []
Implicit Place search using SMT with State Equation took 2190 ms to find 0 implicit places.
[2023-03-18 20:13:37] [INFO ] Invariant cache hit.
[2023-03-18 20:13:40] [INFO ] Dead Transitions using invariants and state equation in 2707 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4945 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Support contains 5120 out of 5120 places after structural reductions.
[2023-03-18 20:13:41] [INFO ] Flatten gal took : 408 ms
[2023-03-18 20:13:41] [INFO ] Flatten gal took : 261 ms
[2023-03-18 20:13:41] [INFO ] Input system was already deterministic with 4096 transitions.
Incomplete random walk after 10000 steps, including 47 resets, run finished after 4511 ms. (steps per millisecond=2 ) properties (out of 11) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 220 ms. (steps per millisecond=45 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 231 ms. (steps per millisecond=43 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 433 ms. (steps per millisecond=23 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 219 ms. (steps per millisecond=45 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 353 ms. (steps per millisecond=28 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 214 ms. (steps per millisecond=46 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 466 ms. (steps per millisecond=21 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-18 20:13:48] [INFO ] Invariant cache hit.
[2023-03-18 20:13:50] [INFO ] [Real]Absence check using 1024 positive place invariants in 346 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 20:14:14] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 20:14:14] [INFO ] After 25069ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 768 out of 5120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Graph (complete) has 16384 edges and 5120 vertex of which 1024 are kept as prefixes of interest. Removing 4096 places using SCC suffix rule.11 ms
Discarding 4096 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 147 ms. Remains 1024 /5120 variables (removed 4096) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 148 ms. Remains : 1024/5120 places, 4096/4096 transitions.
Incomplete random walk after 10000 steps, including 47 resets, run finished after 4319 ms. (steps per millisecond=2 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 242 ms. (steps per millisecond=41 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 230 ms. (steps per millisecond=43 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 383 ms. (steps per millisecond=26 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 217 ms. (steps per millisecond=46 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 287 ms. (steps per millisecond=34 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 220 ms. (steps per millisecond=45 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 464 ms. (steps per millisecond=21 ) properties (out of 7) seen :0
Probabilistic random walk after 199608 steps, saw 199547 distinct states, run finished after 18081 ms. (steps per millisecond=11 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 4096 rows 1024 cols
[2023-03-18 20:14:39] [INFO ] Computed 168 place invariants in 899 ms
[2023-03-18 20:14:40] [INFO ] [Real]Absence check using 0 positive and 168 generalized place invariants in 134 ms returned sat
[2023-03-18 20:14:40] [INFO ] After 466ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-18 20:14:40] [INFO ] [Nat]Absence check using 0 positive and 168 generalized place invariants in 120 ms returned sat
[2023-03-18 20:14:49] [INFO ] After 9020ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :5
[2023-03-18 20:14:50] [INFO ] After 9673ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :5
Attempting to minimize the solution found.
Minimization took 356 ms.
[2023-03-18 20:14:50] [INFO ] After 10485ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :5
Fused 7 Parikh solutions to 1 different solutions.
Finished Parikh walk after 256 steps, including 0 resets, run visited all 5 properties in 41 ms. (steps per millisecond=6 )
Parikh walk visited 5 properties in 43 ms.
Successfully simplified 2 atomic propositions for a total of 5 simplifications.
Computed a total of 5120 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5120 transition count 4096
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G((p0||X(p1)))||(X((p0||X(p1)))&&G(p2))))))'
Support contains 4864 out of 5120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 46 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 5120 cols
[2023-03-18 20:14:51] [INFO ] Computed 1024 place invariants in 25 ms
[2023-03-18 20:14:52] [INFO ] Implicit Places using invariants in 872 ms returned []
[2023-03-18 20:14:52] [INFO ] Invariant cache hit.
[2023-03-18 20:14:53] [INFO ] Implicit Places using invariants and state equation in 897 ms returned []
Implicit Place search using SMT with State Equation took 1772 ms to find 0 implicit places.
[2023-03-18 20:14:53] [INFO ] Invariant cache hit.
[2023-03-18 20:14:55] [INFO ] Dead Transitions using invariants and state equation in 2811 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4631 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 562 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-COL-BN16-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND p2 p0), acceptance={} source=0 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND p2 p0), acceptance={0} source=1 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={0} source=1 dest: 4}, { cond=(AND p2 p0), acceptance={} source=1 dest: 5}, { cond=(AND p2 (NOT p0)), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p2) p0 p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p2 p0 p1), acceptance={0} source=2 dest: 3}, { cond=(AND p2 p0 (NOT p1)), acceptance={0, 1} source=2 dest: 3}, { cond=(AND p2 (NOT p0) p1), acceptance={0} source=2 dest: 4}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 4}, { cond=(AND p2 p0 p1), acceptance={} source=2 dest: 5}, { cond=(AND p2 p0 (NOT p1)), acceptance={1} source=2 dest: 5}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=2 dest: 6}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={1} source=2 dest: 6}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 7}, { cond=(AND p2 (NOT p0)), acceptance={0} source=3 dest: 8}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 9}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=4 dest: 7}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1} source=4 dest: 7}, { cond=(AND p2 (NOT p0) p1), acceptance={0} source=4 dest: 8}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={0, 1} source=4 dest: 8}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=4 dest: 9}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={1} source=4 dest: 9}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=5 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=5 dest: 2}, { cond=(AND p2 p0), acceptance={} source=5 dest: 5}, { cond=(AND p2 (NOT p0)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p2) p0 p1), acceptance={0} source=6 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0, 1} source=6 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=6 dest: 2}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1} source=6 dest: 2}, { cond=(AND p2 p0 p1), acceptance={} source=6 dest: 5}, { cond=(AND p2 p0 (NOT p1)), acceptance={1} source=6 dest: 5}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=6 dest: 6}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={1} source=6 dest: 6}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0, 1} source=7 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1} source=7 dest: 2}, { cond=(AND p2 p0 (NOT p1)), acceptance={0, 1} source=7 dest: 3}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={0, 1} source=7 dest: 4}, { cond=(AND p2 p0 (NOT p1)), acceptance={1} source=7 dest: 5}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={1} source=7 dest: 6}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1} source=8 dest: 7}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={0, 1} source=8 dest: 8}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={1} source=8 dest: 9}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0, 1} source=9 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1} source=9 dest: 2}, { cond=(AND p2 p0 (NOT p1)), acceptance={1} source=9 dest: 5}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={1} source=9 dest: 6}]], initial=0, aps=[p2:(GT (ADD s4352 s4353 s4354 s4355 s4356 s4357 s4358 s4359 s4360 s4361 s4362 s4363 s4364 s4365 s4366 s4367 s4368 s4369 s4370 s4371 s4372 s4373 s4374 s437...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration timeout after 6810 steps with 32 reset in 10001 ms.
Product exploration timeout after 6770 steps with 32 reset in 10019 ms.
Computed a total of 5120 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5120 transition count 4096
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 p2 (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND p2 p0 p1))), (X (AND p2 (NOT p0) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND p2 (NOT p0) p1))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p2 p0))), (X (AND p2 (NOT p0))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 16 factoid took 1107 ms. Reduced automaton from 10 states, 57 edges and 3 AP (stutter sensitive) to 15 states, 83 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 713 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), false, false, (AND p2 (NOT p0) (NOT p1)), false, false, false]
Incomplete random walk after 10000 steps, including 47 resets, run finished after 8090 ms. (steps per millisecond=1 ) properties (out of 14) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1139 ms. (steps per millisecond=8 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2095 ms. (steps per millisecond=4 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1018 ms. (steps per millisecond=9 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1954 ms. (steps per millisecond=5 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2089 ms. (steps per millisecond=4 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2138 ms. (steps per millisecond=4 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1991 ms. (steps per millisecond=5 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1908 ms. (steps per millisecond=5 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-18 20:15:47] [INFO ] Invariant cache hit.
[2023-03-18 20:15:56] [INFO ] [Real]Absence check using 1024 positive place invariants in 302 ms returned sat
[2023-03-18 20:16:19] [INFO ] After 25023ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-18 20:16:21] [INFO ] [Nat]Absence check using 1024 positive place invariants in 335 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:621)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 20:16:44] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 20:16:44] [INFO ] After 25029ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4864 out of 5120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 56 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Incomplete random walk after 10000 steps, including 47 resets, run finished after 8127 ms. (steps per millisecond=1 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1147 ms. (steps per millisecond=8 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2214 ms. (steps per millisecond=4 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1075 ms. (steps per millisecond=9 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2065 ms. (steps per millisecond=4 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2248 ms. (steps per millisecond=4 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2275 ms. (steps per millisecond=4 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2098 ms. (steps per millisecond=4 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2025 ms. (steps per millisecond=4 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 194312 steps, run timeout after 69092 ms. (steps per millisecond=2 ) properties seen :{}
Probabilistic random walk after 194312 steps, saw 194254 distinct states, run finished after 69096 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 8 properties.
[2023-03-18 20:18:17] [INFO ] Invariant cache hit.
[2023-03-18 20:18:25] [INFO ] [Real]Absence check using 1024 positive place invariants in 338 ms returned sat
[2023-03-18 20:18:49] [INFO ] After 25018ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-18 20:18:50] [INFO ] [Nat]Absence check using 1024 positive place invariants in 326 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 20:19:14] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 20:19:14] [INFO ] After 25059ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4864 out of 5120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 47 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 41 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2023-03-18 20:19:14] [INFO ] Invariant cache hit.
[2023-03-18 20:19:15] [INFO ] Implicit Places using invariants in 854 ms returned []
[2023-03-18 20:19:15] [INFO ] Invariant cache hit.
[2023-03-18 20:19:15] [INFO ] Implicit Places using invariants and state equation in 893 ms returned []
Implicit Place search using SMT with State Equation took 1754 ms to find 0 implicit places.
[2023-03-18 20:19:16] [INFO ] Redundant transitions in 263 ms returned []
[2023-03-18 20:19:16] [INFO ] Invariant cache hit.
[2023-03-18 20:19:19] [INFO ] Dead Transitions using invariants and state equation in 2757 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4822 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND p2 p0 p1))), (X (AND p2 (NOT p0) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND p2 (NOT p0) p1))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p2 p0))), (X (AND p2 (NOT p0))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p2 (NOT p1) (NOT p0)))), (F (NOT (AND p2 (NOT p1)))), (F (AND (NOT p2) (NOT p1) (NOT p0))), (F (AND (NOT p2) p1 (NOT p0))), (F (NOT p2)), (F (AND (NOT p2) (NOT p0)))]
Knowledge based reduction with 16 factoid took 1218 ms. Reduced automaton from 15 states, 83 edges and 3 AP (stutter insensitive) to 15 states, 83 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 614 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), false, false, (AND p2 (NOT p0) (NOT p1)), false, false, false]
Stuttering acceptance computed with spot in 615 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), false, false, (AND p2 (NOT p0) (NOT p1)), false, false, false]
[2023-03-18 20:19:23] [INFO ] Invariant cache hit.
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 4864 out of 5120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 82 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2023-03-18 20:19:38] [INFO ] Invariant cache hit.
[2023-03-18 20:19:39] [INFO ] Implicit Places using invariants in 804 ms returned []
[2023-03-18 20:19:39] [INFO ] Invariant cache hit.
[2023-03-18 20:19:40] [INFO ] Implicit Places using invariants and state equation in 806 ms returned []
Implicit Place search using SMT with State Equation took 1612 ms to find 0 implicit places.
[2023-03-18 20:19:40] [INFO ] Redundant transitions in 257 ms returned []
[2023-03-18 20:19:40] [INFO ] Invariant cache hit.
[2023-03-18 20:19:43] [INFO ] Dead Transitions using invariants and state equation in 2673 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4639 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Computed a total of 5120 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5120 transition count 4096
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 p2 (NOT p0) (NOT p1)), (X p2), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND p2 p1))), (X (AND p2 (NOT p1) (NOT p0))), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT (AND p2 p1 p0))), (X (AND p2 (NOT p1))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND p2 p1 (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 1264 ms. Reduced automaton from 15 states, 83 edges and 3 AP (stutter insensitive) to 15 states, 83 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 694 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), false, false, (AND p2 (NOT p0) (NOT p1)), false, false, false]
Incomplete random walk after 10000 steps, including 47 resets, run finished after 8199 ms. (steps per millisecond=1 ) properties (out of 14) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1142 ms. (steps per millisecond=8 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2185 ms. (steps per millisecond=4 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1066 ms. (steps per millisecond=9 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2044 ms. (steps per millisecond=4 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2174 ms. (steps per millisecond=4 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2238 ms. (steps per millisecond=4 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2114 ms. (steps per millisecond=4 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1980 ms. (steps per millisecond=5 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-18 20:20:17] [INFO ] Invariant cache hit.
[2023-03-18 20:20:25] [INFO ] [Real]Absence check using 1024 positive place invariants in 346 ms returned sat
[2023-03-18 20:20:49] [INFO ] After 25023ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-18 20:20:50] [INFO ] [Nat]Absence check using 1024 positive place invariants in 332 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 20:21:14] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 20:21:14] [INFO ] After 25035ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4864 out of 5120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 37 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Incomplete random walk after 10000 steps, including 47 resets, run finished after 8134 ms. (steps per millisecond=1 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1167 ms. (steps per millisecond=8 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2174 ms. (steps per millisecond=4 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1062 ms. (steps per millisecond=9 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2032 ms. (steps per millisecond=4 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2173 ms. (steps per millisecond=4 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2241 ms. (steps per millisecond=4 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2073 ms. (steps per millisecond=4 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1982 ms. (steps per millisecond=5 ) properties (out of 8) seen :0
Probabilistic random walk after 199608 steps, saw 199550 distinct states, run finished after 69013 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 8 properties.
[2023-03-18 20:22:46] [INFO ] Invariant cache hit.
[2023-03-18 20:22:55] [INFO ] [Real]Absence check using 1024 positive place invariants in 370 ms returned sat
[2023-03-18 20:23:18] [INFO ] After 25019ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-18 20:23:19] [INFO ] [Nat]Absence check using 1024 positive place invariants in 352 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:621)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 20:23:43] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 20:23:43] [INFO ] After 25025ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 6 ms.
Support contains 4864 out of 5120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 38 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 34 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2023-03-18 20:23:43] [INFO ] Invariant cache hit.
[2023-03-18 20:23:44] [INFO ] Implicit Places using invariants in 789 ms returned []
[2023-03-18 20:23:44] [INFO ] Invariant cache hit.
[2023-03-18 20:23:45] [INFO ] Implicit Places using invariants and state equation in 863 ms returned []
Implicit Place search using SMT with State Equation took 1654 ms to find 0 implicit places.
[2023-03-18 20:23:45] [INFO ] Redundant transitions in 142 ms returned []
[2023-03-18 20:23:45] [INFO ] Invariant cache hit.
[2023-03-18 20:23:47] [INFO ] Dead Transitions using invariants and state equation in 2605 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4447 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X p2), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND p2 p1))), (X (AND p2 (NOT p1) (NOT p0))), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT (AND p2 p1 p0))), (X (AND p2 (NOT p1))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND p2 p1 (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p2 (NOT p1) (NOT p0)))), (F (NOT (AND p2 (NOT p1)))), (F (AND (NOT p2) (NOT p1) (NOT p0))), (F (AND (NOT p2) p1 (NOT p0))), (F (NOT p2)), (F (AND (NOT p2) (NOT p0)))]
Knowledge based reduction with 17 factoid took 1291 ms. Reduced automaton from 15 states, 83 edges and 3 AP (stutter insensitive) to 15 states, 83 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 603 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), false, false, (AND p2 (NOT p0) (NOT p1)), false, false, false]
Stuttering acceptance computed with spot in 643 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), false, false, (AND p2 (NOT p0) (NOT p1)), false, false, false]
[2023-03-18 20:23:52] [INFO ] Invariant cache hit.
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 724 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), false, false, (AND p2 (NOT p0) (NOT p1)), false, false, false]
Product exploration timeout after 5580 steps with 26 reset in 10005 ms.
Product exploration timeout after 5560 steps with 26 reset in 10013 ms.
Support contains 4864 out of 5120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 46 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2023-03-18 20:24:28] [INFO ] Invariant cache hit.
[2023-03-18 20:24:29] [INFO ] Implicit Places using invariants in 866 ms returned []
[2023-03-18 20:24:29] [INFO ] Invariant cache hit.
[2023-03-18 20:24:30] [INFO ] Implicit Places using invariants and state equation in 805 ms returned []
Implicit Place search using SMT with State Equation took 1672 ms to find 0 implicit places.
[2023-03-18 20:24:30] [INFO ] Redundant transitions in 146 ms returned []
[2023-03-18 20:24:30] [INFO ] Invariant cache hit.
[2023-03-18 20:24:32] [INFO ] Dead Transitions using invariants and state equation in 2783 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4653 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Treatment of property Sudoku-COL-BN16-LTLCardinality-01 finished in 582374 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 4096 out of 5120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 297 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2023-03-18 20:24:33] [INFO ] Invariant cache hit.
[2023-03-18 20:24:35] [INFO ] Implicit Places using invariants in 1777 ms returned []
[2023-03-18 20:24:35] [INFO ] Invariant cache hit.
[2023-03-18 20:24:37] [INFO ] Implicit Places using invariants and state equation in 1594 ms returned []
Implicit Place search using SMT with State Equation took 3375 ms to find 0 implicit places.
[2023-03-18 20:24:37] [INFO ] Redundant transitions in 148 ms returned []
[2023-03-18 20:24:37] [INFO ] Invariant cache hit.
[2023-03-18 20:24:40] [INFO ] Dead Transitions using invariants and state equation in 2647 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6480 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-BN16-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 3 (ADD s256 s257 s258 s259 s260 s261 s262 s263 s264 s265 s266 s267 s268 s269 s270 s271 s272 s273 s274 s275 s276 s277 s278 s279 s280 s281 s282 s283...], 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 timeout after 22590 steps with 826 reset in 10010 ms.
Product exploration timeout after 23030 steps with 764 reset in 10003 ms.
Computed a total of 5120 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5120 transition count 4096
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 123 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 63 ms :[(NOT p0), (NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=0 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 127 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 84 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
[2023-03-18 20:25:04] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Support contains 4096 out of 5120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 123 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2023-03-18 20:25:19] [INFO ] Invariant cache hit.
[2023-03-18 20:25:21] [INFO ] Implicit Places using invariants in 1714 ms returned []
[2023-03-18 20:25:21] [INFO ] Invariant cache hit.
[2023-03-18 20:25:23] [INFO ] Implicit Places using invariants and state equation in 1670 ms returned []
Implicit Place search using SMT with State Equation took 3411 ms to find 0 implicit places.
[2023-03-18 20:25:23] [INFO ] Redundant transitions in 141 ms returned []
[2023-03-18 20:25:23] [INFO ] Invariant cache hit.
[2023-03-18 20:25:26] [INFO ] Dead Transitions using invariants and state equation in 3203 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6884 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Computed a total of 5120 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5120 transition count 4096
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 103 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 54 ms :[(NOT p0), (NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=0 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 112 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 48 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0), (NOT p0)]
[2023-03-18 20:25:30] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Product exploration timeout after 23170 steps with 820 reset in 10006 ms.
Product exploration timeout after 22850 steps with 786 reset in 10001 ms.
Support contains 4096 out of 5120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 118 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2023-03-18 20:26:05] [INFO ] Invariant cache hit.
[2023-03-18 20:26:07] [INFO ] Implicit Places using invariants in 1689 ms returned []
[2023-03-18 20:26:07] [INFO ] Invariant cache hit.
[2023-03-18 20:26:08] [INFO ] Implicit Places using invariants and state equation in 1599 ms returned []
Implicit Place search using SMT with State Equation took 3290 ms to find 0 implicit places.
[2023-03-18 20:26:09] [INFO ] Redundant transitions in 143 ms returned []
[2023-03-18 20:26:09] [INFO ] Invariant cache hit.
[2023-03-18 20:26:11] [INFO ] Dead Transitions using invariants and state equation in 2744 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6302 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Treatment of property Sudoku-COL-BN16-LTLCardinality-07 finished in 98540 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||X(G((p1 U p2)))))))'
Support contains 768 out of 5120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Reduce places removed 4096 places and 0 transitions.
Iterating post reduction 0 with 4096 rules applied. Total rules applied 4096 place count 1024 transition count 4096
Applied a total of 4096 rules in 44 ms. Remains 1024 /5120 variables (removed 4096) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 1024 cols
[2023-03-18 20:26:12] [INFO ] Computed 168 place invariants in 632 ms
[2023-03-18 20:26:13] [INFO ] Implicit Places using invariants in 1108 ms returned []
[2023-03-18 20:26:13] [INFO ] Invariant cache hit.
[2023-03-18 20:26:15] [INFO ] Implicit Places using invariants and state equation in 2286 ms returned []
Implicit Place search using SMT with State Equation took 3396 ms to find 0 implicit places.
[2023-03-18 20:26:15] [INFO ] Invariant cache hit.
[2023-03-18 20:26:16] [INFO ] Dead Transitions using invariants and state equation in 1407 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1024/5120 places, 4096/4096 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4853 ms. Remains : 1024/5120 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), true, (NOT p2)]
Running random walk in product with property : Sudoku-COL-BN16-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(OR p2 p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ 1 (ADD s256 s257 s258 s259 s260 s261 s262 s263 s264 s265 s266 s267 s268 s269 s270 s271 s272 s273 s274 s275 s276 s277 s278 s279 s280 s281 s282 s283...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration timeout after 15120 steps with 5040 reset in 10001 ms.
Product exploration timeout after 15120 steps with 5040 reset in 10003 ms.
Computed a total of 1024 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1024 transition count 4096
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p2 p1), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 183 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 219 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), true, (NOT p2)]
Incomplete random walk after 10000 steps, including 47 resets, run finished after 3700 ms. (steps per millisecond=2 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 199 ms. (steps per millisecond=50 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 519 ms. (steps per millisecond=19 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 525 ms. (steps per millisecond=19 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 517 ms. (steps per millisecond=19 ) properties (out of 4) seen :0
Probabilistic random walk after 219581 steps, saw 219513 distinct states, run finished after 15019 ms. (steps per millisecond=14 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-18 20:26:58] [INFO ] Invariant cache hit.
[2023-03-18 20:26:59] [INFO ] [Real]Absence check using 0 positive and 168 generalized place invariants in 123 ms returned sat
[2023-03-18 20:26:59] [INFO ] After 404ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2023-03-18 20:26:59] [INFO ] [Nat]Absence check using 0 positive and 168 generalized place invariants in 122 ms returned sat
[2023-03-18 20:27:05] [INFO ] After 5134ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-18 20:27:05] [INFO ] After 5552ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 293 ms.
[2023-03-18 20:27:05] [INFO ] After 6163ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 1 different solutions.
Finished Parikh walk after 256 steps, including 0 resets, run visited all 3 properties in 33 ms. (steps per millisecond=7 )
Parikh walk visited 3 properties in 33 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 p1), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p1 (NOT p2))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p1) (NOT p2))), (F (NOT (OR p1 p2)))]
Knowledge based reduction with 5 factoid took 221 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[true, (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 149 ms :[true, (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 512 out of 1024 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 4096/4096 transitions.
Applied a total of 0 rules in 22 ms. Remains 1024 /1024 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2023-03-18 20:27:06] [INFO ] Invariant cache hit.
[2023-03-18 20:27:06] [INFO ] Implicit Places using invariants in 482 ms returned []
[2023-03-18 20:27:06] [INFO ] Invariant cache hit.
[2023-03-18 20:27:08] [INFO ] Implicit Places using invariants and state equation in 2026 ms returned []
Implicit Place search using SMT with State Equation took 2510 ms to find 0 implicit places.
[2023-03-18 20:27:08] [INFO ] Invariant cache hit.
[2023-03-18 20:27:10] [INFO ] Dead Transitions using invariants and state equation in 1411 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3944 ms. Remains : 1024/1024 places, 4096/4096 transitions.
Computed a total of 1024 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1024 transition count 4096
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p2), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[true, (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 47 resets, run finished after 3412 ms. (steps per millisecond=2 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 202 ms. (steps per millisecond=49 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 214 ms. (steps per millisecond=46 ) properties (out of 2) seen :0
Probabilistic random walk after 174742 steps, saw 174688 distinct states, run finished after 9035 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-18 20:27:24] [INFO ] Invariant cache hit.
[2023-03-18 20:27:24] [INFO ] [Real]Absence check using 0 positive and 168 generalized place invariants in 130 ms returned sat
[2023-03-18 20:27:49] [INFO ] After 24706ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-18 20:27:49] [INFO ] After 24714ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-18 20:27:49] [INFO ] After 25037ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 512 out of 1024 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1024/1024 places, 4096/4096 transitions.
Applied a total of 0 rules in 143 ms. Remains 1024 /1024 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 143 ms. Remains : 1024/1024 places, 4096/4096 transitions.
Incomplete random walk after 10000 steps, including 47 resets, run finished after 3457 ms. (steps per millisecond=2 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 224 ms. (steps per millisecond=44 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 208 ms. (steps per millisecond=48 ) properties (out of 2) seen :0
Probabilistic random walk after 197311 steps, saw 197251 distinct states, run finished after 9042 ms. (steps per millisecond=21 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-18 20:28:02] [INFO ] Invariant cache hit.
[2023-03-18 20:28:02] [INFO ] [Real]Absence check using 0 positive and 168 generalized place invariants in 127 ms returned sat
[2023-03-18 20:28:27] [INFO ] After 24715ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-18 20:28:27] [INFO ] After 24723ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-18 20:28:27] [INFO ] After 25031ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 512 out of 1024 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1024/1024 places, 4096/4096 transitions.
Applied a total of 0 rules in 60 ms. Remains 1024 /1024 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 1024/1024 places, 4096/4096 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1024/1024 places, 4096/4096 transitions.
Applied a total of 0 rules in 60 ms. Remains 1024 /1024 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2023-03-18 20:28:27] [INFO ] Invariant cache hit.
[2023-03-18 20:28:28] [INFO ] Implicit Places using invariants in 783 ms returned []
[2023-03-18 20:28:28] [INFO ] Invariant cache hit.
[2023-03-18 20:28:32] [INFO ] Implicit Places using invariants and state equation in 3998 ms returned []
Implicit Place search using SMT with State Equation took 4781 ms to find 0 implicit places.
[2023-03-18 20:28:32] [INFO ] Redundant transitions in 145 ms returned []
[2023-03-18 20:28:32] [INFO ] Invariant cache hit.
[2023-03-18 20:28:34] [INFO ] Dead Transitions using invariants and state equation in 1434 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6431 ms. Remains : 1024/1024 places, 4096/4096 transitions.
Applied a total of 0 rules in 67 ms. Remains 1024 /1024 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-18 20:28:34] [INFO ] Invariant cache hit.
[2023-03-18 20:28:34] [INFO ] [Real]Absence check using 0 positive and 168 generalized place invariants in 122 ms returned sat
[2023-03-18 20:32:19] [INFO ] After 225019ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Knowledge obtained : [(AND p0 p2), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[true, (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 140 ms :[true, (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 239 ms :[true, (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration timeout after 15190 steps with 5063 reset in 10007 ms.
Product exploration timeout after 15000 steps with 5000 reset in 10008 ms.
Applying partial POR strategy [true, false, true, false, false]
Stuttering acceptance computed with spot in 128 ms :[true, (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 512 out of 1024 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1024/1024 places, 4096/4096 transitions.
Applied a total of 0 rules in 132 ms. Remains 1024 /1024 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2023-03-18 20:32:40] [INFO ] Redundant transitions in 142 ms returned []
[2023-03-18 20:32:40] [INFO ] Invariant cache hit.
[2023-03-18 20:32:41] [INFO ] Dead Transitions using invariants and state equation in 1407 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1695 ms. Remains : 1024/1024 places, 4096/4096 transitions.
Support contains 512 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 4096/4096 transitions.
Applied a total of 0 rules in 47 ms. Remains 1024 /1024 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2023-03-18 20:32:41] [INFO ] Invariant cache hit.
[2023-03-18 20:32:42] [INFO ] Implicit Places using invariants in 806 ms returned []
[2023-03-18 20:32:42] [INFO ] Invariant cache hit.
[2023-03-18 20:32:46] [INFO ] Implicit Places using invariants and state equation in 3378 ms returned []
Implicit Place search using SMT with State Equation took 4185 ms to find 0 implicit places.
[2023-03-18 20:32:46] [INFO ] Invariant cache hit.
[2023-03-18 20:32:47] [INFO ] Dead Transitions using invariants and state equation in 1543 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5777 ms. Remains : 1024/1024 places, 4096/4096 transitions.
Treatment of property Sudoku-COL-BN16-LTLCardinality-08 finished in 395867 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 4352 out of 5120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 84 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 5120 cols
[2023-03-18 20:32:48] [INFO ] Computed 1024 place invariants in 24 ms
[2023-03-18 20:32:49] [INFO ] Implicit Places using invariants in 1417 ms returned []
[2023-03-18 20:32:49] [INFO ] Invariant cache hit.
[2023-03-18 20:32:50] [INFO ] Implicit Places using invariants and state equation in 1454 ms returned []
Implicit Place search using SMT with State Equation took 2873 ms to find 0 implicit places.
[2023-03-18 20:32:50] [INFO ] Invariant cache hit.
[2023-03-18 20:32:53] [INFO ] Dead Transitions using invariants and state equation in 2769 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5726 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : Sudoku-COL-BN16-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (LEQ 1 (ADD s256 s257 s258 s259 s260 s261 s262 s263 s264 s265 s266 s267 s268 s269 s270 s271 s272 s273 s274 s275 s276 s277 s278 s279 s280 s281 s282...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 15710 steps with 7855 reset in 10003 ms.
Product exploration timeout after 15630 steps with 7815 reset in 10003 ms.
Computed a total of 5120 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5120 transition count 4096
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 50 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-BN16-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-BN16-LTLCardinality-10 finished in 28043 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 256 out of 5120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Reduce places removed 4096 places and 0 transitions.
Iterating post reduction 0 with 4096 rules applied. Total rules applied 4096 place count 1024 transition count 4096
Applied a total of 4096 rules in 201 ms. Remains 1024 /5120 variables (removed 4096) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 1024 cols
[2023-03-18 20:33:16] [INFO ] Computed 168 place invariants in 604 ms
[2023-03-18 20:33:17] [INFO ] Implicit Places using invariants in 1637 ms returned []
[2023-03-18 20:33:17] [INFO ] Invariant cache hit.
[2023-03-18 20:33:21] [INFO ] Implicit Places using invariants and state equation in 3559 ms returned []
Implicit Place search using SMT with State Equation took 5199 ms to find 0 implicit places.
[2023-03-18 20:33:21] [INFO ] Invariant cache hit.
[2023-03-18 20:33:22] [INFO ] Dead Transitions using invariants and state equation in 1474 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1024/5120 places, 4096/4096 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6875 ms. Remains : 1024/5120 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-BN16-LTLCardinality-11 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:(GT 3 (ADD s512 s513 s514 s515 s516 s517 s518 s519 s520 s521 s522 s523 s524 s525 s526 s527 s528 s529 s530 s531 s532 s533 s534 s535 s536 s537 s538 s539 ...], 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 1 steps with 0 reset in 6 ms.
FORMULA Sudoku-COL-BN16-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-BN16-LTLCardinality-11 finished in 6971 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G((p0||X(p1)))||(X((p0||X(p1)))&&G(p2))))))'
Found a Lengthening insensitive property : Sudoku-COL-BN16-LTLCardinality-01
Stuttering acceptance computed with spot in 418 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Support contains 4864 out of 5120 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 50 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 5120 cols
[2023-03-18 20:33:23] [INFO ] Computed 1024 place invariants in 21 ms
[2023-03-18 20:33:24] [INFO ] Implicit Places using invariants in 812 ms returned []
[2023-03-18 20:33:24] [INFO ] Invariant cache hit.
[2023-03-18 20:33:25] [INFO ] Implicit Places using invariants and state equation in 781 ms returned []
Implicit Place search using SMT with State Equation took 1594 ms to find 0 implicit places.
[2023-03-18 20:33:25] [INFO ] Invariant cache hit.
[2023-03-18 20:33:28] [INFO ] Dead Transitions using invariants and state equation in 2936 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 4582 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Running random walk in product with property : Sudoku-COL-BN16-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND p2 p0), acceptance={} source=0 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND p2 p0), acceptance={0} source=1 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={0} source=1 dest: 4}, { cond=(AND p2 p0), acceptance={} source=1 dest: 5}, { cond=(AND p2 (NOT p0)), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p2) p0 p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p2 p0 p1), acceptance={0} source=2 dest: 3}, { cond=(AND p2 p0 (NOT p1)), acceptance={0, 1} source=2 dest: 3}, { cond=(AND p2 (NOT p0) p1), acceptance={0} source=2 dest: 4}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 4}, { cond=(AND p2 p0 p1), acceptance={} source=2 dest: 5}, { cond=(AND p2 p0 (NOT p1)), acceptance={1} source=2 dest: 5}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=2 dest: 6}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={1} source=2 dest: 6}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 7}, { cond=(AND p2 (NOT p0)), acceptance={0} source=3 dest: 8}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 9}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=4 dest: 7}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1} source=4 dest: 7}, { cond=(AND p2 (NOT p0) p1), acceptance={0} source=4 dest: 8}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={0, 1} source=4 dest: 8}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=4 dest: 9}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={1} source=4 dest: 9}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=5 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=5 dest: 2}, { cond=(AND p2 p0), acceptance={} source=5 dest: 5}, { cond=(AND p2 (NOT p0)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p2) p0 p1), acceptance={0} source=6 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0, 1} source=6 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=6 dest: 2}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1} source=6 dest: 2}, { cond=(AND p2 p0 p1), acceptance={} source=6 dest: 5}, { cond=(AND p2 p0 (NOT p1)), acceptance={1} source=6 dest: 5}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=6 dest: 6}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={1} source=6 dest: 6}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0, 1} source=7 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1} source=7 dest: 2}, { cond=(AND p2 p0 (NOT p1)), acceptance={0, 1} source=7 dest: 3}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={0, 1} source=7 dest: 4}, { cond=(AND p2 p0 (NOT p1)), acceptance={1} source=7 dest: 5}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={1} source=7 dest: 6}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1} source=8 dest: 7}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={0, 1} source=8 dest: 8}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={1} source=8 dest: 9}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0, 1} source=9 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1} source=9 dest: 2}, { cond=(AND p2 p0 (NOT p1)), acceptance={1} source=9 dest: 5}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={1} source=9 dest: 6}]], initial=0, aps=[p2:(GT (ADD s4352 s4353 s4354 s4355 s4356 s4357 s4358 s4359 s4360 s4361 s4362 s4363 s4364 s4365 s4366 s4367 s4368 s4369 s4370 s4371 s4372 s4373 s4374 s437...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration timeout after 5940 steps with 28 reset in 10013 ms.
Product exploration timeout after 5940 steps with 28 reset in 10017 ms.
Computed a total of 5120 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5120 transition count 4096
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 p2 (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND p2 p0 p1))), (X (AND p2 (NOT p0) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND p2 (NOT p0) p1))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p2 p0))), (X (AND p2 (NOT p0))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 16 factoid took 1458 ms. Reduced automaton from 10 states, 57 edges and 3 AP (stutter sensitive) to 15 states, 83 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 622 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), false, false, (AND p2 (NOT p0) (NOT p1)), false, false, false]
Incomplete random walk after 10000 steps, including 47 resets, run finished after 8633 ms. (steps per millisecond=1 ) properties (out of 14) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1156 ms. (steps per millisecond=8 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2255 ms. (steps per millisecond=4 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1092 ms. (steps per millisecond=9 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2097 ms. (steps per millisecond=4 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2235 ms. (steps per millisecond=4 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2289 ms. (steps per millisecond=4 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2130 ms. (steps per millisecond=4 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2016 ms. (steps per millisecond=4 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-18 20:34:21] [INFO ] Invariant cache hit.
[2023-03-18 20:34:30] [INFO ] [Real]Absence check using 1024 positive place invariants in 331 ms returned sat
[2023-03-18 20:34:53] [INFO ] After 25024ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-18 20:34:55] [INFO ] [Nat]Absence check using 1024 positive place invariants in 329 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 20:35:18] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 20:35:18] [INFO ] After 25036ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4864 out of 5120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 34 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Incomplete random walk after 10000 steps, including 47 resets, run finished after 8587 ms. (steps per millisecond=1 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1141 ms. (steps per millisecond=8 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2201 ms. (steps per millisecond=4 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1069 ms. (steps per millisecond=9 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2050 ms. (steps per millisecond=4 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2211 ms. (steps per millisecond=4 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2254 ms. (steps per millisecond=4 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2120 ms. (steps per millisecond=4 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2039 ms. (steps per millisecond=4 ) properties (out of 8) seen :0
Probabilistic random walk after 164033 steps, saw 163985 distinct states, run finished after 69079 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 8 properties.
[2023-03-18 20:36:51] [INFO ] Invariant cache hit.
[2023-03-18 20:37:00] [INFO ] [Real]Absence check using 1024 positive place invariants in 337 ms returned sat
[2023-03-18 20:37:23] [INFO ] After 25024ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-18 20:37:25] [INFO ] [Nat]Absence check using 1024 positive place invariants in 339 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 20:37:48] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 20:37:48] [INFO ] After 25021ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4864 out of 5120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 35 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 33 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2023-03-18 20:37:48] [INFO ] Invariant cache hit.
[2023-03-18 20:37:49] [INFO ] Implicit Places using invariants in 789 ms returned []
[2023-03-18 20:37:49] [INFO ] Invariant cache hit.
[2023-03-18 20:37:50] [INFO ] Implicit Places using invariants and state equation in 788 ms returned []
Implicit Place search using SMT with State Equation took 1578 ms to find 0 implicit places.
[2023-03-18 20:37:50] [INFO ] Redundant transitions in 143 ms returned []
[2023-03-18 20:37:50] [INFO ] Invariant cache hit.
[2023-03-18 20:37:53] [INFO ] Dead Transitions using invariants and state equation in 2748 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4512 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND p2 p0 p1))), (X (AND p2 (NOT p0) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND p2 (NOT p0) p1))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p2 p0))), (X (AND p2 (NOT p0))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p2 (NOT p1) (NOT p0)))), (F (NOT (AND p2 (NOT p1)))), (F (AND (NOT p2) (NOT p1) (NOT p0))), (F (AND (NOT p2) p1 (NOT p0))), (F (NOT p2)), (F (AND (NOT p2) (NOT p0)))]
Knowledge based reduction with 16 factoid took 1177 ms. Reduced automaton from 15 states, 83 edges and 3 AP (stutter insensitive) to 15 states, 83 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 594 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), false, false, (AND p2 (NOT p0) (NOT p1)), false, false, false]
Stuttering acceptance computed with spot in 545 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), false, false, (AND p2 (NOT p0) (NOT p1)), false, false, false]
[2023-03-18 20:37:57] [INFO ] Invariant cache hit.
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 4864 out of 5120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 43 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2023-03-18 20:38:12] [INFO ] Invariant cache hit.
[2023-03-18 20:38:13] [INFO ] Implicit Places using invariants in 794 ms returned []
[2023-03-18 20:38:13] [INFO ] Invariant cache hit.
[2023-03-18 20:38:14] [INFO ] Implicit Places using invariants and state equation in 784 ms returned []
Implicit Place search using SMT with State Equation took 1588 ms to find 0 implicit places.
[2023-03-18 20:38:14] [INFO ] Redundant transitions in 149 ms returned []
[2023-03-18 20:38:14] [INFO ] Invariant cache hit.
[2023-03-18 20:38:17] [INFO ] Dead Transitions using invariants and state equation in 2841 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4634 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Computed a total of 5120 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5120 transition count 4096
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 p2 (NOT p0) (NOT p1)), (X p2), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND p2 p1))), (X (AND p2 (NOT p1) (NOT p0))), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT (AND p2 p1 p0))), (X (AND p2 (NOT p1))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND p2 p1 (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 1261 ms. Reduced automaton from 15 states, 83 edges and 3 AP (stutter insensitive) to 15 states, 83 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 600 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), false, false, (AND p2 (NOT p0) (NOT p1)), false, false, false]
Incomplete random walk after 10000 steps, including 47 resets, run finished after 8540 ms. (steps per millisecond=1 ) properties (out of 14) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1140 ms. (steps per millisecond=8 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2217 ms. (steps per millisecond=4 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1067 ms. (steps per millisecond=9 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2072 ms. (steps per millisecond=4 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2205 ms. (steps per millisecond=4 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2257 ms. (steps per millisecond=4 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2137 ms. (steps per millisecond=4 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2010 ms. (steps per millisecond=4 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-18 20:38:52] [INFO ] Invariant cache hit.
[2023-03-18 20:39:01] [INFO ] [Real]Absence check using 1024 positive place invariants in 359 ms returned sat
[2023-03-18 20:39:24] [INFO ] After 25018ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-18 20:39:26] [INFO ] [Nat]Absence check using 1024 positive place invariants in 335 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 20:39:49] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 20:39:49] [INFO ] After 25049ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4864 out of 5120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 40 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Incomplete random walk after 10000 steps, including 47 resets, run finished after 8576 ms. (steps per millisecond=1 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1146 ms. (steps per millisecond=8 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2247 ms. (steps per millisecond=4 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1089 ms. (steps per millisecond=9 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2085 ms. (steps per millisecond=4 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2227 ms. (steps per millisecond=4 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2314 ms. (steps per millisecond=4 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2120 ms. (steps per millisecond=4 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2047 ms. (steps per millisecond=4 ) properties (out of 8) seen :0
Probabilistic random walk after 171204 steps, saw 171154 distinct states, run finished after 69242 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 8 properties.
[2023-03-18 20:41:22] [INFO ] Invariant cache hit.
[2023-03-18 20:41:30] [INFO ] [Real]Absence check using 1024 positive place invariants in 349 ms returned sat
[2023-03-18 20:41:54] [INFO ] After 25031ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-18 20:41:55] [INFO ] [Nat]Absence check using 1024 positive place invariants in 335 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 20:42:19] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 20:42:19] [INFO ] After 25032ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4864 out of 5120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 35 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 30 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2023-03-18 20:42:19] [INFO ] Invariant cache hit.
[2023-03-18 20:42:20] [INFO ] Implicit Places using invariants in 799 ms returned []
[2023-03-18 20:42:20] [INFO ] Invariant cache hit.
[2023-03-18 20:42:21] [INFO ] Implicit Places using invariants and state equation in 864 ms returned []
Implicit Place search using SMT with State Equation took 1665 ms to find 0 implicit places.
[2023-03-18 20:42:21] [INFO ] Redundant transitions in 148 ms returned []
[2023-03-18 20:42:21] [INFO ] Invariant cache hit.
[2023-03-18 20:42:24] [INFO ] Dead Transitions using invariants and state equation in 2733 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4587 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X p2), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND p2 p1))), (X (AND p2 (NOT p1) (NOT p0))), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT (AND p2 p1 p0))), (X (AND p2 (NOT p1))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND p2 p1 (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p2 (NOT p1) (NOT p0)))), (F (NOT (AND p2 (NOT p1)))), (F (AND (NOT p2) (NOT p1) (NOT p0))), (F (AND (NOT p2) p1 (NOT p0))), (F (NOT p2)), (F (AND (NOT p2) (NOT p0)))]
Knowledge based reduction with 17 factoid took 1250 ms. Reduced automaton from 15 states, 83 edges and 3 AP (stutter insensitive) to 15 states, 83 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 977 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), false, false, (AND p2 (NOT p0) (NOT p1)), false, false, false]
Stuttering acceptance computed with spot in 844 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), false, false, (AND p2 (NOT p0) (NOT p1)), false, false, false]
[2023-03-18 20:42:29] [INFO ] Invariant cache hit.
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 721 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), false, false, (AND p2 (NOT p0) (NOT p1)), false, false, false]
Product exploration timeout after 4870 steps with 23 reset in 10015 ms.
Product exploration timeout after 4960 steps with 23 reset in 10010 ms.
Support contains 4864 out of 5120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 74 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2023-03-18 20:43:05] [INFO ] Invariant cache hit.
[2023-03-18 20:43:06] [INFO ] Implicit Places using invariants in 862 ms returned []
[2023-03-18 20:43:06] [INFO ] Invariant cache hit.
[2023-03-18 20:43:06] [INFO ] Implicit Places using invariants and state equation in 795 ms returned []
Implicit Place search using SMT with State Equation took 1662 ms to find 0 implicit places.
[2023-03-18 20:43:07] [INFO ] Redundant transitions in 141 ms returned []
[2023-03-18 20:43:07] [INFO ] Invariant cache hit.
[2023-03-18 20:43:09] [INFO ] Dead Transitions using invariants and state equation in 2567 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4454 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Treatment of property Sudoku-COL-BN16-LTLCardinality-01 finished in 586907 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||X(G((p1 U p2)))))))'
[2023-03-18 20:43:10] [INFO ] Flatten gal took : 197 ms
[2023-03-18 20:43:10] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 8 ms.
[2023-03-18 20:43:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 5120 places, 4096 transitions and 20480 arcs took 21 ms.
Total runtime 1776238 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT Sudoku-COL-BN16
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLCardinality

BK_STOP 1679172264266

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/LTLCardinality.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:436
lola: rewrite Frontend/Parser/formula_rewrite.k:521
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: NOTDEADLOCKFREE
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: LAUNCH task # 7 (type EXCL) for 6 Sudoku-COL-BN16-LTLCardinality-08
lola: time limit : 1198 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-BN16-LTLCardinality-01: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-BN16-LTLCardinality-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 4/1198 3/32 Sudoku-COL-BN16-LTLCardinality-08 134336 m, 26867 m/sec, 134639 t fired, .

Time elapsed: 10 secs. Pages in use: 3
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-BN16-LTLCardinality-01: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-BN16-LTLCardinality-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 9/1198 6/32 Sudoku-COL-BN16-LTLCardinality-08 322216 m, 37576 m/sec, 324788 t fired, .

Time elapsed: 15 secs. Pages in use: 6
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-BN16-LTLCardinality-01: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-BN16-LTLCardinality-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 14/1198 9/32 Sudoku-COL-BN16-LTLCardinality-08 517522 m, 39061 m/sec, 524852 t fired, .

Time elapsed: 20 secs. Pages in use: 9
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-BN16-LTLCardinality-01: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-BN16-LTLCardinality-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 19/1198 12/32 Sudoku-COL-BN16-LTLCardinality-08 712952 m, 39086 m/sec, 727779 t fired, .

Time elapsed: 25 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-BN16-LTLCardinality-01: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-BN16-LTLCardinality-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 24/1198 14/32 Sudoku-COL-BN16-LTLCardinality-08 907533 m, 38916 m/sec, 932192 t fired, .

Time elapsed: 30 secs. Pages in use: 14
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-BN16-LTLCardinality-01: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-BN16-LTLCardinality-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 29/1198 16/32 Sudoku-COL-BN16-LTLCardinality-08 987629 m, 16019 m/sec, 1017114 t fired, .

Time elapsed: 35 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-BN16-LTLCardinality-01: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-BN16-LTLCardinality-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 34/1198 16/32 Sudoku-COL-BN16-LTLCardinality-08 1026637 m, 7801 m/sec, 1058616 t fired, .

Time elapsed: 40 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-BN16-LTLCardinality-01: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-BN16-LTLCardinality-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 39/1198 17/32 Sudoku-COL-BN16-LTLCardinality-08 1080938 m, 10860 m/sec, 1116782 t fired, .

Time elapsed: 45 secs. Pages in use: 17
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-BN16-LTLCardinality-01: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-BN16-LTLCardinality-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 44/1198 17/32 Sudoku-COL-BN16-LTLCardinality-08 1122051 m, 8222 m/sec, 1160849 t fired, .

Time elapsed: 50 secs. Pages in use: 17
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-BN16-LTLCardinality-01: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-BN16-LTLCardinality-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 54/1198 18/32 Sudoku-COL-BN16-LTLCardinality-08 1182093 m, 12008 m/sec, 1225448 t fired, .

Time elapsed: 60 secs. Pages in use: 18
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-BN16-LTLCardinality-01: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-BN16-LTLCardinality-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 59/1198 19/32 Sudoku-COL-BN16-LTLCardinality-08 1229869 m, 9555 m/sec, 1276836 t fired, .

Time elapsed: 65 secs. Pages in use: 19
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-BN16-LTLCardinality-01: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-BN16-LTLCardinality-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 66/1198 19/32 Sudoku-COL-BN16-LTLCardinality-08 1233491 m, 724 m/sec, 1280766 t fired, .

Time elapsed: 72 secs. Pages in use: 19
# running tasks: 1 of 4 Visible: 3
/home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin//../BenchKit_head.sh: line 63: 2677 Killed lola --conf=$BIN_DIR/configfiles/ltlcardinalityconf --formula=$DIR/LTLCardinality.xml --verdictfile=$DIR/GenericPropertiesVerdict.xml $DIR/model.pnml

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is Sudoku-COL-BN16, 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 r487-tall-167912702700155"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-COL-BN16.tgz
mv Sudoku-COL-BN16 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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;