Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 424K
-rw-r--r-- 1 mcc users 8.8K Feb 26 09:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K Feb 26 09:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 26 08:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 26 08:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 17:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Feb 26 10:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 26 10:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Feb 26 10:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 26 10:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:17 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 6.5K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679167354967

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-COL-AN15
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-18 19:22:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-18 19:22:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 19:22:36] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-18 19:22:36] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-18 19:22:37] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 681 ms
[2023-03-18 19:22:37] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 4050 PT places and 3375.0 transition bindings in 10 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2023-03-18 19:22:37] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 3 ms.
[2023-03-18 19:22:37] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 2 formulas.
FORMULA Sudoku-COL-AN15-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN15-LTLCardinality-10 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 14 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 10214 steps, including 44 resets, run finished after 56 ms. (steps per millisecond=182 ) properties (out of 19) seen :14
Incomplete Best-First random walk after 10214 steps, including 44 resets, run finished after 10 ms. (steps per millisecond=1021 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10214 steps, including 44 resets, run finished after 8 ms. (steps per millisecond=1276 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10214 steps, including 44 resets, run finished after 8 ms. (steps per millisecond=1276 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10214 steps, including 44 resets, run finished after 8 ms. (steps per millisecond=1276 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10214 steps, including 44 resets, run finished after 8 ms. (steps per millisecond=1276 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1 rows 4 cols
[2023-03-18 19:22:37] [INFO ] Computed 3 place invariants in 4 ms
[2023-03-18 19:22:37] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-18 19:22:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-18 19:22:37] [INFO ] After 33ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :0
Fused 5 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 5 atomic propositions for a total of 14 simplifications.
FORMULA Sudoku-COL-AN15-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN15-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN15-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 19:22:37] [INFO ] Flatten gal took : 12 ms
[2023-03-18 19:22:37] [INFO ] Flatten gal took : 1 ms
Domain [N(15), N(15)] of place Rows breaks symmetries in sort N
[2023-03-18 19:22:37] [INFO ] Unfolded HLPN to a Petri net with 4050 places and 3375 transitions 13500 arcs in 62 ms.
[2023-03-18 19:22:37] [INFO ] Unfolded 11 HLPN properties in 3 ms.
Support contains 4050 out of 4050 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 38 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
// Phase 1: matrix 3375 rows 4050 cols
[2023-03-18 19:22:38] [INFO ] Computed 675 place invariants in 58 ms
[2023-03-18 19:22:38] [INFO ] Implicit Places using invariants in 632 ms returned []
[2023-03-18 19:22:38] [INFO ] Invariant cache hit.
[2023-03-18 19:22:39] [INFO ] Implicit Places using invariants and state equation in 816 ms returned []
Implicit Place search using SMT with State Equation took 1452 ms to find 0 implicit places.
[2023-03-18 19:22:39] [INFO ] Invariant cache hit.
[2023-03-18 19:22:41] [INFO ] Dead Transitions using invariants and state equation in 2018 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3512 ms. Remains : 4050/4050 places, 3375/3375 transitions.
Support contains 4050 out of 4050 places after structural reductions.
[2023-03-18 19:22:41] [INFO ] Flatten gal took : 316 ms
[2023-03-18 19:22:42] [INFO ] Flatten gal took : 185 ms
[2023-03-18 19:22:42] [INFO ] Input system was already deterministic with 3375 transitions.
Incomplete random walk after 10000 steps, including 50 resets, run finished after 3569 ms. (steps per millisecond=2 ) properties (out of 18) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 297 ms. (steps per millisecond=33 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 531 ms. (steps per millisecond=18 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 310 ms. (steps per millisecond=32 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 296 ms. (steps per millisecond=33 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 300 ms. (steps per millisecond=33 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
[2023-03-18 19:22:49] [INFO ] Invariant cache hit.
[2023-03-18 19:22:51] [INFO ] After 1140ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-18 19:22:52] [INFO ] [Nat]Absence check using 675 positive place invariants in 204 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 19:23:16] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 19:23:16] [INFO ] After 25039ms 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 1 ms.
Support contains 675 out of 4050 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Graph (complete) has 10125 edges and 4050 vertex of which 675 are kept as prefixes of interest. Removing 3375 places using SCC suffix rule.9 ms
Discarding 3375 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 74 ms. Remains 675 /4050 variables (removed 3375) and now considering 3375/3375 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 675/4050 places, 3375/3375 transitions.
Incomplete random walk after 10000 steps, including 50 resets, run finished after 3213 ms. (steps per millisecond=3 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 562 ms. (steps per millisecond=17 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 318 ms. (steps per millisecond=31 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 305 ms. (steps per millisecond=32 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 324 ms. (steps per millisecond=30 ) properties (out of 12) seen :0
Probabilistic random walk after 146545 steps, saw 146494 distinct states, run finished after 15070 ms. (steps per millisecond=9 ) properties seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 3375 rows 675 cols
[2023-03-18 19:23:37] [INFO ] Computed 44 place invariants in 198 ms
[2023-03-18 19:23:38] [INFO ] [Real]Absence check using 0 positive and 44 generalized place invariants in 47 ms returned sat
[2023-03-18 19:23:38] [INFO ] After 320ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-18 19:23:38] [INFO ] [Nat]Absence check using 0 positive and 44 generalized place invariants in 45 ms returned sat
[2023-03-18 19:23:41] [INFO ] After 3315ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :8
[2023-03-18 19:23:42] [INFO ] After 4201ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :8
Attempting to minimize the solution found.
Minimization took 493 ms.
[2023-03-18 19:23:43] [INFO ] After 5058ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :8
Fused 12 Parikh solutions to 1 different solutions.
Finished Parikh walk after 225 steps, including 0 resets, run visited all 8 properties in 34 ms. (steps per millisecond=6 )
Parikh walk visited 8 properties in 36 ms.
Successfully simplified 5 atomic propositions for a total of 11 simplifications.
Computed a total of 4050 stabilizing places and 3375 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4050 transition count 3375
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Support contains 3600 out of 4050 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 155 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
// Phase 1: matrix 3375 rows 4050 cols
[2023-03-18 19:23:43] [INFO ] Computed 675 place invariants in 18 ms
[2023-03-18 19:23:44] [INFO ] Implicit Places using invariants in 950 ms returned []
[2023-03-18 19:23:44] [INFO ] Invariant cache hit.
[2023-03-18 19:23:45] [INFO ] Implicit Places using invariants and state equation in 1168 ms returned []
Implicit Place search using SMT with State Equation took 2120 ms to find 0 implicit places.
[2023-03-18 19:23:46] [INFO ] Redundant transitions in 195 ms returned []
[2023-03-18 19:23:46] [INFO ] Invariant cache hit.
[2023-03-18 19:23:48] [INFO ] Dead Transitions using invariants and state equation in 1938 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4426 ms. Remains : 4050/4050 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-COL-AN15-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ (ADD s225 s226 s227 s228 s229 s230 s231 s232 s233 s234 s235 s236 s237 s238 s239 s240 s241 s242 s243 s244 s245 s246 s247 s248 s249 s250 s251 s252 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 197 steps with 0 reset in 97 ms.
FORMULA Sudoku-COL-AN15-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN15-LTLCardinality-03 finished in 4768 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X(F((p0&&X(p1)))))))))'
Support contains 225 out of 4050 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Reduce places removed 3375 places and 0 transitions.
Iterating post reduction 0 with 3375 rules applied. Total rules applied 3375 place count 675 transition count 3375
Applied a total of 3375 rules in 117 ms. Remains 675 /4050 variables (removed 3375) and now considering 3375/3375 (removed 0) transitions.
// Phase 1: matrix 3375 rows 675 cols
[2023-03-18 19:23:48] [INFO ] Computed 44 place invariants in 153 ms
[2023-03-18 19:23:49] [INFO ] Implicit Places using invariants in 660 ms returned []
[2023-03-18 19:23:49] [INFO ] Invariant cache hit.
[2023-03-18 19:23:57] [INFO ] Implicit Places using invariants and state equation in 7988 ms returned []
Implicit Place search using SMT with State Equation took 8650 ms to find 0 implicit places.
[2023-03-18 19:23:57] [INFO ] Invariant cache hit.
[2023-03-18 19:23:58] [INFO ] Dead Transitions using invariants and state equation in 977 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 675/4050 places, 3375/3375 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9746 ms. Remains : 675/4050 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 276 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-COL-AN15-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={} source=6 dest: 4}]], initial=5, aps=[p0:(GT 2 (ADD s450 s451 s452 s453 s454 s455 s456 s457 s458 s459 s460 s461 s462 s463 s464 s465 s466 s467 s468 s469 s470 s471 s472 s473 s474 s475 s476 s477 ...], 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][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 192 steps with 0 reset in 52 ms.
FORMULA Sudoku-COL-AN15-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN15-LTLCardinality-04 finished in 10103 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 225 out of 4050 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Reduce places removed 3375 places and 0 transitions.
Iterating post reduction 0 with 3375 rules applied. Total rules applied 3375 place count 675 transition count 3375
Applied a total of 3375 rules in 50 ms. Remains 675 /4050 variables (removed 3375) and now considering 3375/3375 (removed 0) transitions.
[2023-03-18 19:23:58] [INFO ] Invariant cache hit.
[2023-03-18 19:23:59] [INFO ] Implicit Places using invariants in 502 ms returned []
[2023-03-18 19:23:59] [INFO ] Invariant cache hit.
[2023-03-18 19:24:04] [INFO ] Implicit Places using invariants and state equation in 5542 ms returned []
Implicit Place search using SMT with State Equation took 6048 ms to find 0 implicit places.
[2023-03-18 19:24:04] [INFO ] Invariant cache hit.
[2023-03-18 19:24:05] [INFO ] Dead Transitions using invariants and state equation in 959 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 675/4050 places, 3375/3375 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7058 ms. Remains : 675/4050 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN15-LTLCardinality-05 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 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=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 27760 steps with 13880 reset in 10002 ms.
Product exploration timeout after 28090 steps with 14045 reset in 10002 ms.
Computed a total of 675 stabilizing places and 3375 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 675 transition count 3375
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 :(X p0)
Knowledge based reduction with 3 factoid took 60 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-AN15-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN15-LTLCardinality-05 finished in 27774 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0||X(p1)))&&G(F(!p0))))'
Support contains 450 out of 4050 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Reduce places removed 3375 places and 0 transitions.
Iterating post reduction 0 with 3375 rules applied. Total rules applied 3375 place count 675 transition count 3375
Applied a total of 3375 rules in 33 ms. Remains 675 /4050 variables (removed 3375) and now considering 3375/3375 (removed 0) transitions.
[2023-03-18 19:24:26] [INFO ] Invariant cache hit.
[2023-03-18 19:24:26] [INFO ] Implicit Places using invariants in 300 ms returned []
[2023-03-18 19:24:26] [INFO ] Invariant cache hit.
[2023-03-18 19:24:36] [INFO ] Implicit Places using invariants and state equation in 9880 ms returned []
Implicit Place search using SMT with State Equation took 10182 ms to find 0 implicit places.
[2023-03-18 19:24:36] [INFO ] Invariant cache hit.
[2023-03-18 19:24:37] [INFO ] Dead Transitions using invariants and state equation in 966 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 675/4050 places, 3375/3375 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11181 ms. Remains : 675/4050 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p1) p0), p0, p0, (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-COL-AN15-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ 1 (ADD s225 s226 s227 s228 s229 s230 s231 s232 s233 s234 s235 s236 s237 s238 s239 s240 s241 s242 s243 s244 s245 s246 s247 s248 s249 s250 s251 s252...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 199 steps with 0 reset in 51 ms.
FORMULA Sudoku-COL-AN15-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN15-LTLCardinality-06 finished in 11392 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U ((p1 U p0)||G(p2))))'
Support contains 3600 out of 4050 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 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 43 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
// Phase 1: matrix 3375 rows 4050 cols
[2023-03-18 19:24:37] [INFO ] Computed 675 place invariants in 14 ms
[2023-03-18 19:24:38] [INFO ] Implicit Places using invariants in 645 ms returned []
[2023-03-18 19:24:38] [INFO ] Invariant cache hit.
[2023-03-18 19:24:39] [INFO ] Implicit Places using invariants and state equation in 941 ms returned []
Implicit Place search using SMT with State Equation took 1588 ms to find 0 implicit places.
[2023-03-18 19:24:39] [INFO ] Redundant transitions in 181 ms returned []
[2023-03-18 19:24:39] [INFO ] Invariant cache hit.
[2023-03-18 19:24:41] [INFO ] Dead Transitions using invariants and state equation in 1880 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3704 ms. Remains : 4050/4050 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Sudoku-COL-AN15-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(LEQ 1 (ADD s225 s226 s227 s228 s229 s230 s231 s232 s233 s234 s235 s236 s237 s238 s239 s240 s241 s242 s243 s244 s245 s246 s247 s248 s249 s250 s251 s252...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration timeout after 21210 steps with 10605 reset in 10001 ms.
Product exploration timeout after 21190 steps with 10595 reset in 10001 ms.
Computed a total of 4050 stabilizing places and 3375 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4050 transition count 3375
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X p0), (X (NOT (AND (NOT p0) (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 6 factoid took 132 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN15-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN15-LTLCardinality-07 finished in 25504 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3375 out of 4050 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 98 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
[2023-03-18 19:25:03] [INFO ] Invariant cache hit.
[2023-03-18 19:25:04] [INFO ] Implicit Places using invariants in 1092 ms returned []
[2023-03-18 19:25:04] [INFO ] Invariant cache hit.
[2023-03-18 19:25:05] [INFO ] Implicit Places using invariants and state equation in 1448 ms returned []
Implicit Place search using SMT with State Equation took 2542 ms to find 0 implicit places.
[2023-03-18 19:25:05] [INFO ] Redundant transitions in 108 ms returned []
[2023-03-18 19:25:05] [INFO ] Invariant cache hit.
[2023-03-18 19:25:07] [INFO ] Dead Transitions using invariants and state equation in 1961 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4715 ms. Remains : 4050/4050 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN15-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 2 (ADD s225 s226 s227 s228 s229 s230 s231 s232 s233 s234 s235 s236 s237 s238 s239 s240 s241 s242 s243 s244 s245 s246 s247 s248 s249 s250 s251 s252 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 197 steps with 0 reset in 79 ms.
FORMULA Sudoku-COL-AN15-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN15-LTLCardinality-08 finished in 4852 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(!p0)))'
Support contains 225 out of 4050 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Graph (complete) has 10125 edges and 4050 vertex of which 675 are kept as prefixes of interest. Removing 3375 places using SCC suffix rule.6 ms
Discarding 3375 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 64 ms. Remains 675 /4050 variables (removed 3375) and now considering 3375/3375 (removed 0) transitions.
// Phase 1: matrix 3375 rows 675 cols
[2023-03-18 19:25:08] [INFO ] Computed 44 place invariants in 72 ms
[2023-03-18 19:25:08] [INFO ] Implicit Places using invariants in 574 ms returned []
[2023-03-18 19:25:08] [INFO ] Invariant cache hit.
[2023-03-18 19:25:15] [INFO ] Implicit Places using invariants and state equation in 6684 ms returned []
Implicit Place search using SMT with State Equation took 7258 ms to find 0 implicit places.
[2023-03-18 19:25:15] [INFO ] Redundant transitions in 105 ms returned []
[2023-03-18 19:25:15] [INFO ] Invariant cache hit.
[2023-03-18 19:25:16] [INFO ] Dead Transitions using invariants and state equation in 964 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 675/4050 places, 3375/3375 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8403 ms. Remains : 675/4050 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 94 ms :[true, p0, (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN15-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT 2 (ADD s450 s451 s452 s453 s454 s455 s456 s457 s458 s459 s460 s461 s462 s463 s464 s465 s466 s467 s468 s469 s470 s471 s472 s473 s474 s475 s476 s477 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 198 steps with 0 reset in 51 ms.
FORMULA Sudoku-COL-AN15-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN15-LTLCardinality-11 finished in 8574 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X(G(p1)))))'
Support contains 3600 out of 4050 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 38 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
// Phase 1: matrix 3375 rows 4050 cols
[2023-03-18 19:25:16] [INFO ] Computed 675 place invariants in 15 ms
[2023-03-18 19:25:17] [INFO ] Implicit Places using invariants in 911 ms returned []
[2023-03-18 19:25:17] [INFO ] Invariant cache hit.
[2023-03-18 19:25:18] [INFO ] Implicit Places using invariants and state equation in 1179 ms returned []
Implicit Place search using SMT with State Equation took 2092 ms to find 0 implicit places.
[2023-03-18 19:25:18] [INFO ] Invariant cache hit.
[2023-03-18 19:25:20] [INFO ] Dead Transitions using invariants and state equation in 1906 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4038 ms. Remains : 4050/4050 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-COL-AN15-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(LEQ (ADD s3825 s3826 s3827 s3828 s3829 s3830 s3831 s3832 s3833 s3834 s3835 s3836 s3837 s3838 s3839 s3840 s3841 s3842 s3843 s3844 s3845 s3846 s3847 s38...], 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]]
Product exploration timeout after 15640 steps with 137 reset in 10009 ms.
Product exploration timeout after 15530 steps with 136 reset in 10009 ms.
Computed a total of 4050 stabilizing places and 3375 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4050 transition count 3375
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 172 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 113 steps, including 0 resets, run visited all 3 properties in 53 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 4 factoid took 190 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-18 19:25:45] [INFO ] Invariant cache hit.
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 3600 out of 4050 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 36 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
[2023-03-18 19:26:00] [INFO ] Invariant cache hit.
[2023-03-18 19:26:01] [INFO ] Implicit Places using invariants in 891 ms returned []
[2023-03-18 19:26:01] [INFO ] Invariant cache hit.
[2023-03-18 19:26:03] [INFO ] Implicit Places using invariants and state equation in 1165 ms returned []
Implicit Place search using SMT with State Equation took 2058 ms to find 0 implicit places.
[2023-03-18 19:26:03] [INFO ] Invariant cache hit.
[2023-03-18 19:26:04] [INFO ] Dead Transitions using invariants and state equation in 1868 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3963 ms. Remains : 4050/4050 places, 3375/3375 transitions.
Computed a total of 4050 stabilizing places and 3375 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4050 transition count 3375
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 113 steps, including 0 resets, run visited all 3 properties in 52 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 199 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-18 19:26:09] [INFO ] Invariant cache hit.
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration timeout after 15640 steps with 137 reset in 10005 ms.
Product exploration timeout after 15700 steps with 137 reset in 10002 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3600 out of 4050 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 114 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
[2023-03-18 19:26:45] [INFO ] Redundant transitions in 107 ms returned []
[2023-03-18 19:26:45] [INFO ] Invariant cache hit.
[2023-03-18 19:26:47] [INFO ] Dead Transitions using invariants and state equation in 1888 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2120 ms. Remains : 4050/4050 places, 3375/3375 transitions.
Support contains 3600 out of 4050 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 35 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
[2023-03-18 19:26:47] [INFO ] Invariant cache hit.
[2023-03-18 19:26:47] [INFO ] Implicit Places using invariants in 829 ms returned []
[2023-03-18 19:26:47] [INFO ] Invariant cache hit.
[2023-03-18 19:26:49] [INFO ] Implicit Places using invariants and state equation in 1149 ms returned []
Implicit Place search using SMT with State Equation took 1981 ms to find 0 implicit places.
[2023-03-18 19:26:49] [INFO ] Invariant cache hit.
[2023-03-18 19:26:51] [INFO ] Dead Transitions using invariants and state equation in 2123 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4142 ms. Remains : 4050/4050 places, 3375/3375 transitions.
Treatment of property Sudoku-COL-AN15-LTLCardinality-12 finished in 95250 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(F(p1)))))'
Support contains 3825 out of 4050 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 19 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
[2023-03-18 19:26:51] [INFO ] Invariant cache hit.
[2023-03-18 19:26:52] [INFO ] Implicit Places using invariants in 657 ms returned []
[2023-03-18 19:26:52] [INFO ] Invariant cache hit.
[2023-03-18 19:26:53] [INFO ] Implicit Places using invariants and state equation in 903 ms returned []
Implicit Place search using SMT with State Equation took 1566 ms to find 0 implicit places.
[2023-03-18 19:26:53] [INFO ] Invariant cache hit.
[2023-03-18 19:26:55] [INFO ] Dead Transitions using invariants and state equation in 2319 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3910 ms. Remains : 4050/4050 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : Sudoku-COL-AN15-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(GT 1 (ADD s3825 s3826 s3827 s3828 s3829 s3830 s3831 s3832 s3833 s3834 s3835 s3836 s3837 s3838 s3839 s3840 s3841 s3842 s3843 s3844 s3845 s3846 s3847 s3...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 199 steps with 0 reset in 67 ms.
FORMULA Sudoku-COL-AN15-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN15-LTLCardinality-13 finished in 4146 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X((p0 U (G(p0)||(p0&&G(p1)))))))))'
Support contains 225 out of 4050 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Reduce places removed 3375 places and 0 transitions.
Iterating post reduction 0 with 3375 rules applied. Total rules applied 3375 place count 675 transition count 3375
Applied a total of 3375 rules in 53 ms. Remains 675 /4050 variables (removed 3375) and now considering 3375/3375 (removed 0) transitions.
// Phase 1: matrix 3375 rows 675 cols
[2023-03-18 19:26:56] [INFO ] Computed 44 place invariants in 76 ms
[2023-03-18 19:26:56] [INFO ] Implicit Places using invariants in 612 ms returned []
[2023-03-18 19:26:56] [INFO ] Invariant cache hit.
[2023-03-18 19:27:02] [INFO ] Implicit Places using invariants and state equation in 5797 ms returned []
Implicit Place search using SMT with State Equation took 6412 ms to find 0 implicit places.
[2023-03-18 19:27:02] [INFO ] Invariant cache hit.
[2023-03-18 19:27:03] [INFO ] Dead Transitions using invariants and state equation in 1007 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 675/4050 places, 3375/3375 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7474 ms. Remains : 675/4050 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN15-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 2 (ADD s450 s451 s452 s453 s454 s455 s456 s457 s458 s459 s460 s461 s462 s463 s464 s465 s466 s467 s468 s469 s470 s471 s472 s473 s474 s475 s476 s477 ...], 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]]
Stuttering criterion allowed to conclude after 197 steps with 0 reset in 50 ms.
FORMULA Sudoku-COL-AN15-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN15-LTLCardinality-14 finished in 7601 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(p0)))'
Support contains 3375 out of 4050 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 73 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
// Phase 1: matrix 3375 rows 4050 cols
[2023-03-18 19:27:03] [INFO ] Computed 675 place invariants in 29 ms
[2023-03-18 19:27:04] [INFO ] Implicit Places using invariants in 1078 ms returned []
[2023-03-18 19:27:04] [INFO ] Invariant cache hit.
[2023-03-18 19:27:06] [INFO ] Implicit Places using invariants and state equation in 1397 ms returned []
Implicit Place search using SMT with State Equation took 2482 ms to find 0 implicit places.
[2023-03-18 19:27:06] [INFO ] Invariant cache hit.
[2023-03-18 19:27:08] [INFO ] Dead Transitions using invariants and state equation in 1885 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4442 ms. Remains : 4050/4050 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN15-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=3, aps=[p0:(LEQ 1 (ADD s225 s226 s227 s228 s229 s230 s231 s232 s233 s234 s235 s236 s237 s238 s239 s240 s241 s242 s243 s244 s245 s246 s247 s248 s249 s250 s251 s252...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration timeout after 20760 steps with 6920 reset in 10002 ms.
Product exploration timeout after 20550 steps with 6850 reset in 10003 ms.
Computed a total of 4050 stabilizing places and 3375 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4050 transition count 3375
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), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 88 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=0 )
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 131 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
[2023-03-18 19:27:31] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Support contains 3375 out of 4050 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 231 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
[2023-03-18 19:27:46] [INFO ] Invariant cache hit.
[2023-03-18 19:27:47] [INFO ] Implicit Places using invariants in 1023 ms returned []
[2023-03-18 19:27:47] [INFO ] Invariant cache hit.
[2023-03-18 19:27:48] [INFO ] Implicit Places using invariants and state equation in 1397 ms returned []
Implicit Place search using SMT with State Equation took 2422 ms to find 0 implicit places.
[2023-03-18 19:27:48] [INFO ] Invariant cache hit.
[2023-03-18 19:27:50] [INFO ] Dead Transitions using invariants and state equation in 1880 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4533 ms. Remains : 4050/4050 places, 3375/3375 transitions.
Computed a total of 4050 stabilizing places and 3375 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4050 transition count 3375
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), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 90 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 89 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
[2023-03-18 19:27:53] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Product exploration timeout after 20250 steps with 6750 reset in 10007 ms.
Product exploration timeout after 20280 steps with 6760 reset in 10009 ms.
Applying partial POR strategy [true, false, true, false]
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Support contains 3375 out of 4050 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 91 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
[2023-03-18 19:28:29] [INFO ] Redundant transitions in 104 ms returned []
[2023-03-18 19:28:29] [INFO ] Invariant cache hit.
[2023-03-18 19:28:31] [INFO ] Dead Transitions using invariants and state equation in 1866 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2067 ms. Remains : 4050/4050 places, 3375/3375 transitions.
Support contains 3375 out of 4050 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 68 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
[2023-03-18 19:28:31] [INFO ] Invariant cache hit.
[2023-03-18 19:28:32] [INFO ] Implicit Places using invariants in 1056 ms returned []
[2023-03-18 19:28:32] [INFO ] Invariant cache hit.
[2023-03-18 19:28:33] [INFO ] Implicit Places using invariants and state equation in 1373 ms returned []
Implicit Place search using SMT with State Equation took 2431 ms to find 0 implicit places.
[2023-03-18 19:28:33] [INFO ] Invariant cache hit.
[2023-03-18 19:28:35] [INFO ] Dead Transitions using invariants and state equation in 1888 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4387 ms. Remains : 4050/4050 places, 3375/3375 transitions.
Treatment of property Sudoku-COL-AN15-LTLCardinality-15 finished in 92100 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X(G(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(p0)))'
[2023-03-18 19:28:36] [INFO ] Flatten gal took : 202 ms
[2023-03-18 19:28:36] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 4 ms.
[2023-03-18 19:28:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 4050 places, 3375 transitions and 13500 arcs took 30 ms.
Total runtime 359807 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT Sudoku-COL-AN15
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/372
LTLCardinality

FORMULA Sudoku-COL-AN15-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679167769427

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/372/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/372/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/372/LTLCardinality.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: LAUNCH task # 6 (type SKEL/SRCH) for 3 Sudoku-COL-AN15-LTLCardinality-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 6 (type SKEL/SRCH) for Sudoku-COL-AN15-LTLCardinality-15
lola: result : true
lola: markings : 3
lola: fired transitions : 2
lola: time used : 0.000000
lola: memory pages used : 1
lola: planning for Sudoku-COL-AN15-LTLCardinality-15 stopped (result already fixed).
lola: LAUNCH task # 1 (type EXCL) for 0 Sudoku-COL-AN15-LTLCardinality-12
lola: time limit : 3596 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN15-LTLCardinality-15: LTL true skeleton: LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN15-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 3/3596 5/32 Sudoku-COL-AN15-LTLCardinality-12 83289 m, 16657 m/sec, 91186 t fired, .

Time elapsed: 7 secs. Pages in use: 5
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN15-LTLCardinality-15: LTL true skeleton: LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN15-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 8/3596 9/32 Sudoku-COL-AN15-LTLCardinality-12 186574 m, 20657 m/sec, 247993 t fired, .

Time elapsed: 12 secs. Pages in use: 9
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN15-LTLCardinality-15: LTL true skeleton: LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN15-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 13/3596 11/32 Sudoku-COL-AN15-LTLCardinality-12 243140 m, 11313 m/sec, 436411 t fired, .

Time elapsed: 17 secs. Pages in use: 11
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN15-LTLCardinality-15: LTL true skeleton: LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN15-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 18/3596 16/32 Sudoku-COL-AN15-LTLCardinality-12 343257 m, 20023 m/sec, 599773 t fired, .

Time elapsed: 22 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN15-LTLCardinality-15: LTL true skeleton: LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN15-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 23/3596 20/32 Sudoku-COL-AN15-LTLCardinality-12 439754 m, 19299 m/sec, 754227 t fired, .

Time elapsed: 27 secs. Pages in use: 20
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN15-LTLCardinality-15: LTL true skeleton: LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN15-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 28/3596 21/32 Sudoku-COL-AN15-LTLCardinality-12 490118 m, 10072 m/sec, 939124 t fired, .

Time elapsed: 32 secs. Pages in use: 21
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN15-LTLCardinality-15: LTL true skeleton: LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN15-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 33/3596 26/32 Sudoku-COL-AN15-LTLCardinality-12 596946 m, 21365 m/sec, 1100843 t fired, .

Time elapsed: 37 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN15-LTLCardinality-15: LTL true skeleton: LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN15-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 38/3596 30/32 Sudoku-COL-AN15-LTLCardinality-12 694067 m, 19424 m/sec, 1263376 t fired, .

Time elapsed: 42 secs. Pages in use: 30
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN15-LTLCardinality-15: LTL true skeleton: LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN15-LTLCardinality-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 43/3596 32/32 Sudoku-COL-AN15-LTLCardinality-12 738973 m, 8981 m/sec, 1465050 t fired, .

Time elapsed: 47 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 1 (type EXCL) for Sudoku-COL-AN15-LTLCardinality-12 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN15-LTLCardinality-15: LTL true skeleton: LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN15-LTLCardinality-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 52 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: Portfolio finished: no open tasks 2

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN15-LTLCardinality-12: LTL unknown AGGR
Sudoku-COL-AN15-LTLCardinality-15: LTL true skeleton: LTL model checker


Time elapsed: 52 secs. Pages in use: 32

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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