About the Execution of ITS-Tools for Sudoku-COL-AN11
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16219.812 | 3600000.00 | 2915585.00 | 743149.30 | FTFFTF?FF?FFFFT? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r258-tall-165303545300123.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-COL-AN11, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r258-tall-165303545300123
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 244K
-rw-r--r-- 1 mcc users 7.1K Apr 30 12:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Apr 30 12:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 30 12:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 30 12:12 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 3.8K May 9 09:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 09:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 09:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 09:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 09:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 6.5K 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-COL-AN11-LTLCardinality-00
FORMULA_NAME Sudoku-COL-AN11-LTLCardinality-01
FORMULA_NAME Sudoku-COL-AN11-LTLCardinality-02
FORMULA_NAME Sudoku-COL-AN11-LTLCardinality-03
FORMULA_NAME Sudoku-COL-AN11-LTLCardinality-04
FORMULA_NAME Sudoku-COL-AN11-LTLCardinality-05
FORMULA_NAME Sudoku-COL-AN11-LTLCardinality-06
FORMULA_NAME Sudoku-COL-AN11-LTLCardinality-07
FORMULA_NAME Sudoku-COL-AN11-LTLCardinality-08
FORMULA_NAME Sudoku-COL-AN11-LTLCardinality-09
FORMULA_NAME Sudoku-COL-AN11-LTLCardinality-10
FORMULA_NAME Sudoku-COL-AN11-LTLCardinality-11
FORMULA_NAME Sudoku-COL-AN11-LTLCardinality-12
FORMULA_NAME Sudoku-COL-AN11-LTLCardinality-13
FORMULA_NAME Sudoku-COL-AN11-LTLCardinality-14
FORMULA_NAME Sudoku-COL-AN11-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1653076505896
Running Version 202205111006
[2022-05-20 19:55:07] [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-20 19:55:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 19:55:07] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-20 19:55:07] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-20 19:55:07] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 477 ms
[2022-05-20 19:55:07] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 1694 PT places and 1331.0 transition bindings in 14 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
[2022-05-20 19:55:07] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 8 ms.
[2022-05-20 19:55:07] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 3 formulas.
FORMULA Sudoku-COL-AN11-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN11-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN11-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN11-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 12 properties that can be checked using skeleton over-approximation.
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Incomplete random walk after 10085 steps, including 81 resets, run finished after 53 ms. (steps per millisecond=190 ) properties (out of 16) seen :11
Incomplete Best-First random walk after 10085 steps, including 81 resets, run finished after 28 ms. (steps per millisecond=360 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10085 steps, including 81 resets, run finished after 16 ms. (steps per millisecond=630 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10085 steps, including 81 resets, run finished after 18 ms. (steps per millisecond=560 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10085 steps, including 81 resets, run finished after 18 ms. (steps per millisecond=560 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10085 steps, including 81 resets, run finished after 25 ms. (steps per millisecond=403 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1 rows 4 cols
[2022-05-20 19:55:08] [INFO ] Computed 3 place invariants in 5 ms
[2022-05-20 19:55:08] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-20 19:55:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-20 19:55:08] [INFO ] After 35ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :0
Fused 5 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 5 atomic propositions for a total of 12 simplifications.
FORMULA Sudoku-COL-AN11-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN11-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-20 19:55:08] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2022-05-20 19:55:08] [INFO ] Flatten gal took : 13 ms
FORMULA Sudoku-COL-AN11-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN11-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-20 19:55:08] [INFO ] Flatten gal took : 1 ms
Domain [N(11), N(11)] of place Rows breaks symmetries in sort N
[2022-05-20 19:55:08] [INFO ] Unfolded HLPN to a Petri net with 1694 places and 1331 transitions 5324 arcs in 28 ms.
[2022-05-20 19:55:08] [INFO ] Unfolded 8 HLPN properties in 1 ms.
Support contains 1694 out of 1694 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 21 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 1694 cols
[2022-05-20 19:55:08] [INFO ] Computed 363 place invariants in 30 ms
[2022-05-20 19:55:09] [INFO ] Implicit Places using invariants in 454 ms returned []
// Phase 1: matrix 1331 rows 1694 cols
[2022-05-20 19:55:09] [INFO ] Computed 363 place invariants in 11 ms
[2022-05-20 19:55:09] [INFO ] Implicit Places using invariants and state equation in 777 ms returned []
Implicit Place search using SMT with State Equation took 1236 ms to find 0 implicit places.
// Phase 1: matrix 1331 rows 1694 cols
[2022-05-20 19:55:09] [INFO ] Computed 363 place invariants in 14 ms
[2022-05-20 19:55:10] [INFO ] Dead Transitions using invariants and state equation in 764 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1694/1694 places, 1331/1331 transitions.
Support contains 1694 out of 1694 places after structural reductions.
[2022-05-20 19:55:10] [INFO ] Flatten gal took : 153 ms
[2022-05-20 19:55:11] [INFO ] Flatten gal took : 129 ms
[2022-05-20 19:55:11] [INFO ] Input system was already deterministic with 1331 transitions.
Incomplete random walk after 10000 steps, including 95 resets, run finished after 1496 ms. (steps per millisecond=6 ) properties (out of 11) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 1331 rows 1694 cols
[2022-05-20 19:55:13] [INFO ] Computed 363 place invariants in 14 ms
[2022-05-20 19:55:14] [INFO ] [Real]Absence check using 363 positive place invariants in 89 ms returned sat
[2022-05-20 19:55:15] [INFO ] After 1617ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-05-20 19:55:15] [INFO ] [Nat]Absence check using 363 positive place invariants in 75 ms returned sat
[2022-05-20 19:55:18] [INFO ] After 1074ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2022-05-20 19:55:18] [INFO ] After 1770ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 386 ms.
[2022-05-20 19:55:19] [INFO ] After 3752ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 1 different solutions.
Finished Parikh walk after 121 steps, including 0 resets, run visited all 7 properties in 13 ms. (steps per millisecond=9 )
Parikh walk visited 7 properties in 14 ms.
Computed a total of 1694 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1694 transition count 1331
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(G((F(p0)&&p1)))))'
Support contains 1452 out of 1694 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 73 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 1694 cols
[2022-05-20 19:55:19] [INFO ] Computed 363 place invariants in 7 ms
[2022-05-20 19:55:20] [INFO ] Implicit Places using invariants in 590 ms returned []
// Phase 1: matrix 1331 rows 1694 cols
[2022-05-20 19:55:20] [INFO ] Computed 363 place invariants in 6 ms
[2022-05-20 19:55:21] [INFO ] Implicit Places using invariants and state equation in 1464 ms returned []
Implicit Place search using SMT with State Equation took 2057 ms to find 0 implicit places.
[2022-05-20 19:55:21] [INFO ] Redundant transitions in 90 ms returned []
// Phase 1: matrix 1331 rows 1694 cols
[2022-05-20 19:55:21] [INFO ] Computed 363 place invariants in 13 ms
[2022-05-20 19:55:22] [INFO ] Dead Transitions using invariants and state equation in 750 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1694/1694 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 1612 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN11-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (GT 3 (ADD s121 s122 s123 s124 s125 s126 s127 s128 s129 s130 s131 s132 s133 s134 s135 s136 s137 s138 s139 s140 s141 s142 s143 s144 s145 s146 s147 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 101 steps with 0 reset in 50 ms.
FORMULA Sudoku-COL-AN11-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN11-LTLCardinality-03 finished in 4699 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0)) U X(!X(p1))))'
Support contains 1452 out of 1694 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 18 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 1694 cols
[2022-05-20 19:55:24] [INFO ] Computed 363 place invariants in 12 ms
[2022-05-20 19:55:24] [INFO ] Implicit Places using invariants in 581 ms returned []
// Phase 1: matrix 1331 rows 1694 cols
[2022-05-20 19:55:24] [INFO ] Computed 363 place invariants in 4 ms
[2022-05-20 19:55:26] [INFO ] Implicit Places using invariants and state equation in 1430 ms returned []
Implicit Place search using SMT with State Equation took 2013 ms to find 0 implicit places.
// Phase 1: matrix 1331 rows 1694 cols
[2022-05-20 19:55:26] [INFO ] Computed 363 place invariants in 5 ms
[2022-05-20 19:55:26] [INFO ] Dead Transitions using invariants and state equation in 733 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1694/1694 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 303 ms :[p1, p1, p1, p1, true, (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN11-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 4}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 4}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ 2 (ADD s121 s122 s123 s124 s125 s126 s127 s128 s129 s130 s131 s132 s133 s134 s135 s136 s137 s138 s139 s140 s141 s142 s143 s144 s145 s146 s147 s148...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA Sudoku-COL-AN11-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN11-LTLCardinality-05 finished in 3104 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((G((X(X(p1)) U p1))||p0))))'
Support contains 363 out of 1694 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Reduce places removed 1331 places and 0 transitions.
Iterating post reduction 0 with 1331 rules applied. Total rules applied 1331 place count 363 transition count 1331
Applied a total of 1331 rules in 15 ms. Remains 363 /1694 variables (removed 1331) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 363 cols
[2022-05-20 19:55:27] [INFO ] Computed 32 place invariants in 69 ms
[2022-05-20 19:55:27] [INFO ] Implicit Places using invariants in 142 ms returned []
// Phase 1: matrix 1331 rows 363 cols
[2022-05-20 19:55:27] [INFO ] Computed 32 place invariants in 69 ms
[2022-05-20 19:55:27] [INFO ] Implicit Places using invariants and state equation in 429 ms returned []
Implicit Place search using SMT with State Equation took 573 ms to find 0 implicit places.
// Phase 1: matrix 1331 rows 363 cols
[2022-05-20 19:55:27] [INFO ] Computed 32 place invariants in 52 ms
[2022-05-20 19:55:28] [INFO ] Dead Transitions using invariants and state equation in 878 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 363/1694 places, 1331/1331 transitions.
Finished structural reductions, in 1 iterations. Remains : 363/1694 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 191 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : Sudoku-COL-AN11-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=true, acceptance={0} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (GT (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 947 reset in 7865 ms.
Product exploration explored 100000 steps with 947 reset in 7761 ms.
Computed a total of 363 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 363 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), true, (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 1785 ms. Reduced automaton from 6 states, 10 edges and 2 AP to 5 states, 7 edges and 1 AP.
Stuttering acceptance computed with spot in 146 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Incomplete random walk after 10000 steps, including 94 resets, run finished after 779 ms. (steps per millisecond=12 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 278346 steps, run timeout after 3001 ms. (steps per millisecond=92 ) properties seen :{}
Probabilistic random walk after 278346 steps, saw 132288 distinct states, run finished after 3001 ms. (steps per millisecond=92 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1331 rows 363 cols
[2022-05-20 19:56:40] [INFO ] Computed 32 place invariants in 31 ms
[2022-05-20 19:56:40] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 18 ms returned sat
[2022-05-20 19:56:40] [INFO ] After 413ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-20 19:56:40] [INFO ] After 467ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2022-05-20 19:56:40] [INFO ] After 582ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 121 steps, including 0 resets, run visited all 1 properties in 16 ms. (steps per millisecond=7 )
Parikh walk visited 1 properties in 15 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), true, (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 9 factoid took 320 ms. Reduced automaton from 5 states, 7 edges and 1 AP to 5 states, 7 edges and 1 AP.
Stuttering acceptance computed with spot in 138 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 141 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 121 out of 363 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 363/363 places, 1331/1331 transitions.
Applied a total of 0 rules in 7 ms. Remains 363 /363 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 363 cols
[2022-05-20 19:56:41] [INFO ] Computed 32 place invariants in 29 ms
[2022-05-20 19:56:41] [INFO ] Implicit Places using invariants in 96 ms returned []
// Phase 1: matrix 1331 rows 363 cols
[2022-05-20 19:56:41] [INFO ] Computed 32 place invariants in 29 ms
[2022-05-20 19:56:41] [INFO ] Implicit Places using invariants and state equation in 363 ms returned []
Implicit Place search using SMT with State Equation took 461 ms to find 0 implicit places.
// Phase 1: matrix 1331 rows 363 cols
[2022-05-20 19:56:42] [INFO ] Computed 32 place invariants in 27 ms
[2022-05-20 19:56:42] [INFO ] Dead Transitions using invariants and state equation in 464 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 363/363 places, 1331/1331 transitions.
Computed a total of 363 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 363 transition count 1331
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 : [p1, (X p1), true, (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 196 ms. Reduced automaton from 5 states, 7 edges and 1 AP to 5 states, 7 edges and 1 AP.
Stuttering acceptance computed with spot in 183 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Incomplete random walk after 10000 steps, including 94 resets, run finished after 785 ms. (steps per millisecond=12 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 272422 steps, run timeout after 3001 ms. (steps per millisecond=90 ) properties seen :{}
Probabilistic random walk after 272422 steps, saw 131020 distinct states, run finished after 3001 ms. (steps per millisecond=90 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1331 rows 363 cols
[2022-05-20 19:56:58] [INFO ] Computed 32 place invariants in 32 ms
[2022-05-20 19:56:58] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 18 ms returned sat
[2022-05-20 19:56:59] [INFO ] After 429ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-20 19:56:59] [INFO ] After 492ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2022-05-20 19:56:59] [INFO ] After 613ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 121 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=24 )
Parikh walk visited 1 properties in 6 ms.
Knowledge obtained : [p1, (X p1), true, (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 5 factoid took 197 ms. Reduced automaton from 5 states, 7 edges and 1 AP to 5 states, 7 edges and 1 AP.
Stuttering acceptance computed with spot in 143 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 162 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 337 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 946 reset in 7600 ms.
Product exploration explored 100000 steps with 945 reset in 7546 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 120 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 121 out of 363 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 363/363 places, 1331/1331 transitions.
Applied a total of 0 rules in 52 ms. Remains 363 /363 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2022-05-20 19:57:15] [INFO ] Redundant transitions in 17 ms returned []
// Phase 1: matrix 1331 rows 363 cols
[2022-05-20 19:57:15] [INFO ] Computed 32 place invariants in 22 ms
[2022-05-20 19:57:16] [INFO ] Dead Transitions using invariants and state equation in 426 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 363/363 places, 1331/1331 transitions.
Product exploration explored 100000 steps with 946 reset in 7602 ms.
Product exploration explored 100000 steps with 944 reset in 7752 ms.
Built C files in :
/tmp/ltsmin4076920366360909398
[2022-05-20 19:57:31] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4076920366360909398
Running compilation step : cd /tmp/ltsmin4076920366360909398;'/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'
Compilation finished in 2758 ms.
Running link step : cd /tmp/ltsmin4076920366360909398;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin4076920366360909398;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15524949537417445695.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 121 out of 363 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 363/363 places, 1331/1331 transitions.
Applied a total of 0 rules in 15 ms. Remains 363 /363 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 363 cols
[2022-05-20 19:57:46] [INFO ] Computed 32 place invariants in 22 ms
[2022-05-20 19:57:47] [INFO ] Implicit Places using invariants in 255 ms returned []
// Phase 1: matrix 1331 rows 363 cols
[2022-05-20 19:57:47] [INFO ] Computed 32 place invariants in 27 ms
[2022-05-20 19:57:47] [INFO ] Implicit Places using invariants and state equation in 902 ms returned []
Implicit Place search using SMT with State Equation took 1160 ms to find 0 implicit places.
// Phase 1: matrix 1331 rows 363 cols
[2022-05-20 19:57:47] [INFO ] Computed 32 place invariants in 29 ms
[2022-05-20 19:57:48] [INFO ] Dead Transitions using invariants and state equation in 425 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 363/363 places, 1331/1331 transitions.
Built C files in :
/tmp/ltsmin15097914852014981146
[2022-05-20 19:57:48] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15097914852014981146
Running compilation step : cd /tmp/ltsmin15097914852014981146;'/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'
Compilation finished in 2222 ms.
Running link step : cd /tmp/ltsmin15097914852014981146;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin15097914852014981146;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased130712113595672531.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 19:58:03] [INFO ] Flatten gal took : 67 ms
[2022-05-20 19:58:03] [INFO ] Flatten gal took : 77 ms
[2022-05-20 19:58:03] [INFO ] Time to serialize gal into /tmp/LTL7863169276768077823.gal : 28 ms
[2022-05-20 19:58:03] [INFO ] Time to serialize properties into /tmp/LTL10092124479283204051.ltl : 2 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/LTL7863169276768077823.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10092124479283204051.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/LTL7863169...267
Read 1 LTL properties
Checking formula 0 : !((G(X(((G((X(X("((((((((Columns_0+Columns_1)+(Columns_2+Columns_3))+((Columns_4+Columns_5)+(Columns_6+Columns_7)))+(((Columns_8+Colum...7383
Formula 0 simplified : !GX("((((((((Columns_0+Columns_1)+(Columns_2+Columns_3))+((Columns_4+Columns_5)+(Columns_6+Columns_7)))+(((Columns_8+Columns_9)+(Col...7367
Detected timeout of ITS tools.
[2022-05-20 19:58:18] [INFO ] Flatten gal took : 56 ms
[2022-05-20 19:58:18] [INFO ] Applying decomposition
[2022-05-20 19:58:18] [INFO ] Flatten gal took : 55 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/graph5622442900609379913.txt' '-o' '/tmp/graph5622442900609379913.bin' '-w' '/tmp/graph5622442900609379913.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5622442900609379913.bin' '-l' '-1' '-v' '-w' '/tmp/graph5622442900609379913.weights' '-q' '0' '-e' '0.001'
[2022-05-20 19:58:19] [INFO ] Decomposing Gal with order
[2022-05-20 19:58:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 19:58:21] [INFO ] Removed a total of 1210 redundant transitions.
[2022-05-20 19:58:21] [INFO ] Flatten gal took : 2541 ms
[2022-05-20 19:58:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 1331 labels/synchronizations in 91 ms.
[2022-05-20 19:58:22] [INFO ] Time to serialize gal into /tmp/LTL15772902026257198396.gal : 7 ms
[2022-05-20 19:58:22] [INFO ] Time to serialize properties into /tmp/LTL10224671280950863138.ltl : 1 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/LTL15772902026257198396.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10224671280950863138.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/LTL1577290...268
Read 1 LTL properties
Checking formula 0 : !((G(X(((G((X(X("((((((((gu1.Columns_0+gu1.Columns_1)+(gu1.Columns_2+gu1.Columns_3))+((gu1.Columns_4+gu1.Columns_5)+(gu1.Columns_6+gu1...9803
Formula 0 simplified : !GX("((((((((gu0.Rows_0+gu0.Rows_1)+(gu0.Rows_2+gu0.Rows_3))+((gu0.Rows_4+gu0.Rows_5)+(gu0.Rows_6+gu0.Rows_7)))+(((gu0.Rows_8+gu0.Ro...9787
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15988483526707403615
[2022-05-20 19:58:37] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15988483526707403615
Running compilation step : cd /tmp/ltsmin15988483526707403615;'/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'
Compilation finished in 2318 ms.
Running link step : cd /tmp/ltsmin15988483526707403615;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin15988483526707403615;'/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(([]((X(X((LTLAPp1==true))) U (LTLAPp1==true)))||(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Sudoku-COL-AN11-LTLCardinality-06 finished in 204984 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(!G(!F(p0)) U X(p0)))'
Support contains 1331 out of 1694 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 26 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 1694 cols
[2022-05-20 19:58:52] [INFO ] Computed 363 place invariants in 5 ms
[2022-05-20 19:58:53] [INFO ] Implicit Places using invariants in 745 ms returned []
// Phase 1: matrix 1331 rows 1694 cols
[2022-05-20 19:58:53] [INFO ] Computed 363 place invariants in 10 ms
[2022-05-20 19:58:54] [INFO ] Implicit Places using invariants and state equation in 1680 ms returned []
Implicit Place search using SMT with State Equation took 2430 ms to find 0 implicit places.
// Phase 1: matrix 1331 rows 1694 cols
[2022-05-20 19:58:54] [INFO ] Computed 363 place invariants in 4 ms
[2022-05-20 19:58:55] [INFO ] Dead Transitions using invariants and state equation in 749 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1694/1694 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 87 ms :[true, p0, p0]
Running random walk in product with property : Sudoku-COL-AN11-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 2 (ADD s121 s122 s123 s124 s125 s126 s127 s128 s129 s130 s131 s132 s133 s134 s135 s136 s137 s138 s139 s140 s141 s142 s143 s144 s145 s146 s147 s148...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA Sudoku-COL-AN11-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN11-LTLCardinality-07 finished in 3336 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(((G(p0) U X(p0)) U p1)))'
Support contains 1573 out of 1694 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 14 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 1694 cols
[2022-05-20 19:58:55] [INFO ] Computed 363 place invariants in 6 ms
[2022-05-20 19:58:56] [INFO ] Implicit Places using invariants in 450 ms returned []
// Phase 1: matrix 1331 rows 1694 cols
[2022-05-20 19:58:56] [INFO ] Computed 363 place invariants in 9 ms
[2022-05-20 19:58:57] [INFO ] Implicit Places using invariants and state equation in 1160 ms returned []
Implicit Place search using SMT with State Equation took 1612 ms to find 0 implicit places.
// Phase 1: matrix 1331 rows 1694 cols
[2022-05-20 19:58:57] [INFO ] Computed 363 place invariants in 11 ms
[2022-05-20 19:58:57] [INFO ] Dead Transitions using invariants and state equation in 739 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1694/1694 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : Sudoku-COL-AN11-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ (ADD s121 s122 s123 s124 s125 s126 s127 s128 s129 s130 s131 s132 s133 s134 s135 s136 s137 s138 s139 s140 s141 s142 s143 s144 s145 s146 s147 s148 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 101 steps with 0 reset in 15 ms.
FORMULA Sudoku-COL-AN11-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN11-LTLCardinality-08 finished in 2509 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 121 out of 1694 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Graph (complete) has 3993 edges and 1694 vertex of which 363 are kept as prefixes of interest. Removing 1331 places using SCC suffix rule.9 ms
Discarding 1331 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 26 ms. Remains 363 /1694 variables (removed 1331) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 363 cols
[2022-05-20 19:58:58] [INFO ] Computed 32 place invariants in 28 ms
[2022-05-20 19:58:58] [INFO ] Implicit Places using invariants in 264 ms returned []
// Phase 1: matrix 1331 rows 363 cols
[2022-05-20 19:58:58] [INFO ] Computed 32 place invariants in 30 ms
[2022-05-20 19:58:59] [INFO ] Implicit Places using invariants and state equation in 926 ms returned []
Implicit Place search using SMT with State Equation took 1192 ms to find 0 implicit places.
[2022-05-20 19:58:59] [INFO ] Redundant transitions in 28 ms returned []
// Phase 1: matrix 1331 rows 363 cols
[2022-05-20 19:58:59] [INFO ] Computed 32 place invariants in 29 ms
[2022-05-20 19:58:59] [INFO ] Dead Transitions using invariants and state equation in 467 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 363/1694 places, 1331/1331 transitions.
Finished structural reductions, in 1 iterations. Remains : 363/1694 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 393 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN11-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 3 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 946 reset in 7922 ms.
Product exploration explored 100000 steps with 946 reset in 7966 ms.
Computed a total of 363 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 363 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 236 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 94 resets, run finished after 781 ms. (steps per millisecond=12 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 283238 steps, run timeout after 3001 ms. (steps per millisecond=94 ) properties seen :{}
Probabilistic random walk after 283238 steps, saw 133341 distinct states, run finished after 3001 ms. (steps per millisecond=94 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1331 rows 363 cols
[2022-05-20 19:59:32] [INFO ] Computed 32 place invariants in 30 ms
[2022-05-20 19:59:32] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 22 ms returned sat
[2022-05-20 19:59:32] [INFO ] After 566ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 19:59:32] [INFO ] [Nat]Absence check using 0 positive and 32 generalized place invariants in 17 ms returned sat
[2022-05-20 19:59:33] [INFO ] After 384ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 19:59:33] [INFO ] After 439ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 35 ms.
[2022-05-20 19:59:33] [INFO ] After 553ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 119 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=29 )
Parikh walk visited 1 properties in 11 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 135 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Support contains 121 out of 363 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 363/363 places, 1331/1331 transitions.
Applied a total of 0 rules in 21 ms. Remains 363 /363 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 363 cols
[2022-05-20 19:59:33] [INFO ] Computed 32 place invariants in 24 ms
[2022-05-20 19:59:33] [INFO ] Implicit Places using invariants in 272 ms returned []
// Phase 1: matrix 1331 rows 363 cols
[2022-05-20 19:59:33] [INFO ] Computed 32 place invariants in 29 ms
[2022-05-20 19:59:34] [INFO ] Implicit Places using invariants and state equation in 845 ms returned []
Implicit Place search using SMT with State Equation took 1119 ms to find 0 implicit places.
[2022-05-20 19:59:34] [INFO ] Redundant transitions in 27 ms returned []
// Phase 1: matrix 1331 rows 363 cols
[2022-05-20 19:59:34] [INFO ] Computed 32 place invariants in 27 ms
[2022-05-20 19:59:35] [INFO ] Dead Transitions using invariants and state equation in 433 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 363/363 places, 1331/1331 transitions.
Computed a total of 363 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 363 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 134 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 95 resets, run finished after 770 ms. (steps per millisecond=12 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 289218 steps, run timeout after 3001 ms. (steps per millisecond=96 ) properties seen :{}
Probabilistic random walk after 289218 steps, saw 134477 distinct states, run finished after 3001 ms. (steps per millisecond=96 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1331 rows 363 cols
[2022-05-20 19:59:51] [INFO ] Computed 32 place invariants in 23 ms
[2022-05-20 19:59:51] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 17 ms returned sat
[2022-05-20 19:59:52] [INFO ] After 523ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 19:59:52] [INFO ] [Nat]Absence check using 0 positive and 32 generalized place invariants in 17 ms returned sat
[2022-05-20 19:59:52] [INFO ] After 377ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 19:59:52] [INFO ] After 439ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2022-05-20 19:59:52] [INFO ] After 548ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 119 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=29 )
Parikh walk visited 1 properties in 4 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 310 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Product exploration explored 100000 steps with 945 reset in 7917 ms.
Product exploration explored 100000 steps with 946 reset in 8030 ms.
Built C files in :
/tmp/ltsmin14686655437882353795
[2022-05-20 20:00:08] [INFO ] Computing symmetric may disable matrix : 1331 transitions.
[2022-05-20 20:00:08] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 20:00:08] [INFO ] Computing symmetric may enable matrix : 1331 transitions.
[2022-05-20 20:00:08] [INFO ] Computation of Complete enable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 20:00:09] [INFO ] Computing Do-Not-Accords matrix : 1331 transitions.
[2022-05-20 20:00:09] [INFO ] Computation of Completed DNA matrix. took 51 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 20:00:09] [INFO ] Built C files in 263ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14686655437882353795
Running compilation step : cd /tmp/ltsmin14686655437882353795;'/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/ltsmin14686655437882353795;'/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/ltsmin14686655437882353795;'/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 121 out of 363 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 363/363 places, 1331/1331 transitions.
Applied a total of 0 rules in 19 ms. Remains 363 /363 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 363 cols
[2022-05-20 20:00:12] [INFO ] Computed 32 place invariants in 23 ms
[2022-05-20 20:00:12] [INFO ] Implicit Places using invariants in 255 ms returned []
// Phase 1: matrix 1331 rows 363 cols
[2022-05-20 20:00:12] [INFO ] Computed 32 place invariants in 23 ms
[2022-05-20 20:00:13] [INFO ] Implicit Places using invariants and state equation in 923 ms returned []
Implicit Place search using SMT with State Equation took 1201 ms to find 0 implicit places.
[2022-05-20 20:00:13] [INFO ] Redundant transitions in 21 ms returned []
// Phase 1: matrix 1331 rows 363 cols
[2022-05-20 20:00:13] [INFO ] Computed 32 place invariants in 27 ms
[2022-05-20 20:00:13] [INFO ] Dead Transitions using invariants and state equation in 473 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 363/363 places, 1331/1331 transitions.
Built C files in :
/tmp/ltsmin10431412751495618272
[2022-05-20 20:00:13] [INFO ] Computing symmetric may disable matrix : 1331 transitions.
[2022-05-20 20:00:13] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 20:00:13] [INFO ] Computing symmetric may enable matrix : 1331 transitions.
[2022-05-20 20:00:13] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 20:00:14] [INFO ] Computing Do-Not-Accords matrix : 1331 transitions.
[2022-05-20 20:00:14] [INFO ] Computation of Completed DNA matrix. took 35 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 20:00:14] [INFO ] Built C files in 232ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10431412751495618272
Running compilation step : cd /tmp/ltsmin10431412751495618272;'/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/ltsmin10431412751495618272;'/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/ltsmin10431412751495618272;'/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-20 20:00:17] [INFO ] Flatten gal took : 61 ms
[2022-05-20 20:00:17] [INFO ] Flatten gal took : 59 ms
[2022-05-20 20:00:17] [INFO ] Time to serialize gal into /tmp/LTL9183254218004413235.gal : 5 ms
[2022-05-20 20:00:17] [INFO ] Time to serialize properties into /tmp/LTL14955475119105029741.ltl : 0 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/LTL9183254218004413235.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14955475119105029741.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/LTL9183254...267
Read 1 LTL properties
Checking formula 0 : !((F(G("((((((((Rows_0+Rows_1)+(Rows_2+Rows_3))+((Rows_4+Rows_5)+(Rows_6+Rows_7)))+(((Rows_8+Rows_9)+(Rows_10+Rows_11))+((Rows_12+Rows...1257
Formula 0 simplified : !FG"((((((((Rows_0+Rows_1)+(Rows_2+Rows_3))+((Rows_4+Rows_5)+(Rows_6+Rows_7)))+(((Rows_8+Rows_9)+(Rows_10+Rows_11))+((Rows_12+Rows_1...1251
Detected timeout of ITS tools.
[2022-05-20 20:00:32] [INFO ] Flatten gal took : 59 ms
[2022-05-20 20:00:32] [INFO ] Applying decomposition
[2022-05-20 20:00:32] [INFO ] Flatten gal took : 56 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/graph13467319157733240281.txt' '-o' '/tmp/graph13467319157733240281.bin' '-w' '/tmp/graph13467319157733240281.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13467319157733240281.bin' '-l' '-1' '-v' '-w' '/tmp/graph13467319157733240281.weights' '-q' '0' '-e' '0.001'
[2022-05-20 20:00:32] [INFO ] Decomposing Gal with order
[2022-05-20 20:00:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 20:00:33] [INFO ] Removed a total of 3630 redundant transitions.
[2022-05-20 20:00:33] [INFO ] Flatten gal took : 243 ms
[2022-05-20 20:00:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2022-05-20 20:00:33] [INFO ] Time to serialize gal into /tmp/LTL17322231360782586346.gal : 24 ms
[2022-05-20 20:00:33] [INFO ] Time to serialize properties into /tmp/LTL6939600971641484246.ltl : 0 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/LTL17322231360782586346.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6939600971641484246.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/LTL1732223...267
Read 1 LTL properties
Checking formula 0 : !((F(G("((((((((gu0.Rows_0+gu0.Rows_1)+(gu0.Rows_2+gu0.Rows_3))+((gu0.Rows_4+gu0.Rows_5)+(gu0.Rows_6+gu0.Rows_7)))+(((gu0.Rows_8+gu0.R...1741
Formula 0 simplified : !FG"((((((((gu0.Rows_0+gu0.Rows_1)+(gu0.Rows_2+gu0.Rows_3))+((gu0.Rows_4+gu0.Rows_5)+(gu0.Rows_6+gu0.Rows_7)))+(((gu0.Rows_8+gu0.Row...1735
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1780234299518434604
[2022-05-20 20:00:48] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1780234299518434604
Running compilation step : cd /tmp/ltsmin1780234299518434604;'/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'
Compilation finished in 2384 ms.
Running link step : cd /tmp/ltsmin1780234299518434604;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin1780234299518434604;'/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' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Sudoku-COL-AN11-LTLCardinality-09 finished in 125308 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 121 out of 1694 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Reduce places removed 1331 places and 0 transitions.
Iterating post reduction 0 with 1331 rules applied. Total rules applied 1331 place count 363 transition count 1331
Applied a total of 1331 rules in 19 ms. Remains 363 /1694 variables (removed 1331) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 363 cols
[2022-05-20 20:01:03] [INFO ] Computed 32 place invariants in 28 ms
[2022-05-20 20:01:03] [INFO ] Implicit Places using invariants in 289 ms returned []
// Phase 1: matrix 1331 rows 363 cols
[2022-05-20 20:01:03] [INFO ] Computed 32 place invariants in 25 ms
[2022-05-20 20:01:04] [INFO ] Implicit Places using invariants and state equation in 884 ms returned []
Implicit Place search using SMT with State Equation took 1175 ms to find 0 implicit places.
// Phase 1: matrix 1331 rows 363 cols
[2022-05-20 20:01:04] [INFO ] Computed 32 place invariants in 30 ms
[2022-05-20 20:01:05] [INFO ] Dead Transitions using invariants and state equation in 438 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 363/1694 places, 1331/1331 transitions.
Finished structural reductions, in 1 iterations. Remains : 363/1694 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 153 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN11-LTLCardinality-13 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: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(GT 2 (ADD s242 s243 s244 s245 s246 s247 s248 s249 s250 s251 s252 s253 s254 s255 s256 s257 s258 s259 s260 s261 s262 s263 s264 s265 s266 s267 s268 s269 ...], 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 2 ms.
FORMULA Sudoku-COL-AN11-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN11-LTLCardinality-13 finished in 1814 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((F((!X(p0)||p1))||X(p2)) U (p0 U (p1 U p0))))'
Support contains 1694 out of 1694 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 22 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 1694 cols
[2022-05-20 20:01:05] [INFO ] Computed 363 place invariants in 7 ms
[2022-05-20 20:01:05] [INFO ] Implicit Places using invariants in 241 ms returned []
// Phase 1: matrix 1331 rows 1694 cols
[2022-05-20 20:01:05] [INFO ] Computed 363 place invariants in 6 ms
[2022-05-20 20:01:06] [INFO ] Implicit Places using invariants and state equation in 747 ms returned []
Implicit Place search using SMT with State Equation took 990 ms to find 0 implicit places.
[2022-05-20 20:01:06] [INFO ] Redundant transitions in 25 ms returned []
// Phase 1: matrix 1331 rows 1694 cols
[2022-05-20 20:01:06] [INFO ] Computed 363 place invariants in 7 ms
[2022-05-20 20:01:06] [INFO ] Dead Transitions using invariants and state equation in 685 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1694/1694 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND p0 (NOT p1))]
Running random walk in product with property : Sudoku-COL-AN11-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ (ADD s1573 s1574 s1575 s1576 s1577 s1578 s1579 s1580 s1581 s1582 s1583 s1584 s1585 s1586 s1587 s1588 s1589 s1590 s1591 s1592 s1593 s1594 s1595 s15...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration timeout after 43570 steps with 702 reset in 10001 ms.
Product exploration timeout after 43720 steps with 705 reset in 10003 ms.
Computed a total of 1694 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1694 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (AND (NOT p0) p1)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 336 ms. Reduced automaton from 3 states, 6 edges and 3 AP to 3 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (AND p0 (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Incomplete random walk after 10000 steps, including 94 resets, run finished after 1394 ms. (steps per millisecond=7 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 499 ms. (steps per millisecond=20 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 575 ms. (steps per millisecond=17 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1331 rows 1694 cols
[2022-05-20 20:05:30] [INFO ] Computed 363 place invariants in 9 ms
[2022-05-20 20:05:31] [INFO ] After 240ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 20:05:31] [INFO ] [Nat]Absence check using 363 positive place invariants in 96 ms returned sat
[2022-05-20 20:05:32] [INFO ] After 735ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2022-05-20 20:05:33] [INFO ] After 876ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 85 ms.
[2022-05-20 20:05:33] [INFO ] After 1666ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 119 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=17 )
Parikh walk visited 1 properties in 8 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (AND (NOT p0) p1)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p2) (NOT p1))), (F (NOT (AND (NOT p0) p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 12 factoid took 490 ms. Reduced automaton from 3 states, 6 edges and 3 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
// Phase 1: matrix 1331 rows 1694 cols
[2022-05-20 20:05:34] [INFO ] Computed 363 place invariants in 5 ms
[2022-05-20 20:05:42] [INFO ] [Real]Absence check using 363 positive place invariants in 175 ms returned sat
[2022-05-20 20:05:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 20:05:44] [INFO ] [Real]Absence check using state equation in 1651 ms returned sat
[2022-05-20 20:05:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 20:05:58] [INFO ] [Nat]Absence check using 363 positive place invariants in 5815 ms returned sat
[2022-05-20 20:05:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 20:05:59] [INFO ] [Nat]Absence check using state equation in 752 ms returned unknown
Could not prove EG (NOT p0)
Support contains 1452 out of 1694 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 23 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 1694 cols
[2022-05-20 20:05:59] [INFO ] Computed 363 place invariants in 3 ms
[2022-05-20 20:06:00] [INFO ] Implicit Places using invariants in 290 ms returned []
// Phase 1: matrix 1331 rows 1694 cols
[2022-05-20 20:06:00] [INFO ] Computed 363 place invariants in 10 ms
[2022-05-20 20:06:00] [INFO ] Implicit Places using invariants and state equation in 757 ms returned []
Implicit Place search using SMT with State Equation took 1049 ms to find 0 implicit places.
[2022-05-20 20:06:00] [INFO ] Redundant transitions in 23 ms returned []
// Phase 1: matrix 1331 rows 1694 cols
[2022-05-20 20:06:00] [INFO ] Computed 363 place invariants in 8 ms
[2022-05-20 20:06:01] [INFO ] Dead Transitions using invariants and state equation in 680 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1694/1694 places, 1331/1331 transitions.
Computed a total of 1694 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1694 transition count 1331
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)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 116 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 31 ms :[(NOT p0)]
Finished random walk after 61 steps, including 0 resets, run visited all 1 properties in 15 ms. (steps per millisecond=4 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 177 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 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
// Phase 1: matrix 1331 rows 1694 cols
[2022-05-20 20:06:49] [INFO ] Computed 363 place invariants in 11 ms
[2022-05-20 20:06:58] [INFO ] [Real]Absence check using 363 positive place invariants in 160 ms returned sat
[2022-05-20 20:06:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 20:07:00] [INFO ] [Real]Absence check using state equation in 1664 ms returned sat
[2022-05-20 20:07:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 20:07:13] [INFO ] [Nat]Absence check using 363 positive place invariants in 5235 ms returned sat
[2022-05-20 20:07:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 20:07:15] [INFO ] [Nat]Absence check using state equation in 1284 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Product exploration timeout after 68060 steps with 1097 reset in 10001 ms.
Product exploration timeout after 67800 steps with 1093 reset in 10002 ms.
Built C files in :
/tmp/ltsmin15260007160243184017
[2022-05-20 20:07:35] [INFO ] Computing symmetric may disable matrix : 1331 transitions.
[2022-05-20 20:07:35] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 20:07:35] [INFO ] Computing symmetric may enable matrix : 1331 transitions.
[2022-05-20 20:07:35] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 20:07:35] [INFO ] Computing Do-Not-Accords matrix : 1331 transitions.
[2022-05-20 20:07:35] [INFO ] Computation of Completed DNA matrix. took 23 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 20:07:35] [INFO ] Built C files in 219ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15260007160243184017
Running compilation step : cd /tmp/ltsmin15260007160243184017;'/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/ltsmin15260007160243184017;'/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/ltsmin15260007160243184017;'/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 1452 out of 1694 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 40 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 1694 cols
[2022-05-20 20:07:38] [INFO ] Computed 363 place invariants in 4 ms
[2022-05-20 20:07:39] [INFO ] Implicit Places using invariants in 550 ms returned []
// Phase 1: matrix 1331 rows 1694 cols
[2022-05-20 20:07:39] [INFO ] Computed 363 place invariants in 4 ms
[2022-05-20 20:07:40] [INFO ] Implicit Places using invariants and state equation in 1362 ms returned []
Implicit Place search using SMT with State Equation took 1914 ms to find 0 implicit places.
[2022-05-20 20:07:40] [INFO ] Redundant transitions in 52 ms returned []
// Phase 1: matrix 1331 rows 1694 cols
[2022-05-20 20:07:40] [INFO ] Computed 363 place invariants in 7 ms
[2022-05-20 20:07:41] [INFO ] Dead Transitions using invariants and state equation in 681 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1694/1694 places, 1331/1331 transitions.
Built C files in :
/tmp/ltsmin14946325408680114096
[2022-05-20 20:07:41] [INFO ] Computing symmetric may disable matrix : 1331 transitions.
[2022-05-20 20:07:41] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 20:07:41] [INFO ] Computing symmetric may enable matrix : 1331 transitions.
[2022-05-20 20:07:41] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 20:07:41] [INFO ] Computing Do-Not-Accords matrix : 1331 transitions.
[2022-05-20 20:07:41] [INFO ] Computation of Completed DNA matrix. took 23 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 20:07:41] [INFO ] Built C files in 209ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14946325408680114096
Running compilation step : cd /tmp/ltsmin14946325408680114096;'/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/ltsmin14946325408680114096;'/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/ltsmin14946325408680114096;'/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-20 20:07:44] [INFO ] Flatten gal took : 63 ms
[2022-05-20 20:07:44] [INFO ] Flatten gal took : 60 ms
[2022-05-20 20:07:44] [INFO ] Time to serialize gal into /tmp/LTL8453835726241654707.gal : 7 ms
[2022-05-20 20:07:44] [INFO ] Time to serialize properties into /tmp/LTL5239769865388968482.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/LTL8453835726241654707.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5239769865388968482.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/LTL8453835...266
Read 1 LTL properties
Checking formula 0 : !((((F((!(X("((((((((Columns_0+Columns_1)+(Columns_2+Columns_3))+((Columns_4+Columns_5)+(Columns_6+Columns_7)))+(((Columns_8+Columns_9...89570
Formula 0 simplified : !((F("((((((((((((Board_0+Board_1)+(Board_2+Board_3))+((Board_4+Board_5)+(Board_6+Board_7)))+(((Board_8+Board_9)+(Board_10+Board_11)...89558
Detected timeout of ITS tools.
[2022-05-20 20:07:59] [INFO ] Flatten gal took : 58 ms
[2022-05-20 20:07:59] [INFO ] Applying decomposition
[2022-05-20 20:07:59] [INFO ] Flatten gal took : 69 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/graph5284918902362448749.txt' '-o' '/tmp/graph5284918902362448749.bin' '-w' '/tmp/graph5284918902362448749.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5284918902362448749.bin' '-l' '-1' '-v' '-w' '/tmp/graph5284918902362448749.weights' '-q' '0' '-e' '0.001'
[2022-05-20 20:08:09] [INFO ] Decomposing Gal with order
[2022-05-20 20:08:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 20:08:11] [INFO ] Removed a total of 3630 redundant transitions.
[2022-05-20 20:08:11] [INFO ] Flatten gal took : 1731 ms
[2022-05-20 20:08:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 15 ms.
[2022-05-20 20:08:11] [INFO ] Time to serialize gal into /tmp/LTL333156898487848671.gal : 10 ms
[2022-05-20 20:08:11] [INFO ] Time to serialize properties into /tmp/LTL8911140547170772388.ltl : 3 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/LTL333156898487848671.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8911140547170772388.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/LTL3331568...265
Read 1 LTL properties
Checking formula 0 : !((((F((!(X("((((((((gi2.gu3.Columns_0+gi2.gu3.Columns_1)+(gi2.gu3.Columns_2+gi2.gu3.Columns_3))+((gi2.gu3.Columns_4+gi2.gu3.Columns_5...147166
Formula 0 simplified : !((F("((((((((((((gi2.gu1.Board_0+gi2.gu1.Board_1)+(gi2.gu1.Board_2+gi2.gu1.Board_3))+((gi2.gu1.Board_4+gi2.gu1.Board_5)+(gi2.gu1.Bo...147154
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14610403615837981579
[2022-05-20 20:08:26] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14610403615837981579
Running compilation step : cd /tmp/ltsmin14610403615837981579;'/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/ltsmin14610403615837981579;'/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/ltsmin14610403615837981579;'/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-COL-AN11-LTLCardinality-15 finished in 444760 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((G((X(X(p1)) U p1))||p0))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((F((!X(p0)||p1))||X(p2)) U (p0 U (p1 U p0))))'
[2022-05-20 20:08:30] [INFO ] Flatten gal took : 58 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7921476700660102131
[2022-05-20 20:08:30] [INFO ] Computing symmetric may disable matrix : 1331 transitions.
[2022-05-20 20:08:30] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 20:08:30] [INFO ] Computing symmetric may enable matrix : 1331 transitions.
[2022-05-20 20:08:30] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 20:08:30] [INFO ] Applying decomposition
[2022-05-20 20:08:30] [INFO ] Flatten gal took : 60 ms
[2022-05-20 20:08:30] [INFO ] Computing Do-Not-Accords matrix : 1331 transitions.
[2022-05-20 20:08:30] [INFO ] Computation of Completed DNA matrix. took 37 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 20:08:30] [INFO ] Built C files in 423ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7921476700660102131
Running compilation step : cd /tmp/ltsmin7921476700660102131;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '240' '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'
Compilation finished in 5433 ms.
Running link step : cd /tmp/ltsmin7921476700660102131;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 69 ms.
Running LTSmin : cd /tmp/ltsmin7921476700660102131;'/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(([]((X(X((LTLAPp1==true))) U (LTLAPp1==true)))||(LTLAPp0==true))))' '--buchi-type=spotba'
[2022-05-20 20:08:43] [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/graph7185442933495891689.txt' '-o' '/tmp/graph7185442933495891689.bin' '-w' '/tmp/graph7185442933495891689.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-20 20:08:44] [INFO ] Flatten gal took : 153 ms
[2022-05-20 20:08:44] [INFO ] Time to serialize gal into /tmp/LTLCardinality12753713498472821643.gal : 22 ms
[2022-05-20 20:08:45] [INFO ] Time to serialize properties into /tmp/LTLCardinality70862765486316187.ltl : 1174 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/LTLCardinality12753713498472821643.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality70862765486316187.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...287
Read 3 LTL properties
Checking formula 0 : !((G(X(((G((X(X("((((((((Columns_0+Columns_1)+(Columns_2+Columns_3))+((Columns_4+Columns_5)+(Columns_6+Columns_7)))+(((Columns_8+Colum...7383
Formula 0 simplified : !GX("((((((((Columns_0+Columns_1)+(Columns_2+Columns_3))+((Columns_4+Columns_5)+(Columns_6+Columns_7)))+(((Columns_8+Columns_9)+(Col...7367
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.084: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.084: LTL layer: formula: [](X(([]((X(X((LTLAPp1==true))) U (LTLAPp1==true)))||(LTLAPp0==true))))
pins2lts-mc-linux64( 1/ 8), 0.084: "[](X(([]((X(X((LTLAPp1==true))) U (LTLAPp1==true)))||(LTLAPp0==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.085: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.085: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.093: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.093: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.111: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.112: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.115: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.115: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.117: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.349: DFS-FIFO for weak LTL, using special progress label 1338
pins2lts-mc-linux64( 0/ 8), 0.349: There are 1339 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.349: State length is 1695, there are 1344 groups
pins2lts-mc-linux64( 0/ 8), 0.349: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.350: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.350: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.350: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 7/ 8), 6.092: ~1 levels ~960 states ~1248248 transitions
pins2lts-mc-linux64( 7/ 8), 10.317: ~1 levels ~1920 states ~2496248 transitions
pins2lts-mc-linux64( 7/ 8), 18.882: ~1 levels ~3840 states ~4934040 transitions
pins2lts-mc-linux64( 7/ 8), 36.057: ~1 levels ~7680 states ~9808872 transitions
pins2lts-mc-linux64( 4/ 8), 51.885: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 85.063:
pins2lts-mc-linux64( 0/ 8), 85.063: mean standard work distribution: 0.7% (states) 0.6% (transitions)
pins2lts-mc-linux64( 0/ 8), 85.063:
pins2lts-mc-linux64( 0/ 8), 85.063: Explored 10673 states 13585079 transitions, fanout: 1272.845
pins2lts-mc-linux64( 0/ 8), 85.063: Total exploration time 84.690 sec (55.710 sec minimum, 71.006 sec on average)
pins2lts-mc-linux64( 0/ 8), 85.063: States per second: 126, Transitions per second: 160409
pins2lts-mc-linux64( 0/ 8), 85.063:
pins2lts-mc-linux64( 0/ 8), 85.063: Progress states detected: 9757111
pins2lts-mc-linux64( 0/ 8), 85.063: Redundant explorations: -99.8906
pins2lts-mc-linux64( 0/ 8), 85.063:
pins2lts-mc-linux64( 0/ 8), 85.063: Queue width: 8B, total height: 10609006, memory: 80.94MB
pins2lts-mc-linux64( 0/ 8), 85.063: Tree memory: 330.5MB, 35.5 B/state, compr.: 0.5%
pins2lts-mc-linux64( 0/ 8), 85.063: Tree fill ratio (roots/leafs): 7.0%/100.0%
pins2lts-mc-linux64( 0/ 8), 85.063: Stored 1360 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 85.063: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 85.063: Est. total memory use: 411.4MB (~1104.9MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin7921476700660102131;'/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(([]((X(X((LTLAPp1==true))) U (LTLAPp1==true)))||(LTLAPp0==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin7921476700660102131;'/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(([]((X(X((LTLAPp1==true))) U (LTLAPp1==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-20 20:33:30] [INFO ] Applying decomposition
[2022-05-20 20:33:30] [INFO ] Flatten gal took : 411 ms
[2022-05-20 20:33:31] [INFO ] Decomposing Gal with order
[2022-05-20 20:33:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 20:33:32] [INFO ] Removed a total of 3157 redundant transitions.
[2022-05-20 20:33:32] [INFO ] Flatten gal took : 659 ms
[2022-05-20 20:33:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 36 ms.
[2022-05-20 20:33:33] [INFO ] Time to serialize gal into /tmp/LTLCardinality15541313575238155415.gal : 45 ms
[2022-05-20 20:33:33] [INFO ] Time to serialize properties into /tmp/LTLCardinality631811784798820463.ltl : 14 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/LTLCardinality15541313575238155415.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality631811784798820463.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...288
Read 3 LTL properties
Checking formula 0 : !((G(X(((G((X(X("((((((((gNN0.Columns_0+gNN1.Columns_1)+(gNN2.Columns_2+gNN3.Columns_3))+((gNN4.Columns_4+gNN5.Columns_5)+(gNN6.Column...11068
Formula 0 simplified : !GX("((((((((gNN0.Columns_0+gNN1.Columns_1)+(gNN2.Columns_2+gNN3.Columns_3))+((gNN4.Columns_4+gNN5.Columns_5)+(gNN6.Columns_6+gNN7.C...11052
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-COL-AN11"
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-COL-AN11, 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-165303545300123"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-COL-AN11.tgz
mv Sudoku-COL-AN11 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 ;