About the Execution of ITS-Tools for Sudoku-PT-AN13
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 3600000.00 | 0.00 | 0.00 | ?TFFTFFFFFFFTFFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r258-tall-165303545500299.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
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 r258-tall-165303545500299
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 29M
-rw-r--r-- 1 mcc users 1.2M Apr 30 12:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 5.6M Apr 30 12:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3M Apr 30 11:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 11M Apr 30 11:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 460K May 9 09:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 1.5M May 9 09:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.1M May 9 09:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 4.1M May 9 09:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 107K May 9 09:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 261K May 9 09:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 1.2M May 10 09:34 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 1653111398493
Running Version 202205111006
[2022-05-21 05:36:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-21 05:36:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 05:36:40] [INFO ] Load time of PNML (sax parser for PT used): 209 ms
[2022-05-21 05:36:40] [INFO ] Transformed 2704 places.
[2022-05-21 05:36:40] [INFO ] Transformed 2197 transitions.
[2022-05-21 05:36:40] [INFO ] Parsed PT model containing 2704 places and 2197 transitions in 333 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 332 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Sudoku-PT-AN13-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN13-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN13-LTLCardinality-13 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 32 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 2704 cols
[2022-05-21 05:36:41] [INFO ] Computed 507 place invariants in 36 ms
[2022-05-21 05:36:41] [INFO ] Implicit Places using invariants in 617 ms returned []
// Phase 1: matrix 2197 rows 2704 cols
[2022-05-21 05:36:41] [INFO ] Computed 507 place invariants in 18 ms
[2022-05-21 05:36:43] [INFO ] Implicit Places using invariants and state equation in 1602 ms returned []
Implicit Place search using SMT with State Equation took 2246 ms to find 0 implicit places.
// Phase 1: matrix 2197 rows 2704 cols
[2022-05-21 05:36:43] [INFO ] Computed 507 place invariants in 13 ms
[2022-05-21 05:36:45] [INFO ] Dead Transitions using invariants and state equation in 1480 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2704/2704 places, 2197/2197 transitions.
Support contains 2704 out of 2704 places after structural reductions.
[2022-05-21 05:36:45] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2022-05-21 05:36:45] [INFO ] Flatten gal took : 258 ms
FORMULA Sudoku-PT-AN13-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-21 05:36:45] [INFO ] Flatten gal took : 162 ms
[2022-05-21 05:36:46] [INFO ] Input system was already deterministic with 2197 transitions.
Incomplete random walk after 10000 steps, including 67 resets, run finished after 2408 ms. (steps per millisecond=4 ) properties (out of 20) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) 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 139 ms. (steps per millisecond=71 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 2197 rows 2704 cols
[2022-05-21 05:36:49] [INFO ] Computed 507 place invariants in 15 ms
[2022-05-21 05:36:50] [INFO ] After 743ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2022-05-21 05:36:51] [INFO ] [Nat]Absence check using 507 positive place invariants in 138 ms returned sat
[2022-05-21 05:36:58] [INFO ] After 4260ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :3
[2022-05-21 05:36:58] [INFO ] After 4760ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :3
Attempting to minimize the solution found.
Minimization took 281 ms.
[2022-05-21 05:36:59] [INFO ] After 8264ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :3
Fused 9 Parikh solutions to 1 different solutions.
Finished Parikh walk after 169 steps, including 0 resets, run visited all 3 properties in 14 ms. (steps per millisecond=12 )
Parikh walk visited 3 properties in 16 ms.
FORMULA Sudoku-PT-AN13-LTLCardinality-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 6 atomic propositions for a total of 11 simplifications.
Initial state reduction rules removed 2 formulas.
FORMULA Sudoku-PT-AN13-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN13-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN13-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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 : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)||p0)))'
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 112 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 2704 cols
[2022-05-21 05:36:59] [INFO ] Computed 507 place invariants in 10 ms
[2022-05-21 05:37:00] [INFO ] Implicit Places using invariants in 1055 ms returned []
// Phase 1: matrix 2197 rows 2704 cols
[2022-05-21 05:37:00] [INFO ] Computed 507 place invariants in 8 ms
[2022-05-21 05:37:03] [INFO ] Implicit Places using invariants and state equation in 2744 ms returned []
Implicit Place search using SMT with State Equation took 3803 ms to find 0 implicit places.
[2022-05-21 05:37:03] [INFO ] Redundant transitions in 124 ms returned []
// Phase 1: matrix 2197 rows 2704 cols
[2022-05-21 05:37:03] [INFO ] Computed 507 place invariants in 15 ms
[2022-05-21 05:37:04] [INFO ] Dead Transitions using invariants and state equation in 1388 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2704/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 173 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN13-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT (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 s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration timeout after 37950 steps with 441 reset in 10001 ms.
Product exploration timeout after 37930 steps with 441 reset in 10001 ms.
Computed a total of 2704 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2704 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 138 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Finished random walk after 85 steps, including 0 resets, run visited all 1 properties in 27 ms. (steps per millisecond=3 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 149 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
// Phase 1: matrix 2197 rows 2704 cols
[2022-05-21 05:37:27] [INFO ] Computed 507 place invariants in 23 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:878)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:518)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:686)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:652)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:348)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:322)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:78)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:686)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2022-05-21 05:37:42] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
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 47 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 2704 cols
[2022-05-21 05:37:42] [INFO ] Computed 507 place invariants in 8 ms
[2022-05-21 05:37:43] [INFO ] Implicit Places using invariants in 966 ms returned []
// Phase 1: matrix 2197 rows 2704 cols
[2022-05-21 05:37:43] [INFO ] Computed 507 place invariants in 29 ms
[2022-05-21 05:37:46] [INFO ] Implicit Places using invariants and state equation in 2902 ms returned []
Implicit Place search using SMT with State Equation took 3881 ms to find 0 implicit places.
[2022-05-21 05:37:46] [INFO ] Redundant transitions in 52 ms returned []
// Phase 1: matrix 2197 rows 2704 cols
[2022-05-21 05:37:46] [INFO ] Computed 507 place invariants in 14 ms
[2022-05-21 05:37:48] [INFO ] Dead Transitions using invariants and state equation in 1252 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2704/2704 places, 2197/2197 transitions.
Computed a total of 2704 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2704 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Finished random walk after 85 steps, including 0 resets, run visited all 1 properties in 25 ms. (steps per millisecond=3 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 115 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
// Phase 1: matrix 2197 rows 2704 cols
[2022-05-21 05:37:49] [INFO ] Computed 507 place invariants in 25 ms
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Product exploration timeout after 37890 steps with 440 reset in 10002 ms.
Product exploration timeout after 37950 steps with 441 reset in 10001 ms.
Built C files in :
/tmp/ltsmin2796041275193343630
[2022-05-21 05:38:24] [INFO ] Too many transitions (2197) to apply POR reductions. Disabling POR matrices.
[2022-05-21 05:38:25] [INFO ] Built C files in 64ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2796041275193343630
Running compilation step : cd /tmp/ltsmin2796041275193343630;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin2796041275193343630;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin2796041275193343630;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
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 38 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 2704 cols
[2022-05-21 05:38:28] [INFO ] Computed 507 place invariants in 6 ms
[2022-05-21 05:38:29] [INFO ] Implicit Places using invariants in 925 ms returned []
// Phase 1: matrix 2197 rows 2704 cols
[2022-05-21 05:38:29] [INFO ] Computed 507 place invariants in 6 ms
[2022-05-21 05:38:31] [INFO ] Implicit Places using invariants and state equation in 2916 ms returned []
Implicit Place search using SMT with State Equation took 3872 ms to find 0 implicit places.
[2022-05-21 05:38:32] [INFO ] Redundant transitions in 71 ms returned []
// Phase 1: matrix 2197 rows 2704 cols
[2022-05-21 05:38:32] [INFO ] Computed 507 place invariants in 10 ms
[2022-05-21 05:38:33] [INFO ] Dead Transitions using invariants and state equation in 1347 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2704/2704 places, 2197/2197 transitions.
Built C files in :
/tmp/ltsmin12081287267101898054
[2022-05-21 05:38:33] [INFO ] Too many transitions (2197) to apply POR reductions. Disabling POR matrices.
[2022-05-21 05:38:33] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12081287267101898054
Running compilation step : cd /tmp/ltsmin12081287267101898054;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin12081287267101898054;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin12081287267101898054;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-21 05:38:37] [INFO ] Flatten gal took : 114 ms
[2022-05-21 05:38:37] [INFO ] Flatten gal took : 117 ms
[2022-05-21 05:38:37] [INFO ] Time to serialize gal into /tmp/LTL3508186393019948095.gal : 23 ms
[2022-05-21 05:38:37] [INFO ] Time to serialize properties into /tmp/LTL7300317000654331626.ltl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3508186393019948095.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7300317000654331626.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3508186...266
Read 1 LTL properties
Checking formula 0 : !((F((X("(((((((((((((Board_0_0_0+Board_0_0_1)+(Board_0_0_2+Board_0_0_3))+((Board_0_0_4+Board_0_0_5)+(Board_0_0_6+Board_0_0_7)))+(((Bo...68806
Formula 0 simplified : !F("(((((((((((((Board_0_0_0+Board_0_0_1)+(Board_0_0_2+Board_0_0_3))+((Board_0_0_4+Board_0_0_5)+(Board_0_0_6+Board_0_0_7)))+(((Board...68799
Detected timeout of ITS tools.
[2022-05-21 05:38:52] [INFO ] Flatten gal took : 124 ms
[2022-05-21 05:38:52] [INFO ] Applying decomposition
[2022-05-21 05:38:52] [INFO ] Flatten gal took : 109 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph17878162825406721176.txt' '-o' '/tmp/graph17878162825406721176.bin' '-w' '/tmp/graph17878162825406721176.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17878162825406721176.bin' '-l' '-1' '-v' '-w' '/tmp/graph17878162825406721176.weights' '-q' '0' '-e' '0.001'
[2022-05-21 05:39:03] [INFO ] Decomposing Gal with order
[2022-05-21 05:39:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-21 05:39:05] [INFO ] Removed a total of 2938 redundant transitions.
[2022-05-21 05:39:05] [INFO ] Flatten gal took : 1921 ms
[2022-05-21 05:39:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 810 labels/synchronizations in 140 ms.
[2022-05-21 05:39:06] [INFO ] Time to serialize gal into /tmp/LTL3051540959317098245.gal : 24 ms
[2022-05-21 05:39:06] [INFO ] Time to serialize properties into /tmp/LTL15818241379136768617.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3051540959317098245.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15818241379136768617.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3051540...267
Read 1 LTL properties
Checking formula 0 : !((F((X("(((((((((((((gu239.Board_0_0_0+gu239.Board_0_0_1)+(gu239.Board_0_0_2+gu239.Board_0_0_3))+((gu239.Board_0_0_4+gu239.Board_0_0_...97198
Formula 0 simplified : !F("(((((((((((((gu239.Board_0_0_0+gu239.Board_0_0_1)+(gu239.Board_0_0_2+gu239.Board_0_0_3))+((gu239.Board_0_0_4+gu239.Board_0_0_5)+...97191
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6385357014329678052
[2022-05-21 05:39:21] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6385357014329678052
Running compilation step : cd /tmp/ltsmin6385357014329678052;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin6385357014329678052;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin6385357014329678052;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property Sudoku-PT-AN13-LTLCardinality-00 finished in 145065 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X((p0 U !p1))||F(X(p2))))))'
Support contains 2535 out of 2704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 39 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 2704 cols
[2022-05-21 05:39:24] [INFO ] Computed 507 place invariants in 6 ms
[2022-05-21 05:39:25] [INFO ] Implicit Places using invariants in 610 ms returned []
// Phase 1: matrix 2197 rows 2704 cols
[2022-05-21 05:39:25] [INFO ] Computed 507 place invariants in 18 ms
[2022-05-21 05:39:27] [INFO ] Implicit Places using invariants and state equation in 2229 ms returned []
Implicit Place search using SMT with State Equation took 2844 ms to find 0 implicit places.
[2022-05-21 05:39:27] [INFO ] Redundant transitions in 65 ms returned []
// Phase 1: matrix 2197 rows 2704 cols
[2022-05-21 05:39:27] [INFO ] Computed 507 place invariants in 13 ms
[2022-05-21 05:39:28] [INFO ] Dead Transitions using invariants and state equation in 1404 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2704/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 147 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Running random walk in product with property : Sudoku-PT-AN13-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND (NOT p2) (NOT p1)) (AND (NOT p2) p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(LEQ (ADD s169 s170 s171 s172 s173 s174 s175 s176 s177 s178 s179 s180 s181 s182 s183 s184 s185 s186 s187 s188 s189 s190 s191 s192 s193 s194 s195 s196 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 145 steps with 0 reset in 57 ms.
FORMULA Sudoku-PT-AN13-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN13-LTLCardinality-03 finished in 4614 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(p1)))))'
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 69 ms. Remains 507 /2704 variables (removed 2197) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 507 cols
[2022-05-21 05:39:29] [INFO ] Computed 38 place invariants in 122 ms
[2022-05-21 05:39:29] [INFO ] Implicit Places using invariants in 549 ms returned []
// Phase 1: matrix 2197 rows 507 cols
[2022-05-21 05:39:29] [INFO ] Computed 38 place invariants in 56 ms
[2022-05-21 05:39:34] [INFO ] Implicit Places using invariants and state equation in 4339 ms returned []
Implicit Place search using SMT with State Equation took 4892 ms to find 0 implicit places.
// Phase 1: matrix 2197 rows 507 cols
[2022-05-21 05:39:34] [INFO ] Computed 38 place invariants in 54 ms
[2022-05-21 05:39:34] [INFO ] Dead Transitions using invariants and state equation in 762 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 507/2704 places, 2197/2197 transitions.
Finished structural reductions, in 1 iterations. Remains : 507/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-PT-AN13-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(AND (GT 1 (ADD s338 s339 s340 s341 s342 s343 s344 s345 s346 s347 s348 s349 s350 s351 s352 s353 s354 s355 s356 s357 s358 s359 s360 s361 s362 s363 s364 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA Sudoku-PT-AN13-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN13-LTLCardinality-07 finished in 5868 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&p1)))'
Support contains 4 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Reduce places removed 2196 places and 0 transitions.
Iterating post reduction 0 with 2196 rules applied. Total rules applied 2196 place count 508 transition count 2197
Applied a total of 2196 rules in 122 ms. Remains 508 /2704 variables (removed 2196) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 508 cols
[2022-05-21 05:39:35] [INFO ] Computed 38 place invariants in 82 ms
[2022-05-21 05:39:35] [INFO ] Implicit Places using invariants in 556 ms returned []
// Phase 1: matrix 2197 rows 508 cols
[2022-05-21 05:39:35] [INFO ] Computed 38 place invariants in 60 ms
[2022-05-21 05:39:38] [INFO ] Implicit Places using invariants and state equation in 2418 ms returned []
Implicit Place search using SMT with State Equation took 2977 ms to find 0 implicit places.
// Phase 1: matrix 2197 rows 508 cols
[2022-05-21 05:39:38] [INFO ] Computed 38 place invariants in 60 ms
[2022-05-21 05:39:38] [INFO ] Dead Transitions using invariants and state equation in 776 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 508/2704 places, 2197/2197 transitions.
Finished structural reductions, in 1 iterations. Remains : 508/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 112 ms :[true, (OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-PT-AN13-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 p0), acceptance={} source=3 dest: 2}]], initial=1, aps=[p0:(LEQ s311 s169), p1:(LEQ s412 s205)], 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 1 steps with 0 reset in 2 ms.
FORMULA Sudoku-PT-AN13-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN13-LTLCardinality-08 finished in 4028 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((true U X(p0)))'
Support contains 2 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 46 ms. Remains 507 /2704 variables (removed 2197) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 507 cols
[2022-05-21 05:39:39] [INFO ] Computed 38 place invariants in 51 ms
[2022-05-21 05:39:39] [INFO ] Implicit Places using invariants in 571 ms returned []
// Phase 1: matrix 2197 rows 507 cols
[2022-05-21 05:39:39] [INFO ] Computed 38 place invariants in 53 ms
[2022-05-21 05:39:46] [INFO ] Implicit Places using invariants and state equation in 7053 ms returned []
Implicit Place search using SMT with State Equation took 7626 ms to find 0 implicit places.
// Phase 1: matrix 2197 rows 507 cols
[2022-05-21 05:39:46] [INFO ] Computed 38 place invariants in 56 ms
[2022-05-21 05:39:47] [INFO ] Dead Transitions using invariants and state equation in 807 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 507/2704 places, 2197/2197 transitions.
Finished structural reductions, in 1 iterations. Remains : 507/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN13-LTLCardinality-09 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 s265 s340)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 3464 steps with 1371 reset in 672 ms.
FORMULA Sudoku-PT-AN13-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN13-LTLCardinality-09 finished in 9251 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U (G(p1)&&(X(p0)||p2))))'
Support contains 5 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Reduce places removed 2196 places and 0 transitions.
Iterating post reduction 0 with 2196 rules applied. Total rules applied 2196 place count 508 transition count 2197
Applied a total of 2196 rules in 43 ms. Remains 508 /2704 variables (removed 2196) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 508 cols
[2022-05-21 05:39:48] [INFO ] Computed 38 place invariants in 76 ms
[2022-05-21 05:39:48] [INFO ] Implicit Places using invariants in 578 ms returned []
// Phase 1: matrix 2197 rows 508 cols
[2022-05-21 05:39:48] [INFO ] Computed 38 place invariants in 108 ms
[2022-05-21 05:39:51] [INFO ] Implicit Places using invariants and state equation in 2293 ms returned []
Implicit Place search using SMT with State Equation took 2898 ms to find 0 implicit places.
// Phase 1: matrix 2197 rows 508 cols
[2022-05-21 05:39:51] [INFO ] Computed 38 place invariants in 67 ms
[2022-05-21 05:39:51] [INFO ] Dead Transitions using invariants and state equation in 768 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 508/2704 places, 2197/2197 transitions.
Finished structural reductions, in 1 iterations. Remains : 508/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 198 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p0), (NOT p1), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : Sudoku-PT-AN13-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ s383 s169), p0:(LEQ 1 s128), p2:(LEQ s491 s69)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 299 steps with 1 reset in 39 ms.
FORMULA Sudoku-PT-AN13-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN13-LTLCardinality-11 finished in 3982 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(p0))))'
Support contains 2 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Reduce places removed 2196 places and 0 transitions.
Iterating post reduction 0 with 2196 rules applied. Total rules applied 2196 place count 508 transition count 2197
Applied a total of 2196 rules in 42 ms. Remains 508 /2704 variables (removed 2196) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 508 cols
[2022-05-21 05:39:52] [INFO ] Computed 38 place invariants in 88 ms
[2022-05-21 05:39:52] [INFO ] Implicit Places using invariants in 609 ms returned []
// Phase 1: matrix 2197 rows 508 cols
[2022-05-21 05:39:52] [INFO ] Computed 38 place invariants in 86 ms
[2022-05-21 05:39:55] [INFO ] Implicit Places using invariants and state equation in 2377 ms returned []
Implicit Place search using SMT with State Equation took 2994 ms to find 0 implicit places.
// Phase 1: matrix 2197 rows 508 cols
[2022-05-21 05:39:55] [INFO ] Computed 38 place invariants in 84 ms
[2022-05-21 05:39:56] [INFO ] Dead Transitions using invariants and state equation in 759 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 508/2704 places, 2197/2197 transitions.
Finished structural reductions, in 1 iterations. Remains : 508/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 130 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN13-LTLCardinality-14 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:(LEQ s462 s169)], 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-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN13-LTLCardinality-14 finished in 3957 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(G(X(F(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.16 ms
Discarding 2197 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 69 ms. Remains 507 /2704 variables (removed 2197) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 507 cols
[2022-05-21 05:39:56] [INFO ] Computed 38 place invariants in 53 ms
[2022-05-21 05:39:56] [INFO ] Implicit Places using invariants in 579 ms returned []
// Phase 1: matrix 2197 rows 507 cols
[2022-05-21 05:39:56] [INFO ] Computed 38 place invariants in 58 ms
[2022-05-21 05:40:01] [INFO ] Implicit Places using invariants and state equation in 4513 ms returned []
Implicit Place search using SMT with State Equation took 5098 ms to find 0 implicit places.
[2022-05-21 05:40:01] [INFO ] Redundant transitions in 62 ms returned []
// Phase 1: matrix 2197 rows 507 cols
[2022-05-21 05:40:01] [INFO ] Computed 38 place invariants in 59 ms
[2022-05-21 05:40:02] [INFO ] Dead Transitions using invariants and state equation in 750 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 507/2704 places, 2197/2197 transitions.
Finished structural reductions, in 1 iterations. Remains : 507/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN13-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s29 s371)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 261 steps with 1 reset in 39 ms.
FORMULA Sudoku-PT-AN13-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN13-LTLCardinality-15 finished in 6124 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)||p0)))'
[2022-05-21 05:40:02] [INFO ] Flatten gal took : 111 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7713490202083936469
[2022-05-21 05:40:02] [INFO ] Too many transitions (2197) to apply POR reductions. Disabling POR matrices.
[2022-05-21 05:40:02] [INFO ] Built C files in 54ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7713490202083936469
[2022-05-21 05:40:02] [INFO ] Applying decomposition
Running compilation step : cd /tmp/ltsmin7713490202083936469;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-21 05:40:02] [INFO ] Flatten gal took : 111 ms
Compilation finished in 6156 ms.
Running link step : cd /tmp/ltsmin7713490202083936469;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin7713490202083936469;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((X((LTLAPp0==true))||(LTLAPp0==true)))' '--buchi-type=spotba'
[2022-05-21 05:40:16] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.util.concurrent.TimeoutException: Subprocess running '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph12193692458593586138.txt' '-o' '/tmp/graph12193692458593586138.bin' '-w' '/tmp/graph12193692458593586138.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:213)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:264)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:98)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:737)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2022-05-21 05:40:17] [INFO ] Flatten gal took : 294 ms
[2022-05-21 05:40:17] [INFO ] Time to serialize gal into /tmp/LTLCardinality18142251208698232561.gal : 19 ms
[2022-05-21 05:40:17] [INFO ] Time to serialize properties into /tmp/LTLCardinality4034521402751072134.ltl : 13 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality18142251208698232561.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality4034521402751072134.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...289
Read 1 LTL properties
Checking formula 0 : !((F((X("(((((((((((((Board_0_0_0+Board_0_0_1)+(Board_0_0_2+Board_0_0_3))+((Board_0_0_4+Board_0_0_5)+(Board_0_0_6+Board_0_0_7)))+(((Bo...68806
Formula 0 simplified : !F("(((((((((((((Board_0_0_0+Board_0_0_1)+(Board_0_0_2+Board_0_0_3))+((Board_0_0_4+Board_0_0_5)+(Board_0_0_6+Board_0_0_7)))+(((Board...68799
Detected timeout of ITS tools.
[2022-05-21 06:01:26] [INFO ] Flatten gal took : 173 ms
[2022-05-21 06:01:26] [INFO ] Time to serialize gal into /tmp/LTLCardinality15911144956302921757.gal : 38 ms
[2022-05-21 06:01:29] [INFO ] Time to serialize properties into /tmp/LTLCardinality6444500548724707340.ltl : 3178 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality15911144956302921757.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality6444500548724707340.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...289
Read 1 LTL properties
Checking formula 0 : !((F((X("(((((((((((((Board_0_0_0+Board_0_0_1)+(Board_0_0_2+Board_0_0_3))+((Board_0_0_4+Board_0_0_5)+(Board_0_0_6+Board_0_0_7)))+(((Bo...68806
Formula 0 simplified : !F("(((((((((((((Board_0_0_0+Board_0_0_1)+(Board_0_0_2+Board_0_0_3))+((Board_0_0_4+Board_0_0_5)+(Board_0_0_6+Board_0_0_7)))+(((Board...68799
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 5/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.025: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.026: LTL layer: formula: <>((X((LTLAPp0==true))||(LTLAPp0==true)))
pins2lts-mc-linux64( 3/ 8), 0.026: "<>((X((LTLAPp0==true))||(LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.026: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.048: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.049: Using Spin LTL semantics
pins2lts-mc-linux64( 5/ 8), 0.052: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.056: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.056: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.064: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.067: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.088: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.774: DFS-FIFO for weak LTL, using special progress label 2199
pins2lts-mc-linux64( 0/ 8), 0.774: There are 2200 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.774: State length is 2705, there are 2198 groups
pins2lts-mc-linux64( 0/ 8), 0.774: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.774: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.774: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.774: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 5/ 8), 7.264: ~86 levels ~960 states ~728672 transitions
pins2lts-mc-linux64( 4/ 8), 7.566: ~86 levels ~1920 states ~721536 transitions
pins2lts-mc-linux64( 2/ 8), 7.951: ~86 levels ~3840 states ~725288 transitions
pins2lts-mc-linux64( 2/ 8), 8.706: ~86 levels ~7680 states ~727640 transitions
pins2lts-mc-linux64( 2/ 8), 10.338: ~86 levels ~15360 states ~736944 transitions
pins2lts-mc-linux64( 2/ 8), 13.679: ~86 levels ~30720 states ~753248 transitions
pins2lts-mc-linux64( 2/ 8), 20.259: ~86 levels ~61440 states ~785960 transitions
pins2lts-mc-linux64( 2/ 8), 33.872: ~86 levels ~122880 states ~856080 transitions
pins2lts-mc-linux64( 1/ 8), 60.949: ~86 levels ~245760 states ~1022784 transitions
pins2lts-mc-linux64( 4/ 8), 116.593: ~86 levels ~491520 states ~1597184 transitions
pins2lts-mc-linux64( 4/ 8), 225.290: ~86 levels ~983040 states ~2505952 transitions
pins2lts-mc-linux64( 4/ 8), 443.479: ~86 levels ~1966080 states ~4518344 transitions
pins2lts-mc-linux64( 4/ 8), 880.161: ~86 levels ~3932160 states ~8610640 transitions
pins2lts-mc-linux64( 7/ 8), 1690.632: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1699.094:
pins2lts-mc-linux64( 0/ 8), 1699.095: mean standard work distribution: 16.4% (states) 15.9% (transitions)
pins2lts-mc-linux64( 0/ 8), 1699.095:
pins2lts-mc-linux64( 0/ 8), 1699.095: Explored 7058857 states 15123174 transitions, fanout: 2.142
pins2lts-mc-linux64( 0/ 8), 1699.095: Total exploration time 1698.300 sec (1689.840 sec minimum, 1694.643 sec on average)
pins2lts-mc-linux64( 0/ 8), 1699.095: States per second: 4156, Transitions per second: 8905
pins2lts-mc-linux64( 0/ 8), 1699.095:
pins2lts-mc-linux64( 0/ 8), 1699.095: Progress states detected: 0
pins2lts-mc-linux64( 0/ 8), 1699.095: Redundant explorations: -9.0929
pins2lts-mc-linux64( 0/ 8), 1699.095:
pins2lts-mc-linux64( 0/ 8), 1699.095: Queue width: 8B, total height: 696, memory: 0.01MB
pins2lts-mc-linux64( 0/ 8), 1699.095: Tree memory: 315.2MB, 42.6 B/state, compr.: 0.4%
pins2lts-mc-linux64( 0/ 8), 1699.095: Tree fill ratio (roots/leafs): 5.0%/100.0%
pins2lts-mc-linux64( 0/ 8), 1699.095: Stored 2326 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1699.095: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1699.096: Est. total memory use: 315.2MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin7713490202083936469;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((X((LTLAPp0==true))||(LTLAPp0==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin7713490202083936469;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((X((LTLAPp0==true))||(LTLAPp0==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-21 06:22:41] [INFO ] Flatten gal took : 1127 ms
[2022-05-21 06:22:43] [INFO ] Input system was already deterministic with 2197 transitions.
[2022-05-21 06:22:43] [INFO ] Transformed 2704 places.
[2022-05-21 06:22:43] [INFO ] Transformed 2197 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/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//..//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
[2022-05-21 06:22:44] [INFO ] Time to serialize gal into /tmp/LTLCardinality17885682697498183689.gal : 12 ms
[2022-05-21 06:22:51] [INFO ] Time to serialize properties into /tmp/LTLCardinality3170296065389383508.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality17885682697498183689.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality3170296065389383508.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...334
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F((X("(((((((((((((Board_0_0_0+Board_0_0_1)+(Board_0_0_2+Board_0_0_3))+((Board_0_0_4+Board_0_0_5)+(Board_0_0_6+Board_0_0_7)))+(((Bo...68806
Formula 0 simplified : !F("(((((((((((((Board_0_0_0+Board_0_0_1)+(Board_0_0_2+Board_0_0_3))+((Board_0_0_4+Board_0_0_5)+(Board_0_0_6+Board_0_0_7)))+(((Board...68799
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
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="itstools"
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-4028"
echo " Executing tool itstools"
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 r258-tall-165303545500299"
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 ;