Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 440K
-rw-r--r-- 1 mcc users 6.1K Apr 12 11:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Apr 12 11:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Apr 12 10:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Apr 12 10:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 12:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 155K Apr 12 12:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 12 11:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 12 11:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 08:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717138352785

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-COL-AN13
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202304061127
[2024-05-31 06:52:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-31 06:52:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 06:52:34] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-31 06:52:34] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-31 06:52:34] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 383 ms
[2024-05-31 06:52:34] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 2704 PT places and 2197.0 transition bindings in 12 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
[2024-05-31 06:52:35] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 6 ms.
[2024-05-31 06:52:35] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 3 formulas.
FORMULA Sudoku-COL-AN13-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN13-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN13-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 13 properties that can be checked using skeleton over-approximation.
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Incomplete random walk after 10088 steps, including 58 resets, run finished after 33 ms. (steps per millisecond=305 ) properties (out of 23) seen :16
Incomplete Best-First random walk after 10088 steps, including 58 resets, run finished after 14 ms. (steps per millisecond=720 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10088 steps, including 58 resets, run finished after 20 ms. (steps per millisecond=504 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10088 steps, including 58 resets, run finished after 12 ms. (steps per millisecond=840 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10088 steps, including 58 resets, run finished after 10 ms. (steps per millisecond=1008 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10088 steps, including 58 resets, run finished after 8 ms. (steps per millisecond=1261 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10088 steps, including 58 resets, run finished after 6 ms. (steps per millisecond=1681 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10088 steps, including 58 resets, run finished after 7 ms. (steps per millisecond=1441 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 1 rows 4 cols
[2024-05-31 06:52:35] [INFO ] Computed 3 invariants in 2 ms
[2024-05-31 06:52:35] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-31 06:52:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 06:52:35] [INFO ] After 47ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :0
Fused 7 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 7 atomic propositions for a total of 13 simplifications.
FORMULA Sudoku-COL-AN13-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN13-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-31 06:52:35] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2024-05-31 06:52:35] [INFO ] Flatten gal took : 12 ms
FORMULA Sudoku-COL-AN13-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN13-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-31 06:52:35] [INFO ] Flatten gal took : 1 ms
Domain [N(13), N(13)] of place Rows breaks symmetries in sort N
[2024-05-31 06:52:35] [INFO ] Unfolded HLPN to a Petri net with 2704 places and 2197 transitions 8788 arcs in 40 ms.
[2024-05-31 06:52:35] [INFO ] Unfolded 9 HLPN properties in 3 ms.
Support contains 2704 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 36 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 2704 cols
[2024-05-31 06:52:35] [INFO ] Computed 507 invariants in 33 ms
[2024-05-31 06:52:36] [INFO ] Implicit Places using invariants in 504 ms returned []
[2024-05-31 06:52:36] [INFO ] Invariant cache hit.
[2024-05-31 06:52:37] [INFO ] Implicit Places using invariants and state equation in 1444 ms returned []
Implicit Place search using SMT with State Equation took 1951 ms to find 0 implicit places.
[2024-05-31 06:52:37] [INFO ] Invariant cache hit.
[2024-05-31 06:52:38] [INFO ] Dead Transitions using invariants and state equation in 1371 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3359 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Support contains 2704 out of 2704 places after structural reductions.
[2024-05-31 06:52:39] [INFO ] Flatten gal took : 222 ms
[2024-05-31 06:52:39] [INFO ] Flatten gal took : 183 ms
[2024-05-31 06:52:40] [INFO ] Input system was already deterministic with 2197 transitions.
Incomplete random walk after 10000 steps, including 67 resets, run finished after 2902 ms. (steps per millisecond=3 ) properties (out of 19) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 601 ms. (steps per millisecond=16 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 336 ms. (steps per millisecond=29 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 185 ms. (steps per millisecond=54 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 314 ms. (steps per millisecond=31 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 669 ms. (steps per millisecond=14 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
[2024-05-31 06:52:46] [INFO ] Invariant cache hit.
[2024-05-31 06:52:48] [INFO ] [Real]Absence check using 507 positive place invariants in 135 ms returned sat
[2024-05-31 06:52:50] [INFO ] After 2989ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2024-05-31 06:52:51] [INFO ] [Nat]Absence check using 507 positive place invariants in 138 ms returned sat
[2024-05-31 06:53:15] [INFO ] After 25022ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 13 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2704 out of 2704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 59 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Incomplete random walk after 10000 steps, including 67 resets, run finished after 2754 ms. (steps per millisecond=3 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 601 ms. (steps per millisecond=16 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 330 ms. (steps per millisecond=30 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 185 ms. (steps per millisecond=54 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 320 ms. (steps per millisecond=31 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 648 ms. (steps per millisecond=15 ) properties (out of 13) seen :0
Interrupted probabilistic random walk after 151089 steps, run timeout after 15007 ms. (steps per millisecond=10 ) properties seen :{}
Probabilistic random walk after 151089 steps, saw 150981 distinct states, run finished after 15009 ms. (steps per millisecond=10 ) properties seen :0
Running SMT prover for 13 properties.
[2024-05-31 06:53:36] [INFO ] Invariant cache hit.
[2024-05-31 06:53:38] [INFO ] [Real]Absence check using 507 positive place invariants in 127 ms returned sat
[2024-05-31 06:53:40] [INFO ] After 2716ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2024-05-31 06:53:40] [INFO ] [Nat]Absence check using 507 positive place invariants in 127 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:632)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
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:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-31 06:54:05] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-31 06:54:05] [INFO ] After 25043ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:13
Fused 13 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2704 out of 2704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 35 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 29 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-31 06:54:05] [INFO ] Invariant cache hit.
[2024-05-31 06:54:05] [INFO ] Implicit Places using invariants in 376 ms returned []
[2024-05-31 06:54:05] [INFO ] Invariant cache hit.
[2024-05-31 06:54:07] [INFO ] Implicit Places using invariants and state equation in 1437 ms returned []
Implicit Place search using SMT with State Equation took 1816 ms to find 0 implicit places.
[2024-05-31 06:54:07] [INFO ] Redundant transitions in 122 ms returned []
[2024-05-31 06:54:07] [INFO ] Invariant cache hit.
[2024-05-31 06:54:08] [INFO ] Dead Transitions using invariants and state equation in 1292 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3268 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 22 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
Running SMT prover for 13 properties.
[2024-05-31 06:54:08] [INFO ] Invariant cache hit.
[2024-05-31 06:54:10] [INFO ] [Real]Absence check using 507 positive place invariants in 136 ms returned sat
[2024-05-31 06:54:12] [INFO ] After 3011ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2024-05-31 06:54:13] [INFO ] [Nat]Absence check using 507 positive place invariants in 145 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:632)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:218)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:279)
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:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-31 06:57:57] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-31 06:57:57] [INFO ] After 225038ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:13
Computed a total of 2704 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2704 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&((p1||F(p2)) U p3))))'
Support contains 2535 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 34 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-31 06:57:57] [INFO ] Invariant cache hit.
[2024-05-31 06:57:58] [INFO ] Implicit Places using invariants in 637 ms returned []
[2024-05-31 06:57:58] [INFO ] Invariant cache hit.
[2024-05-31 06:58:00] [INFO ] Implicit Places using invariants and state equation in 2039 ms returned []
Implicit Place search using SMT with State Equation took 2679 ms to find 0 implicit places.
[2024-05-31 06:58:00] [INFO ] Invariant cache hit.
[2024-05-31 06:58:01] [INFO ] Dead Transitions using invariants and state equation in 1381 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4096 ms. Remains : 2704/2704 places, 2197/2197 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 422 ms :[(OR (NOT p0) (NOT p3)), (OR (NOT p0) (NOT p3)), true, (NOT p2), (NOT p3)]
Running random walk in product with property : Sudoku-COL-AN13-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p3) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p3)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(NOT p3), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (LEQ 3 (ADD s2535 s2536 s2537 s2538 s2539 s2540 s2541 s2542 s2543 s2544 s2545 s2546 s2547 s2548 s2549 s2550 s2551 s2552 s2553 s2554 s2555 s2556 s25...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration timeout after 36110 steps with 18055 reset in 10001 ms.
Product exploration timeout after 35910 steps with 17955 reset in 10001 ms.
Computed a total of 2704 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2704 transition count 2197
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 p3 (NOT p1) (NOT p2)), (X (NOT (AND p0 (NOT p3) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p3)))), (X p0), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 127 ms. Reduced automaton from 5 states, 8 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN13-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN13-LTLCardinality-01 finished in 25555 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 169 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Reduce places removed 2197 places and 0 transitions.
Iterating post reduction 0 with 2197 rules applied. Total rules applied 2197 place count 507 transition count 2197
Applied a total of 2197 rules in 68 ms. Remains 507 /2704 variables (removed 2197) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 507 cols
[2024-05-31 06:58:23] [INFO ] Computed 38 invariants in 92 ms
[2024-05-31 06:58:23] [INFO ] Implicit Places using invariants in 455 ms returned []
[2024-05-31 06:58:23] [INFO ] Invariant cache hit.
[2024-05-31 06:58:25] [INFO ] Implicit Places using invariants and state equation in 1661 ms returned []
Implicit Place search using SMT with State Equation took 2130 ms to find 0 implicit places.
[2024-05-31 06:58:25] [INFO ] Invariant cache hit.
[2024-05-31 06:58:25] [INFO ] Dead Transitions using invariants and state equation in 628 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 507/2704 places, 2197/2197 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2826 ms. Remains : 507/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN13-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 (ADD s169 s170 s171 s172 s173 s174 s175 s176 s177 s178 s179 s180 s181 s182 s183 s184 s185 s186 s187 s188 s189 s190 s191 s192 s193 s194 s195 s196...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration timeout after 48180 steps with 24090 reset in 10002 ms.
Product exploration timeout after 47860 steps with 23930 reset in 10001 ms.
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 20 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN13-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN13-LTLCardinality-02 finished in 23297 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 2197 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 44 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 2704 cols
[2024-05-31 06:58:46] [INFO ] Computed 507 invariants in 17 ms
[2024-05-31 06:58:47] [INFO ] Implicit Places using invariants in 1263 ms returned []
[2024-05-31 06:58:47] [INFO ] Invariant cache hit.
[2024-05-31 06:58:50] [INFO ] Implicit Places using invariants and state equation in 3068 ms returned []
Implicit Place search using SMT with State Equation took 4333 ms to find 0 implicit places.
[2024-05-31 06:58:50] [INFO ] Invariant cache hit.
[2024-05-31 06:58:52] [INFO ] Dead Transitions using invariants and state equation in 1259 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5638 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 158 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN13-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(GT 2 (ADD s169 s170 s171 s172 s173 s174 s175 s176 s177 s178 s179 s180 s181 s182 s183 s184 s185 s186 s187 s188 s189 s190 s191 s192 s193 s194 s195 s196 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 148 steps with 0 reset in 27 ms.
FORMULA Sudoku-COL-AN13-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN13-LTLCardinality-03 finished in 5848 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X((p0 U (X(p1) U (X(G(p1))||(p1&&X(p1))))))))'
Support contains 2366 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 27 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-31 06:58:52] [INFO ] Invariant cache hit.
[2024-05-31 06:58:53] [INFO ] Implicit Places using invariants in 1019 ms returned []
[2024-05-31 06:58:53] [INFO ] Invariant cache hit.
[2024-05-31 06:58:56] [INFO ] Implicit Places using invariants and state equation in 2691 ms returned []
Implicit Place search using SMT with State Equation took 3712 ms to find 0 implicit places.
[2024-05-31 06:58:56] [INFO ] Invariant cache hit.
[2024-05-31 06:58:57] [INFO ] Dead Transitions using invariants and state equation in 1345 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5086 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 280 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), true, (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-COL-AN13-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 6}, { cond=p0, acceptance={} source=0 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 7}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 6}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}], [{ cond=(NOT p1), acceptance={} source=5 dest: 2}, { cond=p1, acceptance={} source=5 dest: 4}], [{ cond=(AND p0 p1), acceptance={0} source=6 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=6 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={0} source=6 dest: 6}], [{ cond=(AND p0 p1), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(LEQ 3 (ADD s2366 s2367 s2368 s2369 s2370 s2371 s2372 s2373 s2374 s2375 s2376 s2377 s2378 s2379 s2380 s2381 s2382 s2383 s2384 s2385 s2386 s2387 s2388 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration timeout after 38950 steps with 262 reset in 10002 ms.
Product exploration timeout after 38650 steps with 260 reset in 10003 ms.
Computed a total of 2704 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2704 transition count 2197
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 p1), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 127 ms. Reduced automaton from 8 states, 18 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 234 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Incomplete random walk after 10000 steps, including 67 resets, run finished after 1569 ms. (steps per millisecond=6 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 478 ms. (steps per millisecond=20 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 479 ms. (steps per millisecond=20 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-31 06:59:21] [INFO ] Invariant cache hit.
[2024-05-31 06:59:22] [INFO ] [Real]Absence check using 507 positive place invariants in 127 ms returned sat
[2024-05-31 06:59:47] [INFO ] After 25018ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 06:59:47] [INFO ] [Nat]Absence check using 507 positive place invariants in 135 ms returned sat
[2024-05-31 07:00:12] [INFO ] After 25028ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 2366 out of 2704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 41 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Incomplete random walk after 10000 steps, including 67 resets, run finished after 1411 ms. (steps per millisecond=7 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 476 ms. (steps per millisecond=21 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 223859 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :{}
Probabilistic random walk after 223859 steps, saw 216439 distinct states, run finished after 3001 ms. (steps per millisecond=74 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-31 07:00:17] [INFO ] Invariant cache hit.
[2024-05-31 07:00:17] [INFO ] [Real]Absence check using 507 positive place invariants in 161 ms returned sat
[2024-05-31 07:00:42] [INFO ] After 25025ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 1 ms.
Support contains 2366 out of 2704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 37 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 47 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-31 07:00:42] [INFO ] Invariant cache hit.
[2024-05-31 07:00:43] [INFO ] Implicit Places using invariants in 993 ms returned []
[2024-05-31 07:00:43] [INFO ] Invariant cache hit.
[2024-05-31 07:00:45] [INFO ] Implicit Places using invariants and state equation in 2555 ms returned []
Implicit Place search using SMT with State Equation took 3550 ms to find 0 implicit places.
[2024-05-31 07:00:46] [INFO ] Redundant transitions in 101 ms returned []
[2024-05-31 07:00:46] [INFO ] Invariant cache hit.
[2024-05-31 07:00:47] [INFO ] Dead Transitions using invariants and state equation in 1234 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4940 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 31 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-31 07:00:47] [INFO ] Invariant cache hit.
[2024-05-31 07:00:48] [INFO ] [Real]Absence check using 507 positive place invariants in 122 ms returned sat
[2024-05-31 07:04:32] [INFO ] After 225014ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (NOT p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 8 factoid took 279 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Stuttering acceptance computed with spot in 168 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Support contains 2366 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 23 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-31 07:04:33] [INFO ] Invariant cache hit.
[2024-05-31 07:04:34] [INFO ] Implicit Places using invariants in 911 ms returned []
[2024-05-31 07:04:34] [INFO ] Invariant cache hit.
[2024-05-31 07:04:36] [INFO ] Implicit Places using invariants and state equation in 2586 ms returned []
Implicit Place search using SMT with State Equation took 3499 ms to find 0 implicit places.
[2024-05-31 07:04:36] [INFO ] Invariant cache hit.
[2024-05-31 07:04:38] [INFO ] Dead Transitions using invariants and state equation in 1209 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4732 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Computed a total of 2704 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2704 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 113 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Incomplete random walk after 10000 steps, including 67 resets, run finished after 1401 ms. (steps per millisecond=7 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-31 07:04:40] [INFO ] Invariant cache hit.
[2024-05-31 07:04:41] [INFO ] [Real]Absence check using 507 positive place invariants in 141 ms returned sat
[2024-05-31 07:04:42] [INFO ] After 2053ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 07:04:43] [INFO ] [Nat]Absence check using 507 positive place invariants in 123 ms returned sat
[2024-05-31 07:04:45] [INFO ] After 1500ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 07:04:45] [INFO ] After 1655ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 78 ms.
[2024-05-31 07:04:46] [INFO ] After 3190ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 167 steps, including 0 resets, run visited all 1 properties in 9 ms. (steps per millisecond=18 )
Parikh walk visited 1 properties in 10 ms.
Knowledge obtained : [(AND p1 p0), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 6 factoid took 203 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Stuttering acceptance computed with spot in 188 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Stuttering acceptance computed with spot in 214 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Product exploration timeout after 40930 steps with 276 reset in 10003 ms.
Product exploration timeout after 40800 steps with 275 reset in 10003 ms.
Applying partial POR strategy [true, false, false, false, true, false]
Stuttering acceptance computed with spot in 193 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Support contains 2366 out of 2704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 110 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-31 07:05:07] [INFO ] Redundant transitions in 51 ms returned []
[2024-05-31 07:05:07] [INFO ] Invariant cache hit.
[2024-05-31 07:05:08] [INFO ] Dead Transitions using invariants and state equation in 1360 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1533 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Built C files in :
/tmp/ltsmin14182695742610202889
[2024-05-31 07:05:08] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14182695742610202889
Running compilation step : cd /tmp/ltsmin14182695742610202889;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14182695742610202889;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14182695742610202889;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2366 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 21 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-31 07:05:11] [INFO ] Invariant cache hit.
[2024-05-31 07:05:12] [INFO ] Implicit Places using invariants in 1052 ms returned []
[2024-05-31 07:05:12] [INFO ] Invariant cache hit.
[2024-05-31 07:05:15] [INFO ] Implicit Places using invariants and state equation in 2647 ms returned []
Implicit Place search using SMT with State Equation took 3701 ms to find 0 implicit places.
[2024-05-31 07:05:15] [INFO ] Invariant cache hit.
[2024-05-31 07:05:16] [INFO ] Dead Transitions using invariants and state equation in 1375 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5098 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Built C files in :
/tmp/ltsmin5045767695000975627
[2024-05-31 07:05:17] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5045767695000975627
Running compilation step : cd /tmp/ltsmin5045767695000975627;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5045767695000975627;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5045767695000975627;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-31 07:05:20] [INFO ] Flatten gal took : 122 ms
[2024-05-31 07:05:20] [INFO ] Flatten gal took : 110 ms
[2024-05-31 07:05:20] [INFO ] Time to serialize gal into /tmp/LTL8685247099568185973.gal : 27 ms
[2024-05-31 07:05:20] [INFO ] Time to serialize properties into /tmp/LTL16643979100946405491.prop : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8685247099568185973.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5497221581530302511.hoa' '-atoms' '/tmp/LTL16643979100946405491.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL16643979100946405491.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5497221581530302511.hoa
Detected timeout of ITS tools.
[2024-05-31 07:05:35] [INFO ] Flatten gal took : 107 ms
[2024-05-31 07:05:35] [INFO ] Flatten gal took : 137 ms
[2024-05-31 07:05:36] [INFO ] Time to serialize gal into /tmp/LTL3294988708748578369.gal : 28 ms
[2024-05-31 07:05:36] [INFO ] Time to serialize properties into /tmp/LTL10007885197523277157.ltl : 13 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3294988708748578369.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10007885197523277157.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((G("(((((((((Cells_0+Cells_1)+(Cells_2+Cells_3))+((Cells_4+Cells_5)+(Cells_6+Cells_7)))+(((Cells_8+Cells_9)+(Cells_10+Cells_11))+((...113732
Formula 0 simplified : F!"(((((((((Cells_0+Cells_1)+(Cells_2+Cells_3))+((Cells_4+Cells_5)+(Cells_6+Cells_7)))+(((Cells_8+Cells_9)+(Cells_10+Cells_11))+((Ce...113718
Detected timeout of ITS tools.
[2024-05-31 07:05:51] [INFO ] Flatten gal took : 86 ms
[2024-05-31 07:05:51] [INFO ] Applying decomposition
[2024-05-31 07:05:51] [INFO ] Flatten gal took : 94 ms
[2024-05-31 07:06:08] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.util.concurrent.TimeoutException: Subprocess running '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph818537512409613656.txt' '-o' '/tmp/graph818537512409613656.bin' '-w' '/tmp/graph818537512409613656.weights' killed by timeout after 10 SECONDS
at fr.lip6.move.gal.process.Runner.waitForOrTimeout(Runner.java:76)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:47)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:27)
at fr.lip6.move.gal.louvain.GraphBuilder.convertGraphToBin(GraphBuilder.java:258)
at fr.lip6.move.gal.louvain.GraphBuilder.computeLouvain(GraphBuilder.java:189)
at fr.lip6.move.gal.louvain.GraphBuilder.computeLouvain(GraphBuilder.java:157)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:226)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:277)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:663)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:341)
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:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-31 07:06:08] [INFO ] Flatten gal took : 85 ms
[2024-05-31 07:06:08] [INFO ] Time to serialize gal into /tmp/LTL1263372799994331812.gal : 14 ms
[2024-05-31 07:06:08] [INFO ] Time to serialize properties into /tmp/LTL2808824350438375558.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1263372799994331812.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2808824350438375558.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((G("(((((((((Cells_0+Cells_1)+(Cells_2+Cells_3))+((Cells_4+Cells_5)+(Cells_6+Cells_7)))+(((Cells_8+Cells_9)+(Cells_10+Cells_11))+((...113732
Formula 0 simplified : F!"(((((((((Cells_0+Cells_1)+(Cells_2+Cells_3))+((Cells_4+Cells_5)+(Cells_6+Cells_7)))+(((Cells_8+Cells_9)+(Cells_10+Cells_11))+((Ce...113718
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14441447910589346702
[2024-05-31 07:06:24] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14441447910589346702
Running compilation step : cd /tmp/ltsmin14441447910589346702;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14441447910589346702;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14441447910589346702;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property Sudoku-COL-AN13-LTLCardinality-05 finished in 454757 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((G(p0) U p1))&&(p2 U p3))))'
Support contains 338 out of 2704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Graph (complete) has 6591 edges and 2704 vertex of which 507 are kept as prefixes of interest. Removing 2197 places using SCC suffix rule.6 ms
Discarding 2197 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 26 ms. Remains 507 /2704 variables (removed 2197) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 507 cols
[2024-05-31 07:06:27] [INFO ] Computed 38 invariants in 58 ms
[2024-05-31 07:06:27] [INFO ] Implicit Places using invariants in 302 ms returned []
[2024-05-31 07:06:27] [INFO ] Invariant cache hit.
[2024-05-31 07:06:28] [INFO ] Implicit Places using invariants and state equation in 1094 ms returned []
Implicit Place search using SMT with State Equation took 1398 ms to find 0 implicit places.
[2024-05-31 07:06:28] [INFO ] Redundant transitions in 53 ms returned []
[2024-05-31 07:06:28] [INFO ] Invariant cache hit.
[2024-05-31 07:06:29] [INFO ] Dead Transitions using invariants and state equation in 638 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 507/2704 places, 2197/2197 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2124 ms. Remains : 507/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 339 ms :[(OR (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (NOT p1), (NOT p1), (NOT p3), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : Sudoku-COL-AN13-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p3) (NOT p2))), acceptance={0, 1} source=0 dest: 0}, { cond=(OR (AND (NOT p1) p0 p3) (AND (NOT p1) p0 p2)), acceptance={1} source=0 dest: 1}, { cond=(OR (AND (NOT p1) p0 p3) (AND (NOT p1) p0 p2)), acceptance={0, 1} source=0 dest: 2}, { cond=(OR (AND p1 p3) (AND p1 p2) (AND p0 p3) (AND p0 p2)), acceptance={0} source=0 dest: 3}, { cond=(OR (AND p1 (NOT p3) p2) (AND p0 (NOT p3) p2)), acceptance={0, 1} source=0 dest: 4}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p3) (NOT p2))), acceptance={0, 1} source=1 dest: 0}, { cond=(OR (AND (NOT p1) p0) (AND p0 (NOT p3) (NOT p2))), acceptance={1} source=1 dest: 1}, { cond=(OR (AND p1 (NOT p0) p3) (AND p1 (NOT p0) p2)), acceptance={0} source=1 dest: 3}, { cond=(AND p1 (NOT p0) (NOT p3) p2), acceptance={0, 1} source=1 dest: 4}, { cond=(OR (AND p1 p0 p3) (AND p1 p0 p2)), acceptance={} source=1 dest: 5}, { cond=(AND p1 p0 (NOT p3) p2), acceptance={1} source=1 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={1} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={1} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=3 dest: 2}, { cond=(OR p1 p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0, 1} source=4 dest: 0}, { cond=(AND (NOT p3) p2), acceptance={0, 1} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=5 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={1} source=5 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=5 dest: 3}, { cond=(AND p1 p0), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={0, 1} source=6 dest: 0}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={1} source=6 dest: 1}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={0, 1} source=6 dest: 4}, { cond=(AND p0 (NOT p3) p2), acceptance={1} source=6 dest: 6}]], initial=0, aps=[p1:(LEQ 2 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Product exploration timeout after 65730 steps with 443 reset in 10003 ms.
Product exploration timeout after 65320 steps with 440 reset in 10001 ms.
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0 p3 p2), (X (NOT (AND p1 (NOT p0) (NOT p3) p2))), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p3) (NOT p2))))), (X (NOT (AND (NOT p1) p0))), (X (NOT (OR (AND p1 (NOT p0) p3) (AND p1 (NOT p0) p2)))), (X (NOT (AND (NOT p3) p2))), (X (NOT (OR (AND (NOT p1) p0) (AND p0 (NOT p3) (NOT p2))))), (X (OR p1 p0)), (X (NOT (OR (AND (NOT p1) p0 p3) (AND (NOT p1) p0 p2)))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p3) (NOT p2))))), (X (OR (AND p1 p0 p3) (AND p1 p0 p2))), (X (NOT (AND p1 p0 (NOT p3) p2))), (X (NOT (OR (AND p1 (NOT p3) p2) (AND p0 (NOT p3) p2)))), (X (OR (AND p1 p3) (AND p1 p2) (AND p0 p3) (AND p0 p2))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 20 factoid took 4676 ms. Reduced automaton from 7 states, 28 edges and 4 AP (stutter insensitive) to 7 states, 28 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 315 ms :[(OR (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (NOT p1), (NOT p1), (NOT p3), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p3))]
Incomplete random walk after 10000 steps, including 67 resets, run finished after 3345 ms. (steps per millisecond=2 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 64 ms. (steps per millisecond=15 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 79 ms. (steps per millisecond=12 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 62 ms. (steps per millisecond=16 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 41 ms. (steps per millisecond=24 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 41 ms. (steps per millisecond=24 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 58 ms. (steps per millisecond=17 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 44 ms. (steps per millisecond=22 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 58 ms. (steps per millisecond=17 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 44 ms. (steps per millisecond=22 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 41 ms. (steps per millisecond=24 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 41 ms. (steps per millisecond=24 ) properties (out of 21) seen :0
Probabilistic random walk after 60485 steps, saw 60454 distinct states, run finished after 12031 ms. (steps per millisecond=5 ) properties seen :0
Running SMT prover for 21 properties.
[2024-05-31 07:07:11] [INFO ] Invariant cache hit.
[2024-05-31 07:07:14] [INFO ] [Real]Absence check using 0 positive and 38 generalized place invariants in 30 ms returned sat
[2024-05-31 07:07:14] [INFO ] After 304ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:18
[2024-05-31 07:07:15] [INFO ] [Nat]Absence check using 0 positive and 38 generalized place invariants in 27 ms returned sat
[2024-05-31 07:07:17] [INFO ] After 2069ms SMT Verify possible using state equation in natural domain returned unsat :12 sat :9
[2024-05-31 07:07:17] [INFO ] After 2834ms SMT Verify possible using trap constraints in natural domain returned unsat :12 sat :9
Attempting to minimize the solution found.
Minimization took 449 ms.
[2024-05-31 07:07:18] [INFO ] After 3674ms SMT Verify possible using all constraints in natural domain returned unsat :12 sat :9
Fused 21 Parikh solutions to 2 different solutions.
Finished Parikh walk after 169 steps, including 0 resets, run visited all 9 properties in 30 ms. (steps per millisecond=5 )
Parikh walk visited 5 properties in 31 ms.
Support contains 338 out of 507 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 12 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 507/507 places, 2197/2197 transitions.
Incomplete random walk after 10000 steps, including 67 resets, run finished after 2150 ms. (steps per millisecond=4 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 230 ms. (steps per millisecond=43 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 231 ms. (steps per millisecond=43 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 239 ms. (steps per millisecond=41 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 99558 steps, run timeout after 6009 ms. (steps per millisecond=16 ) properties seen :{}
Probabilistic random walk after 99558 steps, saw 99488 distinct states, run finished after 6009 ms. (steps per millisecond=16 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-31 07:07:27] [INFO ] Invariant cache hit.
[2024-05-31 07:07:27] [INFO ] [Real]Absence check using 0 positive and 38 generalized place invariants in 28 ms returned sat
[2024-05-31 07:07:30] [INFO ] After 3001ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-31 07:07:30] [INFO ] [Nat]Absence check using 0 positive and 38 generalized place invariants in 29 ms returned sat
[2024-05-31 07:07:31] [INFO ] After 687ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-31 07:07:31] [INFO ] After 1019ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 202 ms.
[2024-05-31 07:07:32] [INFO ] After 1388ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 1 different solutions.
Finished Parikh walk after 169 steps, including 0 resets, run visited all 4 properties in 19 ms. (steps per millisecond=8 )
Parikh walk visited 4 properties in 19 ms.
Found 8 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 p3 p2), (X (NOT (AND p1 (NOT p0) (NOT p3) p2))), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p3) (NOT p2))))), (X (NOT (AND (NOT p1) p0))), (X (NOT (OR (AND p1 (NOT p0) p3) (AND p1 (NOT p0) p2)))), (X (NOT (AND (NOT p3) p2))), (X (NOT (OR (AND (NOT p1) p0) (AND p0 (NOT p3) (NOT p2))))), (X (OR p1 p0)), (X (NOT (OR (AND (NOT p1) p0 p3) (AND (NOT p1) p0 p2)))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p3) (NOT p2))))), (X (OR (AND p1 p0 p3) (AND p1 p0 p2))), (X (NOT (AND p1 p0 (NOT p3) p2))), (X (NOT (OR (AND p1 (NOT p3) p2) (AND p0 (NOT p3) p2)))), (X (OR (AND p1 p3) (AND p1 p2) (AND p0 p3) (AND p0 p2))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND p0 p1 (NOT p3) p2))), (G (NOT (AND (NOT p0) p1))), (G (NOT (AND (NOT p3) p2))), (G (OR p0 p1)), (G (NOT (AND (NOT p0) (NOT p3) p2))), (G (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p1)))), (G (NOT (AND p0 (NOT p3) p2)))]
False Knowledge obtained : [(F (NOT (OR (AND p0 p1 p3) (AND p0 p1 p2)))), (F (AND (NOT p0) p1 (NOT p3) p2)), (F (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2)))), (F (OR (AND p0 (NOT p3) p2) (AND p1 (NOT p3) p2))), (F (OR (AND (NOT p0) p1 p3) (AND (NOT p0) p1 p2))), (F (AND (NOT p3) (NOT p2))), (F (OR (AND p0 (NOT p1)) (AND p0 (NOT p3) (NOT p2)))), (F (OR (AND (NOT p0) (NOT p1)) (AND (NOT p3) (NOT p2)))), (F (AND p0 (NOT p3) (NOT p2))), (F (NOT (OR (AND p0 p3) (AND p0 p2) (AND p1 p3) (AND p1 p2)))), (F (OR (AND p0 (NOT p1) p3) (AND p0 (NOT p1) p2))), (F (NOT (AND p0 p1))), (F (AND p0 (NOT p1)))]
Property proved to be false thanks to negative knowledge :(F (AND (NOT p0) p1 (NOT p3) p2))
Knowledge based reduction with 28 factoid took 5248 ms. Reduced automaton from 7 states, 28 edges and 4 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN13-LTLCardinality-07 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN13-LTLCardinality-07 finished in 70308 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0&&X(p1))))'
Support contains 338 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Reduce places removed 2197 places and 0 transitions.
Iterating post reduction 0 with 2197 rules applied. Total rules applied 2197 place count 507 transition count 2197
Applied a total of 2197 rules in 16 ms. Remains 507 /2704 variables (removed 2197) and now considering 2197/2197 (removed 0) transitions.
[2024-05-31 07:07:37] [INFO ] Invariant cache hit.
[2024-05-31 07:07:37] [INFO ] Implicit Places using invariants in 245 ms returned []
[2024-05-31 07:07:37] [INFO ] Invariant cache hit.
[2024-05-31 07:07:38] [INFO ] Implicit Places using invariants and state equation in 1198 ms returned []
Implicit Place search using SMT with State Equation took 1445 ms to find 0 implicit places.
[2024-05-31 07:07:38] [INFO ] Invariant cache hit.
[2024-05-31 07:07:39] [INFO ] Dead Transitions using invariants and state equation in 716 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 507/2704 places, 2197/2197 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2178 ms. Remains : 507/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 92 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-COL-AN13-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ (ADD s169 s170 s171 s172 s173 s174 s175 s176 s177 s178 s179 s180 s181 s182 s183 s184 s185 s186 s187 s188 s189 s190 s191 s192 s193 s194 s195 s196 s...], 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]]
Product exploration timeout after 57710 steps with 389 reset in 10001 ms.
Product exploration timeout after 57270 steps with 386 reset in 10002 ms.
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
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 p1), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (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 5 factoid took 370 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[true, (OR (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 67 resets, run finished after 1828 ms. (steps per millisecond=5 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 233 ms. (steps per millisecond=42 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 236 ms. (steps per millisecond=42 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 139933 steps, run timeout after 6023 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 139933 steps, saw 139830 distinct states, run finished after 6023 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-31 07:08:08] [INFO ] Invariant cache hit.
[2024-05-31 07:08:09] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 07:08:09] [INFO ] [Nat]Absence check using 0 positive and 38 generalized place invariants in 28 ms returned sat
[2024-05-31 07:08:10] [INFO ] After 1599ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-31 07:08:10] [INFO ] After 1753ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 89 ms.
[2024-05-31 07:08:11] [INFO ] After 1965ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 169 steps, including 0 resets, run visited all 2 properties in 15 ms. (steps per millisecond=11 )
Parikh walk visited 2 properties in 14 ms.
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (OR (NOT p0) (NOT p1))), (F (NOT (AND p0 p1)))]
Property proved to be false thanks to negative knowledge :(F (OR (NOT p0) (NOT p1)))
Knowledge based reduction with 5 factoid took 267 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN13-LTLCardinality-09 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN13-LTLCardinality-09 finished in 33933 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G(p0) U p1))))'
Support contains 2535 out of 2704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 21 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 2704 cols
[2024-05-31 07:08:11] [INFO ] Computed 507 invariants in 17 ms
[2024-05-31 07:08:11] [INFO ] Implicit Places using invariants in 598 ms returned []
[2024-05-31 07:08:11] [INFO ] Invariant cache hit.
[2024-05-31 07:08:13] [INFO ] Implicit Places using invariants and state equation in 1923 ms returned []
Implicit Place search using SMT with State Equation took 2523 ms to find 0 implicit places.
[2024-05-31 07:08:13] [INFO ] Redundant transitions in 50 ms returned []
[2024-05-31 07:08:13] [INFO ] Invariant cache hit.
[2024-05-31 07:08:15] [INFO ] Dead Transitions using invariants and state equation in 1202 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3804 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : Sudoku-COL-AN13-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={1} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={1} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p1:(AND (LEQ (ADD s169 s170 s171 s172 s173 s174 s175 s176 s177 s178 s179 s180 s181 s182 s183 s184 s185 s186 s187 s188 s189 s190 s191 s192 s193 s194 s195 s...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration timeout after 24980 steps with 168 reset in 10005 ms.
Product exploration timeout after 24880 steps with 167 reset in 10002 ms.
Computed a total of 2704 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2704 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0)))), (X (OR p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 261 ms. Reduced automaton from 3 states, 11 edges and 2 AP (stutter insensitive) to 3 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 67 resets, run finished after 1936 ms. (steps per millisecond=5 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 203 ms. (steps per millisecond=49 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 209 ms. (steps per millisecond=47 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 796 ms. (steps per millisecond=12 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-31 07:08:40] [INFO ] Invariant cache hit.
[2024-05-31 07:08:40] [INFO ] After 297ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2024-05-31 07:08:41] [INFO ] [Nat]Absence check using 507 positive place invariants in 126 ms returned sat
[2024-05-31 07:08:41] [INFO ] After 484ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0)))), (X (OR p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p0) p1))), (G (OR p0 p1)), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 11 factoid took 389 ms. Reduced automaton from 3 states, 11 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p1), (NOT p1)]
Support contains 2535 out of 2704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 38 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-31 07:08:41] [INFO ] Invariant cache hit.
[2024-05-31 07:08:42] [INFO ] Implicit Places using invariants in 589 ms returned []
[2024-05-31 07:08:42] [INFO ] Invariant cache hit.
[2024-05-31 07:08:44] [INFO ] Implicit Places using invariants and state equation in 1950 ms returned []
Implicit Place search using SMT with State Equation took 2541 ms to find 0 implicit places.
[2024-05-31 07:08:44] [INFO ] Redundant transitions in 50 ms returned []
[2024-05-31 07:08:44] [INFO ] Invariant cache hit.
[2024-05-31 07:08:45] [INFO ] Dead Transitions using invariants and state equation in 1228 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3866 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Computed a total of 2704 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2704 transition count 2197
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 : [p1, (X p1), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 752 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(NOT p1), (NOT p1)]
Finished random walk after 85 steps, including 0 resets, run visited all 1 properties in 26 ms. (steps per millisecond=3 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p1, (X p1), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1))]
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 75 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 56 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (NOT p1)]
Stuttering criterion allowed to conclude after 145 steps with 0 reset in 34 ms.
FORMULA Sudoku-COL-AN13-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN13-LTLCardinality-10 finished in 36363 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 507 out of 2704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Graph (complete) has 6591 edges and 2704 vertex of which 507 are kept as prefixes of interest. Removing 2197 places using SCC suffix rule.4 ms
Discarding 2197 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 21 ms. Remains 507 /2704 variables (removed 2197) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 507 cols
[2024-05-31 07:08:47] [INFO ] Computed 38 invariants in 49 ms
[2024-05-31 07:08:47] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-05-31 07:08:47] [INFO ] Invariant cache hit.
[2024-05-31 07:08:48] [INFO ] Implicit Places using invariants and state equation in 496 ms returned []
Implicit Place search using SMT with State Equation took 638 ms to find 0 implicit places.
[2024-05-31 07:08:48] [INFO ] Redundant transitions in 51 ms returned []
[2024-05-31 07:08:48] [INFO ] Invariant cache hit.
[2024-05-31 07:08:49] [INFO ] Dead Transitions using invariants and state equation in 624 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 507/2704 places, 2197/2197 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1353 ms. Remains : 507/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN13-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LEQ 3 (ADD s169 s170 s171 s172 s173 s174 s175 s176 s177 s178 s179 s180 s181 s182 s183 s184 s185 s186 s187 s188 s189 s190 s191 s192 s193 s194 s195...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration timeout after 55430 steps with 374 reset in 10001 ms.
Product exploration timeout after 54850 steps with 370 reset in 10002 ms.
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 67 resets, run finished after 1575 ms. (steps per millisecond=6 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 337 ms. (steps per millisecond=29 ) properties (out of 1) seen :0
Probabilistic random walk after 86899 steps, saw 86846 distinct states, run finished after 3036 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-31 07:09:14] [INFO ] Invariant cache hit.
[2024-05-31 07:09:14] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 07:09:14] [INFO ] [Nat]Absence check using 0 positive and 38 generalized place invariants in 27 ms returned sat
[2024-05-31 07:09:19] [INFO ] After 4680ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 07:09:19] [INFO ] After 4755ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 48 ms.
[2024-05-31 07:09:19] [INFO ] After 4916ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 167 steps, including 0 resets, run visited all 1 properties in 15 ms. (steps per millisecond=11 )
Parikh walk visited 1 properties in 16 ms.
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 11 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-31 07:09:19] [INFO ] Invariant cache hit.
[2024-05-31 07:09:19] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-31 07:09:19] [INFO ] Invariant cache hit.
[2024-05-31 07:09:20] [INFO ] Implicit Places using invariants and state equation in 470 ms returned []
Implicit Place search using SMT with State Equation took 553 ms to find 0 implicit places.
[2024-05-31 07:09:20] [INFO ] Redundant transitions in 54 ms returned []
[2024-05-31 07:09:20] [INFO ] Invariant cache hit.
[2024-05-31 07:09:21] [INFO ] Dead Transitions using invariants and state equation in 624 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1258 ms. Remains : 507/507 places, 2197/2197 transitions.
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 67 resets, run finished after 1582 ms. (steps per millisecond=6 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 346 ms. (steps per millisecond=28 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 87989 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 87989 steps, saw 87932 distinct states, run finished after 3003 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-31 07:09:26] [INFO ] Invariant cache hit.
[2024-05-31 07:09:26] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 07:09:26] [INFO ] [Nat]Absence check using 0 positive and 38 generalized place invariants in 25 ms returned sat
[2024-05-31 07:09:31] [INFO ] After 4668ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 07:09:31] [INFO ] After 4757ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 49 ms.
[2024-05-31 07:09:31] [INFO ] After 4907ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 167 steps, including 0 resets, run visited all 1 properties in 10 ms. (steps per millisecond=16 )
Parikh walk visited 1 properties in 10 ms.
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Product exploration timeout after 55070 steps with 371 reset in 10003 ms.
Product exploration timeout after 54910 steps with 370 reset in 10002 ms.
Built C files in :
/tmp/ltsmin1785532321073055171
[2024-05-31 07:09:51] [INFO ] Too many transitions (2197) to apply POR reductions. Disabling POR matrices.
[2024-05-31 07:09:51] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1785532321073055171
Running compilation step : cd /tmp/ltsmin1785532321073055171;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1785532321073055171;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1785532321073055171;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 7 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-31 07:09:54] [INFO ] Invariant cache hit.
[2024-05-31 07:09:54] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-31 07:09:54] [INFO ] Invariant cache hit.
[2024-05-31 07:09:55] [INFO ] Implicit Places using invariants and state equation in 470 ms returned []
Implicit Place search using SMT with State Equation took 565 ms to find 0 implicit places.
[2024-05-31 07:09:55] [INFO ] Redundant transitions in 49 ms returned []
[2024-05-31 07:09:55] [INFO ] Invariant cache hit.
[2024-05-31 07:09:56] [INFO ] Dead Transitions using invariants and state equation in 629 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1258 ms. Remains : 507/507 places, 2197/2197 transitions.
Built C files in :
/tmp/ltsmin16649873117382132051
[2024-05-31 07:09:56] [INFO ] Too many transitions (2197) to apply POR reductions. Disabling POR matrices.
[2024-05-31 07:09:56] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16649873117382132051
Running compilation step : cd /tmp/ltsmin16649873117382132051;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16649873117382132051;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16649873117382132051;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-31 07:09:59] [INFO ] Flatten gal took : 77 ms
[2024-05-31 07:09:59] [INFO ] Flatten gal took : 63 ms
[2024-05-31 07:09:59] [INFO ] Time to serialize gal into /tmp/LTL13315506436917330541.gal : 9 ms
[2024-05-31 07:09:59] [INFO ] Time to serialize properties into /tmp/LTL7550674090968208787.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13315506436917330541.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11926414908193274060.hoa' '-atoms' '/tmp/LTL7550674090968208787.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL7550674090968208787.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11926414908193274060.hoa
Detected timeout of ITS tools.
[2024-05-31 07:10:14] [INFO ] Flatten gal took : 62 ms
[2024-05-31 07:10:14] [INFO ] Flatten gal took : 64 ms
[2024-05-31 07:10:14] [INFO ] Time to serialize gal into /tmp/LTL10558456624006147944.gal : 9 ms
[2024-05-31 07:10:14] [INFO ] Time to serialize properties into /tmp/LTL8561703669465849036.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10558456624006147944.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8561703669465849036.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("((((((((((Cells_0+Cells_1)+(Cells_2+Cells_3))+((Cells_4+Cells_5)+(Cells_6+Cells_7)))+(((Cells_8+Cells_9)+(Cells_10+Cells_11))+...5961
Formula 0 simplified : GF!"((((((((((Cells_0+Cells_1)+(Cells_2+Cells_3))+((Cells_4+Cells_5)+(Cells_6+Cells_7)))+(((Cells_8+Cells_9)+(Cells_10+Cells_11))+((...5955
Detected timeout of ITS tools.
[2024-05-31 07:10:29] [INFO ] Flatten gal took : 71 ms
[2024-05-31 07:10:29] [INFO ] Applying decomposition
[2024-05-31 07:10:29] [INFO ] Flatten gal took : 60 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph13146500197668292472.txt' '-o' '/tmp/graph13146500197668292472.bin' '-w' '/tmp/graph13146500197668292472.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13146500197668292472.bin' '-l' '-1' '-v' '-w' '/tmp/graph13146500197668292472.weights' '-q' '0' '-e' '0.001'
[2024-05-31 07:10:30] [INFO ] Decomposing Gal with order
[2024-05-31 07:10:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 07:10:33] [INFO ] Removed a total of 2028 redundant transitions.
[2024-05-31 07:10:33] [INFO ] Flatten gal took : 3306 ms
[2024-05-31 07:10:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 2197 labels/synchronizations in 137 ms.
[2024-05-31 07:10:33] [INFO ] Time to serialize gal into /tmp/LTL13760338982061730889.gal : 10 ms
[2024-05-31 07:10:33] [INFO ] Time to serialize properties into /tmp/LTL1817011672222858377.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13760338982061730889.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1817011672222858377.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("((((((((((gu1.Cells_0+gu1.Cells_1)+(gu1.Cells_2+gu1.Cells_3))+((gu1.Cells_4+gu1.Cells_5)+(gu1.Cells_6+gu1.Cells_7)))+(((gu1.Ce...7989
Formula 0 simplified : GF!"((((((((((gu1.Cells_0+gu1.Cells_1)+(gu1.Cells_2+gu1.Cells_3))+((gu1.Cells_4+gu1.Cells_5)+(gu1.Cells_6+gu1.Cells_7)))+(((gu1.Cell...7983
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12863385053550000009
[2024-05-31 07:10:48] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12863385053550000009
Running compilation step : cd /tmp/ltsmin12863385053550000009;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12863385053550000009;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12863385053550000009;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property Sudoku-COL-AN13-LTLCardinality-12 finished in 124273 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((F(p1) U G(p2))&&p0)))'
Support contains 2535 out of 2704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 19 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 2704 cols
[2024-05-31 07:10:51] [INFO ] Computed 507 invariants in 11 ms
[2024-05-31 07:10:52] [INFO ] Implicit Places using invariants in 681 ms returned []
[2024-05-31 07:10:52] [INFO ] Invariant cache hit.
[2024-05-31 07:10:54] [INFO ] Implicit Places using invariants and state equation in 1980 ms returned []
Implicit Place search using SMT with State Equation took 2667 ms to find 0 implicit places.
[2024-05-31 07:10:54] [INFO ] Redundant transitions in 48 ms returned []
[2024-05-31 07:10:54] [INFO ] Invariant cache hit.
[2024-05-31 07:10:55] [INFO ] Dead Transitions using invariants and state equation in 1253 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3994 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Sudoku-COL-AN13-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1))), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (LEQ (ADD s2535 s2536 s2537 s2538 s2539 s2540 s2541 s2542 s2543 s2544 s2545 s2546 s2547 s2548 s2549 s2550 s2551 s2552 s2553 s2554 s2555 s2556 s255...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration timeout after 41700 steps with 281 reset in 10004 ms.
Product exploration timeout after 41320 steps with 278 reset in 10001 ms.
Computed a total of 2704 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2704 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p2 p1), (X p2), (X (NOT p0)), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1))))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT 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 10 factoid took 397 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 214 ms :[(OR (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 67 resets, run finished after 2204 ms. (steps per millisecond=4 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1489 ms. (steps per millisecond=6 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1614 ms. (steps per millisecond=6 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1086 ms. (steps per millisecond=9 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 621 ms. (steps per millisecond=16 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 618 ms. (steps per millisecond=16 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 748 ms. (steps per millisecond=13 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2024-05-31 07:11:26] [INFO ] Invariant cache hit.
[2024-05-31 07:11:30] [INFO ] After 487ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:5
[2024-05-31 07:11:30] [INFO ] [Nat]Absence check using 507 positive place invariants in 130 ms returned sat
[2024-05-31 07:11:30] [INFO ] After 779ms 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.
Found 6 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X p2), (X (NOT p0)), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1))))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT 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 (NOT p1) (NOT p2)))), (G (NOT (AND (NOT p1) p2 p0))), (G (NOT (AND (NOT p1) p2))), (G p2), (G (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p0))))), (G (NOT (AND (NOT p1) (NOT p2) p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 16 factoid took 413 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
[2024-05-31 07:11:32] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Support contains 2366 out of 2704 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 21 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-31 07:11:47] [INFO ] Invariant cache hit.
[2024-05-31 07:11:48] [INFO ] Implicit Places using invariants in 642 ms returned []
[2024-05-31 07:11:48] [INFO ] Invariant cache hit.
[2024-05-31 07:11:50] [INFO ] Implicit Places using invariants and state equation in 2041 ms returned []
Implicit Place search using SMT with State Equation took 2691 ms to find 0 implicit places.
[2024-05-31 07:11:50] [INFO ] Redundant transitions in 52 ms returned []
[2024-05-31 07:11:50] [INFO ] Invariant cache hit.
[2024-05-31 07:11:51] [INFO ] Dead Transitions using invariants and state equation in 1261 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4034 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Computed a total of 2704 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2704 transition count 2197
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 66 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Finished random walk after 85 steps, including 0 resets, run visited all 1 properties in 25 ms. (steps per millisecond=3 )
Parikh walk visited 0 properties in 0 ms.
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 86 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
[2024-05-31 07:11:54] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Product exploration timeout after 37700 steps with 438 reset in 10001 ms.
Product exploration timeout after 37490 steps with 435 reset in 10001 ms.
Built C files in :
/tmp/ltsmin16475777207514208268
[2024-05-31 07:12:29] [INFO ] Too many transitions (2197) to apply POR reductions. Disabling POR matrices.
[2024-05-31 07:12:29] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16475777207514208268
Running compilation step : cd /tmp/ltsmin16475777207514208268;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16475777207514208268;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16475777207514208268;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2366 out of 2704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 37 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-31 07:12:32] [INFO ] Invariant cache hit.
[2024-05-31 07:12:33] [INFO ] Implicit Places using invariants in 895 ms returned []
[2024-05-31 07:12:33] [INFO ] Invariant cache hit.
[2024-05-31 07:12:35] [INFO ] Implicit Places using invariants and state equation in 2490 ms returned []
Implicit Place search using SMT with State Equation took 3387 ms to find 0 implicit places.
[2024-05-31 07:12:35] [INFO ] Redundant transitions in 53 ms returned []
[2024-05-31 07:12:35] [INFO ] Invariant cache hit.
[2024-05-31 07:12:36] [INFO ] Dead Transitions using invariants and state equation in 1292 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4773 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Built C files in :
/tmp/ltsmin11481508228155224141
[2024-05-31 07:12:36] [INFO ] Too many transitions (2197) to apply POR reductions. Disabling POR matrices.
[2024-05-31 07:12:36] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11481508228155224141
Running compilation step : cd /tmp/ltsmin11481508228155224141;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11481508228155224141;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11481508228155224141;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-31 07:12:40] [INFO ] Flatten gal took : 161 ms
[2024-05-31 07:12:40] [INFO ] Flatten gal took : 149 ms
[2024-05-31 07:12:40] [INFO ] Time to serialize gal into /tmp/LTL17026668515122737647.gal : 12 ms
[2024-05-31 07:12:40] [INFO ] Time to serialize properties into /tmp/LTL7009294345188006109.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17026668515122737647.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1271380331442068963.hoa' '-atoms' '/tmp/LTL7009294345188006109.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL7009294345188006109.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1271380331442068963.hoa
Detected timeout of ITS tools.
[2024-05-31 07:12:55] [INFO ] Flatten gal took : 89 ms
[2024-05-31 07:12:55] [INFO ] Flatten gal took : 83 ms
[2024-05-31 07:12:55] [INFO ] Time to serialize gal into /tmp/LTL17832301290083303284.gal : 12 ms
[2024-05-31 07:12:55] [INFO ] Time to serialize properties into /tmp/LTL9307349437319934338.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17832301290083303284.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9307349437319934338.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(("((((((((((Columns_0+Columns_1)+(Columns_2+Columns_3))+((Columns_4+Columns_5)+(Columns_6+Columns_7)))+(((Columns_8+Columns_9)+(C...92677
Formula 0 simplified : G(!"((((((((((Columns_0+Columns_1)+(Columns_2+Columns_3))+((Columns_4+Columns_5)+(Columns_6+Columns_7)))+(((Columns_8+Columns_9)+(Co...92670
Detected timeout of ITS tools.
[2024-05-31 07:13:11] [INFO ] Flatten gal took : 84 ms
[2024-05-31 07:13:11] [INFO ] Applying decomposition
[2024-05-31 07:13:11] [INFO ] Flatten gal took : 81 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph10508380433868019587.txt' '-o' '/tmp/graph10508380433868019587.bin' '-w' '/tmp/graph10508380433868019587.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10508380433868019587.bin' '-l' '-1' '-v' '-w' '/tmp/graph10508380433868019587.weights' '-q' '0' '-e' '0.001'
[2024-05-31 07:13:46] [INFO ] Decomposing Gal with order
[2024-05-31 07:13:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 07:13:52] [INFO ] Flatten gal took : 5150 ms
[2024-05-31 07:13:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2024-05-31 07:13:52] [INFO ] Time to serialize gal into /tmp/LTL10110024904261858020.gal : 20 ms
[2024-05-31 07:13:52] [INFO ] Time to serialize properties into /tmp/LTL15019181687573268735.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10110024904261858020.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15019181687573268735.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(("((((((((((gu1.Columns_0+gu1.Columns_1)+(gu1.Columns_2+gu1.Columns_3))+((gu1.Columns_4+gu1.Columns_5)+(gu1.Columns_6+gu1.Columns...122421
Formula 0 simplified : G(!"((((((((((gu1.Columns_0+gu1.Columns_1)+(gu1.Columns_2+gu1.Columns_3))+((gu1.Columns_4+gu1.Columns_5)+(gu1.Columns_6+gu1.Columns_...122414
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9058798661654574763
[2024-05-31 07:14:07] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9058798661654574763
Running compilation step : cd /tmp/ltsmin9058798661654574763;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9058798661654574763;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9058798661654574763;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property Sudoku-COL-AN13-LTLCardinality-15 finished in 198828 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X((p0 U (X(p1) U (X(G(p1))||(p1&&X(p1))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((F(p1) U G(p2))&&p0)))'
[2024-05-31 07:14:15] [INFO ] Flatten gal took : 115 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8653072379083315777
[2024-05-31 07:14:15] [INFO ] Too many transitions (2197) to apply POR reductions. Disabling POR matrices.
[2024-05-31 07:14:15] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8653072379083315777
Running compilation step : cd /tmp/ltsmin8653072379083315777;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-31 07:14:15] [INFO ] Applying decomposition
[2024-05-31 07:14:15] [INFO ] Flatten gal took : 95 ms
Compilation finished in 7399 ms.
Running link step : cd /tmp/ltsmin8653072379083315777;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 184 ms.
Running LTSmin : cd /tmp/ltsmin8653072379083315777;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((LTLAPp0==true))||X(((LTLAPp0==true) U (X((LTLAPp1==true)) U (X([]((LTLAPp1==true)))||((LTLAPp1==true)&&X((LTLAPp1==true))))))))' '--buchi-type=spotba'
[2024-05-31 07:14:56] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.util.concurrent.TimeoutException: Subprocess running '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph2945395910064888076.txt' '-o' '/tmp/graph2945395910064888076.bin' '-w' '/tmp/graph2945395910064888076.weights' killed by timeout after 10 SECONDS
at fr.lip6.move.gal.process.Runner.waitForOrTimeout(Runner.java:76)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:47)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:27)
at fr.lip6.move.gal.louvain.GraphBuilder.convertGraphToBin(GraphBuilder.java:258)
at fr.lip6.move.gal.louvain.GraphBuilder.computeLouvain(GraphBuilder.java:189)
at fr.lip6.move.gal.louvain.GraphBuilder.computeLouvain(GraphBuilder.java:157)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:226)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:277)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:106)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:855)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-31 07:14:56] [INFO ] Flatten gal took : 269 ms
[2024-05-31 07:14:56] [INFO ] Time to serialize gal into /tmp/LTLCardinality15590381306811322787.gal : 28 ms
[2024-05-31 07:14:56] [INFO ] Time to serialize properties into /tmp/LTLCardinality14990085463514731299.ltl : 15 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality15590381306811322787.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality14990085463514731299.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...299
Read 3 LTL properties
Checking formula 0 : !(((G("(((((((((Cells_0+Cells_1)+(Cells_2+Cells_3))+((Cells_4+Cells_5)+(Cells_6+Cells_7)))+(((Cells_8+Cells_9)+(Cells_10+Cells_11))+((...113732
Formula 0 simplified : F!"(((((((((Cells_0+Cells_1)+(Cells_2+Cells_3))+((Cells_4+Cells_5)+(Cells_6+Cells_7)))+(((Cells_8+Cells_9)+(Cells_10+Cells_11))+((Ce...113718
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.012: LTL layer: formula: ([]((LTLAPp0==true))||X(((LTLAPp0==true) U (X((LTLAPp1==true)) U (X([]((LTLAPp1==true)))||((LTLAPp1==true)&&X((LTLAPp1==true))))))))
pins2lts-mc-linux64( 3/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.025: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.056: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.065: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.065: "([]((LTLAPp0==true))||X(((LTLAPp0==true) U (X((LTLAPp1==true)) U (X([]((LTLAPp1==true)))||((LTLAPp1==true)&&X((LTLAPp1==true))))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.085: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.094: Using Spin LTL semantics
pins2lts-mc-linux64( 5/ 8), 0.131: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.136: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.155: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.161: buchi has 8 states
pins2lts-mc-linux64( 0/ 8), 0.217: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 7.116: DFS-FIFO for weak LTL, using special progress label 2204
pins2lts-mc-linux64( 0/ 8), 7.116: There are 2205 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 7.116: State length is 2705, there are 2215 groups
pins2lts-mc-linux64( 0/ 8), 7.116: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 7.116: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 7.116: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 7.116: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 5/ 8), 21.569: ~1 levels ~960 states ~2073896 transitions
pins2lts-mc-linux64( 5/ 8), 33.579: ~1 levels ~1920 states ~4147496 transitions
pins2lts-mc-linux64( 7/ 8), 57.222: ~1 levels ~3840 states ~8155184 transitions
pins2lts-mc-linux64( 1/ 8), 80.463: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 135.428:
pins2lts-mc-linux64( 0/ 8), 135.429: mean standard work distribution: 1.1% (states) 1.5% (transitions)
pins2lts-mc-linux64( 0/ 8), 135.429:
pins2lts-mc-linux64( 0/ 8), 135.429: Explored 5486 states 11719752 transitions, fanout: 2136.302
pins2lts-mc-linux64( 0/ 8), 135.429: Total exploration time 128.270 sec (73.950 sec minimum, 99.376 sec on average)
pins2lts-mc-linux64( 0/ 8), 135.429: States per second: 43, Transitions per second: 91368
pins2lts-mc-linux64( 0/ 8), 135.429:
pins2lts-mc-linux64( 0/ 8), 135.429: Progress states detected: 8540303
pins2lts-mc-linux64( 0/ 8), 135.429: Redundant explorations: -99.9358
pins2lts-mc-linux64( 0/ 8), 135.429:
pins2lts-mc-linux64( 0/ 8), 135.429: Queue width: 8B, total height: 10264827, memory: 78.31MB
pins2lts-mc-linux64( 0/ 8), 135.429: Tree memory: 321.2MB, 39.4 B/state, compr.: 0.4%
pins2lts-mc-linux64( 0/ 8), 135.429: Tree fill ratio (roots/leafs): 6.0%/100.0%
pins2lts-mc-linux64( 0/ 8), 135.429: Stored 2289 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 135.429: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 135.429: Est. total memory use: 399.5MB (~1102.3MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin8653072379083315777;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((LTLAPp0==true))||X(((LTLAPp0==true) U (X((LTLAPp1==true)) U (X([]((LTLAPp1==true)))||((LTLAPp1==true)&&X((LTLAPp1==true))))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin8653072379083315777;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((LTLAPp0==true))||X(((LTLAPp0==true) U (X((LTLAPp1==true)) U (X([]((LTLAPp1==true)))||((LTLAPp1==true)&&X((LTLAPp1==true))))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
ITS-tools command line returned an error code 137
[2024-05-31 07:30:11] [INFO ] Applying decomposition
[2024-05-31 07:30:12] [INFO ] Flatten gal took : 669 ms
[2024-05-31 07:30:13] [INFO ] Decomposing Gal with order
[2024-05-31 07:30:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 07:30:14] [INFO ] Removed a total of 5421 redundant transitions.
[2024-05-31 07:30:15] [INFO ] Flatten gal took : 924 ms
[2024-05-31 07:30:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 62 ms.
[2024-05-31 07:30:16] [INFO ] Time to serialize gal into /tmp/LTLCardinality16661812825502543401.gal : 45 ms
[2024-05-31 07:30:16] [INFO ] Time to serialize properties into /tmp/LTLCardinality3354620752649712172.ltl : 30 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality16661812825502543401.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality3354620752649712172.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 3 LTL properties
Checking formula 0 : !(((G("(((((((((gNN0.Cells_0+gNN1.Cells_1)+(gNN2.Cells_2+gNN3.Cells_3))+((gNN4.Cells_4+gNN5.Cells_5)+(gNN6.Cells_6+gNN7.Cells_7)))+(((...190530
Formula 0 simplified : F!"(((((((((gNN0.Cells_0+gNN1.Cells_1)+(gNN2.Cells_2+gNN3.Cells_3))+((gNN4.Cells_4+gNN5.Cells_5)+(gNN6.Cells_6+gNN7.Cells_7)))+(((gN...190516
ITS-tools command line returned an error code 137
[2024-05-31 07:42:42] [INFO ] Flatten gal took : 863 ms
[2024-05-31 07:42:50] [INFO ] Input system was already deterministic with 2197 transitions.
[2024-05-31 07:42:50] [INFO ] Transformed 2704 places.
[2024-05-31 07:42:50] [INFO ] Transformed 2197 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-31 07:42:51] [INFO ] Time to serialize gal into /tmp/LTLCardinality16040629126214673160.gal : 13 ms
[2024-05-31 07:42:51] [INFO ] Time to serialize properties into /tmp/LTLCardinality4049383936032087776.ltl : 8 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality16040629126214673160.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality4049383936032087776.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 3 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((G("(((((((((Cells_0+Cells_1)+(Cells_2+Cells_3))+((Cells_4+Cells_5)+(Cells_6+Cells_7)))+(((Cells_8+Cells_9)+(Cells_10+Cells_11))+((...113732
Formula 0 simplified : F!"(((((((((Cells_0+Cells_1)+(Cells_2+Cells_3))+((Cells_4+Cells_5)+(Cells_6+Cells_7)))+(((Cells_8+Cells_9)+(Cells_10+Cells_11))+((Ce...113718
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 161396 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16252448 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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