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-171690556400427.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-AN15, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r417-tall-171690556400427
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 63M
-rw-r--r-- 1 mcc users 1.3M Apr 12 11:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 6.0M Apr 12 11:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.6M Apr 12 10:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 17M Apr 12 10:22 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 811K Apr 23 08:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 2.6M Apr 23 08:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.4M Apr 23 08:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 4.7M Apr 23 08:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 840K Apr 12 12:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 3.6M Apr 12 12:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.5M Apr 12 11:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16M Apr 12 11:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 211K Apr 23 08:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 509K Apr 23 08:01 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 1.9M 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-AN15-LTLCardinality-00
FORMULA_NAME Sudoku-PT-AN15-LTLCardinality-01
FORMULA_NAME Sudoku-PT-AN15-LTLCardinality-02
FORMULA_NAME Sudoku-PT-AN15-LTLCardinality-03
FORMULA_NAME Sudoku-PT-AN15-LTLCardinality-04
FORMULA_NAME Sudoku-PT-AN15-LTLCardinality-05
FORMULA_NAME Sudoku-PT-AN15-LTLCardinality-06
FORMULA_NAME Sudoku-PT-AN15-LTLCardinality-07
FORMULA_NAME Sudoku-PT-AN15-LTLCardinality-08
FORMULA_NAME Sudoku-PT-AN15-LTLCardinality-09
FORMULA_NAME Sudoku-PT-AN15-LTLCardinality-10
FORMULA_NAME Sudoku-PT-AN15-LTLCardinality-11
FORMULA_NAME Sudoku-PT-AN15-LTLCardinality-12
FORMULA_NAME Sudoku-PT-AN15-LTLCardinality-13
FORMULA_NAME Sudoku-PT-AN15-LTLCardinality-14
FORMULA_NAME Sudoku-PT-AN15-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717157389222

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-AN15
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-31 12:09:51] [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 12:09:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 12:09:51] [INFO ] Load time of PNML (sax parser for PT used): 233 ms
[2024-05-31 12:09:51] [INFO ] Transformed 4050 places.
[2024-05-31 12:09:51] [INFO ] Transformed 3375 transitions.
[2024-05-31 12:09:51] [INFO ] Found NUPN structural information;
[2024-05-31 12:09:51] [INFO ] Parsed PT model containing 4050 places and 3375 transitions and 13500 arcs in 373 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 524 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 7 formulas.
FORMULA Sudoku-PT-AN15-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN15-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN15-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN15-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN15-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN15-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN15-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN15-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 4050 out of 4050 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 40 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
// Phase 1: matrix 3375 rows 4050 cols
[2024-05-31 12:09:52] [INFO ] Computed 675 invariants in 56 ms
[2024-05-31 12:09:53] [INFO ] Implicit Places using invariants in 752 ms returned []
[2024-05-31 12:09:53] [INFO ] Invariant cache hit.
[2024-05-31 12:09:53] [INFO ] Implicit Places using invariants and state equation in 621 ms returned []
Implicit Place search using SMT with State Equation took 1396 ms to find 0 implicit places.
[2024-05-31 12:09:53] [INFO ] Invariant cache hit.
[2024-05-31 12:09:56] [INFO ] Dead Transitions using invariants and state equation in 2320 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3758 ms. Remains : 4050/4050 places, 3375/3375 transitions.
Support contains 4050 out of 4050 places after structural reductions.
[2024-05-31 12:09:56] [INFO ] Flatten gal took : 391 ms
[2024-05-31 12:09:57] [INFO ] Flatten gal took : 205 ms
[2024-05-31 12:09:57] [INFO ] Input system was already deterministic with 3375 transitions.
Incomplete random walk after 10000 steps, including 50 resets, run finished after 3658 ms. (steps per millisecond=2 ) properties (out of 18) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 426 ms. (steps per millisecond=23 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 468 ms. (steps per millisecond=21 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2024-05-31 12:10:02] [INFO ] Invariant cache hit.
[2024-05-31 12:10:04] [INFO ] [Real]Absence check using 675 positive place invariants in 232 ms returned sat
[2024-05-31 12:10:28] [INFO ] After 25039ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-31 12:10:29] [INFO ] [Nat]Absence check using 675 positive place invariants in 281 ms returned sat
[2024-05-31 12:10:53] [INFO ] After 25014ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 675 out of 4050 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Graph (complete) has 10125 edges and 4050 vertex of which 675 are kept as prefixes of interest. Removing 3375 places using SCC suffix rule.9 ms
Discarding 3375 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 69 ms. Remains 675 /4050 variables (removed 3375) and now considering 3375/3375 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 675/4050 places, 3375/3375 transitions.
Incomplete random walk after 10000 steps, including 50 resets, run finished after 3464 ms. (steps per millisecond=2 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 400 ms. (steps per millisecond=25 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 280 ms. (steps per millisecond=35 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 464 ms. (steps per millisecond=21 ) properties (out of 5) seen :0
Probabilistic random walk after 154343 steps, saw 154288 distinct states, run finished after 12014 ms. (steps per millisecond=12 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 3375 rows 675 cols
[2024-05-31 12:11:10] [INFO ] Computed 44 invariants in 191 ms
[2024-05-31 12:11:10] [INFO ] [Real]Absence check using 0 positive and 44 generalized place invariants in 53 ms returned sat
[2024-05-31 12:11:12] [INFO ] After 1647ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-31 12:11:12] [INFO ] [Nat]Absence check using 0 positive and 44 generalized place invariants in 50 ms returned sat
[2024-05-31 12:11:16] [INFO ] After 3517ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :2
[2024-05-31 12:11:16] [INFO ] After 3747ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :2
Attempting to minimize the solution found.
Minimization took 122 ms.
[2024-05-31 12:11:16] [INFO ] After 4148ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :2
Fused 5 Parikh solutions to 1 different solutions.
Finished Parikh walk after 224 steps, including 0 resets, run visited all 2 properties in 22 ms. (steps per millisecond=10 )
Parikh walk visited 1 properties in 24 ms.
Support contains 225 out of 675 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 675/675 places, 3375/3375 transitions.
Applied a total of 0 rules in 145 ms. Remains 675 /675 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 145 ms. Remains : 675/675 places, 3375/3375 transitions.
Incomplete random walk after 10000 steps, including 50 resets, run finished after 2258 ms. (steps per millisecond=4 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 347682 steps, run timeout after 6001 ms. (steps per millisecond=57 ) properties seen :{}
Probabilistic random walk after 347682 steps, saw 345293 distinct states, run finished after 6002 ms. (steps per millisecond=57 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-31 12:11:25] [INFO ] Invariant cache hit.
[2024-05-31 12:11:25] [INFO ] [Real]Absence check using 0 positive and 44 generalized place invariants in 45 ms returned sat
[2024-05-31 12:11:29] [INFO ] After 4412ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 12:11:29] [INFO ] [Nat]Absence check using 0 positive and 44 generalized place invariants in 45 ms returned sat
[2024-05-31 12:11:32] [INFO ] After 2792ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 12:11:32] [INFO ] After 2920ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 74 ms.
[2024-05-31 12:11:32] [INFO ] After 3179ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 224 steps, including 0 resets, run visited all 1 properties in 14 ms. (steps per millisecond=16 )
Parikh walk visited 1 properties in 14 ms.
Successfully simplified 2 atomic propositions for a total of 8 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA Sudoku-PT-AN15-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN15-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 4050 stabilizing places and 3375 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4050 transition count 3375
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((p0 U p1) U p2))))'
Support contains 3825 out of 4050 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 90 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
// Phase 1: matrix 3375 rows 4050 cols
[2024-05-31 12:11:33] [INFO ] Computed 675 invariants in 33 ms
[2024-05-31 12:11:34] [INFO ] Implicit Places using invariants in 834 ms returned []
[2024-05-31 12:11:34] [INFO ] Invariant cache hit.
[2024-05-31 12:11:34] [INFO ] Implicit Places using invariants and state equation in 899 ms returned []
Implicit Place search using SMT with State Equation took 1735 ms to find 0 implicit places.
[2024-05-31 12:11:35] [INFO ] Redundant transitions in 199 ms returned []
[2024-05-31 12:11:35] [INFO ] Invariant cache hit.
[2024-05-31 12:11:37] [INFO ] Dead Transitions using invariants and state equation in 2397 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4436 ms. Remains : 4050/4050 places, 3375/3375 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 252 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : Sudoku-PT-AN15-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(OR p2 p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=0 dest: 1}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={0} source=0 dest: 2}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=2 dest: 1}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(LEQ 3 (ADD s3825 s3826 s3827 s3828 s3829 s3830 s3831 s3832 s3833 s3834 s3835 s3836 s3837 s3838 s3839 s3840 s3841 s3842 s3843 s3844 s3845 s3846 s3847 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration timeout after 41190 steps with 207 reset in 10001 ms.
Product exploration timeout after 40880 steps with 206 reset in 10004 ms.
Computed a total of 4050 stabilizing places and 3375 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4050 transition count 3375
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (AND p2 (NOT p1) (NOT p0))), (X (NOT (AND p2 (NOT p1) p0))), (X (OR p2 p1 p0)), (X (NOT (OR (AND (NOT p2) p1) (AND (NOT p2) p0)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 419 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter insensitive) to 3 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 149 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2)]
Incomplete random walk after 10000 steps, including 50 resets, run finished after 5227 ms. (steps per millisecond=1 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 924 ms. (steps per millisecond=10 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 916 ms. (steps per millisecond=10 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1758 ms. (steps per millisecond=5 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1760 ms. (steps per millisecond=5 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1611 ms. (steps per millisecond=6 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2024-05-31 12:12:12] [INFO ] Invariant cache hit.
[2024-05-31 12:12:19] [INFO ] [Real]Absence check using 675 positive place invariants in 219 ms returned sat
[2024-05-31 12:12:43] [INFO ] After 25019ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:2
[2024-05-31 12:12:44] [INFO ] [Nat]Absence check using 675 positive place invariants in 232 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 12:13:08] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-31 12:13:08] [INFO ] After 25030ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0 real:2
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3825 out of 4050 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 72 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 4050/4050 places, 3375/3375 transitions.
Incomplete random walk after 10000 steps, including 50 resets, run finished after 3953 ms. (steps per millisecond=2 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 903 ms. (steps per millisecond=11 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1696 ms. (steps per millisecond=5 ) properties (out of 2) seen :0
Probabilistic random walk after 122117 steps, saw 122075 distinct states, run finished after 18015 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-31 12:13:33] [INFO ] Invariant cache hit.
[2024-05-31 12:13:35] [INFO ] [Real]Absence check using 675 positive place invariants in 194 ms returned sat
[2024-05-31 12:13:59] [INFO ] After 25040ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 12:14:00] [INFO ] [Nat]Absence check using 675 positive place invariants in 206 ms returned sat
[2024-05-31 12:14:24] [INFO ] After 25033ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3825 out of 4050 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 50 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 4050/4050 places, 3375/3375 transitions.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (AND p2 (NOT p1) (NOT p0))), (X (NOT (AND p2 (NOT p1) p0))), (X (OR p2 p1 p0)), (X (NOT (OR (AND (NOT p2) p1) (AND (NOT p2) p0)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND p0 (NOT p1) p2))), (G (OR p0 p1 p2)), (G (NOT (AND p0 (NOT p1) (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1) p2)))]
Knowledge based reduction with 14 factoid took 834 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p2), (NOT p2)]
Support contains 225 out of 4050 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 37 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
[2024-05-31 12:14:25] [INFO ] Invariant cache hit.
[2024-05-31 12:14:26] [INFO ] Implicit Places using invariants in 932 ms returned []
[2024-05-31 12:14:26] [INFO ] Invariant cache hit.
[2024-05-31 12:14:27] [INFO ] Implicit Places using invariants and state equation in 893 ms returned []
Implicit Place search using SMT with State Equation took 1849 ms to find 0 implicit places.
[2024-05-31 12:14:28] [INFO ] Redundant transitions in 192 ms returned []
[2024-05-31 12:14:28] [INFO ] Invariant cache hit.
[2024-05-31 12:14:30] [INFO ] Dead Transitions using invariants and state equation in 2232 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4337 ms. Remains : 4050/4050 places, 3375/3375 transitions.
Computed a total of 4050 stabilizing places and 3375 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4050 transition count 3375
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p2, (X p2), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 197 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 50 resets, run finished after 2156 ms. (steps per millisecond=4 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 327669 steps, run timeout after 6003 ms. (steps per millisecond=54 ) properties seen :{}
Probabilistic random walk after 327669 steps, saw 327496 distinct states, run finished after 6003 ms. (steps per millisecond=54 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-31 12:14:40] [INFO ] Invariant cache hit.
[2024-05-31 12:14:40] [INFO ] [Real]Absence check using 675 positive place invariants in 205 ms returned sat
[2024-05-31 12:15:05] [INFO ] After 25019ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 225 out of 4050 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Graph (complete) has 10125 edges and 4050 vertex of which 675 are kept as prefixes of interest. Removing 3375 places using SCC suffix rule.3 ms
Discarding 3375 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 94 ms. Remains 675 /4050 variables (removed 3375) and now considering 3375/3375 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 675/4050 places, 3375/3375 transitions.
Incomplete random walk after 10000 steps, including 50 resets, run finished after 2172 ms. (steps per millisecond=4 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 355231 steps, run timeout after 6001 ms. (steps per millisecond=59 ) properties seen :{}
Probabilistic random walk after 355231 steps, saw 346577 distinct states, run finished after 6001 ms. (steps per millisecond=59 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 3375 rows 675 cols
[2024-05-31 12:15:13] [INFO ] Computed 44 invariants in 75 ms
[2024-05-31 12:15:13] [INFO ] [Real]Absence check using 0 positive and 44 generalized place invariants in 44 ms returned sat
[2024-05-31 12:15:15] [INFO ] After 1916ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 12:15:15] [INFO ] [Nat]Absence check using 0 positive and 44 generalized place invariants in 43 ms returned sat
[2024-05-31 12:15:20] [INFO ] After 4406ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 12:15:20] [INFO ] After 4528ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 56 ms.
[2024-05-31 12:15:20] [INFO ] After 4768ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 223 steps, including 0 resets, run visited all 1 properties in 23 ms. (steps per millisecond=9 )
Parikh walk visited 1 properties in 34 ms.
Knowledge obtained : [p2, (X p2), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 3 factoid took 125 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 302 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p2), (NOT p2)]
Product exploration timeout after 47000 steps with 237 reset in 10005 ms.
Product exploration timeout after 47440 steps with 239 reset in 10003 ms.
Built C files in :
/tmp/ltsmin177377549192105281
[2024-05-31 12:15:40] [INFO ] Too many transitions (3375) to apply POR reductions. Disabling POR matrices.
[2024-05-31 12:15:41] [INFO ] Built C files in 74ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin177377549192105281
Running compilation step : cd /tmp/ltsmin177377549192105281;'/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/ltsmin177377549192105281;'/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/ltsmin177377549192105281;'/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 225 out of 4050 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Graph (complete) has 10125 edges and 4050 vertex of which 675 are kept as prefixes of interest. Removing 3375 places using SCC suffix rule.5 ms
Discarding 3375 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 66 ms. Remains 675 /4050 variables (removed 3375) and now considering 3375/3375 (removed 0) transitions.
[2024-05-31 12:15:44] [INFO ] Invariant cache hit.
[2024-05-31 12:15:46] [INFO ] Implicit Places using invariants in 2425 ms returned []
[2024-05-31 12:15:46] [INFO ] Invariant cache hit.
[2024-05-31 12:15:56] [INFO ] Implicit Places using invariants and state equation in 9689 ms returned []
Implicit Place search using SMT with State Equation took 12129 ms to find 0 implicit places.
[2024-05-31 12:15:56] [INFO ] Redundant transitions in 102 ms returned []
[2024-05-31 12:15:56] [INFO ] Invariant cache hit.
[2024-05-31 12:15:58] [INFO ] Dead Transitions using invariants and state equation in 2136 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 675/4050 places, 3375/3375 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14481 ms. Remains : 675/4050 places, 3375/3375 transitions.
Built C files in :
/tmp/ltsmin2189987475617342043
[2024-05-31 12:15:58] [INFO ] Too many transitions (3375) to apply POR reductions. Disabling POR matrices.
[2024-05-31 12:15:58] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2189987475617342043
Running compilation step : cd /tmp/ltsmin2189987475617342043;'/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/ltsmin2189987475617342043;'/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/ltsmin2189987475617342043;'/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 12:16:02] [INFO ] Flatten gal took : 129 ms
[2024-05-31 12:16:02] [INFO ] Flatten gal took : 108 ms
[2024-05-31 12:16:02] [INFO ] Time to serialize gal into /tmp/LTL8739541313103642336.gal : 44 ms
[2024-05-31 12:16:03] [INFO ] Time to serialize properties into /tmp/LTL3487089884890240713.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/LTL8739541313103642336.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2677304342750440984.hoa' '-atoms' '/tmp/LTL3487089884890240713.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...317
Loading property file /tmp/LTL3487089884890240713.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2677304342750440984.hoa
Detected timeout of ITS tools.
[2024-05-31 12:16:18] [INFO ] Flatten gal took : 214 ms
[2024-05-31 12:16:18] [INFO ] Flatten gal took : 133 ms
[2024-05-31 12:16:18] [INFO ] Time to serialize gal into /tmp/LTL10317573296940376663.gal : 35 ms
[2024-05-31 12:16:18] [INFO ] Time to serialize properties into /tmp/LTL1725602363493699120.ltl : 17 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/LTL10317573296940376663.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1725602363493699120.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G((("((((((((((Cells_0_0+Cells_0_1)+(Cells_0_2+Cells_0_3))+((Cells_0_4+Cells_0_5)+(Cells_0_6+Cells_0_7)))+(((Cells_0_8+Cells_0_9)...113602
Formula 0 simplified : GF((!"((((((((((Cells_0_0+Cells_0_1)+(Cells_0_2+Cells_0_3))+((Cells_0_4+Cells_0_5)+(Cells_0_6+Cells_0_7)))+(((Cells_0_8+Cells_0_9)+(...113598
Detected timeout of ITS tools.
[2024-05-31 12:16:33] [INFO ] Flatten gal took : 123 ms
[2024-05-31 12:16:33] [INFO ] Applying decomposition
[2024-05-31 12:16:34] [INFO ] Flatten gal took : 133 ms
[2024-05-31 12:17:12] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.util.concurrent.TimeoutException: Subprocess running '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph5475865697966664736.txt' '-o' '/tmp/graph5475865697966664736.bin' '-w' '/tmp/graph5475865697966664736.weights' killed by timeout after 10 SECONDS
at fr.lip6.move.gal.process.Runner.waitForOrTimeout(Runner.java:76)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:47)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:27)
at fr.lip6.move.gal.louvain.GraphBuilder.convertGraphToBin(GraphBuilder.java:258)
at fr.lip6.move.gal.louvain.GraphBuilder.computeLouvain(GraphBuilder.java:189)
at fr.lip6.move.gal.louvain.GraphBuilder.computeLouvain(GraphBuilder.java:157)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:226)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:277)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:663)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:341)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-31 12:17:12] [INFO ] Flatten gal took : 121 ms
[2024-05-31 12:17:12] [INFO ] Time to serialize gal into /tmp/LTL16452739984615834734.gal : 24 ms
[2024-05-31 12:17:12] [INFO ] Time to serialize properties into /tmp/LTL15693121893847291744.ltl : 5 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/LTL16452739984615834734.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15693121893847291744.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(G((("((((((((((Cells_0_0+Cells_0_1)+(Cells_0_2+Cells_0_3))+((Cells_0_4+Cells_0_5)+(Cells_0_6+Cells_0_7)))+(((Cells_0_8+Cells_0_9)...113602
Formula 0 simplified : GF((!"((((((((((Cells_0_0+Cells_0_1)+(Cells_0_2+Cells_0_3))+((Cells_0_4+Cells_0_5)+(Cells_0_6+Cells_0_7)))+(((Cells_0_8+Cells_0_9)+(...113598
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17698483827079814395
[2024-05-31 12:17:27] [INFO ] Built C files in 69ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17698483827079814395
Running compilation step : cd /tmp/ltsmin17698483827079814395;'/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/ltsmin17698483827079814395;'/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/ltsmin17698483827079814395;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property Sudoku-PT-AN15-LTLCardinality-00 finished in 357320 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 U G((p1 U p2)))&&X(p1)))))'
Support contains 3825 out of 4050 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Applied a total of 0 rules in 22 ms. Remains 4050 /4050 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
// Phase 1: matrix 3375 rows 4050 cols
[2024-05-31 12:17:30] [INFO ] Computed 675 invariants in 16 ms
[2024-05-31 12:17:31] [INFO ] Implicit Places using invariants in 953 ms returned []
[2024-05-31 12:17:31] [INFO ] Invariant cache hit.
[2024-05-31 12:17:32] [INFO ] Implicit Places using invariants and state equation in 795 ms returned []
Implicit Place search using SMT with State Equation took 1774 ms to find 0 implicit places.
[2024-05-31 12:17:32] [INFO ] Invariant cache hit.
[2024-05-31 12:17:34] [INFO ] Dead Transitions using invariants and state equation in 2308 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4108 ms. Remains : 4050/4050 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 333 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), true, (OR (AND (NOT p1) p2) (AND p0 (NOT p1))), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : Sudoku-PT-AN15-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p2 p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(OR p2 p1 p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(OR (AND p2 (NOT p0)) (AND p1 (NOT p0))), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=1 dest: 6}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=1 dest: 7}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(OR (AND p2 (NOT p1)) (AND (NOT p1) p0)), acceptance={} source=3 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 4}, { cond=(OR p2 p1), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=6 dest: 4}, { cond=(OR (AND p2 (NOT p0)) (AND p1 (NOT p0))), acceptance={} source=6 dest: 5}, { cond=(OR (AND p2 p0) (AND p1 p0)), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=6 dest: 6}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=6 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=7 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=7 dest: 6}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p2:(OR (LEQ (ADD s225 s226 s227 s228 s229 s230 s231 s232 s233 s234 s235 s236 s237 s238 s239 s240 s241 s242 s243 s244 s245 s246 s247 s248 s249 s250 s251 s2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration timeout after 11100 steps with 2760 reset in 10003 ms.
Product exploration timeout after 11100 steps with 2806 reset in 10002 ms.
Computed a total of 4050 stabilizing places and 3375 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4050 transition count 3375
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p2 p1 p0), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (OR p2 p1 p0)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 361 ms. Reduced automaton from 8 states, 25 edges and 3 AP (stutter sensitive) to 8 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 345 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), true, (OR (AND p0 (NOT p1)) (AND (NOT p1) p2)), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 50 resets, run finished after 7697 ms. (steps per millisecond=1 ) properties (out of 11) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2218 ms. (steps per millisecond=4 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 3558 ms. (steps per millisecond=2 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2203 ms. (steps per millisecond=4 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2926 ms. (steps per millisecond=3 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 3580 ms. (steps per millisecond=2 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2235 ms. (steps per millisecond=4 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2024-05-31 12:18:24] [INFO ] Invariant cache hit.
[2024-05-31 12:18:34] [INFO ] After 861ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0 real:2
[2024-05-31 12:18:36] [INFO ] [Nat]Absence check using 675 positive place invariants in 269 ms returned sat
[2024-05-31 12:18:36] [INFO ] After 1803ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :0
Fused 6 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 6 invariant AP formulas.
Knowledge obtained : [(AND p2 p1 p0), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (OR p2 p1 p0)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND p0 (NOT p1) (NOT p2)))), (G (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (G (NOT (OR (AND p0 (NOT p1)) (AND (NOT p1) p2)))), (G (NOT (AND p0 p1 (NOT p2)))), (G (NOT (AND (NOT p0) p1 (NOT p2)))), (G (NOT (AND p1 (NOT p2))))]
False Knowledge obtained : [(F (NOT (OR p0 p1 p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (NOT (OR (AND p0 p1) (AND p0 p2)))), (F (AND (NOT p1) (NOT p2))), (F (NOT (OR p1 p2)))]
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be false thanks to negative knowledge :(F (NOT (OR p0 p1 p2)))
Knowledge based reduction with 16 factoid took 498 ms. Reduced automaton from 8 states, 25 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN15-LTLCardinality-04 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN15-LTLCardinality-04 finished in 66938 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((p0&&F((G(p2)||p1)))))'
Support contains 5 out of 4050 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Reduce places removed 3375 places and 0 transitions.
Iterating post reduction 0 with 3375 rules applied. Total rules applied 3375 place count 675 transition count 3375
Applied a total of 3375 rules in 94 ms. Remains 675 /4050 variables (removed 3375) and now considering 3375/3375 (removed 0) transitions.
// Phase 1: matrix 3375 rows 675 cols
[2024-05-31 12:18:37] [INFO ] Computed 44 invariants in 74 ms
[2024-05-31 12:18:40] [INFO ] Implicit Places using invariants in 3517 ms returned []
[2024-05-31 12:18:40] [INFO ] Invariant cache hit.
[2024-05-31 12:18:51] [INFO ] Implicit Places using invariants and state equation in 10808 ms returned []
Implicit Place search using SMT with State Equation took 14329 ms to find 0 implicit places.
[2024-05-31 12:18:51] [INFO ] Invariant cache hit.
[2024-05-31 12:18:53] [INFO ] Dead Transitions using invariants and state equation in 2116 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 675/4050 places, 3375/3375 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16541 ms. Remains : 675/4050 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Sudoku-PT-AN15-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s287 1), p1:(OR (EQ s271 0) (EQ s609 1)), p2:(OR (EQ s45 0) (EQ s350 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 261 steps with 130 reset in 90 ms.
FORMULA Sudoku-PT-AN15-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN15-LTLCardinality-08 finished in 16798 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' '!((p0 U X((F(p1)||G(!p2)))))'
Support contains 4 out of 4050 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Reduce places removed 3374 places and 0 transitions.
Iterating post reduction 0 with 3374 rules applied. Total rules applied 3374 place count 676 transition count 3375
Applied a total of 3374 rules in 256 ms. Remains 676 /4050 variables (removed 3374) and now considering 3375/3375 (removed 0) transitions.
// Phase 1: matrix 3375 rows 676 cols
[2024-05-31 12:18:54] [INFO ] Computed 44 invariants in 109 ms
[2024-05-31 12:18:58] [INFO ] Implicit Places using invariants in 3696 ms returned []
[2024-05-31 12:18:58] [INFO ] Invariant cache hit.
[2024-05-31 12:19:27] [INFO ] Implicit Places using invariants and state equation in 29595 ms returned []
Implicit Place search using SMT with State Equation took 33299 ms to find 0 implicit places.
[2024-05-31 12:19:27] [INFO ] Invariant cache hit.
[2024-05-31 12:19:29] [INFO ] Dead Transitions using invariants and state equation in 2089 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 676/4050 places, 3375/3375 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35669 ms. Remains : 676/4050 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN15-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s601 1), p1:(NEQ s134 1), p2:(AND (EQ s134 1) (OR (EQ s225 0) (EQ s662 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 323 steps with 1 reset in 83 ms.
FORMULA Sudoku-PT-AN15-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN15-LTLCardinality-09 finished in 35927 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 5 out of 4050 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Reduce places removed 3374 places and 0 transitions.
Iterating post reduction 0 with 3374 rules applied. Total rules applied 3374 place count 676 transition count 3375
Applied a total of 3374 rules in 73 ms. Remains 676 /4050 variables (removed 3374) and now considering 3375/3375 (removed 0) transitions.
// Phase 1: matrix 3375 rows 676 cols
[2024-05-31 12:19:30] [INFO ] Computed 44 invariants in 185 ms
[2024-05-31 12:19:33] [INFO ] Implicit Places using invariants in 3854 ms returned []
[2024-05-31 12:19:33] [INFO ] Invariant cache hit.
[2024-05-31 12:19:45] [INFO ] Implicit Places using invariants and state equation in 11106 ms returned []
Implicit Place search using SMT with State Equation took 14963 ms to find 0 implicit places.
[2024-05-31 12:19:45] [INFO ] Invariant cache hit.
[2024-05-31 12:19:47] [INFO ] Dead Transitions using invariants and state equation in 2258 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 676/4050 places, 3375/3375 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17299 ms. Remains : 676/4050 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 266 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN15-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s225 0) (EQ s247 1) (EQ s20 0) (EQ s321 0) (EQ s100 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 203 steps with 0 reset in 44 ms.
FORMULA Sudoku-PT-AN15-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN15-LTLCardinality-13 finished in 17643 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 4050 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Reduce places removed 3374 places and 0 transitions.
Iterating post reduction 0 with 3374 rules applied. Total rules applied 3374 place count 676 transition count 3375
Applied a total of 3374 rules in 71 ms. Remains 676 /4050 variables (removed 3374) and now considering 3375/3375 (removed 0) transitions.
// Phase 1: matrix 3375 rows 676 cols
[2024-05-31 12:19:48] [INFO ] Computed 44 invariants in 296 ms
[2024-05-31 12:19:51] [INFO ] Implicit Places using invariants in 3895 ms returned []
[2024-05-31 12:19:51] [INFO ] Invariant cache hit.
[2024-05-31 12:20:14] [INFO ] Implicit Places using invariants and state equation in 22676 ms returned []
Implicit Place search using SMT with State Equation took 26576 ms to find 0 implicit places.
[2024-05-31 12:20:14] [INFO ] Invariant cache hit.
[2024-05-31 12:20:16] [INFO ] Dead Transitions using invariants and state equation in 2174 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 676/4050 places, 3375/3375 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28822 ms. Remains : 676/4050 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN15-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s633 0) (EQ s225 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 1930 steps with 20 reset in 622 ms.
FORMULA Sudoku-PT-AN15-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN15-LTLCardinality-14 finished in 29543 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((p0 U p1) U p2))))'
[2024-05-31 12:20:17] [INFO ] Flatten gal took : 119 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8164140402148720599
[2024-05-31 12:20:17] [INFO ] Too many transitions (3375) to apply POR reductions. Disabling POR matrices.
[2024-05-31 12:20:17] [INFO ] Built C files in 54ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8164140402148720599
Running compilation step : cd /tmp/ltsmin8164140402148720599;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-31 12:20:17] [INFO ] Applying decomposition
[2024-05-31 12:20:17] [INFO ] Flatten gal took : 120 ms
[2024-05-31 12:20:38] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.util.concurrent.TimeoutException: Subprocess running '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph11553979488476475856.txt' '-o' '/tmp/graph11553979488476475856.bin' '-w' '/tmp/graph11553979488476475856.weights' killed by timeout after 10 SECONDS
at fr.lip6.move.gal.process.Runner.waitForOrTimeout(Runner.java:76)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:47)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:27)
at fr.lip6.move.gal.louvain.GraphBuilder.convertGraphToBin(GraphBuilder.java:258)
at fr.lip6.move.gal.louvain.GraphBuilder.computeLouvain(GraphBuilder.java:189)
at fr.lip6.move.gal.louvain.GraphBuilder.computeLouvain(GraphBuilder.java:157)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:226)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:277)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:106)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:855)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-31 12:20:38] [INFO ] Flatten gal took : 126 ms
[2024-05-31 12:20:49] [INFO ] Time to serialize gal into /tmp/LTLCardinality12587297582182562074.gal : 10506 ms
[2024-05-31 12:20:49] [INFO ] Time to serialize properties into /tmp/LTLCardinality15666099218584815955.ltl : 582 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/LTLCardinality12587297582182562074.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality15666099218584815955.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...299
Read 1 LTL properties
Compilation finished in 32478 ms.
Running link step : cd /tmp/ltsmin8164140402148720599;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 71 ms.
Running LTSmin : cd /tmp/ltsmin8164140402148720599;'/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) U (LTLAPp1==true)) U (LTLAPp2==true))))' '--buchi-type=spotba'
Checking formula 0 : !((F(G((("((((((((((Cells_0_0+Cells_0_1)+(Cells_0_2+Cells_0_3))+((Cells_0_4+Cells_0_5)+(Cells_0_6+Cells_0_7)))+(((Cells_0_8+Cells_0_9)...113602
Formula 0 simplified : GF((!"((((((((((Cells_0_0+Cells_0_1)+(Cells_0_2+Cells_0_3))+((Cells_0_4+Cells_0_5)+(Cells_0_6+Cells_0_7)))+(((Cells_0_8+Cells_0_9)+(...113598
Detected timeout of ITS tools.
[2024-05-31 12:44:19] [INFO ] Applying decomposition
[2024-05-31 12:44:19] [INFO ] Flatten gal took : 585 ms
[2024-05-31 12:44:20] [INFO ] Decomposing Gal with order
[2024-05-31 12:44:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 12:44:23] [INFO ] Removed a total of 6261 redundant transitions.
[2024-05-31 12:44:24] [INFO ] Flatten gal took : 1440 ms
[2024-05-31 12:44:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 50 ms.
[2024-05-31 12:44:25] [INFO ] Time to serialize gal into /tmp/LTLCardinality16015654803654770198.gal : 56 ms
[2024-05-31 12:44:25] [INFO ] Time to serialize properties into /tmp/LTLCardinality4081352101824821690.ltl : 5 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/LTLCardinality16015654803654770198.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality4081352101824821690.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 1 LTL properties
Checking formula 0 : !((F(G((("((((((((((gu122.Cells_0_0+gu133.Cells_0_1)+(gu192.Cells_0_2+gu49.Cells_0_3))+((gu45.Cells_0_4+gu1.Cells_0_5)+(gu204.Cells_0_...156178
Formula 0 simplified : GF((!"((((((((((gu122.Cells_0_0+gu133.Cells_0_1)+(gu192.Cells_0_2+gu49.Cells_0_3))+((gu45.Cells_0_4+gu1.Cells_0_5)+(gu204.Cells_0_6+...156174
Detected timeout of ITS tools.
[2024-05-31 13:07:55] [INFO ] Flatten gal took : 551 ms
[2024-05-31 13:07:56] [INFO ] Input system was already deterministic with 3375 transitions.
[2024-05-31 13:07:56] [INFO ] Transformed 4050 places.
[2024-05-31 13:07:56] [INFO ] Transformed 3375 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-31 13:08:01] [INFO ] Time to serialize gal into /tmp/LTLCardinality10217720648015832748.gal : 44 ms
[2024-05-31 13:08:01] [INFO ] Time to serialize properties into /tmp/LTLCardinality17577985649629205487.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality10217720648015832748.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality17577985649629205487.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...344
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G((("((((((((((Cells_0_0+Cells_0_1)+(Cells_0_2+Cells_0_3))+((Cells_0_4+Cells_0_5)+(Cells_0_6+Cells_0_7)))+(((Cells_0_8+Cells_0_9)...113602
Formula 0 simplified : GF((!"((((((((((Cells_0_0+Cells_0_1)+(Cells_0_2+Cells_0_3))+((Cells_0_4+Cells_0_5)+(Cells_0_6+Cells_0_7)))+(((Cells_0_8+Cells_0_9)+(...113598
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 11114368 kB
After kill :
MemTotal: 16393232 kB
MemFree: 12357312 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-AN15"
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-AN15, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r417-tall-171690556400427"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-PT-AN15.tgz
mv Sudoku-PT-AN15 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;