Execution Chart

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

Trace from the execution

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

--------------------
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 1679201646008

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-COL-BN16
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-19 04:54:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-19 04:54:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 04:54:07] [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-19 04:54:07] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-19 04:54:08] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 796 ms
[2023-03-19 04:54:08] [INFO ] Imported 5 HL places and 1 HL transitions for a total of 5120 PT places and 65536.0 transition bindings in 27 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2023-03-19 04:54:08] [INFO ] Built PT skeleton of HLPN with 5 places and 1 transitions 5 arcs in 4 ms.
[2023-03-19 04:54:08] [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 23 ms. (steps per millisecond=437 ) properties (out of 16) seen :10
Incomplete Best-First random walk after 10061 steps, including 38 resets, run finished after 18 ms. (steps per millisecond=558 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10061 steps, including 38 resets, run finished after 11 ms. (steps per millisecond=914 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10061 steps, including 38 resets, run finished after 11 ms. (steps per millisecond=914 ) 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 7 ms. (steps per millisecond=1437 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10061 steps, including 38 resets, run finished after 7 ms. (steps per millisecond=1437 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1 rows 5 cols
[2023-03-19 04:54:08] [INFO ] Computed 4 place invariants in 4 ms
[2023-03-19 04:54:08] [INFO ] After 144ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-19 04:54:08] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-19 04:54:08] [INFO ] After 48ms 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 0 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-19 04:54:08] [INFO ] Flatten gal took : 41 ms
[2023-03-19 04:54:08] [INFO ] Flatten gal took : 1 ms
Domain [N(16), N(16)] of place Rows breaks symmetries in sort N
[2023-03-19 04:54:08] [INFO ] Unfolded HLPN to a Petri net with 5120 places and 4096 transitions 20480 arcs in 85 ms.
[2023-03-19 04:54:09] [INFO ] Unfolded 5 HLPN properties in 4 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 43 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 5120 cols
[2023-03-19 04:54:09] [INFO ] Computed 1024 place invariants in 74 ms
[2023-03-19 04:54:09] [INFO ] Implicit Places using invariants in 690 ms returned []
[2023-03-19 04:54:09] [INFO ] Invariant cache hit.
[2023-03-19 04:54:10] [INFO ] Implicit Places using invariants and state equation in 546 ms returned []
Implicit Place search using SMT with State Equation took 1240 ms to find 0 implicit places.
[2023-03-19 04:54:10] [INFO ] Invariant cache hit.
[2023-03-19 04:54:13] [INFO ] Dead Transitions using invariants and state equation in 2891 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4181 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Support contains 5120 out of 5120 places after structural reductions.
[2023-03-19 04:54:14] [INFO ] Flatten gal took : 440 ms
[2023-03-19 04:54:14] [INFO ] Flatten gal took : 309 ms
[2023-03-19 04:54:15] [INFO ] Input system was already deterministic with 4096 transitions.
Incomplete random walk after 10000 steps, including 47 resets, run finished after 4773 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 229 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 264 ms. (steps per millisecond=37 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 429 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 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 423 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 226 ms. (steps per millisecond=44 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 605 ms. (steps per millisecond=16 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-19 04:54:22] [INFO ] Invariant cache hit.
[2023-03-19 04:54:24] [INFO ] [Real]Absence check using 1024 positive place invariants in 372 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-19 04:54:47] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 04:54:47] [INFO ] After 25053ms 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.13 ms
Discarding 4096 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 157 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 158 ms. Remains : 1024/5120 places, 4096/4096 transitions.
Incomplete random walk after 10000 steps, including 47 resets, run finished after 4573 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 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 215 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 426 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 223 ms. (steps per millisecond=44 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 416 ms. (steps per millisecond=24 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 603 ms. (steps per millisecond=16 ) properties (out of 7) seen :0
Probabilistic random walk after 174557 steps, saw 174503 distinct states, run finished after 18028 ms. (steps per millisecond=9 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 4096 rows 1024 cols
[2023-03-19 04:55:13] [INFO ] Computed 168 place invariants in 884 ms
[2023-03-19 04:55:14] [INFO ] [Real]Absence check using 0 positive and 168 generalized place invariants in 143 ms returned sat
[2023-03-19 04:55:14] [INFO ] After 506ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-19 04:55:15] [INFO ] [Nat]Absence check using 0 positive and 168 generalized place invariants in 135 ms returned sat
[2023-03-19 04:55:25] [INFO ] After 10084ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :5
[2023-03-19 04:55:26] [INFO ] After 10825ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :5
Attempting to minimize the solution found.
Minimization took 407 ms.
[2023-03-19 04:55:26] [INFO ] After 11763ms 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 36 ms. (steps per millisecond=7 )
Parikh walk visited 5 properties in 39 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 105 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 5120 cols
[2023-03-19 04:55:26] [INFO ] Computed 1024 place invariants in 27 ms
[2023-03-19 04:55:27] [INFO ] Implicit Places using invariants in 922 ms returned []
[2023-03-19 04:55:27] [INFO ] Invariant cache hit.
[2023-03-19 04:55:28] [INFO ] Implicit Places using invariants and state equation in 941 ms returned []
Implicit Place search using SMT with State Equation took 1866 ms to find 0 implicit places.
[2023-03-19 04:55:28] [INFO ] Invariant cache hit.
[2023-03-19 04:55:31] [INFO ] Dead Transitions using invariants and state equation in 3131 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5110 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 762 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 5980 steps with 28 reset in 10012 ms.
Product exploration timeout after 6020 steps with 28 reset in 10004 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 (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND p2 p0 p1))), (X (NOT (AND p2 (NOT p0) p1))), (X (AND p2 (NOT p0) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT (AND (NOT 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 1226 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 772 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 8955 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 1243 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 2262 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 1223 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 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 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 2306 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 2112 ms. (steps per millisecond=4 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-19 04:56:27] [INFO ] Invariant cache hit.
[2023-03-19 04:56:37] [INFO ] [Real]Absence check using 1024 positive place invariants in 357 ms returned sat
[2023-03-19 04:57:00] [INFO ] After 25030ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-19 04:57:02] [INFO ] [Nat]Absence check using 1024 positive place invariants in 370 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-19 04:57:25] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 04:57:25] [INFO ] After 25058ms 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 81 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 81 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Incomplete random walk after 10000 steps, including 47 resets, run finished after 8894 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 1286 ms. (steps per millisecond=7 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2357 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 1281 ms. (steps per millisecond=7 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2357 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 2367 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 2396 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 2348 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 2206 ms. (steps per millisecond=4 ) properties (out of 8) seen :0
Probabilistic random walk after 154824 steps, saw 154776 distinct states, run finished after 75296 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 8 properties.
[2023-03-19 04:59:06] [INFO ] Invariant cache hit.
[2023-03-19 04:59:14] [INFO ] [Real]Absence check using 1024 positive place invariants in 347 ms returned sat
[2023-03-19 04:59:38] [INFO ] After 25026ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-19 04:59:39] [INFO ] [Nat]Absence check using 1024 positive place invariants in 364 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-19 05:00:03] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 05:00:03] [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 53 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.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 59 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2023-03-19 05:00:03] [INFO ] Invariant cache hit.
[2023-03-19 05:00:04] [INFO ] Implicit Places using invariants in 943 ms returned []
[2023-03-19 05:00:04] [INFO ] Invariant cache hit.
[2023-03-19 05:00:05] [INFO ] Implicit Places using invariants and state equation in 875 ms returned []
Implicit Place search using SMT with State Equation took 1824 ms to find 0 implicit places.
[2023-03-19 05:00:05] [INFO ] Redundant transitions in 403 ms returned []
[2023-03-19 05:00:05] [INFO ] Invariant cache hit.
[2023-03-19 05:00:08] [INFO ] Dead Transitions using invariants and state equation in 3119 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5414 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 (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND p2 p0 p1))), (X (NOT (AND p2 (NOT p0) p1))), (X (AND p2 (NOT p0) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT (AND (NOT 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 1242 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 678 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 663 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-19 05:00:13] [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 119 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2023-03-19 05:00:29] [INFO ] Invariant cache hit.
[2023-03-19 05:00:30] [INFO ] Implicit Places using invariants in 1028 ms returned []
[2023-03-19 05:00:30] [INFO ] Invariant cache hit.
[2023-03-19 05:00:31] [INFO ] Implicit Places using invariants and state equation in 993 ms returned []
Implicit Place search using SMT with State Equation took 2032 ms to find 0 implicit places.
[2023-03-19 05:00:31] [INFO ] Redundant transitions in 192 ms returned []
[2023-03-19 05:00:31] [INFO ] Invariant cache hit.
[2023-03-19 05:00:34] [INFO ] Dead Transitions using invariants and state equation in 2891 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5242 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 (AND p2 (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (AND p2 (NOT p1) (NOT p0))), (X (NOT (AND p2 p1 p0))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p2 p1))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND p2 p0))), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT 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 1165 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 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]
Incomplete random walk after 10000 steps, including 47 resets, run finished after 9574 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 1242 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 2373 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 1280 ms. (steps per millisecond=7 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2343 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 2345 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 2416 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 2246 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 2116 ms. (steps per millisecond=4 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-19 05:01:11] [INFO ] Invariant cache hit.
[2023-03-19 05:01:20] [INFO ] [Real]Absence check using 1024 positive place invariants in 364 ms returned sat
[2023-03-19 05:01:43] [INFO ] After 25033ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-19 05:01:45] [INFO ] [Nat]Absence check using 1024 positive place invariants in 382 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-19 05:02:08] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 05:02:08] [INFO ] After 25070ms 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 76 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 77 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Incomplete random walk after 10000 steps, including 47 resets, run finished after 9682 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 1286 ms. (steps per millisecond=7 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2359 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 1262 ms. (steps per millisecond=7 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2320 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 2357 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 2399 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 2325 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 2181 ms. (steps per millisecond=4 ) properties (out of 8) seen :0
Probabilistic random walk after 179066 steps, saw 179010 distinct states, run finished after 78455 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 8 properties.
[2023-03-19 05:03:53] [INFO ] Invariant cache hit.
[2023-03-19 05:04:02] [INFO ] [Real]Absence check using 1024 positive place invariants in 360 ms returned sat
[2023-03-19 05:04:25] [INFO ] After 25030ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-19 05:04:27] [INFO ] [Nat]Absence check using 1024 positive place invariants in 361 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-19 05:04:50] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 05:04:50] [INFO ] After 25041ms 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-19 05:04:50] [INFO ] Invariant cache hit.
[2023-03-19 05:04:51] [INFO ] Implicit Places using invariants in 987 ms returned []
[2023-03-19 05:04:51] [INFO ] Invariant cache hit.
[2023-03-19 05:04:52] [INFO ] Implicit Places using invariants and state equation in 859 ms returned []
Implicit Place search using SMT with State Equation took 1858 ms to find 0 implicit places.
[2023-03-19 05:04:52] [INFO ] Redundant transitions in 280 ms returned []
[2023-03-19 05:04:52] [INFO ] Invariant cache hit.
[2023-03-19 05:04:55] [INFO ] Dead Transitions using invariants and state equation in 2892 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5082 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X p2), (X (AND p2 (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (AND p2 (NOT p1) (NOT p0))), (X (NOT (AND p2 p1 p0))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p2 p1))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND p2 p0))), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT 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 1376 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 686 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 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]
[2023-03-19 05:05:00] [INFO ] Invariant cache hit.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:876)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:517)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
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-19 05:05:15] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (AND (NOT p0) (NOT p1))
Could not prove EG (AND (NOT p0) (NOT p1))
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]
Product exploration timeout after 4930 steps with 23 reset in 10006 ms.
Product exploration timeout after 4950 steps with 23 reset in 10009 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 41 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2023-03-19 05:05:36] [INFO ] Invariant cache hit.
[2023-03-19 05:05:37] [INFO ] Implicit Places using invariants in 944 ms returned []
[2023-03-19 05:05:37] [INFO ] Invariant cache hit.
[2023-03-19 05:05:38] [INFO ] Implicit Places using invariants and state equation in 948 ms returned []
Implicit Place search using SMT with State Equation took 1899 ms to find 0 implicit places.
[2023-03-19 05:05:38] [INFO ] Redundant transitions in 185 ms returned []
[2023-03-19 05:05:38] [INFO ] Invariant cache hit.
[2023-03-19 05:05:41] [INFO ] Dead Transitions using invariants and state equation in 2953 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5088 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Treatment of property Sudoku-COL-BN16-LTLCardinality-01 finished in 615649 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 293 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2023-03-19 05:05:42] [INFO ] Invariant cache hit.
[2023-03-19 05:05:44] [INFO ] Implicit Places using invariants in 2024 ms returned []
[2023-03-19 05:05:44] [INFO ] Invariant cache hit.
[2023-03-19 05:05:46] [INFO ] Implicit Places using invariants and state equation in 1854 ms returned []
Implicit Place search using SMT with State Equation took 3883 ms to find 0 implicit places.
[2023-03-19 05:05:46] [INFO ] Redundant transitions in 185 ms returned []
[2023-03-19 05:05:46] [INFO ] Invariant cache hit.
[2023-03-19 05:05:49] [INFO ] Dead Transitions using invariants and state equation in 2912 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7278 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 80 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 20260 steps with 665 reset in 10002 ms.
Product exploration timeout after 19880 steps with 705 reset in 10002 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 109 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 71 ms :[(NOT p0), (NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 11 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 132 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 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
[2023-03-19 05:06:14] [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 151 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2023-03-19 05:06:29] [INFO ] Invariant cache hit.
[2023-03-19 05:06:31] [INFO ] Implicit Places using invariants in 1911 ms returned []
[2023-03-19 05:06:31] [INFO ] Invariant cache hit.
[2023-03-19 05:06:33] [INFO ] Implicit Places using invariants and state equation in 1923 ms returned []
Implicit Place search using SMT with State Equation took 3836 ms to find 0 implicit places.
[2023-03-19 05:06:33] [INFO ] Redundant transitions in 184 ms returned []
[2023-03-19 05:06:33] [INFO ] Invariant cache hit.
[2023-03-19 05:06:36] [INFO ] Dead Transitions using invariants and state equation in 3042 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7219 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 134 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(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 139 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 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
[2023-03-19 05:06:40] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Product exploration timeout after 19330 steps with 767 reset in 10001 ms.
Product exploration timeout after 20070 steps with 669 reset in 10008 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 141 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2023-03-19 05:07:16] [INFO ] Invariant cache hit.
[2023-03-19 05:07:18] [INFO ] Implicit Places using invariants in 1969 ms returned []
[2023-03-19 05:07:18] [INFO ] Invariant cache hit.
[2023-03-19 05:07:20] [INFO ] Implicit Places using invariants and state equation in 2008 ms returned []
Implicit Place search using SMT with State Equation took 3980 ms to find 0 implicit places.
[2023-03-19 05:07:20] [INFO ] Redundant transitions in 196 ms returned []
[2023-03-19 05:07:20] [INFO ] Invariant cache hit.
[2023-03-19 05:07:23] [INFO ] Dead Transitions using invariants and state equation in 3104 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7432 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Treatment of property Sudoku-COL-BN16-LTLCardinality-07 finished in 101301 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 164 ms. Remains 1024 /5120 variables (removed 4096) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 1024 cols
[2023-03-19 05:07:24] [INFO ] Computed 168 place invariants in 680 ms
[2023-03-19 05:07:25] [INFO ] Implicit Places using invariants in 1241 ms returned []
[2023-03-19 05:07:25] [INFO ] Invariant cache hit.
[2023-03-19 05:07:37] [INFO ] Implicit Places using invariants and state equation in 12558 ms returned []
Implicit Place search using SMT with State Equation took 13801 ms to find 0 implicit places.
[2023-03-19 05:07:37] [INFO ] Invariant cache hit.
[2023-03-19 05:07:39] [INFO ] Dead Transitions using invariants and state equation in 1533 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 15501 ms. Remains : 1024/5120 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 220 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 13060 steps with 4353 reset in 10003 ms.
Product exploration timeout after 13080 steps with 4360 reset in 10015 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 210 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 247 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 4416 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 241 ms. (steps per millisecond=41 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 603 ms. (steps per millisecond=16 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 591 ms. (steps per millisecond=16 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 586 ms. (steps per millisecond=17 ) properties (out of 4) seen :0
Probabilistic random walk after 256272 steps, saw 256188 distinct states, run finished after 18046 ms. (steps per millisecond=14 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-19 05:08:25] [INFO ] Invariant cache hit.
[2023-03-19 05:08:26] [INFO ] [Real]Absence check using 0 positive and 168 generalized place invariants in 136 ms returned sat
[2023-03-19 05:08:26] [INFO ] After 431ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2023-03-19 05:08:26] [INFO ] [Nat]Absence check using 0 positive and 168 generalized place invariants in 130 ms returned sat
[2023-03-19 05:08:51] [INFO ] After 24675ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-19 05:08:51] [INFO ] After 24689ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-19 05:08:51] [INFO ] After 25046ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 768 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 29 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 29 ms. Remains : 1024/1024 places, 4096/4096 transitions.
Incomplete random walk after 10000 steps, including 47 resets, run finished after 4077 ms. (steps per millisecond=2 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 255 ms. (steps per millisecond=39 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 589 ms. (steps per millisecond=16 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 589 ms. (steps per millisecond=16 ) properties (out of 3) seen :0
Probabilistic random walk after 252502 steps, saw 252419 distinct states, run finished after 15013 ms. (steps per millisecond=16 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-19 05:09:11] [INFO ] Invariant cache hit.
[2023-03-19 05:09:12] [INFO ] [Real]Absence check using 0 positive and 168 generalized place invariants in 135 ms returned sat
[2023-03-19 05:09:37] [INFO ] After 24640ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-19 05:09:37] [INFO ] After 24649ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-19 05:09:37] [INFO ] After 25038ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 768 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 39 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 40 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 25 ms. Remains 1024 /1024 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2023-03-19 05:09:37] [INFO ] Invariant cache hit.
[2023-03-19 05:09:37] [INFO ] Implicit Places using invariants in 553 ms returned []
[2023-03-19 05:09:37] [INFO ] Invariant cache hit.
[2023-03-19 05:09:50] [INFO ] Implicit Places using invariants and state equation in 12759 ms returned []
Implicit Place search using SMT with State Equation took 13314 ms to find 0 implicit places.
[2023-03-19 05:09:50] [INFO ] Redundant transitions in 190 ms returned []
[2023-03-19 05:09:50] [INFO ] Invariant cache hit.
[2023-03-19 05:09:52] [INFO ] Dead Transitions using invariants and state equation in 1676 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15216 ms. Remains : 1024/1024 places, 4096/4096 transitions.
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 : []
Knowledge based reduction with 5 factoid took 213 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 143 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 158 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 20 ms. Remains 1024 /1024 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2023-03-19 05:09:52] [INFO ] Invariant cache hit.
[2023-03-19 05:09:53] [INFO ] Implicit Places using invariants in 541 ms returned []
[2023-03-19 05:09:53] [INFO ] Invariant cache hit.
[2023-03-19 05:10:06] [INFO ] Implicit Places using invariants and state equation in 12796 ms returned []
Implicit Place search using SMT with State Equation took 13345 ms to find 0 implicit places.
[2023-03-19 05:10:06] [INFO ] Invariant cache hit.
[2023-03-19 05:10:07] [INFO ] Dead Transitions using invariants and state equation in 1586 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14956 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 163 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 153 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 3766 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 219 ms. (steps per millisecond=45 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 211 ms. (steps per millisecond=47 ) properties (out of 2) seen :0
Probabilistic random walk after 233468 steps, saw 233394 distinct states, run finished after 12033 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-19 05:10:25] [INFO ] Invariant cache hit.
[2023-03-19 05:10:25] [INFO ] [Real]Absence check using 0 positive and 168 generalized place invariants in 143 ms returned sat
[2023-03-19 05:10:35] [INFO ] After 9883ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-19 05:10:35] [INFO ] After 10207ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 182 ms.
[2023-03-19 05:10:36] [INFO ] After 10726ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 256 steps, including 0 resets, run visited all 2 properties in 28 ms. (steps per millisecond=9 )
Parikh walk visited 2 properties in 29 ms.
Knowledge obtained : [(AND p0 p2), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p2))]
Knowledge based reduction with 3 factoid took 296 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 175 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 170 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 157 ms :[true, (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration timeout after 13590 steps with 4530 reset in 10005 ms.
Product exploration timeout after 13600 steps with 4533 reset in 10006 ms.
Applying partial POR strategy [true, false, true, false, false]
Stuttering acceptance computed with spot in 243 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 153 ms. Remains 1024 /1024 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2023-03-19 05:10:57] [INFO ] Redundant transitions in 179 ms returned []
[2023-03-19 05:10:57] [INFO ] Invariant cache hit.
[2023-03-19 05:10:59] [INFO ] Dead Transitions using invariants and state equation in 1615 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1959 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 41 ms. Remains 1024 /1024 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2023-03-19 05:10:59] [INFO ] Invariant cache hit.
[2023-03-19 05:11:00] [INFO ] Implicit Places using invariants in 877 ms returned []
[2023-03-19 05:11:00] [INFO ] Invariant cache hit.
[2023-03-19 05:11:18] [INFO ] Implicit Places using invariants and state equation in 18412 ms returned []
Implicit Place search using SMT with State Equation took 19294 ms to find 0 implicit places.
[2023-03-19 05:11:18] [INFO ] Invariant cache hit.
[2023-03-19 05:11:20] [INFO ] Dead Transitions using invariants and state equation in 1629 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20974 ms. Remains : 1024/1024 places, 4096/4096 transitions.
Treatment of property Sudoku-COL-BN16-LTLCardinality-08 finished in 236936 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 80 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 5120 cols
[2023-03-19 05:11:20] [INFO ] Computed 1024 place invariants in 20 ms
[2023-03-19 05:11:22] [INFO ] Implicit Places using invariants in 1644 ms returned []
[2023-03-19 05:11:22] [INFO ] Invariant cache hit.
[2023-03-19 05:11:23] [INFO ] Implicit Places using invariants and state equation in 1622 ms returned []
Implicit Place search using SMT with State Equation took 3289 ms to find 0 implicit places.
[2023-03-19 05:11:24] [INFO ] Invariant cache hit.
[2023-03-19 05:11:26] [INFO ] Dead Transitions using invariants and state equation in 2781 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6158 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 86 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 15170 steps with 7585 reset in 10001 ms.
Product exploration timeout after 15110 steps with 7555 reset in 10001 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 66 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 28539 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 314 ms. Remains 1024 /5120 variables (removed 4096) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 1024 cols
[2023-03-19 05:11:50] [INFO ] Computed 168 place invariants in 651 ms
[2023-03-19 05:11:51] [INFO ] Implicit Places using invariants in 1733 ms returned []
[2023-03-19 05:11:51] [INFO ] Invariant cache hit.
[2023-03-19 05:12:07] [INFO ] Implicit Places using invariants and state equation in 16270 ms returned []
Implicit Place search using SMT with State Equation took 18021 ms to find 0 implicit places.
[2023-03-19 05:12:07] [INFO ] Invariant cache hit.
[2023-03-19 05:12:09] [INFO ] Dead Transitions using invariants and state equation in 1676 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 20026 ms. Remains : 1024/5120 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 135 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 2 ms.
FORMULA Sudoku-COL-BN16-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-BN16-LTLCardinality-11 finished in 20251 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 452 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 38 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 5120 cols
[2023-03-19 05:12:10] [INFO ] Computed 1024 place invariants in 19 ms
[2023-03-19 05:12:10] [INFO ] Implicit Places using invariants in 894 ms returned []
[2023-03-19 05:12:10] [INFO ] Invariant cache hit.
[2023-03-19 05:12:11] [INFO ] Implicit Places using invariants and state equation in 898 ms returned []
Implicit Place search using SMT with State Equation took 1827 ms to find 0 implicit places.
[2023-03-19 05:12:11] [INFO ] Invariant cache hit.
[2023-03-19 05:12:14] [INFO ] Dead Transitions using invariants and state equation in 3072 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 4938 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 5920 steps with 28 reset in 10001 ms.
Product exploration timeout after 6210 steps with 29 reset in 10008 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 (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND p2 p0 p1))), (X (NOT (AND p2 (NOT p0) p1))), (X (AND p2 (NOT p0) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT (AND (NOT 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 1245 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 674 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 8991 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 1281 ms. (steps per millisecond=7 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2360 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 1240 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 2265 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 2313 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 2334 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 2276 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 2128 ms. (steps per millisecond=4 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-19 05:13:09] [INFO ] Invariant cache hit.
[2023-03-19 05:13:19] [INFO ] [Real]Absence check using 1024 positive place invariants in 360 ms returned sat
[2023-03-19 05:13:42] [INFO ] After 25017ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-19 05:13:43] [INFO ] [Nat]Absence check using 1024 positive place invariants in 386 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-19 05:14:07] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 05:14:07] [INFO ] After 25045ms 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 31 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 31 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Incomplete random walk after 10000 steps, including 47 resets, run finished after 8920 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 1243 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 2367 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 1251 ms. (steps per millisecond=7 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2329 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 2364 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 2307 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 2313 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 2107 ms. (steps per millisecond=4 ) properties (out of 8) seen :0
Probabilistic random walk after 150070 steps, saw 150024 distinct states, run finished after 75468 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 8 properties.
[2023-03-19 05:15:48] [INFO ] Invariant cache hit.
[2023-03-19 05:15:56] [INFO ] [Real]Absence check using 1024 positive place invariants in 373 ms returned sat
[2023-03-19 05:16:19] [INFO ] After 25028ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-19 05:16:21] [INFO ] [Nat]Absence check using 1024 positive place invariants in 387 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-19 05:16:44] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 05:16:44] [INFO ] After 25038ms 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 32 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 32 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-19 05:16:44] [INFO ] Invariant cache hit.
[2023-03-19 05:16:45] [INFO ] Implicit Places using invariants in 905 ms returned []
[2023-03-19 05:16:45] [INFO ] Invariant cache hit.
[2023-03-19 05:16:46] [INFO ] Implicit Places using invariants and state equation in 896 ms returned []
Implicit Place search using SMT with State Equation took 1804 ms to find 0 implicit places.
[2023-03-19 05:16:46] [INFO ] Redundant transitions in 178 ms returned []
[2023-03-19 05:16:46] [INFO ] Invariant cache hit.
[2023-03-19 05:16:49] [INFO ] Dead Transitions using invariants and state equation in 2978 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5014 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 (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND p2 p0 p1))), (X (NOT (AND p2 (NOT p0) p1))), (X (AND p2 (NOT p0) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT (AND (NOT 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 1189 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 716 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 696 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-19 05:16:54] [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 44 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2023-03-19 05:17:09] [INFO ] Invariant cache hit.
[2023-03-19 05:17:10] [INFO ] Implicit Places using invariants in 903 ms returned []
[2023-03-19 05:17:10] [INFO ] Invariant cache hit.
[2023-03-19 05:17:11] [INFO ] Implicit Places using invariants and state equation in 922 ms returned []
Implicit Place search using SMT with State Equation took 1829 ms to find 0 implicit places.
[2023-03-19 05:17:11] [INFO ] Redundant transitions in 183 ms returned []
[2023-03-19 05:17:11] [INFO ] Invariant cache hit.
[2023-03-19 05:17:14] [INFO ] Dead Transitions using invariants and state equation in 2892 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4960 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 (AND p2 (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (AND p2 (NOT p1) (NOT p0))), (X (NOT (AND p2 p1 p0))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p2 p1))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND p2 p0))), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT 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 1235 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 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 9595 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 1257 ms. (steps per millisecond=7 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2246 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 1214 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 2218 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 2277 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 2237 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 2111 ms. (steps per millisecond=4 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-19 05:17:51] [INFO ] Invariant cache hit.
[2023-03-19 05:17:59] [INFO ] [Real]Absence check using 1024 positive place invariants in 380 ms returned sat
[2023-03-19 05:18:22] [INFO ] After 25041ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-19 05:18:24] [INFO ] [Nat]Absence check using 1024 positive place invariants in 382 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
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.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-19 05:18:47] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 05:18:47] [INFO ] After 25023ms 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 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 38 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Incomplete random walk after 10000 steps, including 47 resets, run finished after 8974 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 1268 ms. (steps per millisecond=7 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2272 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 1229 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 2233 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 2364 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 2326 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 2315 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 2155 ms. (steps per millisecond=4 ) properties (out of 8) seen :0
Probabilistic random walk after 191792 steps, saw 191730 distinct states, run finished after 75191 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 8 properties.
[2023-03-19 05:20:28] [INFO ] Invariant cache hit.
[2023-03-19 05:20:36] [INFO ] [Real]Absence check using 1024 positive place invariants in 377 ms returned sat
[2023-03-19 05:21:00] [INFO ] After 25028ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-19 05:21:01] [INFO ] [Nat]Absence check using 1024 positive place invariants in 404 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-19 05:21:25] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 05:21:25] [INFO ] After 25034ms 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 45 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2023-03-19 05:21:25] [INFO ] Invariant cache hit.
[2023-03-19 05:21:26] [INFO ] Implicit Places using invariants in 880 ms returned []
[2023-03-19 05:21:26] [INFO ] Invariant cache hit.
[2023-03-19 05:21:26] [INFO ] Implicit Places using invariants and state equation in 876 ms returned []
Implicit Place search using SMT with State Equation took 1784 ms to find 0 implicit places.
[2023-03-19 05:21:27] [INFO ] Redundant transitions in 181 ms returned []
[2023-03-19 05:21:27] [INFO ] Invariant cache hit.
[2023-03-19 05:21:29] [INFO ] Dead Transitions using invariants and state equation in 2719 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4735 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X p2), (X (AND p2 (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (AND p2 (NOT p1) (NOT p0))), (X (NOT (AND p2 p1 p0))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p2 p1))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND p2 p0))), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT 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 1436 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 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]
Stuttering acceptance computed with spot in 715 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-19 05:21:35] [INFO ] Invariant cache hit.
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 728 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 5130 steps with 24 reset in 10012 ms.
Product exploration timeout after 5190 steps with 24 reset in 10018 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 37 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2023-03-19 05:22:11] [INFO ] Invariant cache hit.
[2023-03-19 05:22:11] [INFO ] Implicit Places using invariants in 873 ms returned []
[2023-03-19 05:22:11] [INFO ] Invariant cache hit.
[2023-03-19 05:22:12] [INFO ] Implicit Places using invariants and state equation in 882 ms returned []
Implicit Place search using SMT with State Equation took 1792 ms to find 0 implicit places.
[2023-03-19 05:22:13] [INFO ] Redundant transitions in 181 ms returned []
[2023-03-19 05:22:13] [INFO ] Invariant cache hit.
[2023-03-19 05:22:15] [INFO ] Dead Transitions using invariants and state equation in 2860 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4879 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Treatment of property Sudoku-COL-BN16-LTLCardinality-01 finished in 606842 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-19 05:22:16] [INFO ] Flatten gal took : 398 ms
[2023-03-19 05:22:16] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 8 ms.
[2023-03-19 05:22:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 5120 places, 4096 transitions and 20480 arcs took 37 ms.
Total runtime 1689493 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2667/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 1190 seconds
MemTotal: 16393216 kB
MemFree: 15870804 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16063556 kB
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2667/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 15864208 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16060004 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is Sudoku-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 r489-tall-167912706400155"
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 ;