Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 24M
-rw-r--r-- 1 mcc users 502K Apr 12 10:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 2.4M Apr 12 10:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.2M Apr 12 10:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 5.6M Apr 12 10:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 182K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 634K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 425K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 1.6M Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 620K Apr 12 11:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 2.9M Apr 12 11:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.3M Apr 12 10:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 6.3M Apr 12 10:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 31K Apr 23 08:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 564K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717151539576

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-PT-AN10
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-31 10:32:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-31 10:32:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 10:32:21] [INFO ] Load time of PNML (sax parser for PT used): 166 ms
[2024-05-31 10:32:21] [INFO ] Transformed 1300 places.
[2024-05-31 10:32:21] [INFO ] Transformed 1000 transitions.
[2024-05-31 10:32:21] [INFO ] Found NUPN structural information;
[2024-05-31 10:32:21] [INFO ] Parsed PT model containing 1300 places and 1000 transitions and 4000 arcs in 270 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 76 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA Sudoku-PT-AN10-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN10-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN10-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN10-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN10-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN10-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 1300 out of 1300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 30 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 1300 cols
[2024-05-31 10:32:22] [INFO ] Computed 300 invariants in 29 ms
[2024-05-31 10:32:22] [INFO ] Implicit Places using invariants in 573 ms returned []
[2024-05-31 10:32:22] [INFO ] Invariant cache hit.
[2024-05-31 10:32:23] [INFO ] Implicit Places using invariants and state equation in 806 ms returned []
Implicit Place search using SMT with State Equation took 1402 ms to find 0 implicit places.
[2024-05-31 10:32:23] [INFO ] Invariant cache hit.
[2024-05-31 10:32:24] [INFO ] Dead Transitions using invariants and state equation in 648 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2089 ms. Remains : 1300/1300 places, 1000/1000 transitions.
Support contains 1300 out of 1300 places after structural reductions.
[2024-05-31 10:32:24] [INFO ] Flatten gal took : 134 ms
[2024-05-31 10:32:24] [INFO ] Flatten gal took : 117 ms
[2024-05-31 10:32:24] [INFO ] Input system was already deterministic with 1000 transitions.
Incomplete random walk after 10000 steps, including 114 resets, run finished after 1117 ms. (steps per millisecond=8 ) properties (out of 18) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 290 ms. (steps per millisecond=34 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2024-05-31 10:32:26] [INFO ] Invariant cache hit.
[2024-05-31 10:32:28] [INFO ] [Real]Absence check using 300 positive place invariants in 75 ms returned sat
[2024-05-31 10:32:30] [INFO ] After 3187ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:4
[2024-05-31 10:32:30] [INFO ] [Nat]Absence check using 300 positive place invariants in 67 ms returned sat
[2024-05-31 10:32:55] [INFO ] After 24110ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2024-05-31 10:32:55] [INFO ] After 24116ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2024-05-31 10:32:55] [INFO ] After 25030ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 300 out of 1300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Graph (complete) has 3000 edges and 1300 vertex of which 300 are kept as prefixes of interest. Removing 1000 places using SCC suffix rule.4 ms
Discarding 1000 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 29 ms. Remains 300 /1300 variables (removed 1000) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 300/1300 places, 1000/1000 transitions.
Incomplete random walk after 10000 steps, including 114 resets, run finished after 893 ms. (steps per millisecond=11 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 134340 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 134340 steps, saw 77343 distinct states, run finished after 3003 ms. (steps per millisecond=44 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1000 rows 300 cols
[2024-05-31 10:32:59] [INFO ] Computed 29 invariants in 39 ms
[2024-05-31 10:32:59] [INFO ] [Real]Absence check using 0 positive and 29 generalized place invariants in 17 ms returned sat
[2024-05-31 10:33:24] [INFO ] After 25024ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 10:33:24] [INFO ] [Nat]Absence check using 0 positive and 29 generalized place invariants in 23 ms returned sat
[2024-05-31 10:33:49] [INFO ] After 24899ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-31 10:33:49] [INFO ] After 24901ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1 ms.
[2024-05-31 10:33:49] [INFO ] After 25014ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 4 Parikh solutions to 3 different solutions.
Finished Parikh walk after 100 steps, including 0 resets, run visited all 4 properties in 7 ms. (steps per millisecond=14 )
Parikh walk visited 4 properties in 12 ms.
FORMULA Sudoku-PT-AN10-LTLCardinality-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
Computed a total of 1300 stabilizing places and 1000 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1300 transition count 1000
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&(!p0 U p1))))'
Support contains 1200 out of 1300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 34 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 1300 cols
[2024-05-31 10:33:49] [INFO ] Computed 300 invariants in 10 ms
[2024-05-31 10:33:50] [INFO ] Implicit Places using invariants in 518 ms returned []
[2024-05-31 10:33:50] [INFO ] Invariant cache hit.
[2024-05-31 10:33:51] [INFO ] Implicit Places using invariants and state equation in 985 ms returned []
Implicit Place search using SMT with State Equation took 1505 ms to find 0 implicit places.
[2024-05-31 10:33:51] [INFO ] Redundant transitions in 62 ms returned []
[2024-05-31 10:33:51] [INFO ] Invariant cache hit.
[2024-05-31 10:33:52] [INFO ] Dead Transitions using invariants and state equation in 602 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2215 ms. Remains : 1300/1300 places, 1000/1000 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 226 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p0), (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN10-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) p1), acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GT (ADD s100 s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s115 s116 s117 s118 s119 s120 s121 s122 s123 s124 s125 s126 s127 s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration timeout after 82930 steps with 1594 reset in 10001 ms.
Product exploration timeout after 83790 steps with 1611 reset in 10002 ms.
Computed a total of 1300 stabilizing places and 1000 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1300 transition count 1000
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) p1), (X (OR (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), true, (X (X (OR (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 436 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 114 resets, run finished after 1276 ms. (steps per millisecond=7 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 267 ms. (steps per millisecond=37 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 267 ms. (steps per millisecond=37 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 273 ms. (steps per millisecond=36 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-31 10:35:42] [INFO ] Invariant cache hit.
[2024-05-31 10:35:43] [INFO ] [Real]Absence check using 300 positive place invariants in 60 ms returned sat
[2024-05-31 10:35:43] [INFO ] After 447ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2024-05-31 10:35:44] [INFO ] [Nat]Absence check using 300 positive place invariants in 58 ms returned sat
[2024-05-31 10:36:08] [INFO ] After 25006ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1200 out of 1300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 23 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 1300/1300 places, 1000/1000 transitions.
Incomplete random walk after 10000 steps, including 114 resets, run finished after 1075 ms. (steps per millisecond=9 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 268 ms. (steps per millisecond=37 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 272 ms. (steps per millisecond=36 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 86795 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 86795 steps, saw 50416 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-31 10:36:13] [INFO ] Invariant cache hit.
[2024-05-31 10:36:14] [INFO ] After 227ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 10:36:14] [INFO ] [Nat]Absence check using 300 positive place invariants in 70 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:632)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-31 10:36:39] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-31 10:36:39] [INFO ] After 25020ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1200 out of 1300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 26 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 1300/1300 places, 1000/1000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 16 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2024-05-31 10:36:39] [INFO ] Invariant cache hit.
[2024-05-31 10:36:39] [INFO ] Implicit Places using invariants in 475 ms returned []
[2024-05-31 10:36:39] [INFO ] Invariant cache hit.
[2024-05-31 10:36:40] [INFO ] Implicit Places using invariants and state equation in 991 ms returned []
Implicit Place search using SMT with State Equation took 1469 ms to find 0 implicit places.
[2024-05-31 10:36:40] [INFO ] Redundant transitions in 21 ms returned []
[2024-05-31 10:36:40] [INFO ] Invariant cache hit.
[2024-05-31 10:36:41] [INFO ] Dead Transitions using invariants and state equation in 580 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2096 ms. Remains : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 13 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-05-31 10:36:41] [INFO ] Invariant cache hit.
[2024-05-31 10:36:41] [INFO ] After 255ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 10:36:41] [INFO ] [Nat]Absence check using 300 positive place invariants in 57 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:632)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:218)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:279)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-31 10:40:26] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-31 10:40:26] [INFO ] After 225024ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (OR (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), true, (X (X (OR (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 13 factoid took 264 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(OR (NOT p1) (NOT p0)), true, (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(OR (NOT p1) (NOT p0)), true, (NOT p0)]
[2024-05-31 10:40:27] [INFO ] Invariant cache hit.
[2024-05-31 10:40:33] [INFO ] [Real]Absence check using 300 positive place invariants in 207 ms returned sat
[2024-05-31 10:40:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 10:40:38] [INFO ] [Real]Absence check using state equation in 5415 ms returned sat
[2024-05-31 10:40:38] [INFO ] Solution in real domain found non-integer solution.
Could not prove EG (NOT p0)
Support contains 1200 out of 1300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 22 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2024-05-31 10:40:46] [INFO ] Invariant cache hit.
[2024-05-31 10:40:46] [INFO ] Implicit Places using invariants in 487 ms returned []
[2024-05-31 10:40:46] [INFO ] Invariant cache hit.
[2024-05-31 10:40:47] [INFO ] Implicit Places using invariants and state equation in 1000 ms returned []
Implicit Place search using SMT with State Equation took 1499 ms to find 0 implicit places.
[2024-05-31 10:40:47] [INFO ] Redundant transitions in 9 ms returned []
[2024-05-31 10:40:47] [INFO ] Invariant cache hit.
[2024-05-31 10:40:48] [INFO ] Dead Transitions using invariants and state equation in 600 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2142 ms. Remains : 1300/1300 places, 1000/1000 transitions.
Computed a total of 1300 stabilizing places and 1000 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1300 transition count 1000
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (X (AND (NOT p0) p1))), true, (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 155 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(OR (NOT p1) (NOT p0)), true, (NOT p0)]
Incomplete random walk after 10000 steps, including 114 resets, run finished after 631 ms. (steps per millisecond=15 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-31 10:41:38] [INFO ] Invariant cache hit.
[2024-05-31 10:41:39] [INFO ] [Real]Absence check using 300 positive place invariants in 61 ms returned sat
[2024-05-31 10:41:40] [INFO ] After 1129ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 10:41:40] [INFO ] [Nat]Absence check using 300 positive place invariants in 62 ms returned sat
[2024-05-31 10:41:50] [INFO ] After 10241ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 100 out of 1300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Graph (complete) has 3000 edges and 1300 vertex of which 300 are kept as prefixes of interest. Removing 1000 places using SCC suffix rule.11 ms
Discarding 1000 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 47 ms. Remains 300 /1300 variables (removed 1000) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 300/1300 places, 1000/1000 transitions.
Incomplete random walk after 10000 steps, including 114 resets, run finished after 624 ms. (steps per millisecond=16 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 333316 steps, run timeout after 3001 ms. (steps per millisecond=111 ) properties seen :{}
Probabilistic random walk after 333316 steps, saw 116790 distinct states, run finished after 3001 ms. (steps per millisecond=111 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1000 rows 300 cols
[2024-05-31 10:41:54] [INFO ] Computed 29 invariants in 24 ms
[2024-05-31 10:41:54] [INFO ] [Real]Absence check using 0 positive and 29 generalized place invariants in 19 ms returned sat
[2024-05-31 10:42:03] [INFO ] After 9354ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 100 out of 300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 12 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 300/300 places, 1000/1000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 10 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2024-05-31 10:42:03] [INFO ] Invariant cache hit.
[2024-05-31 10:42:03] [INFO ] Implicit Places using invariants in 537 ms returned []
[2024-05-31 10:42:03] [INFO ] Invariant cache hit.
[2024-05-31 10:42:05] [INFO ] Implicit Places using invariants and state equation in 1222 ms returned []
Implicit Place search using SMT with State Equation took 1760 ms to find 0 implicit places.
[2024-05-31 10:42:05] [INFO ] Redundant transitions in 13 ms returned []
[2024-05-31 10:42:05] [INFO ] Invariant cache hit.
[2024-05-31 10:42:05] [INFO ] Dead Transitions using invariants and state equation in 511 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2311 ms. Remains : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 9 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-31 10:42:05] [INFO ] Invariant cache hit.
[2024-05-31 10:42:05] [INFO ] [Real]Absence check using 0 positive and 29 generalized place invariants in 19 ms returned sat
[2024-05-31 10:42:15] [INFO ] After 9389ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (X (AND (NOT p0) p1))), true, (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 10 factoid took 276 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(OR (NOT p1) (NOT p0)), true, (NOT p0)]
Stuttering acceptance computed with spot in 93 ms :[(OR (NOT p1) (NOT p0)), true, (NOT p0)]
// Phase 1: matrix 1000 rows 1300 cols
[2024-05-31 10:42:15] [INFO ] Computed 300 invariants in 13 ms
[2024-05-31 10:42:21] [INFO ] [Real]Absence check using 300 positive place invariants in 244 ms returned sat
[2024-05-31 10:42:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 10:42:30] [INFO ] [Real]Absence check using state equation in 8896 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 91 ms :[(OR (NOT p1) (NOT p0)), true, (NOT p0)]
Product exploration timeout after 85870 steps with 1651 reset in 10001 ms.
Product exploration timeout after 84920 steps with 1633 reset in 10001 ms.
Built C files in :
/tmp/ltsmin1054339131181308339
[2024-05-31 10:42:50] [INFO ] Computing symmetric may disable matrix : 1000 transitions.
[2024-05-31 10:42:50] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 10:42:50] [INFO ] Computing symmetric may enable matrix : 1000 transitions.
[2024-05-31 10:42:50] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 10:42:51] [INFO ] Computing Do-Not-Accords matrix : 1000 transitions.
[2024-05-31 10:42:51] [INFO ] Computation of Completed DNA matrix. took 31 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 10:42:51] [INFO ] Built C files in 246ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1054339131181308339
Running compilation step : cd /tmp/ltsmin1054339131181308339;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1054339131181308339;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1054339131181308339;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 1200 out of 1300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 12 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2024-05-31 10:42:54] [INFO ] Invariant cache hit.
[2024-05-31 10:42:54] [INFO ] Implicit Places using invariants in 481 ms returned []
[2024-05-31 10:42:54] [INFO ] Invariant cache hit.
[2024-05-31 10:42:55] [INFO ] Implicit Places using invariants and state equation in 1002 ms returned []
Implicit Place search using SMT with State Equation took 1487 ms to find 0 implicit places.
[2024-05-31 10:42:55] [INFO ] Redundant transitions in 12 ms returned []
[2024-05-31 10:42:55] [INFO ] Invariant cache hit.
[2024-05-31 10:42:56] [INFO ] Dead Transitions using invariants and state equation in 644 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2179 ms. Remains : 1300/1300 places, 1000/1000 transitions.
Built C files in :
/tmp/ltsmin6994635715442215647
[2024-05-31 10:42:56] [INFO ] Computing symmetric may disable matrix : 1000 transitions.
[2024-05-31 10:42:56] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 10:42:56] [INFO ] Computing symmetric may enable matrix : 1000 transitions.
[2024-05-31 10:42:56] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 10:42:56] [INFO ] Computing Do-Not-Accords matrix : 1000 transitions.
[2024-05-31 10:42:56] [INFO ] Computation of Completed DNA matrix. took 22 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 10:42:56] [INFO ] Built C files in 218ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6994635715442215647
Running compilation step : cd /tmp/ltsmin6994635715442215647;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6994635715442215647;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6994635715442215647;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-31 10:42:59] [INFO ] Flatten gal took : 60 ms
[2024-05-31 10:43:00] [INFO ] Flatten gal took : 50 ms
[2024-05-31 10:43:02] [INFO ] Time to serialize gal into /tmp/LTL14445118924940386660.gal : 1926 ms
[2024-05-31 10:43:02] [INFO ] Time to serialize properties into /tmp/LTL12761093929021952720.prop : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14445118924940386660.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7189424513786772158.hoa' '-atoms' '/tmp/LTL12761093929021952720.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL12761093929021952720.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7189424513786772158.hoa
Detected timeout of ITS tools.
[2024-05-31 10:43:17] [INFO ] Flatten gal took : 48 ms
[2024-05-31 10:43:17] [INFO ] Flatten gal took : 47 ms
[2024-05-31 10:43:17] [INFO ] Time to serialize gal into /tmp/LTL414794726030840500.gal : 8 ms
[2024-05-31 10:43:17] [INFO ] Time to serialize properties into /tmp/LTL10670395617933503017.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL414794726030840500.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10670395617933503017.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G((F("(((((((((((Board_0_0_0+Board_0_0_1)+(Board_0_0_2+Board_0_0_3))+((Board_0_0_4+Board_0_0_5)+(Board_0_0_6+Board_0_0_7)))+(((Boar...31646
Formula 0 simplified : F(G!"(((((((((((Board_0_0_0+Board_0_0_1)+(Board_0_0_2+Board_0_0_3))+((Board_0_0_4+Board_0_0_5)+(Board_0_0_6+Board_0_0_7)))+(((Board_...31641
Detected timeout of ITS tools.
[2024-05-31 10:43:32] [INFO ] Flatten gal took : 43 ms
[2024-05-31 10:43:32] [INFO ] Applying decomposition
[2024-05-31 10:43:32] [INFO ] Flatten gal took : 54 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph14217059705271277522.txt' '-o' '/tmp/graph14217059705271277522.bin' '-w' '/tmp/graph14217059705271277522.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph14217059705271277522.bin' '-l' '-1' '-v' '-w' '/tmp/graph14217059705271277522.weights' '-q' '0' '-e' '0.001'
[2024-05-31 10:43:35] [INFO ] Decomposing Gal with order
[2024-05-31 10:43:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 10:43:36] [INFO ] Removed a total of 900 redundant transitions.
[2024-05-31 10:43:36] [INFO ] Flatten gal took : 1172 ms
[2024-05-31 10:43:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 1000 labels/synchronizations in 68 ms.
[2024-05-31 10:43:36] [INFO ] Time to serialize gal into /tmp/LTL4434138618739378476.gal : 9 ms
[2024-05-31 10:43:36] [INFO ] Time to serialize properties into /tmp/LTL114870979991391363.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4434138618739378476.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL114870979991391363.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((G((F("(((((((((((gu0.Board_0_0_0+gu0.Board_0_0_1)+(gu0.Board_0_0_2+gu0.Board_0_0_3))+((gu0.Board_0_0_4+gu0.Board_0_0_5)+(gu0.Board_...40846
Formula 0 simplified : F(G!"(((((((((((gu0.Board_0_0_0+gu0.Board_0_0_1)+(gu0.Board_0_0_2+gu0.Board_0_0_3))+((gu0.Board_0_0_4+gu0.Board_0_0_5)+(gu0.Board_0_...40841
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5027124014953500957
[2024-05-31 10:43:52] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5027124014953500957
Running compilation step : cd /tmp/ltsmin5027124014953500957;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2045 ms.
Running link step : cd /tmp/ltsmin5027124014953500957;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin5027124014953500957;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>((LTLAPp0==true))&&(!(LTLAPp0==true) U (LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Sudoku-PT-AN10-LTLCardinality-01 finished in 617283 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(F(!p1))||G(p2)))))'
Support contains 1300 out of 1300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 17 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2024-05-31 10:44:07] [INFO ] Invariant cache hit.
[2024-05-31 10:44:07] [INFO ] Implicit Places using invariants in 251 ms returned []
[2024-05-31 10:44:07] [INFO ] Invariant cache hit.
[2024-05-31 10:44:08] [INFO ] Implicit Places using invariants and state equation in 623 ms returned []
Implicit Place search using SMT with State Equation took 877 ms to find 0 implicit places.
[2024-05-31 10:44:08] [INFO ] Redundant transitions in 10 ms returned []
[2024-05-31 10:44:08] [INFO ] Invariant cache hit.
[2024-05-31 10:44:09] [INFO ] Dead Transitions using invariants and state equation in 589 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1502 ms. Remains : 1300/1300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 64 ms :[(AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Running random walk in product with property : Sudoku-PT-AN10-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p2 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GT (ADD s100 s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s115 s116 s117 s118 s119 s120 s121 s122 s123 s124 s125 s126 s127 s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1147 reset in 8651 ms.
Product exploration explored 100000 steps with 1147 reset in 8616 ms.
Computed a total of 1300 stabilizing places and 1000 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1300 transition count 1000
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND p1 p2 (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 p2 (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 1171 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 114 resets, run finished after 853 ms. (steps per millisecond=11 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 337 ms. (steps per millisecond=29 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-31 10:45:13] [INFO ] Invariant cache hit.
[2024-05-31 10:45:14] [INFO ] After 224ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 10:45:14] [INFO ] [Nat]Absence check using 300 positive place invariants in 63 ms returned sat
[2024-05-31 10:45:15] [INFO ] After 823ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND p1 p2 (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 p2 (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND p1 (NOT p2) (NOT p0))))]
False Knowledge obtained : [(F (AND p1 p2 (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 15 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN10-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN10-LTLCardinality-03 finished in 67944 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)&&(p1||F((p2||X(p1))))))))'
Support contains 1200 out of 1300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 7 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2024-05-31 10:45:15] [INFO ] Invariant cache hit.
[2024-05-31 10:45:15] [INFO ] Implicit Places using invariants in 513 ms returned []
[2024-05-31 10:45:15] [INFO ] Invariant cache hit.
[2024-05-31 10:45:16] [INFO ] Implicit Places using invariants and state equation in 1045 ms returned []
Implicit Place search using SMT with State Equation took 1562 ms to find 0 implicit places.
[2024-05-31 10:45:16] [INFO ] Invariant cache hit.
[2024-05-31 10:45:17] [INFO ] Dead Transitions using invariants and state equation in 607 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2177 ms. Remains : 1300/1300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : Sudoku-PT-AN10-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 0}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(GT (ADD s100 s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s115 s116 s117 s118 s119 s120 s121 s122 s123 s124 s125 s126 s127 s1...], 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, null][false, false, false, false, false]]
Product exploration timeout after 71530 steps with 1402 reset in 10001 ms.
Product exploration timeout after 71840 steps with 1408 reset in 10001 ms.
Computed a total of 1300 stabilizing places and 1000 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1300 transition count 1000
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 392 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 50 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=6 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 7 factoid took 489 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
[2024-05-31 10:46:31] [INFO ] Invariant cache hit.
[2024-05-31 10:46:39] [INFO ] [Real]Absence check using 300 positive place invariants in 311 ms returned sat
[2024-05-31 10:46:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 10:46:46] [INFO ] [Real]Absence check using state equation in 6964 ms returned unknown
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 1200 out of 1300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 5 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2024-05-31 10:46:46] [INFO ] Invariant cache hit.
[2024-05-31 10:46:47] [INFO ] Implicit Places using invariants in 531 ms returned []
[2024-05-31 10:46:47] [INFO ] Invariant cache hit.
[2024-05-31 10:46:48] [INFO ] Implicit Places using invariants and state equation in 1050 ms returned []
Implicit Place search using SMT with State Equation took 1585 ms to find 0 implicit places.
[2024-05-31 10:46:48] [INFO ] Invariant cache hit.
[2024-05-31 10:46:48] [INFO ] Dead Transitions using invariants and state equation in 595 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2185 ms. Remains : 1300/1300 places, 1000/1000 transitions.
Computed a total of 1300 stabilizing places and 1000 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1300 transition count 1000
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (X (AND (NOT p1) (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 129 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 50 steps, including 0 resets, run visited all 1 properties in 9 ms. (steps per millisecond=5 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (X (AND (NOT p1) (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 4 factoid took 148 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
[2024-05-31 10:47:36] [INFO ] Invariant cache hit.
[2024-05-31 10:47:44] [INFO ] [Real]Absence check using 300 positive place invariants in 349 ms returned sat
[2024-05-31 10:47:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 10:47:51] [INFO ] [Real]Absence check using state equation in 7261 ms returned unknown
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration timeout after 71430 steps with 1400 reset in 10001 ms.
Product exploration timeout after 71830 steps with 1408 reset in 10001 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 1200 out of 1300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 17 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2024-05-31 10:48:11] [INFO ] Redundant transitions in 9 ms returned []
[2024-05-31 10:48:11] [INFO ] Invariant cache hit.
[2024-05-31 10:48:12] [INFO ] Dead Transitions using invariants and state equation in 589 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 622 ms. Remains : 1300/1300 places, 1000/1000 transitions.
Built C files in :
/tmp/ltsmin3943872050208425118
[2024-05-31 10:48:12] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3943872050208425118
Running compilation step : cd /tmp/ltsmin3943872050208425118;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2129 ms.
Running link step : cd /tmp/ltsmin3943872050208425118;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin3943872050208425118;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8639992590359555498.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1200 out of 1300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 10 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2024-05-31 10:48:27] [INFO ] Invariant cache hit.
[2024-05-31 10:48:27] [INFO ] Implicit Places using invariants in 534 ms returned []
[2024-05-31 10:48:27] [INFO ] Invariant cache hit.
[2024-05-31 10:48:29] [INFO ] Implicit Places using invariants and state equation in 1069 ms returned []
Implicit Place search using SMT with State Equation took 1606 ms to find 0 implicit places.
[2024-05-31 10:48:29] [INFO ] Invariant cache hit.
[2024-05-31 10:48:29] [INFO ] Dead Transitions using invariants and state equation in 656 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2274 ms. Remains : 1300/1300 places, 1000/1000 transitions.
Built C files in :
/tmp/ltsmin14744135624333157753
[2024-05-31 10:48:29] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14744135624333157753
Running compilation step : cd /tmp/ltsmin14744135624333157753;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2498 ms.
Running link step : cd /tmp/ltsmin14744135624333157753;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin14744135624333157753;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14890985198751980384.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-31 10:48:44] [INFO ] Flatten gal took : 58 ms
[2024-05-31 10:48:44] [INFO ] Flatten gal took : 59 ms
[2024-05-31 10:48:44] [INFO ] Time to serialize gal into /tmp/LTL13996453595757986096.gal : 6 ms
[2024-05-31 10:48:44] [INFO ] Time to serialize properties into /tmp/LTL847541937887003737.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13996453595757986096.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11394951419319985848.hoa' '-atoms' '/tmp/LTL847541937887003737.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL847541937887003737.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11394951419319985848.hoa
Detected timeout of ITS tools.
[2024-05-31 10:49:00] [INFO ] Flatten gal took : 43 ms
[2024-05-31 10:49:00] [INFO ] Flatten gal took : 42 ms
[2024-05-31 10:49:00] [INFO ] Time to serialize gal into /tmp/LTL10682412341537816612.gal : 5 ms
[2024-05-31 10:49:00] [INFO ] Time to serialize properties into /tmp/LTL12124880324314535972.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10682412341537816612.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12124880324314535972.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X((F("((((((((Columns_0_0+Columns_0_1)+(Columns_0_2+Columns_0_3))+((Columns_0_4+Columns_0_5)+(Columns_0_6+Columns_0_7)))+(((Colum...47461
Formula 0 simplified : XX(G!"((((((((Columns_0_0+Columns_0_1)+(Columns_0_2+Columns_0_3))+((Columns_0_4+Columns_0_5)+(Columns_0_6+Columns_0_7)))+(((Columns_...47449
Detected timeout of ITS tools.
[2024-05-31 10:49:15] [INFO ] Flatten gal took : 40 ms
[2024-05-31 10:49:15] [INFO ] Applying decomposition
[2024-05-31 10:49:15] [INFO ] Flatten gal took : 40 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph13816232507649305341.txt' '-o' '/tmp/graph13816232507649305341.bin' '-w' '/tmp/graph13816232507649305341.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13816232507649305341.bin' '-l' '-1' '-v' '-w' '/tmp/graph13816232507649305341.weights' '-q' '0' '-e' '0.001'
[2024-05-31 10:49:19] [INFO ] Decomposing Gal with order
[2024-05-31 10:49:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 10:49:20] [INFO ] Removed a total of 1800 redundant transitions.
[2024-05-31 10:49:20] [INFO ] Flatten gal took : 816 ms
[2024-05-31 10:49:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2024-05-31 10:49:20] [INFO ] Time to serialize gal into /tmp/LTL1126772656799612899.gal : 13 ms
[2024-05-31 10:49:20] [INFO ] Time to serialize properties into /tmp/LTL6727510393554941413.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1126772656799612899.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6727510393554941413.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X((F("((((((((gu2.Columns_0_0+gu2.Columns_0_1)+(gu2.Columns_0_2+gu2.Columns_0_3))+((gu2.Columns_0_4+gu2.Columns_0_5)+(gu2.Columns...73461
Formula 0 simplified : XX(G!"((((((((gu2.Columns_0_0+gu2.Columns_0_1)+(gu2.Columns_0_2+gu2.Columns_0_3))+((gu2.Columns_0_4+gu2.Columns_0_5)+(gu2.Columns_0_...73449
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9834612867179685657
[2024-05-31 10:49:35] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9834612867179685657
Running compilation step : cd /tmp/ltsmin9834612867179685657;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2224 ms.
Running link step : cd /tmp/ltsmin9834612867179685657;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin9834612867179685657;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X((<>((LTLAPp0==true))&&((LTLAPp1==true)||<>(((LTLAPp2==true)||X((LTLAPp1==true))))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Sudoku-PT-AN10-LTLCardinality-04 finished in 275678 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(!p0)))'
Support contains 100 out of 1300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Reduce places removed 1000 places and 0 transitions.
Iterating post reduction 0 with 1000 rules applied. Total rules applied 1000 place count 300 transition count 1000
Applied a total of 1000 rules in 20 ms. Remains 300 /1300 variables (removed 1000) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 300 cols
[2024-05-31 10:49:50] [INFO ] Computed 29 invariants in 13 ms
[2024-05-31 10:49:51] [INFO ] Implicit Places using invariants in 535 ms returned []
[2024-05-31 10:49:51] [INFO ] Invariant cache hit.
[2024-05-31 10:49:52] [INFO ] Implicit Places using invariants and state equation in 1176 ms returned []
Implicit Place search using SMT with State Equation took 1717 ms to find 0 implicit places.
[2024-05-31 10:49:52] [INFO ] Invariant cache hit.
[2024-05-31 10:49:52] [INFO ] Dead Transitions using invariants and state equation in 487 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 300/1300 places, 1000/1000 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2226 ms. Remains : 300/1300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 71 ms :[true, p0, p0]
Running random walk in product with property : Sudoku-PT-AN10-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 2 (ADD s200 s201 s202 s203 s204 s205 s206 s207 s208 s209 s210 s211 s212 s213 s214 s215 s216 s217 s218 s219 s220 s221 s222 s223 s224 s225 s226 s227...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Sudoku-PT-AN10-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN10-LTLCardinality-06 finished in 2315 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 100 out of 1300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Reduce places removed 1000 places and 0 transitions.
Iterating post reduction 0 with 1000 rules applied. Total rules applied 1000 place count 300 transition count 1000
Applied a total of 1000 rules in 7 ms. Remains 300 /1300 variables (removed 1000) and now considering 1000/1000 (removed 0) transitions.
[2024-05-31 10:49:53] [INFO ] Invariant cache hit.
[2024-05-31 10:49:53] [INFO ] Implicit Places using invariants in 540 ms returned []
[2024-05-31 10:49:53] [INFO ] Invariant cache hit.
[2024-05-31 10:49:55] [INFO ] Implicit Places using invariants and state equation in 1451 ms returned []
Implicit Place search using SMT with State Equation took 1992 ms to find 0 implicit places.
[2024-05-31 10:49:55] [INFO ] Invariant cache hit.
[2024-05-31 10:49:55] [INFO ] Dead Transitions using invariants and state equation in 511 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 300/1300 places, 1000/1000 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2512 ms. Remains : 300/1300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN10-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(GT 3 (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 s3...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 85 steps with 0 reset in 5 ms.
FORMULA Sudoku-PT-AN10-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN10-LTLCardinality-07 finished in 2682 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 1300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Reduce places removed 999 places and 0 transitions.
Iterating post reduction 0 with 999 rules applied. Total rules applied 999 place count 301 transition count 1000
Applied a total of 999 rules in 25 ms. Remains 301 /1300 variables (removed 999) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 301 cols
[2024-05-31 10:49:55] [INFO ] Computed 29 invariants in 43 ms
[2024-05-31 10:49:56] [INFO ] Implicit Places using invariants in 812 ms returned []
[2024-05-31 10:49:56] [INFO ] Invariant cache hit.
[2024-05-31 10:49:58] [INFO ] Implicit Places using invariants and state equation in 1706 ms returned []
Implicit Place search using SMT with State Equation took 2520 ms to find 0 implicit places.
[2024-05-31 10:49:58] [INFO ] Invariant cache hit.
[2024-05-31 10:49:58] [INFO ] Dead Transitions using invariants and state equation in 488 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 301/1300 places, 1000/1000 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3036 ms. Remains : 301/1300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN10-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (EQ s39 0) (EQ s100 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA Sudoku-PT-AN10-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN10-LTLCardinality-08 finished in 3160 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&X(G(p1))))))'
Support contains 4 out of 1300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Reduce places removed 1000 places and 0 transitions.
Iterating post reduction 0 with 1000 rules applied. Total rules applied 1000 place count 300 transition count 1000
Applied a total of 1000 rules in 16 ms. Remains 300 /1300 variables (removed 1000) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 300 cols
[2024-05-31 10:49:58] [INFO ] Computed 29 invariants in 19 ms
[2024-05-31 10:49:59] [INFO ] Implicit Places using invariants in 807 ms returned []
[2024-05-31 10:49:59] [INFO ] Invariant cache hit.
[2024-05-31 10:50:01] [INFO ] Implicit Places using invariants and state equation in 1530 ms returned []
Implicit Place search using SMT with State Equation took 2341 ms to find 0 implicit places.
[2024-05-31 10:50:01] [INFO ] Invariant cache hit.
[2024-05-31 10:50:01] [INFO ] Dead Transitions using invariants and state equation in 507 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 300/1300 places, 1000/1000 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2866 ms. Remains : 300/1300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN10-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s142 0) (EQ s262 1)), p1:(AND (NEQ s167 0) (NEQ s86 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 85 steps with 0 reset in 5 ms.
FORMULA Sudoku-PT-AN10-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN10-LTLCardinality-09 finished in 2998 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p1))||p0)))'
Support contains 4 out of 1300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Reduce places removed 998 places and 0 transitions.
Iterating post reduction 0 with 998 rules applied. Total rules applied 998 place count 302 transition count 1000
Applied a total of 998 rules in 16 ms. Remains 302 /1300 variables (removed 998) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 302 cols
[2024-05-31 10:50:01] [INFO ] Computed 29 invariants in 35 ms
[2024-05-31 10:50:02] [INFO ] Implicit Places using invariants in 840 ms returned []
[2024-05-31 10:50:02] [INFO ] Invariant cache hit.
[2024-05-31 10:50:04] [INFO ] Implicit Places using invariants and state equation in 1951 ms returned []
Implicit Place search using SMT with State Equation took 2794 ms to find 0 implicit places.
[2024-05-31 10:50:04] [INFO ] Invariant cache hit.
[2024-05-31 10:50:05] [INFO ] Dead Transitions using invariants and state equation in 543 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 302/1300 places, 1000/1000 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3354 ms. Remains : 302/1300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-PT-AN10-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(OR (EQ s100 0) (EQ s237 1)), p1:(OR (EQ s101 0) (EQ s148 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 9156 ms.
Product exploration explored 100000 steps with 50000 reset in 9257 ms.
Computed a total of 302 stabilizing places and 1000 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 302 transition count 1000
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X p0), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 12 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN10-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN10-LTLCardinality-11 finished in 26711 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0 U (p1||G(p0))))))'
Support contains 4 out of 1300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Reduce places removed 1000 places and 0 transitions.
Iterating post reduction 0 with 1000 rules applied. Total rules applied 1000 place count 300 transition count 1000
Applied a total of 1000 rules in 18 ms. Remains 300 /1300 variables (removed 1000) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 300 cols
[2024-05-31 10:50:28] [INFO ] Computed 29 invariants in 15 ms
[2024-05-31 10:50:29] [INFO ] Implicit Places using invariants in 815 ms returned []
[2024-05-31 10:50:29] [INFO ] Invariant cache hit.
[2024-05-31 10:50:31] [INFO ] Implicit Places using invariants and state equation in 1687 ms returned []
Implicit Place search using SMT with State Equation took 2504 ms to find 0 implicit places.
[2024-05-31 10:50:31] [INFO ] Invariant cache hit.
[2024-05-31 10:50:31] [INFO ] Dead Transitions using invariants and state equation in 487 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 300/1300 places, 1000/1000 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3011 ms. Remains : 300/1300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-PT-AN10-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (NOT (OR (EQ s166 0) (EQ s24 1))) (OR (EQ s217 0) (EQ s106 1))), p0:(OR (EQ s217 0) (EQ s106 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 446 steps with 9 reset in 42 ms.
FORMULA Sudoku-PT-AN10-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN10-LTLCardinality-13 finished in 3136 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&(!p0 U p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)&&(p1||F((p2||X(p1))))))))'
Found a Shortening insensitive property : Sudoku-PT-AN10-LTLCardinality-04
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Support contains 1200 out of 1300 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 12 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 1300 cols
[2024-05-31 10:50:32] [INFO ] Computed 300 invariants in 6 ms
[2024-05-31 10:50:32] [INFO ] Implicit Places using invariants in 527 ms returned []
[2024-05-31 10:50:32] [INFO ] Invariant cache hit.
[2024-05-31 10:50:33] [INFO ] Implicit Places using invariants and state equation in 1034 ms returned []
Implicit Place search using SMT with State Equation took 1563 ms to find 0 implicit places.
[2024-05-31 10:50:33] [INFO ] Invariant cache hit.
[2024-05-31 10:50:34] [INFO ] Dead Transitions using invariants and state equation in 587 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 2163 ms. Remains : 1300/1300 places, 1000/1000 transitions.
Running random walk in product with property : Sudoku-PT-AN10-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 0}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(GT (ADD s100 s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s115 s116 s117 s118 s119 s120 s121 s122 s123 s124 s125 s126 s127 s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration timeout after 71870 steps with 1409 reset in 10002 ms.
Product exploration timeout after 70890 steps with 1390 reset in 10001 ms.
Computed a total of 1300 stabilizing places and 1000 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1300 transition count 1000
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 365 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 369 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 50 steps, including 0 resets, run visited all 1 properties in 9 ms. (steps per millisecond=5 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 7 factoid took 495 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
[2024-05-31 10:51:49] [INFO ] Invariant cache hit.
[2024-05-31 10:51:56] [INFO ] [Real]Absence check using 300 positive place invariants in 342 ms returned sat
[2024-05-31 10:51:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 10:52:04] [INFO ] [Real]Absence check using state equation in 7169 ms returned unknown
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 1200 out of 1300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 3 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2024-05-31 10:52:04] [INFO ] Invariant cache hit.
[2024-05-31 10:52:04] [INFO ] Implicit Places using invariants in 503 ms returned []
[2024-05-31 10:52:04] [INFO ] Invariant cache hit.
[2024-05-31 10:52:05] [INFO ] Implicit Places using invariants and state equation in 1035 ms returned []
Implicit Place search using SMT with State Equation took 1542 ms to find 0 implicit places.
[2024-05-31 10:52:05] [INFO ] Invariant cache hit.
[2024-05-31 10:52:06] [INFO ] Dead Transitions using invariants and state equation in 578 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2123 ms. Remains : 1300/1300 places, 1000/1000 transitions.
Computed a total of 1300 stabilizing places and 1000 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1300 transition count 1000
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (X (AND (NOT p1) (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 103 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 50 steps, including 0 resets, run visited all 1 properties in 10 ms. (steps per millisecond=5 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (X (AND (NOT p1) (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 4 factoid took 126 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
[2024-05-31 10:52:53] [INFO ] Invariant cache hit.
[2024-05-31 10:53:00] [INFO ] [Real]Absence check using 300 positive place invariants in 335 ms returned sat
[2024-05-31 10:53:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 10:53:08] [INFO ] [Real]Absence check using state equation in 7103 ms returned unknown
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration timeout after 71530 steps with 1402 reset in 10001 ms.
Product exploration timeout after 70880 steps with 1389 reset in 10001 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 246 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 1200 out of 1300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 11 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2024-05-31 10:53:28] [INFO ] Redundant transitions in 10 ms returned []
[2024-05-31 10:53:28] [INFO ] Invariant cache hit.
[2024-05-31 10:53:29] [INFO ] Dead Transitions using invariants and state equation in 578 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 621 ms. Remains : 1300/1300 places, 1000/1000 transitions.
Built C files in :
/tmp/ltsmin9129366180880490283
[2024-05-31 10:53:29] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9129366180880490283
Running compilation step : cd /tmp/ltsmin9129366180880490283;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2147 ms.
Running link step : cd /tmp/ltsmin9129366180880490283;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin9129366180880490283;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4699474920597525662.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1200 out of 1300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 5 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2024-05-31 10:53:44] [INFO ] Invariant cache hit.
[2024-05-31 10:53:44] [INFO ] Implicit Places using invariants in 499 ms returned []
[2024-05-31 10:53:44] [INFO ] Invariant cache hit.
[2024-05-31 10:53:45] [INFO ] Implicit Places using invariants and state equation in 1001 ms returned []
Implicit Place search using SMT with State Equation took 1503 ms to find 0 implicit places.
[2024-05-31 10:53:45] [INFO ] Invariant cache hit.
[2024-05-31 10:53:46] [INFO ] Dead Transitions using invariants and state equation in 587 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2096 ms. Remains : 1300/1300 places, 1000/1000 transitions.
Built C files in :
/tmp/ltsmin12720132642170157828
[2024-05-31 10:53:46] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12720132642170157828
Running compilation step : cd /tmp/ltsmin12720132642170157828;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2122 ms.
Running link step : cd /tmp/ltsmin12720132642170157828;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin12720132642170157828;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8639932017988596215.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-31 10:54:01] [INFO ] Flatten gal took : 36 ms
[2024-05-31 10:54:01] [INFO ] Flatten gal took : 37 ms
[2024-05-31 10:54:01] [INFO ] Time to serialize gal into /tmp/LTL2159801452033478802.gal : 7 ms
[2024-05-31 10:54:01] [INFO ] Time to serialize properties into /tmp/LTL17920635044295271440.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2159801452033478802.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8310559021438803054.hoa' '-atoms' '/tmp/LTL17920635044295271440.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL17920635044295271440.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8310559021438803054.hoa
Detected timeout of ITS tools.
[2024-05-31 10:54:16] [INFO ] Flatten gal took : 54 ms
[2024-05-31 10:54:16] [INFO ] Flatten gal took : 38 ms
[2024-05-31 10:54:16] [INFO ] Time to serialize gal into /tmp/LTL8428793373289726817.gal : 5 ms
[2024-05-31 10:54:16] [INFO ] Time to serialize properties into /tmp/LTL4705040265249133098.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8428793373289726817.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4705040265249133098.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X((F("((((((((Columns_0_0+Columns_0_1)+(Columns_0_2+Columns_0_3))+((Columns_0_4+Columns_0_5)+(Columns_0_6+Columns_0_7)))+(((Colum...47461
Formula 0 simplified : XX(G!"((((((((Columns_0_0+Columns_0_1)+(Columns_0_2+Columns_0_3))+((Columns_0_4+Columns_0_5)+(Columns_0_6+Columns_0_7)))+(((Columns_...47449
Detected timeout of ITS tools.
[2024-05-31 10:54:31] [INFO ] Flatten gal took : 37 ms
[2024-05-31 10:54:31] [INFO ] Applying decomposition
[2024-05-31 10:54:31] [INFO ] Flatten gal took : 36 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph10941683302834958173.txt' '-o' '/tmp/graph10941683302834958173.bin' '-w' '/tmp/graph10941683302834958173.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10941683302834958173.bin' '-l' '-1' '-v' '-w' '/tmp/graph10941683302834958173.weights' '-q' '0' '-e' '0.001'
[2024-05-31 10:54:35] [INFO ] Decomposing Gal with order
[2024-05-31 10:54:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 10:54:35] [INFO ] Removed a total of 1800 redundant transitions.
[2024-05-31 10:54:35] [INFO ] Flatten gal took : 666 ms
[2024-05-31 10:54:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2024-05-31 10:54:36] [INFO ] Time to serialize gal into /tmp/LTL16887038366911360077.gal : 9 ms
[2024-05-31 10:54:36] [INFO ] Time to serialize properties into /tmp/LTL17027535228091781935.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16887038366911360077.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17027535228091781935.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X((F("((((((((gu2.Columns_0_0+gu2.Columns_0_1)+(gu2.Columns_0_2+gu2.Columns_0_3))+((gu2.Columns_0_4+gu2.Columns_0_5)+(gu2.Columns...73461
Formula 0 simplified : XX(G!"((((((((gu2.Columns_0_0+gu2.Columns_0_1)+(gu2.Columns_0_2+gu2.Columns_0_3))+((gu2.Columns_0_4+gu2.Columns_0_5)+(gu2.Columns_0_...73449
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8686439097982456815
[2024-05-31 10:54:51] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8686439097982456815
Running compilation step : cd /tmp/ltsmin8686439097982456815;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2159 ms.
Running link step : cd /tmp/ltsmin8686439097982456815;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin8686439097982456815;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X((<>((LTLAPp0==true))&&((LTLAPp1==true)||<>(((LTLAPp2==true)||X((LTLAPp1==true))))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Sudoku-PT-AN10-LTLCardinality-04 finished in 274409 ms.
[2024-05-31 10:55:06] [INFO ] Flatten gal took : 37 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11726619123991660271
[2024-05-31 10:55:06] [INFO ] Computing symmetric may disable matrix : 1000 transitions.
[2024-05-31 10:55:06] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 10:55:06] [INFO ] Applying decomposition
[2024-05-31 10:55:06] [INFO ] Computing symmetric may enable matrix : 1000 transitions.
[2024-05-31 10:55:06] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 10:55:06] [INFO ] Flatten gal took : 37 ms
[2024-05-31 10:55:06] [INFO ] Computing Do-Not-Accords matrix : 1000 transitions.
[2024-05-31 10:55:06] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 10:55:06] [INFO ] Built C files in 452ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11726619123991660271
Running compilation step : cd /tmp/ltsmin11726619123991660271;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 3486 ms.
Running link step : cd /tmp/ltsmin11726619123991660271;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin11726619123991660271;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[]((<>((LTLAPp0==true))&&(!(LTLAPp0==true) U (LTLAPp1==true))))' '--buchi-type=spotba'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph2584849436645248103.txt' '-o' '/tmp/graph2584849436645248103.bin' '-w' '/tmp/graph2584849436645248103.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph2584849436645248103.bin' '-l' '-1' '-v' '-w' '/tmp/graph2584849436645248103.weights' '-q' '0' '-e' '0.001'
[2024-05-31 10:55:13] [INFO ] Decomposing Gal with order
[2024-05-31 10:55:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 10:55:15] [INFO ] Removed a total of 2700 redundant transitions.
[2024-05-31 10:55:15] [INFO ] Flatten gal took : 1887 ms
[2024-05-31 10:55:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 23 ms.
[2024-05-31 10:55:15] [INFO ] Time to serialize gal into /tmp/LTLCardinality4855574096062808785.gal : 42 ms
[2024-05-31 10:55:15] [INFO ] Time to serialize properties into /tmp/LTLCardinality1925019910091017485.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality4855574096062808785.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality1925019910091017485.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 2 LTL properties
Checking formula 0 : !((G((F("(((((((((((gi0.gu1.Board_0_0_0+gi0.gu1.Board_0_0_1)+(gi0.gu1.Board_0_0_2+gi0.gu1.Board_0_0_3))+((gi0.gu1.Board_0_0_4+gi0.gu1....49646
Formula 0 simplified : F(G!"(((((((((((gi0.gu1.Board_0_0_0+gi0.gu1.Board_0_0_1)+(gi0.gu1.Board_0_0_2+gi0.gu1.Board_0_0_3))+((gi0.gu1.Board_0_0_4+gi0.gu1.Bo...49641
Detected timeout of ITS tools.
[2024-05-31 11:22:59] [INFO ] Applying decomposition
[2024-05-31 11:22:59] [INFO ] Flatten gal took : 421 ms
[2024-05-31 11:22:59] [INFO ] Decomposing Gal with order
[2024-05-31 11:22:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 11:23:00] [INFO ] Removed a total of 1791 redundant transitions.
[2024-05-31 11:23:00] [INFO ] Flatten gal took : 605 ms
[2024-05-31 11:23:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 29 ms.
[2024-05-31 11:23:01] [INFO ] Time to serialize gal into /tmp/LTLCardinality14820145871735487535.gal : 49 ms
[2024-05-31 11:23:01] [INFO ] Time to serialize properties into /tmp/LTLCardinality7144468164070363581.ltl : 23 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality14820145871735487535.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality7144468164070363581.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 2 LTL properties
Checking formula 0 : !((G((F("(((((((((((gu88.Board_0_0_0+gu88.Board_0_0_1)+(gu88.Board_0_0_2+gu88.Board_0_0_3))+((gu88.Board_0_0_4+gu88.Board_0_0_5)+(gu88...43147
Formula 0 simplified : F(G!"(((((((((((gu88.Board_0_0_0+gu88.Board_0_0_1)+(gu88.Board_0_0_2+gu88.Board_0_0_3))+((gu88.Board_0_0_4+gu88.Board_0_0_5)+(gu88.B...43142
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin11726619123991660271;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[]((<>((LTLAPp0==true))&&(!(LTLAPp0==true) U (LTLAPp1==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin11726619123991660271;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X((<>((LTLAPp2==true))&&((LTLAPp3==true)||<>(((LTLAPp4==true)||X((LTLAPp3==true))))))))' '--buchi-type=spotba'
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 9033888 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16012140 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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