About the Execution of 2023-gold for Sudoku-PT-AN13
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16216.256 | 2146577.00 | 2568550.00 | 62996.40 | TTTFT?TFFFFFFFFF | normal |
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-171690556400417.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-AN13, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r417-tall-171690556400417
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 42M
-rw-r--r-- 1 mcc users 813K Apr 12 11:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 3.6M Apr 12 11:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.6M Apr 12 10:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 7.3M Apr 12 10:14 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 379K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 1.3M Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.1M Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 3.7M Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7M Apr 12 12:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 7.6M Apr 12 12:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.0M Apr 12 11:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 9.1M Apr 12 11:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 78K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 191K 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 1.2M 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-AN13-LTLCardinality-00
FORMULA_NAME Sudoku-PT-AN13-LTLCardinality-01
FORMULA_NAME Sudoku-PT-AN13-LTLCardinality-02
FORMULA_NAME Sudoku-PT-AN13-LTLCardinality-03
FORMULA_NAME Sudoku-PT-AN13-LTLCardinality-04
FORMULA_NAME Sudoku-PT-AN13-LTLCardinality-05
FORMULA_NAME Sudoku-PT-AN13-LTLCardinality-06
FORMULA_NAME Sudoku-PT-AN13-LTLCardinality-07
FORMULA_NAME Sudoku-PT-AN13-LTLCardinality-08
FORMULA_NAME Sudoku-PT-AN13-LTLCardinality-09
FORMULA_NAME Sudoku-PT-AN13-LTLCardinality-10
FORMULA_NAME Sudoku-PT-AN13-LTLCardinality-11
FORMULA_NAME Sudoku-PT-AN13-LTLCardinality-12
FORMULA_NAME Sudoku-PT-AN13-LTLCardinality-13
FORMULA_NAME Sudoku-PT-AN13-LTLCardinality-14
FORMULA_NAME Sudoku-PT-AN13-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1717155161032
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-AN13
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-31 11:32:42] [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 11:32:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 11:32:42] [INFO ] Load time of PNML (sax parser for PT used): 171 ms
[2024-05-31 11:32:42] [INFO ] Transformed 2704 places.
[2024-05-31 11:32:42] [INFO ] Transformed 2197 transitions.
[2024-05-31 11:32:42] [INFO ] Found NUPN structural information;
[2024-05-31 11:32:42] [INFO ] Parsed PT model containing 2704 places and 2197 transitions and 8788 arcs in 278 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 184 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Sudoku-PT-AN13-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN13-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN13-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN13-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 2704 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 29 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 2704 cols
[2024-05-31 11:32:43] [INFO ] Computed 507 invariants in 47 ms
[2024-05-31 11:32:43] [INFO ] Implicit Places using invariants in 621 ms returned []
[2024-05-31 11:32:43] [INFO ] Invariant cache hit.
[2024-05-31 11:32:44] [INFO ] Implicit Places using invariants and state equation in 734 ms returned []
Implicit Place search using SMT with State Equation took 1382 ms to find 0 implicit places.
[2024-05-31 11:32:44] [INFO ] Invariant cache hit.
[2024-05-31 11:32:45] [INFO ] Dead Transitions using invariants and state equation in 1312 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2727 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Support contains 2704 out of 2704 places after structural reductions.
[2024-05-31 11:32:46] [INFO ] Flatten gal took : 241 ms
[2024-05-31 11:32:46] [INFO ] Flatten gal took : 133 ms
[2024-05-31 11:32:47] [INFO ] Input system was already deterministic with 2197 transitions.
Incomplete random walk after 10000 steps, including 67 resets, run finished after 4052 ms. (steps per millisecond=2 ) properties (out of 25) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 615 ms. (steps per millisecond=16 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 263 ms. (steps per millisecond=38 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2024-05-31 11:32:53] [INFO ] Invariant cache hit.
[2024-05-31 11:32:54] [INFO ] [Real]Absence check using 507 positive place invariants in 177 ms returned sat
[2024-05-31 11:33:18] [INFO ] After 25021ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-31 11:33:19] [INFO ] [Nat]Absence check using 507 positive place invariants in 146 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:632)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-31 11:33:43] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-31 11:33:43] [INFO ] After 25028ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 2704 out of 2704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 38 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Incomplete random walk after 10000 steps, including 67 resets, run finished after 2129 ms. (steps per millisecond=4 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 607 ms. (steps per millisecond=16 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 9) 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 9) seen :0
Probabilistic random walk after 126812 steps, saw 126719 distinct states, run finished after 9062 ms. (steps per millisecond=13 ) properties seen :0
Running SMT prover for 9 properties.
[2024-05-31 11:33:56] [INFO ] Invariant cache hit.
[2024-05-31 11:33:58] [INFO ] [Real]Absence check using 507 positive place invariants in 143 ms returned sat
[2024-05-31 11:34:22] [INFO ] After 25013ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-31 11:34:23] [INFO ] [Nat]Absence check using 507 positive place invariants in 138 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:632)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-31 11:34:47] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-31 11:34:47] [INFO ] After 25024ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2704 out of 2704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 37 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 27 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-31 11:34:47] [INFO ] Invariant cache hit.
[2024-05-31 11:34:48] [INFO ] Implicit Places using invariants in 401 ms returned []
[2024-05-31 11:34:48] [INFO ] Invariant cache hit.
[2024-05-31 11:34:48] [INFO ] Implicit Places using invariants and state equation in 413 ms returned []
Implicit Place search using SMT with State Equation took 817 ms to find 0 implicit places.
[2024-05-31 11:34:48] [INFO ] Redundant transitions in 129 ms returned []
[2024-05-31 11:34:48] [INFO ] Invariant cache hit.
[2024-05-31 11:34:49] [INFO ] Dead Transitions using invariants and state equation in 1216 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2209 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Computed a total of 2704 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2704 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&((p1||F(p2)) U p3))))'
Support contains 2535 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 39 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-31 11:34:50] [INFO ] Invariant cache hit.
[2024-05-31 11:34:50] [INFO ] Implicit Places using invariants in 606 ms returned []
[2024-05-31 11:34:50] [INFO ] Invariant cache hit.
[2024-05-31 11:34:51] [INFO ] Implicit Places using invariants and state equation in 805 ms returned []
Implicit Place search using SMT with State Equation took 1414 ms to find 0 implicit places.
[2024-05-31 11:34:51] [INFO ] Invariant cache hit.
[2024-05-31 11:34:52] [INFO ] Dead Transitions using invariants and state equation in 1288 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2743 ms. Remains : 2704/2704 places, 2197/2197 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 305 ms :[(OR (NOT p0) (NOT p3)), (OR (NOT p0) (NOT p3)), true, (NOT p2), (NOT p3)]
Running random walk in product with property : Sudoku-PT-AN13-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p3) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p3)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(NOT p3), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (LEQ 3 (ADD s2535 s2536 s2537 s2538 s2539 s2540 s2541 s2542 s2543 s2544 s2545 s2546 s2547 s2548 s2549 s2550 s2551 s2552 s2553 s2554 s2555 s2556 s25...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration timeout after 34730 steps with 17365 reset in 10001 ms.
Product exploration timeout after 34900 steps with 17450 reset in 10002 ms.
Computed a total of 2704 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2704 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p3 (NOT p1) (NOT p2)), (X p0), (X (NOT (AND p0 (NOT p3)))), (X (NOT (AND p0 (NOT p3) (NOT p1) (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 21 ms. Reduced automaton from 5 states, 8 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN13-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN13-LTLCardinality-01 finished in 24166 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 169 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Reduce places removed 2197 places and 0 transitions.
Iterating post reduction 0 with 2197 rules applied. Total rules applied 2197 place count 507 transition count 2197
Applied a total of 2197 rules in 191 ms. Remains 507 /2704 variables (removed 2197) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 507 cols
[2024-05-31 11:35:14] [INFO ] Computed 38 invariants in 98 ms
[2024-05-31 11:35:16] [INFO ] Implicit Places using invariants in 1927 ms returned []
[2024-05-31 11:35:16] [INFO ] Invariant cache hit.
[2024-05-31 11:35:23] [INFO ] Implicit Places using invariants and state equation in 7074 ms returned []
Implicit Place search using SMT with State Equation took 9007 ms to find 0 implicit places.
[2024-05-31 11:35:23] [INFO ] Invariant cache hit.
[2024-05-31 11:35:25] [INFO ] Dead Transitions using invariants and state equation in 1561 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 507/2704 places, 2197/2197 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10760 ms. Remains : 507/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN13-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 (ADD s169 s170 s171 s172 s173 s174 s175 s176 s177 s178 s179 s180 s181 s182 s183 s184 s185 s186 s187 s188 s189 s190 s191 s192 s193 s194 s195 s196...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration timeout after 44440 steps with 22220 reset in 10002 ms.
Product exploration timeout after 44620 steps with 22310 reset in 10002 ms.
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 12 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN13-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN13-LTLCardinality-02 finished in 31242 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 2197 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 41 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 2704 cols
[2024-05-31 11:35:45] [INFO ] Computed 507 invariants in 17 ms
[2024-05-31 11:35:46] [INFO ] Implicit Places using invariants in 913 ms returned []
[2024-05-31 11:35:46] [INFO ] Invariant cache hit.
[2024-05-31 11:35:47] [INFO ] Implicit Places using invariants and state equation in 839 ms returned []
Implicit Place search using SMT with State Equation took 1755 ms to find 0 implicit places.
[2024-05-31 11:35:47] [INFO ] Invariant cache hit.
[2024-05-31 11:35:48] [INFO ] Dead Transitions using invariants and state equation in 1222 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3020 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN13-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(GT 2 (ADD s169 s170 s171 s172 s173 s174 s175 s176 s177 s178 s179 s180 s181 s182 s183 s184 s185 s186 s187 s188 s189 s190 s191 s192 s193 s194 s195 s196 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 152 steps with 0 reset in 32 ms.
FORMULA Sudoku-PT-AN13-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN13-LTLCardinality-03 finished in 3237 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X((p0 U (X(p1) U ((p1&&X(p1))||X(G(p1))))))))'
Support contains 2366 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 20 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-31 11:35:48] [INFO ] Invariant cache hit.
[2024-05-31 11:35:49] [INFO ] Implicit Places using invariants in 691 ms returned []
[2024-05-31 11:35:49] [INFO ] Invariant cache hit.
[2024-05-31 11:35:50] [INFO ] Implicit Places using invariants and state equation in 929 ms returned []
Implicit Place search using SMT with State Equation took 1626 ms to find 0 implicit places.
[2024-05-31 11:35:50] [INFO ] Invariant cache hit.
[2024-05-31 11:35:51] [INFO ] Dead Transitions using invariants and state equation in 1214 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2861 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 262 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), true, (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-PT-AN13-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 6}, { cond=p0, acceptance={} source=0 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 7}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 6}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}], [{ cond=(NOT p1), acceptance={} source=5 dest: 2}, { cond=p1, acceptance={} source=5 dest: 4}], [{ cond=(AND p0 p1), acceptance={0} source=6 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=6 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={0} source=6 dest: 6}], [{ cond=(AND p0 p1), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(LEQ 3 (ADD s2366 s2367 s2368 s2369 s2370 s2371 s2372 s2373 s2374 s2375 s2376 s2377 s2378 s2379 s2380 s2381 s2382 s2383 s2384 s2385 s2386 s2387 s2388 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration timeout after 39890 steps with 269 reset in 10004 ms.
Product exploration timeout after 39470 steps with 266 reset in 10003 ms.
Computed a total of 2704 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2704 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 138 ms. Reduced automaton from 8 states, 18 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 193 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Incomplete random walk after 10000 steps, including 67 resets, run finished after 1575 ms. (steps per millisecond=6 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 522 ms. (steps per millisecond=19 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 519 ms. (steps per millisecond=19 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-31 11:36:15] [INFO ] Invariant cache hit.
[2024-05-31 11:36:16] [INFO ] [Real]Absence check using 507 positive place invariants in 139 ms returned sat
[2024-05-31 11:36:41] [INFO ] After 25024ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 11:36:41] [INFO ] [Nat]Absence check using 507 positive place invariants in 141 ms returned sat
[2024-05-31 11:37:06] [INFO ] After 25012ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2366 out of 2704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 38 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Incomplete random walk after 10000 steps, including 67 resets, run finished after 1584 ms. (steps per millisecond=6 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 525 ms. (steps per millisecond=19 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 527 ms. (steps per millisecond=18 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 266401 steps, run timeout after 6001 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 266401 steps, saw 224161 distinct states, run finished after 6002 ms. (steps per millisecond=44 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-31 11:37:14] [INFO ] Invariant cache hit.
[2024-05-31 11:37:15] [INFO ] [Real]Absence check using 507 positive place invariants in 138 ms returned sat
[2024-05-31 11:37:40] [INFO ] After 25020ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 11:37:40] [INFO ] [Nat]Absence check using 507 positive place invariants in 141 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 11:38:05] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-31 11:38:05] [INFO ] After 25028ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2366 out of 2704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 35 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 32 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-31 11:38:05] [INFO ] Invariant cache hit.
[2024-05-31 11:38:06] [INFO ] Implicit Places using invariants in 752 ms returned []
[2024-05-31 11:38:06] [INFO ] Invariant cache hit.
[2024-05-31 11:38:07] [INFO ] Implicit Places using invariants and state equation in 940 ms returned []
Implicit Place search using SMT with State Equation took 1694 ms to find 0 implicit places.
[2024-05-31 11:38:07] [INFO ] Redundant transitions in 100 ms returned []
[2024-05-31 11:38:07] [INFO ] Invariant cache hit.
[2024-05-31 11:38:08] [INFO ] Dead Transitions using invariants and state equation in 1205 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3046 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (NOT p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 7 factoid took 227 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 185 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Stuttering acceptance computed with spot in 191 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Support contains 2366 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 24 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-31 11:38:09] [INFO ] Invariant cache hit.
[2024-05-31 11:38:09] [INFO ] Implicit Places using invariants in 716 ms returned []
[2024-05-31 11:38:09] [INFO ] Invariant cache hit.
[2024-05-31 11:38:10] [INFO ] Implicit Places using invariants and state equation in 942 ms returned []
Implicit Place search using SMT with State Equation took 1660 ms to find 0 implicit places.
[2024-05-31 11:38:10] [INFO ] Invariant cache hit.
[2024-05-31 11:38:11] [INFO ] Dead Transitions using invariants and state equation in 1188 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2873 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Computed a total of 2704 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2704 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 131 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Incomplete random walk after 10000 steps, including 67 resets, run finished after 1572 ms. (steps per millisecond=6 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 529 ms. (steps per millisecond=18 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 526 ms. (steps per millisecond=19 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-31 11:38:15] [INFO ] Invariant cache hit.
[2024-05-31 11:38:16] [INFO ] [Real]Absence check using 507 positive place invariants in 135 ms returned sat
[2024-05-31 11:38:41] [INFO ] After 25015ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 11:38:41] [INFO ] [Nat]Absence check using 507 positive place invariants in 144 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:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java: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 11:39:06] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-31 11:39:06] [INFO ] After 25028ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2366 out of 2704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 31 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Incomplete random walk after 10000 steps, including 67 resets, run finished after 1584 ms. (steps per millisecond=6 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 524 ms. (steps per millisecond=19 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 518 ms. (steps per millisecond=19 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 253953 steps, run timeout after 6001 ms. (steps per millisecond=42 ) properties seen :{}
Probabilistic random walk after 253953 steps, saw 221646 distinct states, run finished after 6001 ms. (steps per millisecond=42 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-31 11:39:14] [INFO ] Invariant cache hit.
[2024-05-31 11:39:15] [INFO ] [Real]Absence check using 507 positive place invariants in 138 ms returned sat
[2024-05-31 11:39:40] [INFO ] After 25011ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 11:39:40] [INFO ] [Nat]Absence check using 507 positive place invariants in 138 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:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java: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 11:40:05] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-31 11:40:05] [INFO ] After 25035ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2366 out of 2704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 30 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 29 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-31 11:40:05] [INFO ] Invariant cache hit.
[2024-05-31 11:40:06] [INFO ] Implicit Places using invariants in 722 ms returned []
[2024-05-31 11:40:06] [INFO ] Invariant cache hit.
[2024-05-31 11:40:07] [INFO ] Implicit Places using invariants and state equation in 929 ms returned []
Implicit Place search using SMT with State Equation took 1652 ms to find 0 implicit places.
[2024-05-31 11:40:07] [INFO ] Redundant transitions in 33 ms returned []
[2024-05-31 11:40:07] [INFO ] Invariant cache hit.
[2024-05-31 11:40:08] [INFO ] Dead Transitions using invariants and state equation in 1233 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2968 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (NOT p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 7 factoid took 469 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Stuttering acceptance computed with spot in 182 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Stuttering acceptance computed with spot in 192 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Product exploration timeout after 39130 steps with 264 reset in 10004 ms.
Product exploration timeout after 38900 steps with 262 reset in 10001 ms.
Applying partial POR strategy [true, false, false, false, true, false]
Stuttering acceptance computed with spot in 187 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Support contains 2366 out of 2704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 139 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-31 11:40:29] [INFO ] Redundant transitions in 42 ms returned []
[2024-05-31 11:40:29] [INFO ] Invariant cache hit.
[2024-05-31 11:40:31] [INFO ] Dead Transitions using invariants and state equation in 1209 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1396 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Built C files in :
/tmp/ltsmin16005557629556552929
[2024-05-31 11:40:31] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16005557629556552929
Running compilation step : cd /tmp/ltsmin16005557629556552929;'/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/ltsmin16005557629556552929;'/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/ltsmin16005557629556552929;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2366 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 33 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-31 11:40:34] [INFO ] Invariant cache hit.
[2024-05-31 11:40:34] [INFO ] Implicit Places using invariants in 700 ms returned []
[2024-05-31 11:40:34] [INFO ] Invariant cache hit.
[2024-05-31 11:40:35] [INFO ] Implicit Places using invariants and state equation in 918 ms returned []
Implicit Place search using SMT with State Equation took 1621 ms to find 0 implicit places.
[2024-05-31 11:40:35] [INFO ] Invariant cache hit.
[2024-05-31 11:40:37] [INFO ] Dead Transitions using invariants and state equation in 1212 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2868 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Built C files in :
/tmp/ltsmin16677683625777181535
[2024-05-31 11:40:37] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16677683625777181535
Running compilation step : cd /tmp/ltsmin16677683625777181535;'/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/ltsmin16677683625777181535;'/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/ltsmin16677683625777181535;'/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 11:40:40] [INFO ] Flatten gal took : 110 ms
[2024-05-31 11:40:40] [INFO ] Flatten gal took : 98 ms
[2024-05-31 11:40:40] [INFO ] Time to serialize gal into /tmp/LTL5692003043860470510.gal : 24 ms
[2024-05-31 11:40:40] [INFO ] Time to serialize properties into /tmp/LTL9502120495483605302.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/LTL5692003043860470510.gal' '-t' 'CGAL' '-hoa' '/tmp/aut920068027338664678.hoa' '-atoms' '/tmp/LTL9502120495483605302.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...316
Loading property file /tmp/LTL9502120495483605302.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut920068027338664678.hoa
Detected timeout of ITS tools.
[2024-05-31 11:40:55] [INFO ] Flatten gal took : 97 ms
[2024-05-31 11:40:55] [INFO ] Flatten gal took : 110 ms
[2024-05-31 11:40:55] [INFO ] Time to serialize gal into /tmp/LTL14695930820373689711.gal : 35 ms
[2024-05-31 11:40:56] [INFO ] Time to serialize properties into /tmp/LTL12283710992811134884.ltl : 35 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/LTL14695930820373689711.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12283710992811134884.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 : !(((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)+(Ce...133420
Formula 0 simplified : F!"(((((((((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)+(Cell...133406
Detected timeout of ITS tools.
[2024-05-31 11:41:11] [INFO ] Flatten gal took : 88 ms
[2024-05-31 11:41:11] [INFO ] Applying decomposition
[2024-05-31 11:41:11] [INFO ] Flatten gal took : 89 ms
[2024-05-31 11:41:27] [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/graph3786401602241348183.txt' '-o' '/tmp/graph3786401602241348183.bin' '-w' '/tmp/graph3786401602241348183.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 11:41:27] [INFO ] Flatten gal took : 100 ms
[2024-05-31 11:41:28] [INFO ] Time to serialize gal into /tmp/LTL6361878706092997673.gal : 16 ms
[2024-05-31 11:41:28] [INFO ] Time to serialize properties into /tmp/LTL12228046469593118831.ltl : 10 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/LTL6361878706092997673.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12228046469593118831.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((G("(((((((((Cells_0_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)+(Ce...133420
Formula 0 simplified : F!"(((((((((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)+(Cell...133406
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6869948606142941354
[2024-05-31 11:41:43] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6869948606142941354
Running compilation step : cd /tmp/ltsmin6869948606142941354;'/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/ltsmin6869948606142941354;'/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/ltsmin6869948606142941354;'/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-AN13-LTLCardinality-05 finished in 357387 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||X(X(X(G(p1)))))))'
Support contains 338 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Reduce places removed 2197 places and 0 transitions.
Iterating post reduction 0 with 2197 rules applied. Total rules applied 2197 place count 507 transition count 2197
Applied a total of 2197 rules in 16 ms. Remains 507 /2704 variables (removed 2197) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 507 cols
[2024-05-31 11:41:46] [INFO ] Computed 38 invariants in 55 ms
[2024-05-31 11:41:47] [INFO ] Implicit Places using invariants in 1103 ms returned []
[2024-05-31 11:41:47] [INFO ] Invariant cache hit.
[2024-05-31 11:41:54] [INFO ] Implicit Places using invariants and state equation in 7409 ms returned []
Implicit Place search using SMT with State Equation took 8515 ms to find 0 implicit places.
[2024-05-31 11:41:54] [INFO ] Invariant cache hit.
[2024-05-31 11:41:56] [INFO ] Dead Transitions using invariants and state equation in 1487 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 507/2704 places, 2197/2197 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10018 ms. Remains : 507/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 194 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-PT-AN13-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 1}]], initial=5, aps=[p0:(LEQ (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 s37...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration timeout after 44500 steps with 22250 reset in 10001 ms.
Product exploration timeout after 44170 steps with 22085 reset in 10002 ms.
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X p0), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 12 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN13-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN13-LTLCardinality-06 finished in 30645 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((G(p0) U p1))&&(p2 U p3))))'
Support contains 338 out of 2704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Graph (complete) has 6591 edges and 2704 vertex of which 507 are kept as prefixes of interest. Removing 2197 places using SCC suffix rule.10 ms
Discarding 2197 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 34 ms. Remains 507 /2704 variables (removed 2197) and now considering 2197/2197 (removed 0) transitions.
[2024-05-31 11:42:16] [INFO ] Invariant cache hit.
[2024-05-31 11:42:17] [INFO ] Implicit Places using invariants in 973 ms returned []
[2024-05-31 11:42:17] [INFO ] Invariant cache hit.
[2024-05-31 11:42:21] [INFO ] Implicit Places using invariants and state equation in 3381 ms returned []
Implicit Place search using SMT with State Equation took 4364 ms to find 0 implicit places.
[2024-05-31 11:42:21] [INFO ] Redundant transitions in 38 ms returned []
[2024-05-31 11:42:21] [INFO ] Invariant cache hit.
[2024-05-31 11:42:22] [INFO ] Dead Transitions using invariants and state equation in 1462 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 507/2704 places, 2197/2197 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5922 ms. Remains : 507/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 311 ms :[(OR (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (NOT p1), (NOT p1), (NOT p3), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : Sudoku-PT-AN13-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p3) (NOT p2))), acceptance={0, 1} source=0 dest: 0}, { cond=(OR (AND (NOT p1) p0 p3) (AND (NOT p1) p0 p2)), acceptance={1} source=0 dest: 1}, { cond=(OR (AND (NOT p1) p0 p3) (AND (NOT p1) p0 p2)), acceptance={0, 1} source=0 dest: 2}, { cond=(OR (AND p1 p3) (AND p1 p2) (AND p0 p3) (AND p0 p2)), acceptance={0} source=0 dest: 3}, { cond=(OR (AND p1 (NOT p3) p2) (AND p0 (NOT p3) p2)), acceptance={0, 1} source=0 dest: 4}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p3) (NOT p2))), acceptance={0, 1} source=1 dest: 0}, { cond=(OR (AND (NOT p1) p0) (AND p0 (NOT p3) (NOT p2))), acceptance={1} source=1 dest: 1}, { cond=(OR (AND p1 (NOT p0) p3) (AND p1 (NOT p0) p2)), acceptance={0} source=1 dest: 3}, { cond=(AND p1 (NOT p0) (NOT p3) p2), acceptance={0, 1} source=1 dest: 4}, { cond=(OR (AND p1 p0 p3) (AND p1 p0 p2)), acceptance={} source=1 dest: 5}, { cond=(AND p1 p0 (NOT p3) p2), acceptance={1} source=1 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={1} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={1} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=3 dest: 2}, { cond=(OR p1 p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0, 1} source=4 dest: 0}, { cond=(AND (NOT p3) p2), acceptance={0, 1} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=5 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={1} source=5 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=5 dest: 3}, { cond=(AND p1 p0), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={0, 1} source=6 dest: 0}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={1} source=6 dest: 1}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={0, 1} source=6 dest: 4}, { cond=(AND p0 (NOT p3) p2), acceptance={1} source=6 dest: 6}]], initial=0, aps=[p1:(LEQ 2 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Product exploration timeout after 64690 steps with 436 reset in 10001 ms.
Product exploration timeout after 64040 steps with 431 reset in 10001 ms.
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0 p3 p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (OR (AND p1 (NOT p0) p3) (AND p1 (NOT p0) p2)))), (X (NOT (OR (AND (NOT p1) p0 p3) (AND (NOT p1) p0 p2)))), (X (OR (AND p1 p3) (AND p1 p2) (AND p0 p3) (AND p0 p2))), (X (NOT (OR (AND (NOT p1) p0) (AND p0 (NOT p3) (NOT p2))))), (X (OR (AND p1 p0 p3) (AND p1 p0 p2))), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p3) (NOT p2))))), (X (NOT (AND (NOT p1) p0))), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p3) (NOT p2))))), (X (NOT (OR (AND p1 (NOT p3) p2) (AND p0 (NOT p3) p2)))), (X (NOT (AND p1 (NOT p0) (NOT p3) p2))), (X (OR p1 p0)), (X (NOT (AND p1 p0 (NOT p3) p2))), (X (NOT (AND (NOT p3) p2))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 20 factoid took 4437 ms. Reduced automaton from 7 states, 28 edges and 4 AP (stutter insensitive) to 7 states, 28 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 308 ms :[(OR (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (NOT p1), (NOT p1), (NOT p3), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p3))]
Incomplete random walk after 10000 steps, including 67 resets, run finished after 3257 ms. (steps per millisecond=3 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 50 ms. (steps per millisecond=20 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 68 ms. (steps per millisecond=14 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 55 ms. (steps per millisecond=18 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 52 ms. (steps per millisecond=19 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 39 ms. (steps per millisecond=25 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 52 ms. (steps per millisecond=19 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 39 ms. (steps per millisecond=25 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 48 ms. (steps per millisecond=20 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 49 ms. (steps per millisecond=20 ) properties (out of 21) seen :0
Interrupted probabilistic random walk after 56455 steps, run timeout after 9085 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 56455 steps, saw 56425 distinct states, run finished after 9085 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 21 properties.
[2024-05-31 11:43:01] [INFO ] Invariant cache hit.
[2024-05-31 11:43:04] [INFO ] After 294ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:19
[2024-05-31 11:43:04] [INFO ] [Nat]Absence check using 0 positive and 38 generalized place invariants in 29 ms returned sat
[2024-05-31 11:43:10] [INFO ] After 5520ms SMT Verify possible using state equation in natural domain returned unsat :12 sat :9
[2024-05-31 11:43:11] [INFO ] After 6301ms SMT Verify possible using trap constraints in natural domain returned unsat :12 sat :9
Attempting to minimize the solution found.
Minimization took 444 ms.
[2024-05-31 11:43:11] [INFO ] After 7179ms SMT Verify possible using all constraints in natural domain returned unsat :12 sat :9
Fused 21 Parikh solutions to 2 different solutions.
Finished Parikh walk after 169 steps, including 0 resets, run visited all 9 properties in 23 ms. (steps per millisecond=7 )
Parikh walk visited 5 properties in 26 ms.
Support contains 338 out of 507 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 11 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 507/507 places, 2197/2197 transitions.
Incomplete random walk after 10000 steps, including 67 resets, run finished after 1922 ms. (steps per millisecond=5 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 256 ms. (steps per millisecond=39 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 255 ms. (steps per millisecond=39 ) properties (out of 4) seen :0
Probabilistic random walk after 150563 steps, saw 150455 distinct states, run finished after 6031 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-31 11:43:20] [INFO ] Invariant cache hit.
[2024-05-31 11:43:20] [INFO ] [Real]Absence check using 0 positive and 38 generalized place invariants in 30 ms returned sat
[2024-05-31 11:43:21] [INFO ] After 1135ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-31 11:43:21] [INFO ] [Nat]Absence check using 0 positive and 38 generalized place invariants in 30 ms returned sat
[2024-05-31 11:43:23] [INFO ] After 1611ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-31 11:43:23] [INFO ] After 1923ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 170 ms.
[2024-05-31 11:43:23] [INFO ] After 2290ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 1 different solutions.
Finished Parikh walk after 169 steps, including 0 resets, run visited all 4 properties in 16 ms. (steps per millisecond=10 )
Parikh walk visited 4 properties in 16 ms.
Found 8 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 p3 p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (OR (AND p1 (NOT p0) p3) (AND p1 (NOT p0) p2)))), (X (NOT (OR (AND (NOT p1) p0 p3) (AND (NOT p1) p0 p2)))), (X (OR (AND p1 p3) (AND p1 p2) (AND p0 p3) (AND p0 p2))), (X (NOT (OR (AND (NOT p1) p0) (AND p0 (NOT p3) (NOT p2))))), (X (OR (AND p1 p0 p3) (AND p1 p0 p2))), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p3) (NOT p2))))), (X (NOT (AND (NOT p1) p0))), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p3) (NOT p2))))), (X (NOT (OR (AND p1 (NOT p3) p2) (AND p0 (NOT p3) p2)))), (X (NOT (AND p1 (NOT p0) (NOT p3) p2))), (X (OR p1 p0)), (X (NOT (AND p1 p0 (NOT p3) p2))), (X (NOT (AND (NOT p3) p2))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND p1 (NOT p3) p2 p0))), (G (NOT (AND p1 (NOT p0)))), (G (NOT (AND (NOT p3) p2))), (G (OR p1 p0)), (G (NOT (AND (NOT p3) p2 (NOT p0)))), (G (NOT (AND (NOT p3) (NOT p2) (NOT p0)))), (G (NOT (AND (NOT p1) (NOT p0)))), (G (NOT (AND (NOT p3) p2 p0)))]
False Knowledge obtained : [(F (NOT (OR (AND p1 p3 p0) (AND p1 p2 p0)))), (F (AND p1 (NOT p3) p2 (NOT p0))), (F (OR (AND (NOT p1) (NOT p0)) (AND (NOT p3) (NOT p2) (NOT p0)))), (F (OR (AND p1 (NOT p3) p2) (AND (NOT p3) p2 p0))), (F (OR (AND p1 p3 (NOT p0)) (AND p1 p2 (NOT p0)))), (F (AND (NOT p3) (NOT p2))), (F (OR (AND (NOT p1) p0) (AND (NOT p3) (NOT p2) p0))), (F (OR (AND (NOT p1) (NOT p0)) (AND (NOT p3) (NOT p2)))), (F (AND (NOT p3) (NOT p2) p0)), (F (NOT (OR (AND p1 p3) (AND p1 p2) (AND p3 p0) (AND p2 p0)))), (F (OR (AND (NOT p1) p3 p0) (AND (NOT p1) p2 p0))), (F (NOT (AND p1 p0))), (F (AND (NOT p1) p0))]
Property proved to be false thanks to negative knowledge :(F (AND p1 (NOT p3) p2 (NOT p0)))
Knowledge based reduction with 28 factoid took 5201 ms. Reduced automaton from 7 states, 28 edges and 4 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN13-LTLCardinality-07 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN13-LTLCardinality-07 finished in 72369 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(X((X(!F(!X(p0))) U p0)))))'
Support contains 2 out of 2704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Graph (complete) has 6591 edges and 2704 vertex of which 507 are kept as prefixes of interest. Removing 2197 places using SCC suffix rule.5 ms
Discarding 2197 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 56 ms. Remains 507 /2704 variables (removed 2197) and now considering 2197/2197 (removed 0) transitions.
[2024-05-31 11:43:29] [INFO ] Invariant cache hit.
[2024-05-31 11:43:31] [INFO ] Implicit Places using invariants in 2616 ms returned []
[2024-05-31 11:43:31] [INFO ] Invariant cache hit.
[2024-05-31 11:43:41] [INFO ] Implicit Places using invariants and state equation in 9444 ms returned []
Implicit Place search using SMT with State Equation took 12063 ms to find 0 implicit places.
[2024-05-31 11:43:41] [INFO ] Redundant transitions in 40 ms returned []
[2024-05-31 11:43:41] [INFO ] Invariant cache hit.
[2024-05-31 11:43:42] [INFO ] Dead Transitions using invariants and state equation in 1514 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 507/2704 places, 2197/2197 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13685 ms. Remains : 507/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN13-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s336 0) (EQ s496 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 5484 steps with 36 reset in 744 ms.
FORMULA Sudoku-PT-AN13-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN13-LTLCardinality-08 finished in 14480 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 1 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Reduce places removed 2197 places and 0 transitions.
Iterating post reduction 0 with 2197 rules applied. Total rules applied 2197 place count 507 transition count 2197
Applied a total of 2197 rules in 49 ms. Remains 507 /2704 variables (removed 2197) and now considering 2197/2197 (removed 0) transitions.
[2024-05-31 11:43:43] [INFO ] Invariant cache hit.
[2024-05-31 11:43:46] [INFO ] Implicit Places using invariants in 2722 ms returned []
[2024-05-31 11:43:46] [INFO ] Invariant cache hit.
[2024-05-31 11:43:54] [INFO ] Implicit Places using invariants and state equation in 7838 ms returned []
Implicit Place search using SMT with State Equation took 10577 ms to find 0 implicit places.
[2024-05-31 11:43:54] [INFO ] Invariant cache hit.
[2024-05-31 11:43:55] [INFO ] Dead Transitions using invariants and state equation in 1478 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 507/2704 places, 2197/2197 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12107 ms. Remains : 507/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 173 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN13-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(NEQ s483 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 3 ms.
FORMULA Sudoku-PT-AN13-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN13-LTLCardinality-09 finished in 12305 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)&&F(p1)&&F(G(p2)))))'
Support contains 4 out of 2704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Graph (complete) has 6591 edges and 2704 vertex of which 508 are kept as prefixes of interest. Removing 2196 places using SCC suffix rule.7 ms
Discarding 2196 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 68 ms. Remains 508 /2704 variables (removed 2196) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 508 cols
[2024-05-31 11:43:56] [INFO ] Computed 38 invariants in 106 ms
[2024-05-31 11:43:58] [INFO ] Implicit Places using invariants in 2840 ms returned []
[2024-05-31 11:43:58] [INFO ] Invariant cache hit.
[2024-05-31 11:44:04] [INFO ] Implicit Places using invariants and state equation in 5940 ms returned []
Implicit Place search using SMT with State Equation took 8784 ms to find 0 implicit places.
[2024-05-31 11:44:04] [INFO ] Redundant transitions in 36 ms returned []
[2024-05-31 11:44:04] [INFO ] Invariant cache hit.
[2024-05-31 11:44:06] [INFO ] Dead Transitions using invariants and state equation in 1524 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 508/2704 places, 2197/2197 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10428 ms. Remains : 508/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : Sudoku-PT-AN13-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s350 0) (EQ s337 1)), p1:(OR (EQ s337 0) (EQ s350 1)), p2:(AND (EQ s169 0) (EQ s440 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 147 steps with 0 reset in 24 ms.
FORMULA Sudoku-PT-AN13-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN13-LTLCardinality-10 finished in 10598 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((F(p1)||p0))))'
Support contains 2 out of 2704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Graph (complete) has 6591 edges and 2704 vertex of which 508 are kept as prefixes of interest. Removing 2196 places using SCC suffix rule.3 ms
Discarding 2196 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 58 ms. Remains 508 /2704 variables (removed 2196) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 508 cols
[2024-05-31 11:44:06] [INFO ] Computed 38 invariants in 76 ms
[2024-05-31 11:44:09] [INFO ] Implicit Places using invariants in 2741 ms returned []
[2024-05-31 11:44:09] [INFO ] Invariant cache hit.
[2024-05-31 11:44:20] [INFO ] Implicit Places using invariants and state equation in 11044 ms returned []
Implicit Place search using SMT with State Equation took 13792 ms to find 0 implicit places.
[2024-05-31 11:44:20] [INFO ] Redundant transitions in 36 ms returned []
[2024-05-31 11:44:20] [INFO ] Invariant cache hit.
[2024-05-31 11:44:21] [INFO ] Dead Transitions using invariants and state equation in 1456 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 508/2704 places, 2197/2197 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15356 ms. Remains : 508/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-PT-AN13-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s169 0) (EQ s300 1)), p1:(OR (EQ s169 0) (EQ s300 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 3105 steps with 20 reset in 421 ms.
FORMULA Sudoku-PT-AN13-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN13-LTLCardinality-11 finished in 15862 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 2704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Graph (complete) has 6591 edges and 2704 vertex of which 508 are kept as prefixes of interest. Removing 2196 places using SCC suffix rule.5 ms
Discarding 2196 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 53 ms. Remains 508 /2704 variables (removed 2196) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 508 cols
[2024-05-31 11:44:22] [INFO ] Computed 38 invariants in 71 ms
[2024-05-31 11:44:25] [INFO ] Implicit Places using invariants in 2738 ms returned []
[2024-05-31 11:44:25] [INFO ] Invariant cache hit.
[2024-05-31 11:44:35] [INFO ] Implicit Places using invariants and state equation in 10327 ms returned []
Implicit Place search using SMT with State Equation took 13067 ms to find 0 implicit places.
[2024-05-31 11:44:35] [INFO ] Redundant transitions in 41 ms returned []
[2024-05-31 11:44:35] [INFO ] Invariant cache hit.
[2024-05-31 11:44:37] [INFO ] Dead Transitions using invariants and state equation in 1501 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 508/2704 places, 2197/2197 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14673 ms. Remains : 508/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN13-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s169 0) (EQ s18 1) (OR (EQ s69 0) (EQ s415 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 146 steps with 0 reset in 25 ms.
FORMULA Sudoku-PT-AN13-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN13-LTLCardinality-12 finished in 14754 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&&X(p1)) U p2)||X(X(G(p3)))))'
Support contains 7 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Reduce places removed 2194 places and 0 transitions.
Iterating post reduction 0 with 2194 rules applied. Total rules applied 2194 place count 510 transition count 2197
Applied a total of 2194 rules in 46 ms. Remains 510 /2704 variables (removed 2194) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 510 cols
[2024-05-31 11:44:37] [INFO ] Computed 38 invariants in 191 ms
[2024-05-31 11:44:40] [INFO ] Implicit Places using invariants in 2838 ms returned []
[2024-05-31 11:44:40] [INFO ] Invariant cache hit.
[2024-05-31 11:44:46] [INFO ] Implicit Places using invariants and state equation in 5985 ms returned []
Implicit Place search using SMT with State Equation took 8826 ms to find 0 implicit places.
[2024-05-31 11:44:46] [INFO ] Invariant cache hit.
[2024-05-31 11:44:47] [INFO ] Dead Transitions using invariants and state equation in 1480 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 510/2704 places, 2197/2197 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10354 ms. Remains : 510/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 239 ms :[true, (OR (NOT p2) (NOT p1)), (NOT p3), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (NOT p3)]
Running random walk in product with property : Sudoku-PT-AN13-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (AND (NOT p2) (NOT p0)) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) p0 p1), acceptance={} source=4 dest: 5}, { cond=(OR (AND (NOT p2) (NOT p0)) (NOT p1)), acceptance={} source=4 dest: 6}], [{ cond=(OR (AND (NOT p2) (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p2) p0 p1 (NOT p3)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p2) p0 p1 p3), acceptance={} source=5 dest: 5}, { cond=(OR (AND (NOT p2) (NOT p0) p3) (AND (NOT p1) p3)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p3), acceptance={} source=6 dest: 0}, { cond=p3, acceptance={} source=6 dest: 6}]], initial=3, aps=[p2:(OR (EQ s196 0) (EQ s171 1)), p0:(OR (EQ s238 0) (EQ s169 1)), p1:(OR (EQ s129 0) (EQ s375 1)), p3:(AND (OR (EQ s196 0) (EQ s171 1)) (EQ s170 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, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 3 ms.
FORMULA Sudoku-PT-AN13-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN13-LTLCardinality-13 finished in 10622 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X((p0 U (X(p1) U ((p1&&X(p1))||X(G(p1))))))))'
[2024-05-31 11:44:47] [INFO ] Flatten gal took : 86 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15358672996619933009
[2024-05-31 11:44:48] [INFO ] Too many transitions (2197) to apply POR reductions. Disabling POR matrices.
[2024-05-31 11:44:48] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15358672996619933009
[2024-05-31 11:44:48] [INFO ] Applying decomposition
Running compilation step : cd /tmp/ltsmin15358672996619933009;'/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 11:44:48] [INFO ] Flatten gal took : 104 ms
Compilation finished in 6254 ms.
Running link step : cd /tmp/ltsmin15358672996619933009;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 60 ms.
Running LTSmin : cd /tmp/ltsmin15358672996619933009;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((LTLAPp0==true))||X(((LTLAPp0==true) U (X((LTLAPp1==true)) U (((LTLAPp1==true)&&X((LTLAPp1==true)))||X([]((LTLAPp1==true))))))))' '--buchi-type=spotba'
[2024-05-31 11:45:04] [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/graph9715233535356837326.txt' '-o' '/tmp/graph9715233535356837326.bin' '-w' '/tmp/graph9715233535356837326.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 11:45:05] [INFO ] Flatten gal took : 181 ms
[2024-05-31 11:45:05] [INFO ] Time to serialize gal into /tmp/LTLCardinality14611372023137151169.gal : 25 ms
[2024-05-31 11:45:05] [INFO ] Time to serialize properties into /tmp/LTLCardinality13708304119023368062.ltl : 15 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality14611372023137151169.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality13708304119023368062.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
Checking formula 0 : !(((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)+(Ce...133420
Formula 0 simplified : F!"(((((((((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)+(Cell...133406
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.053: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.055: LTL layer: formula: ([]((LTLAPp0==true))||X(((LTLAPp0==true) U (X((LTLAPp1==true)) U (((LTLAPp1==true)&&X((LTLAPp1==true)))||X([]((LTLAPp1==true))))))))
pins2lts-mc-linux64( 7/ 8), 0.057: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.058: "([]((LTLAPp0==true))||X(((LTLAPp0==true) U (X((LTLAPp1==true)) U (((LTLAPp1==true)&&X((LTLAPp1==true)))||X([]((LTLAPp1==true))))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.066: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.120: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.120: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.125: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.125: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.133: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.142: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.159: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 2.363: DFS-FIFO for weak LTL, using special progress label 2200
pins2lts-mc-linux64( 0/ 8), 2.363: There are 2201 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 2.363: State length is 2705, there are 2215 groups
pins2lts-mc-linux64( 0/ 8), 2.363: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 2.363: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 2.363: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 2.363: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 1/ 8), 16.079: ~1 levels ~960 states ~2068024 transitions
pins2lts-mc-linux64( 4/ 8), 27.632: ~1 levels ~1920 states ~4147496 transitions
pins2lts-mc-linux64( 1/ 8), 51.292: ~1 levels ~3840 states ~8183368 transitions
pins2lts-mc-linux64( 1/ 8), 74.557: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 133.644:
pins2lts-mc-linux64( 0/ 8), 133.645: mean standard work distribution: 0.6% (states) 0.6% (transitions)
pins2lts-mc-linux64( 0/ 8), 133.645:
pins2lts-mc-linux64( 0/ 8), 133.645: Explored 5500 states 11750969 transitions, fanout: 2136.540
pins2lts-mc-linux64( 0/ 8), 133.645: Total exploration time 131.260 sec (73.010 sec minimum, 113.217 sec on average)
pins2lts-mc-linux64( 0/ 8), 133.645: States per second: 42, Transitions per second: 89524
pins2lts-mc-linux64( 0/ 8), 133.645:
pins2lts-mc-linux64( 0/ 8), 133.645: Progress states detected: 8527864
pins2lts-mc-linux64( 0/ 8), 133.645: Redundant explorations: -99.9355
pins2lts-mc-linux64( 0/ 8), 133.645:
pins2lts-mc-linux64( 0/ 8), 133.645: Queue width: 8B, total height: 10892964, memory: 83.11MB
pins2lts-mc-linux64( 0/ 8), 133.645: Tree memory: 321.1MB, 39.5 B/state, compr.: 0.4%
pins2lts-mc-linux64( 0/ 8), 133.645: Tree fill ratio (roots/leafs): 6.0%/100.0%
pins2lts-mc-linux64( 0/ 8), 133.645: Stored 2409 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 133.645: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 133.645: Est. total memory use: 404.2MB (~1107.1MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15358672996619933009;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((LTLAPp0==true))||X(((LTLAPp0==true) U (X((LTLAPp1==true)) U (((LTLAPp1==true)&&X((LTLAPp1==true)))||X([]((LTLAPp1==true))))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15358672996619933009;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((LTLAPp0==true))||X(((LTLAPp0==true) U (X((LTLAPp1==true)) U (((LTLAPp1==true)&&X((LTLAPp1==true)))||X([]((LTLAPp1==true))))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
ITS-tools command line returned an error code 137
[2024-05-31 11:54:17] [INFO ] Applying decomposition
[2024-05-31 11:54:17] [INFO ] Flatten gal took : 150 ms
[2024-05-31 11:54:17] [INFO ] Decomposing Gal with order
[2024-05-31 11:54:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 11:54:18] [INFO ] Removed a total of 4056 redundant transitions.
[2024-05-31 11:54:19] [INFO ] Flatten gal took : 409 ms
[2024-05-31 11:54:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 20 ms.
[2024-05-31 11:54:19] [INFO ] Time to serialize gal into /tmp/LTLCardinality15186854560684343355.gal : 21 ms
[2024-05-31 11:54:19] [INFO ] Time to serialize properties into /tmp/LTLCardinality14132685487203997544.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/LTLCardinality15186854560684343355.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality14132685487203997544.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
Checking formula 0 : !(((G("(((((((((gu183.Cells_0_0+gu184.Cells_0_1)+(gu185.Cells_0_2+gu186.Cells_0_3))+((gu187.Cells_0_4+gu188.Cells_0_5)+(gu189.Cells_0_...182536
Formula 0 simplified : F!"(((((((((gu183.Cells_0_0+gu184.Cells_0_1)+(gu185.Cells_0_2+gu186.Cells_0_3))+((gu187.Cells_0_4+gu188.Cells_0_5)+(gu189.Cells_0_6+...182522
ITS-tools command line returned an error code 137
[2024-05-31 12:00:55] [INFO ] Flatten gal took : 149 ms
[2024-05-31 12:00:57] [INFO ] Input system was already deterministic with 2197 transitions.
[2024-05-31 12:00:57] [INFO ] Transformed 2704 places.
[2024-05-31 12:00:57] [INFO ] Transformed 2197 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-31 12:00:58] [INFO ] Time to serialize gal into /tmp/LTLCardinality6222812169556396565.gal : 16 ms
[2024-05-31 12:00:58] [INFO ] Time to serialize properties into /tmp/LTLCardinality6288430293293965497.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/LTLCardinality6222812169556396565.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality6288430293293965497.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...342
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((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)+(Ce...133420
Formula 0 simplified : F!"(((((((((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)+(Cell...133406
ITS-tools command line returned an error code 137
Total runtime 2141527 ms.
BK_STOP 1717157307609
--------------------
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-AN13"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is Sudoku-PT-AN13, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r417-tall-171690556400417"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-PT-AN13.tgz
mv Sudoku-PT-AN13 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
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 ;