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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 228K
-rw-r--r-- 1 mcc users 5.8K Apr 30 12:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Apr 30 12:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 30 12:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 30 12:02 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.9K May 9 09:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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-AN10-LTLCardinality-00
FORMULA_NAME Sudoku-COL-AN10-LTLCardinality-01
FORMULA_NAME Sudoku-COL-AN10-LTLCardinality-02
FORMULA_NAME Sudoku-COL-AN10-LTLCardinality-03
FORMULA_NAME Sudoku-COL-AN10-LTLCardinality-04
FORMULA_NAME Sudoku-COL-AN10-LTLCardinality-05
FORMULA_NAME Sudoku-COL-AN10-LTLCardinality-06
FORMULA_NAME Sudoku-COL-AN10-LTLCardinality-07
FORMULA_NAME Sudoku-COL-AN10-LTLCardinality-08
FORMULA_NAME Sudoku-COL-AN10-LTLCardinality-09
FORMULA_NAME Sudoku-COL-AN10-LTLCardinality-10
FORMULA_NAME Sudoku-COL-AN10-LTLCardinality-11
FORMULA_NAME Sudoku-COL-AN10-LTLCardinality-12
FORMULA_NAME Sudoku-COL-AN10-LTLCardinality-13
FORMULA_NAME Sudoku-COL-AN10-LTLCardinality-14
FORMULA_NAME Sudoku-COL-AN10-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1653073386331

Running Version 202205111006
[2022-05-20 19:03: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:03:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 19:03: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:03:07] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-20 19:03:08] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 513 ms
[2022-05-20 19:03:08] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 1300 PT places and 1000.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
FORMULA Sudoku-COL-AN10-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN10-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-20 19:03:08] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 7 ms.
[2022-05-20 19:03:08] [INFO ] Skeletonized 14 HLPN properties in 1 ms.
Initial state reduction rules removed 2 formulas.
FORMULA Sudoku-COL-AN10-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN10-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN10-LTLCardinality-09 FALSE 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 11 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 10097 steps, including 98 resets, run finished after 57 ms. (steps per millisecond=177 ) properties (out of 15) seen :13
Incomplete Best-First random walk after 10097 steps, including 98 resets, run finished after 14 ms. (steps per millisecond=721 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10097 steps, including 98 resets, run finished after 12 ms. (steps per millisecond=841 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1 rows 4 cols
[2022-05-20 19:03:08] [INFO ] Computed 3 place invariants in 6 ms
[2022-05-20 19:03:08] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 19:03:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-20 19:03:08] [INFO ] After 35ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
[2022-05-20 19:03:08] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2022-05-20 19:03:08] [INFO ] Flatten gal took : 13 ms
FORMULA Sudoku-COL-AN10-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-20 19:03:08] [INFO ] Flatten gal took : 1 ms
Domain [N(10), N(10)] of place Rows breaks symmetries in sort N
[2022-05-20 19:03:08] [INFO ] Unfolded HLPN to a Petri net with 1300 places and 1000 transitions 4000 arcs in 24 ms.
[2022-05-20 19:03:08] [INFO ] Unfolded 10 HLPN properties in 2 ms.
Support contains 1300 out of 1300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 20 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 1300 cols
[2022-05-20 19:03:08] [INFO ] Computed 300 place invariants in 26 ms
[2022-05-20 19:03:09] [INFO ] Implicit Places using invariants in 301 ms returned []
// Phase 1: matrix 1000 rows 1300 cols
[2022-05-20 19:03:09] [INFO ] Computed 300 place invariants in 18 ms
[2022-05-20 19:03:09] [INFO ] Implicit Places using invariants and state equation in 750 ms returned []
Implicit Place search using SMT with State Equation took 1053 ms to find 0 implicit places.
// Phase 1: matrix 1000 rows 1300 cols
[2022-05-20 19:03:09] [INFO ] Computed 300 place invariants in 17 ms
[2022-05-20 19:03:12] [INFO ] Dead Transitions using invariants and state equation in 2883 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1300/1300 places, 1000/1000 transitions.
Support contains 1300 out of 1300 places after structural reductions.
[2022-05-20 19:03:12] [INFO ] Flatten gal took : 117 ms
[2022-05-20 19:03:13] [INFO ] Flatten gal took : 111 ms
[2022-05-20 19:03:13] [INFO ] Input system was already deterministic with 1000 transitions.
Incomplete random walk after 10000 steps, including 115 resets, run finished after 1324 ms. (steps per millisecond=7 ) properties (out of 15) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 9) 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 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 9) 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 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 1000 rows 1300 cols
[2022-05-20 19:03:15] [INFO ] Computed 300 place invariants in 15 ms
[2022-05-20 19:03:16] [INFO ] [Real]Absence check using 300 positive place invariants in 80 ms returned sat
[2022-05-20 19:03:17] [INFO ] After 1521ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2022-05-20 19:03:18] [INFO ] [Nat]Absence check using 300 positive place invariants in 63 ms returned sat
[2022-05-20 19:03:42] [INFO ] After 23858ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :4
[2022-05-20 19:03:42] [INFO ] After 23865ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :4
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-05-20 19:03:42] [INFO ] After 25032ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :4
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 300 out of 1300 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Graph (complete) has 3000 edges and 1300 vertex of which 300 are kept as prefixes of interest. Removing 1000 places using SCC suffix rule.3 ms
Discarding 1000 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 25 ms. Remains 300 /1300 variables (removed 1000) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 300/1300 places, 1000/1000 transitions.
Incomplete random walk after 10000 steps, including 114 resets, run finished after 990 ms. (steps per millisecond=10 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 113614 steps, run timeout after 3006 ms. (steps per millisecond=37 ) properties seen :{}
Probabilistic random walk after 113614 steps, saw 59293 distinct states, run finished after 3007 ms. (steps per millisecond=37 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 1000 rows 300 cols
[2022-05-20 19:03:47] [INFO ] Computed 29 place invariants in 53 ms
[2022-05-20 19:03:47] [INFO ] [Real]Absence check using 0 positive and 29 generalized place invariants in 18 ms returned sat
[2022-05-20 19:04:12] [INFO ] After 24841ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:1
[2022-05-20 19:04:12] [INFO ] After 24843ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :3 real:1
Attempting to minimize the solution found.
Minimization took 0 ms.
[2022-05-20 19:04:12] [INFO ] After 25018ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :3 real:1
[2022-05-20 19:04:12] [INFO ] [Nat]Absence check using 0 positive and 29 generalized place invariants in 18 ms returned sat
[2022-05-20 19:04:37] [INFO ] After 24864ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-20 19:04:37] [INFO ] After 24868ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-05-20 19:04:37] [INFO ] After 25020ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 7 Parikh solutions to 3 different solutions.
Finished Parikh walk after 100 steps, including 0 resets, run visited all 7 properties in 22 ms. (steps per millisecond=4 )
Parikh walk visited 7 properties in 24 ms.
Successfully simplified 2 atomic propositions for a total of 10 simplifications.
Computed a total of 1300 stabilizing places and 1000 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1300 transition count 1000
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((!(F(p0) U !(F(!p0)&&p1)) U X(!p1))))'
Support contains 200 out of 1300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Reduce places removed 1000 places and 0 transitions.
Iterating post reduction 0 with 1000 rules applied. Total rules applied 1000 place count 300 transition count 1000
Applied a total of 1000 rules in 22 ms. Remains 300 /1300 variables (removed 1000) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 300 cols
[2022-05-20 19:04:37] [INFO ] Computed 29 place invariants in 19 ms
[2022-05-20 19:04:37] [INFO ] Implicit Places using invariants in 131 ms returned []
// Phase 1: matrix 1000 rows 300 cols
[2022-05-20 19:04:37] [INFO ] Computed 29 place invariants in 20 ms
[2022-05-20 19:04:38] [INFO ] Implicit Places using invariants and state equation in 465 ms returned []
Implicit Place search using SMT with State Equation took 598 ms to find 0 implicit places.
// Phase 1: matrix 1000 rows 300 cols
[2022-05-20 19:04:38] [INFO ] Computed 29 place invariants in 17 ms
[2022-05-20 19:04:38] [INFO ] Dead Transitions using invariants and state equation in 309 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 300/1300 places, 1000/1000 transitions.
Finished structural reductions, in 1 iterations. Remains : 300/1300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 437 ms :[p0, (OR p0 p1), p1, true, p1, true, p1, p1]
Running random walk in product with property : Sudoku-COL-AN10-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={} source=2 dest: 4}, { cond=p1, acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 5}], [{ cond=p1, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={} source=6 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=7 dest: 1}, { cond=(AND p0 p1), acceptance={} source=7 dest: 3}]], initial=6, aps=[p0:(LEQ 1 (ADD s100 s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s115 s116 s117 s118 s119 s120 s121 s122 s123 s124 s125 s126 s127...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration timeout after 86550 steps with 28850 reset in 10003 ms.
Product exploration timeout after 86970 steps with 28990 reset in 10001 ms.
Computed a total of 300 stabilizing places and 1000 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 300 transition count 1000
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND p0 p1))))
Knowledge based reduction with 7 factoid took 134 ms. Reduced automaton from 8 states, 16 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Sudoku-COL-AN10-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN10-LTLCardinality-00 finished in 40587 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((G(!p0) U p1)&&!(!p0 U p2)))'
Support contains 1200 out of 1300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 31 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 1300 cols
[2022-05-20 19:05:18] [INFO ] Computed 300 place invariants in 4 ms
[2022-05-20 19:05:18] [INFO ] Implicit Places using invariants in 338 ms returned []
// Phase 1: matrix 1000 rows 1300 cols
[2022-05-20 19:05:18] [INFO ] Computed 300 place invariants in 9 ms
[2022-05-20 19:05:19] [INFO ] Implicit Places using invariants and state equation in 807 ms returned []
Implicit Place search using SMT with State Equation took 1154 ms to find 0 implicit places.
[2022-05-20 19:05:19] [INFO ] Redundant transitions in 66 ms returned []
// Phase 1: matrix 1000 rows 1300 cols
[2022-05-20 19:05:19] [INFO ] Computed 300 place invariants in 10 ms
[2022-05-20 19:05:20] [INFO ] Dead Transitions using invariants and state equation in 551 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1300/1300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 186 ms :[true, (OR (NOT p1) p2), (OR (NOT p1) p0 p2), p2, (OR p2 p0)]
Running random walk in product with property : Sudoku-COL-AN10-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (AND p0 (NOT p1)) p2), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 3}], [{ cond=(OR p0 p2), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=2 dest: 4}], [{ cond=p2, acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 3}], [{ cond=(OR p0 p2), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(GT 1 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s3...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 50 steps with 0 reset in 19 ms.
FORMULA Sudoku-COL-AN10-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN10-LTLCardinality-02 finished in 2035 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X(X(p1)))))'
Support contains 100 out of 1300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Reduce places removed 1000 places and 0 transitions.
Iterating post reduction 0 with 1000 rules applied. Total rules applied 1000 place count 300 transition count 1000
Applied a total of 1000 rules in 27 ms. Remains 300 /1300 variables (removed 1000) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 300 cols
[2022-05-20 19:05:20] [INFO ] Computed 29 place invariants in 20 ms
[2022-05-20 19:05:20] [INFO ] Implicit Places using invariants in 206 ms returned []
// Phase 1: matrix 1000 rows 300 cols
[2022-05-20 19:05:20] [INFO ] Computed 29 place invariants in 21 ms
[2022-05-20 19:05:21] [INFO ] Implicit Places using invariants and state equation in 603 ms returned []
Implicit Place search using SMT with State Equation took 811 ms to find 0 implicit places.
// Phase 1: matrix 1000 rows 300 cols
[2022-05-20 19:05:21] [INFO ] Computed 29 place invariants in 19 ms
[2022-05-20 19:05:21] [INFO ] Dead Transitions using invariants and state equation in 365 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 300/1300 places, 1000/1000 transitions.
Finished structural reductions, in 1 iterations. Remains : 300/1300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 247 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-COL-AN10-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 2}]], initial=0, aps=[p0:(OR (LEQ 2 (ADD s200 s201 s202 s203 s204 s205 s206 s207 s208 s209 s210 s211 s212 s213 s214 s215 s216 s217 s218 s219 s220 s221 s222 s223 s224 s225 s226 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 8759 ms.
Product exploration explored 100000 steps with 50000 reset in 8908 ms.
Computed a total of 300 stabilizing places and 1000 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 300 transition count 1000
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 5 factoid took 96 ms. Reduced automaton from 5 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Sudoku-COL-AN10-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN10-LTLCardinality-04 finished in 25238 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&(X(X(F(p1)))||X(p2))))'
Support contains 1200 out of 1300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 12 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 1300 cols
[2022-05-20 19:05:45] [INFO ] Computed 300 place invariants in 4 ms
[2022-05-20 19:05:45] [INFO ] Implicit Places using invariants in 293 ms returned []
// Phase 1: matrix 1000 rows 1300 cols
[2022-05-20 19:05:45] [INFO ] Computed 300 place invariants in 3 ms
[2022-05-20 19:05:46] [INFO ] Implicit Places using invariants and state equation in 744 ms returned []
Implicit Place search using SMT with State Equation took 1039 ms to find 0 implicit places.
// Phase 1: matrix 1000 rows 1300 cols
[2022-05-20 19:05:46] [INFO ] Computed 300 place invariants in 12 ms
[2022-05-20 19:05:47] [INFO ] Dead Transitions using invariants and state equation in 521 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1300/1300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p1), true, (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : Sudoku-COL-AN10-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p0:(GT 3 (ADD s1200 s1201 s1202 s1203 s1204 s1205 s1206 s1207 s1208 s1209 s1210 s1211 s1212 s1213 s1214 s1215 s1216 s1217 s1218 s1219 s1220 s1221 s1222 s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Sudoku-COL-AN10-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN10-LTLCardinality-05 finished in 1727 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1100 out of 1300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 23 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 1300 cols
[2022-05-20 19:05:47] [INFO ] Computed 300 place invariants in 2 ms
[2022-05-20 19:05:47] [INFO ] Implicit Places using invariants in 419 ms returned []
// Phase 1: matrix 1000 rows 1300 cols
[2022-05-20 19:05:47] [INFO ] Computed 300 place invariants in 4 ms
[2022-05-20 19:05:48] [INFO ] Implicit Places using invariants and state equation in 1081 ms returned []
Implicit Place search using SMT with State Equation took 1502 ms to find 0 implicit places.
[2022-05-20 19:05:48] [INFO ] Redundant transitions in 17 ms returned []
// Phase 1: matrix 1000 rows 1300 cols
[2022-05-20 19:05:48] [INFO ] Computed 300 place invariants in 6 ms
[2022-05-20 19:05:49] [INFO ] Dead Transitions using invariants and state equation in 546 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1300/1300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN10-LTLCardinality-07 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 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration timeout after 97310 steps with 1116 reset in 10001 ms.
Product exploration timeout after 96890 steps with 1112 reset in 10001 ms.
Computed a total of 1300 stabilizing places and 1000 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1300 transition count 1000
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(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 148 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)]
Finished random walk after 50 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=7 )
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 174 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 27 ms :[(NOT p0)]
// Phase 1: matrix 1000 rows 1300 cols
[2022-05-20 19:06:32] [INFO ] Computed 300 place invariants in 7 ms
[2022-05-20 19:06:38] [INFO ] [Real]Absence check using 300 positive place invariants in 119 ms returned sat
[2022-05-20 19:06:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 19:06:39] [INFO ] [Real]Absence check using state equation in 990 ms returned sat
[2022-05-20 19:06:39] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 19:06:50] [INFO ] [Nat]Absence check using 300 positive place invariants in 4767 ms returned sat
[2022-05-20 19:06:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 19:06:52] [INFO ] [Nat]Absence check using state equation in 2249 ms returned sat
[2022-05-20 19:06:52] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 36 ms.
[2022-05-20 19:06:52] [INFO ] Added : 0 causal constraints over 0 iterations in 159 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1100 out of 1300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 23 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 1300 cols
[2022-05-20 19:06:52] [INFO ] Computed 300 place invariants in 7 ms
[2022-05-20 19:06:52] [INFO ] Implicit Places using invariants in 443 ms returned []
// Phase 1: matrix 1000 rows 1300 cols
[2022-05-20 19:06:52] [INFO ] Computed 300 place invariants in 6 ms
[2022-05-20 19:06:53] [INFO ] Implicit Places using invariants and state equation in 1005 ms returned []
Implicit Place search using SMT with State Equation took 1450 ms to find 0 implicit places.
[2022-05-20 19:06:53] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 1000 rows 1300 cols
[2022-05-20 19:06:54] [INFO ] Computed 300 place invariants in 4 ms
[2022-05-20 19:06:54] [INFO ] Dead Transitions using invariants and state equation in 489 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1300/1300 places, 1000/1000 transitions.
Computed a total of 1300 stabilizing places and 1000 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1300 transition count 1000
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(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 200 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 38 ms :[(NOT p0)]
Finished random walk after 50 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=7 )
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, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
// Phase 1: matrix 1000 rows 1300 cols
[2022-05-20 19:07:17] [INFO ] Computed 300 place invariants in 7 ms
[2022-05-20 19:07:23] [INFO ] [Real]Absence check using 300 positive place invariants in 110 ms returned sat
[2022-05-20 19:07:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 19:07:24] [INFO ] [Real]Absence check using state equation in 992 ms returned sat
[2022-05-20 19:07:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 19:07:35] [INFO ] [Nat]Absence check using 300 positive place invariants in 4780 ms returned sat
[2022-05-20 19:07:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 19:07:37] [INFO ] [Nat]Absence check using state equation in 2247 ms returned sat
[2022-05-20 19:07:37] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 45 ms.
[2022-05-20 19:07:37] [INFO ] Added : 0 causal constraints over 0 iterations in 156 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration timeout after 97700 steps with 1119 reset in 10001 ms.
Product exploration timeout after 97050 steps with 1114 reset in 10001 ms.
Built C files in :
/tmp/ltsmin12535975061080941594
[2022-05-20 19:07:57] [INFO ] Computing symmetric may disable matrix : 1000 transitions.
[2022-05-20 19:07:57] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 19:07:57] [INFO ] Computing symmetric may enable matrix : 1000 transitions.
[2022-05-20 19:07:57] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 19:07:58] [INFO ] Computing Do-Not-Accords matrix : 1000 transitions.
[2022-05-20 19:07:58] [INFO ] Computation of Completed DNA matrix. took 36 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 19:07:58] [INFO ] Built C files in 184ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12535975061080941594
Running compilation step : cd /tmp/ltsmin12535975061080941594;'/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/ltsmin12535975061080941594;'/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/ltsmin12535975061080941594;'/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 1100 out of 1300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 25 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 1300 cols
[2022-05-20 19:08:01] [INFO ] Computed 300 place invariants in 3 ms
[2022-05-20 19:08:01] [INFO ] Implicit Places using invariants in 406 ms returned []
// Phase 1: matrix 1000 rows 1300 cols
[2022-05-20 19:08:01] [INFO ] Computed 300 place invariants in 5 ms
[2022-05-20 19:08:02] [INFO ] Implicit Places using invariants and state equation in 1004 ms returned []
Implicit Place search using SMT with State Equation took 1422 ms to find 0 implicit places.
[2022-05-20 19:08:02] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 1000 rows 1300 cols
[2022-05-20 19:08:02] [INFO ] Computed 300 place invariants in 6 ms
[2022-05-20 19:08:03] [INFO ] Dead Transitions using invariants and state equation in 509 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1300/1300 places, 1000/1000 transitions.
Built C files in :
/tmp/ltsmin12840832120440976539
[2022-05-20 19:08:03] [INFO ] Computing symmetric may disable matrix : 1000 transitions.
[2022-05-20 19:08:03] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 19:08:03] [INFO ] Computing symmetric may enable matrix : 1000 transitions.
[2022-05-20 19:08:03] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 19:08:03] [INFO ] Computing Do-Not-Accords matrix : 1000 transitions.
[2022-05-20 19:08:03] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 19:08:03] [INFO ] Built C files in 130ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12840832120440976539
Running compilation step : cd /tmp/ltsmin12840832120440976539;'/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/ltsmin12840832120440976539;'/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/ltsmin12840832120440976539;'/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 19:08:06] [INFO ] Flatten gal took : 67 ms
[2022-05-20 19:08:06] [INFO ] Flatten gal took : 59 ms
[2022-05-20 19:08:06] [INFO ] Time to serialize gal into /tmp/LTL12405596865969979315.gal : 11 ms
[2022-05-20 19:08:06] [INFO ] Time to serialize properties into /tmp/LTL16154916383874931079.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/LTL12405596865969979315.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16154916383874931079.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/LTL1240559...268
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...12912
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...12906
Detected timeout of ITS tools.
[2022-05-20 19:08:21] [INFO ] Flatten gal took : 57 ms
[2022-05-20 19:08:21] [INFO ] Applying decomposition
[2022-05-20 19:08:21] [INFO ] Flatten gal took : 54 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/graph16035553101641618278.txt' '-o' '/tmp/graph16035553101641618278.bin' '-w' '/tmp/graph16035553101641618278.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16035553101641618278.bin' '-l' '-1' '-v' '-w' '/tmp/graph16035553101641618278.weights' '-q' '0' '-e' '0.001'
[2022-05-20 19:08:23] [INFO ] Decomposing Gal with order
[2022-05-20 19:08:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 19:08:23] [INFO ] Removed a total of 1329 redundant transitions.
[2022-05-20 19:08:23] [INFO ] Flatten gal took : 600 ms
[2022-05-20 19:08:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 332 labels/synchronizations in 52 ms.
[2022-05-20 19:08:24] [INFO ] Time to serialize gal into /tmp/LTL8380508201286439873.gal : 9 ms
[2022-05-20 19:08:24] [INFO ] Time to serialize properties into /tmp/LTL17438419941244493155.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/LTL8380508201286439873.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17438419941244493155.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/LTL8380508...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...17312
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...17306
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5708478743078836658
[2022-05-20 19:08:39] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5708478743078836658
Running compilation step : cd /tmp/ltsmin5708478743078836658;'/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/ltsmin5708478743078836658;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin5708478743078836658;'/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-AN10-LTLCardinality-07 finished in 186999 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 100 out of 1300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Graph (complete) has 3000 edges and 1300 vertex of which 300 are kept as prefixes of interest. Removing 1000 places using SCC suffix rule.6 ms
Discarding 1000 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 43 ms. Remains 300 /1300 variables (removed 1000) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 300 cols
[2022-05-20 19:08:54] [INFO ] Computed 29 place invariants in 12 ms
[2022-05-20 19:08:54] [INFO ] Implicit Places using invariants in 205 ms returned []
// Phase 1: matrix 1000 rows 300 cols
[2022-05-20 19:08:54] [INFO ] Computed 29 place invariants in 16 ms
[2022-05-20 19:08:55] [INFO ] Implicit Places using invariants and state equation in 602 ms returned []
Implicit Place search using SMT with State Equation took 810 ms to find 0 implicit places.
[2022-05-20 19:08:55] [INFO ] Redundant transitions in 13 ms returned []
// Phase 1: matrix 1000 rows 300 cols
[2022-05-20 19:08:55] [INFO ] Computed 29 place invariants in 17 ms
[2022-05-20 19:08:55] [INFO ] Dead Transitions using invariants and state equation in 332 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 300/1300 places, 1000/1000 transitions.
Finished structural reductions, in 1 iterations. Remains : 300/1300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN10-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 3 (ADD s100 s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s115 s116 s117 s118 s119 s120 s121 s122 s123 s124 s125 s126 s127...], 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 1145 reset in 5882 ms.
Product exploration explored 100000 steps with 1148 reset in 5949 ms.
Computed a total of 300 stabilizing places and 1000 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 300 transition count 1000
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 2930 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 42 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 114 resets, run finished after 573 ms. (steps per millisecond=17 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 335631 steps, run timeout after 3001 ms. (steps per millisecond=111 ) properties seen :{}
Probabilistic random walk after 335631 steps, saw 117059 distinct states, run finished after 3001 ms. (steps per millisecond=111 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1000 rows 300 cols
[2022-05-20 19:09:19] [INFO ] Computed 29 place invariants in 21 ms
[2022-05-20 19:09:20] [INFO ] [Real]Absence check using 0 positive and 29 generalized place invariants in 22 ms returned sat
[2022-05-20 19:09:29] [INFO ] After 9325ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 100 out of 300 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 10 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 300/300 places, 1000/1000 transitions.
Incomplete random walk after 10000 steps, including 114 resets, run finished after 562 ms. (steps per millisecond=17 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 339936 steps, run timeout after 3001 ms. (steps per millisecond=113 ) properties seen :{}
Probabilistic random walk after 339936 steps, saw 118196 distinct states, run finished after 3001 ms. (steps per millisecond=113 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1000 rows 300 cols
[2022-05-20 19:09:32] [INFO ] Computed 29 place invariants in 19 ms
[2022-05-20 19:09:33] [INFO ] [Real]Absence check using 0 positive and 29 generalized place invariants in 17 ms returned sat
[2022-05-20 19:09:42] [INFO ] After 9328ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 100 out of 300 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 16 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 300/300 places, 1000/1000 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 8 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 300 cols
[2022-05-20 19:09:42] [INFO ] Computed 29 place invariants in 19 ms
[2022-05-20 19:09:42] [INFO ] Implicit Places using invariants in 218 ms returned []
// Phase 1: matrix 1000 rows 300 cols
[2022-05-20 19:09:42] [INFO ] Computed 29 place invariants in 13 ms
[2022-05-20 19:09:43] [INFO ] Implicit Places using invariants and state equation in 626 ms returned []
Implicit Place search using SMT with State Equation took 850 ms to find 0 implicit places.
[2022-05-20 19:09:43] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 1000 rows 300 cols
[2022-05-20 19:09:43] [INFO ] Computed 29 place invariants in 15 ms
[2022-05-20 19:09:43] [INFO ] Dead Transitions using invariants and state equation in 355 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 10 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1000 rows 300 cols
[2022-05-20 19:09:43] [INFO ] Computed 29 place invariants in 16 ms
[2022-05-20 19:09:43] [INFO ] [Real]Absence check using 0 positive and 29 generalized place invariants in 18 ms returned sat
[2022-05-20 19:09:52] [INFO ] After 9333ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
[2022-05-20 19:09:52] [INFO ] Flatten gal took : 40 ms
[2022-05-20 19:09:53] [INFO ] Flatten gal took : 39 ms
[2022-05-20 19:09:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8093350456717743342.gal : 5 ms
[2022-05-20 19:09:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12174466280330260737.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms11669081926614653357;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8093350456717743342.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12174466280330260737.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality12174466280330260737.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 540
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :540 after 158714
Detected timeout of ITS tools.
[2022-05-20 19:10:08] [INFO ] Flatten gal took : 38 ms
[2022-05-20 19:10:08] [INFO ] Applying decomposition
[2022-05-20 19:10:08] [INFO ] Flatten gal took : 38 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/graph14093936867214769225.txt' '-o' '/tmp/graph14093936867214769225.bin' '-w' '/tmp/graph14093936867214769225.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14093936867214769225.bin' '-l' '-1' '-v' '-w' '/tmp/graph14093936867214769225.weights' '-q' '0' '-e' '0.001'
[2022-05-20 19:10:08] [INFO ] Decomposing Gal with order
[2022-05-20 19:10:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 19:10:08] [INFO ] Removed a total of 2700 redundant transitions.
[2022-05-20 19:10:08] [INFO ] Flatten gal took : 203 ms
[2022-05-20 19:10:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2022-05-20 19:10:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3222378869682062703.gal : 4 ms
[2022-05-20 19:10:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10652727562222443537.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms11669081926614653357;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3222378869682062703.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10652727562222443537.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality10652727562222443537.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 540
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :540 after 158714
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9448192706943809358
[2022-05-20 19:10:23] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9448192706943809358
Running compilation step : cd /tmp/ltsmin9448192706943809358;'/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 1726 ms.
Running link step : cd /tmp/ltsmin9448192706943809358;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin9448192706943809358;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf0==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
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 142 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 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Support contains 100 out of 300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 18 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 300 cols
[2022-05-20 19:10:39] [INFO ] Computed 29 place invariants in 17 ms
[2022-05-20 19:10:39] [INFO ] Implicit Places using invariants in 207 ms returned []
// Phase 1: matrix 1000 rows 300 cols
[2022-05-20 19:10:39] [INFO ] Computed 29 place invariants in 12 ms
[2022-05-20 19:10:39] [INFO ] Implicit Places using invariants and state equation in 554 ms returned []
Implicit Place search using SMT with State Equation took 763 ms to find 0 implicit places.
[2022-05-20 19:10:39] [INFO ] Redundant transitions in 23 ms returned []
// Phase 1: matrix 1000 rows 300 cols
[2022-05-20 19:10:39] [INFO ] Computed 29 place invariants in 20 ms
[2022-05-20 19:10:40] [INFO ] Dead Transitions using invariants and state equation in 396 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 300/300 places, 1000/1000 transitions.
Computed a total of 300 stabilizing places and 1000 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 300 transition count 1000
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 108 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 33 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 114 resets, run finished after 568 ms. (steps per millisecond=17 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 325810 steps, run timeout after 3001 ms. (steps per millisecond=108 ) properties seen :{}
Probabilistic random walk after 325810 steps, saw 115143 distinct states, run finished after 3001 ms. (steps per millisecond=108 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1000 rows 300 cols
[2022-05-20 19:10:49] [INFO ] Computed 29 place invariants in 24 ms
[2022-05-20 19:10:50] [INFO ] [Real]Absence check using 0 positive and 29 generalized place invariants in 17 ms returned sat
[2022-05-20 19:10:59] [INFO ] After 9339ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 100 out of 300 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 14 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 300/300 places, 1000/1000 transitions.
Incomplete random walk after 10000 steps, including 114 resets, run finished after 562 ms. (steps per millisecond=17 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 337830 steps, run timeout after 3001 ms. (steps per millisecond=112 ) properties seen :{}
Probabilistic random walk after 337830 steps, saw 117724 distinct states, run finished after 3001 ms. (steps per millisecond=112 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1000 rows 300 cols
[2022-05-20 19:11:02] [INFO ] Computed 29 place invariants in 20 ms
[2022-05-20 19:11:03] [INFO ] [Real]Absence check using 0 positive and 29 generalized place invariants in 18 ms returned sat
[2022-05-20 19:11:12] [INFO ] After 9335ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 100 out of 300 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 17 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 300/300 places, 1000/1000 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 8 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 300 cols
[2022-05-20 19:11:12] [INFO ] Computed 29 place invariants in 15 ms
[2022-05-20 19:11:12] [INFO ] Implicit Places using invariants in 204 ms returned []
// Phase 1: matrix 1000 rows 300 cols
[2022-05-20 19:11:12] [INFO ] Computed 29 place invariants in 12 ms
[2022-05-20 19:11:13] [INFO ] Implicit Places using invariants and state equation in 580 ms returned []
Implicit Place search using SMT with State Equation took 786 ms to find 0 implicit places.
[2022-05-20 19:11:13] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 1000 rows 300 cols
[2022-05-20 19:11:13] [INFO ] Computed 29 place invariants in 19 ms
[2022-05-20 19:11:13] [INFO ] Dead Transitions using invariants and state equation in 343 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 14 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1000 rows 300 cols
[2022-05-20 19:11:13] [INFO ] Computed 29 place invariants in 19 ms
[2022-05-20 19:11:13] [INFO ] [Real]Absence check using 0 positive and 29 generalized place invariants in 18 ms returned sat
[2022-05-20 19:11:22] [INFO ] After 9360ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
[2022-05-20 19:11:23] [INFO ] Flatten gal took : 38 ms
[2022-05-20 19:11:23] [INFO ] Flatten gal took : 37 ms
[2022-05-20 19:11:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9721988743743235245.gal : 13 ms
[2022-05-20 19:11:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2467241189869729582.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms11294794506837966741;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9721988743743235245.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2467241189869729582.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality2467241189869729582.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 540
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :540 after 158714
Detected timeout of ITS tools.
[2022-05-20 19:11:38] [INFO ] Flatten gal took : 34 ms
[2022-05-20 19:11:38] [INFO ] Applying decomposition
[2022-05-20 19:11:38] [INFO ] Flatten gal took : 33 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/graph2741367838888424646.txt' '-o' '/tmp/graph2741367838888424646.bin' '-w' '/tmp/graph2741367838888424646.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2741367838888424646.bin' '-l' '-1' '-v' '-w' '/tmp/graph2741367838888424646.weights' '-q' '0' '-e' '0.001'
[2022-05-20 19:11:38] [INFO ] Decomposing Gal with order
[2022-05-20 19:11:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 19:11:38] [INFO ] Removed a total of 2700 redundant transitions.
[2022-05-20 19:11:38] [INFO ] Flatten gal took : 146 ms
[2022-05-20 19:11:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2022-05-20 19:11:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9116844273317170889.gal : 17 ms
[2022-05-20 19:11:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11892688228558673204.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms11294794506837966741;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9116844273317170889.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11892688228558673204.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality11892688228558673204.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 540
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :540 after 158714
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13623281110362737765
[2022-05-20 19:11:53] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13623281110362737765
Running compilation step : cd /tmp/ltsmin13623281110362737765;'/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 1668 ms.
Running link step : cd /tmp/ltsmin13623281110362737765;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin13623281110362737765;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf0==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
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 188 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)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1146 reset in 5883 ms.
Product exploration explored 100000 steps with 1147 reset in 5941 ms.
Built C files in :
/tmp/ltsmin6290718868662400873
[2022-05-20 19:12:20] [INFO ] Computing symmetric may disable matrix : 1000 transitions.
[2022-05-20 19:12:20] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 19:12:20] [INFO ] Computing symmetric may enable matrix : 1000 transitions.
[2022-05-20 19:12:20] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 19:12:20] [INFO ] Computing Do-Not-Accords matrix : 1000 transitions.
[2022-05-20 19:12:20] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 19:12:20] [INFO ] Built C files in 166ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6290718868662400873
Running compilation step : cd /tmp/ltsmin6290718868662400873;'/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 2828 ms.
Running link step : cd /tmp/ltsmin6290718868662400873;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin6290718868662400873;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15730780472956680437.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 100 out of 300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 17 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 300 cols
[2022-05-20 19:12:35] [INFO ] Computed 29 place invariants in 12 ms
[2022-05-20 19:12:36] [INFO ] Implicit Places using invariants in 214 ms returned []
// Phase 1: matrix 1000 rows 300 cols
[2022-05-20 19:12:36] [INFO ] Computed 29 place invariants in 20 ms
[2022-05-20 19:12:36] [INFO ] Implicit Places using invariants and state equation in 617 ms returned []
Implicit Place search using SMT with State Equation took 833 ms to find 0 implicit places.
[2022-05-20 19:12:36] [INFO ] Redundant transitions in 16 ms returned []
// Phase 1: matrix 1000 rows 300 cols
[2022-05-20 19:12:36] [INFO ] Computed 29 place invariants in 20 ms
[2022-05-20 19:12:37] [INFO ] Dead Transitions using invariants and state equation in 361 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 300/300 places, 1000/1000 transitions.
Built C files in :
/tmp/ltsmin16638101693402913824
[2022-05-20 19:12:37] [INFO ] Computing symmetric may disable matrix : 1000 transitions.
[2022-05-20 19:12:37] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 19:12:37] [INFO ] Computing symmetric may enable matrix : 1000 transitions.
[2022-05-20 19:12:37] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 19:12:37] [INFO ] Computing Do-Not-Accords matrix : 1000 transitions.
[2022-05-20 19:12:37] [INFO ] Computation of Completed DNA matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 19:12:37] [INFO ] Built C files in 116ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16638101693402913824
Running compilation step : cd /tmp/ltsmin16638101693402913824;'/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 2825 ms.
Running link step : cd /tmp/ltsmin16638101693402913824;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin16638101693402913824;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased94511046801729550.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 19:12:52] [INFO ] Flatten gal took : 34 ms
[2022-05-20 19:12:52] [INFO ] Flatten gal took : 34 ms
[2022-05-20 19:12:52] [INFO ] Time to serialize gal into /tmp/LTL9022126108656285408.gal : 4 ms
[2022-05-20 19:12:52] [INFO ] Time to serialize properties into /tmp/LTL7166526521272462090.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/LTL9022126108656285408.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7166526521272462090.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/LTL9022126...266
Read 1 LTL properties
Checking formula 0 : !((F(G("((((((((Cells_0+Cells_1)+(Cells_2+Cells_3))+((Cells_4+Cells_5)+(Cells_6+Cells_7)))+(((Cells_8+Cells_9)+(Cells_10+Cells_11))+((...1126
Formula 0 simplified : !FG"((((((((Cells_0+Cells_1)+(Cells_2+Cells_3))+((Cells_4+Cells_5)+(Cells_6+Cells_7)))+(((Cells_8+Cells_9)+(Cells_10+Cells_11))+((Ce...1120
Detected timeout of ITS tools.
[2022-05-20 19:13:07] [INFO ] Flatten gal took : 34 ms
[2022-05-20 19:13:07] [INFO ] Applying decomposition
[2022-05-20 19:13:07] [INFO ] Flatten gal took : 32 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/graph707218187342157367.txt' '-o' '/tmp/graph707218187342157367.bin' '-w' '/tmp/graph707218187342157367.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph707218187342157367.bin' '-l' '-1' '-v' '-w' '/tmp/graph707218187342157367.weights' '-q' '0' '-e' '0.001'
[2022-05-20 19:13:07] [INFO ] Decomposing Gal with order
[2022-05-20 19:13:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 19:13:07] [INFO ] Removed a total of 2700 redundant transitions.
[2022-05-20 19:13:07] [INFO ] Flatten gal took : 183 ms
[2022-05-20 19:13:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2022-05-20 19:13:07] [INFO ] Time to serialize gal into /tmp/LTL14612362118774878812.gal : 4 ms
[2022-05-20 19:13:07] [INFO ] Time to serialize properties into /tmp/LTL2123171110879428354.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/LTL14612362118774878812.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2123171110879428354.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/LTL1461236...267
Read 1 LTL properties
Checking formula 0 : !((F(G("((((((((gu100.Cells_0+gu100.Cells_1)+(gu100.Cells_2+gu100.Cells_3))+((gu100.Cells_4+gu100.Cells_5)+(gu100.Cells_6+gu100.Cells_...1726
Formula 0 simplified : !FG"((((((((gu100.Cells_0+gu100.Cells_1)+(gu100.Cells_2+gu100.Cells_3))+((gu100.Cells_4+gu100.Cells_5)+(gu100.Cells_6+gu100.Cells_7)...1720
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16522308083922855922
[2022-05-20 19:13:22] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16522308083922855922
Running compilation step : cd /tmp/ltsmin16522308083922855922;'/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 1684 ms.
Running link step : cd /tmp/ltsmin16522308083922855922;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin16522308083922855922;'/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-AN10-LTLCardinality-08 finished in 283682 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(G((G(p0)&&(X(G(p1))||!p1))))))'
Support contains 1200 out of 1300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 4 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 1300 cols
[2022-05-20 19:13:37] [INFO ] Computed 300 place invariants in 5 ms
[2022-05-20 19:13:38] [INFO ] Implicit Places using invariants in 310 ms returned []
// Phase 1: matrix 1000 rows 1300 cols
[2022-05-20 19:13:38] [INFO ] Computed 300 place invariants in 8 ms
[2022-05-20 19:13:39] [INFO ] Implicit Places using invariants and state equation in 782 ms returned []
Implicit Place search using SMT with State Equation took 1099 ms to find 0 implicit places.
// Phase 1: matrix 1000 rows 1300 cols
[2022-05-20 19:13:39] [INFO ] Computed 300 place invariants in 4 ms
[2022-05-20 19:13:39] [INFO ] Dead Transitions using invariants and state equation in 516 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1300/1300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-COL-AN10-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(GT (ADD s100 s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s115 s116 s117 s118 s119 s120 s121 s122 s123 s124 s125 s126 s127 s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Sudoku-COL-AN10-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN10-LTLCardinality-10 finished in 1766 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1100 out of 1300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 6 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 1300 cols
[2022-05-20 19:13:39] [INFO ] Computed 300 place invariants in 8 ms
[2022-05-20 19:13:40] [INFO ] Implicit Places using invariants in 440 ms returned []
// Phase 1: matrix 1000 rows 1300 cols
[2022-05-20 19:13:40] [INFO ] Computed 300 place invariants in 8 ms
[2022-05-20 19:13:41] [INFO ] Implicit Places using invariants and state equation in 972 ms returned []
Implicit Place search using SMT with State Equation took 1415 ms to find 0 implicit places.
// Phase 1: matrix 1000 rows 1300 cols
[2022-05-20 19:13:41] [INFO ] Computed 300 place invariants in 8 ms
[2022-05-20 19:13:41] [INFO ] Dead Transitions using invariants and state equation in 518 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1300/1300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN10-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT (ADD s100 s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s115 s116 s117 s118 s119 s120 s121 s122 s123 s124 s125 s126 s127 s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Sudoku-COL-AN10-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN10-LTLCardinality-11 finished in 2044 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U F(G(p1))))'
Support contains 1000 out of 1300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 16 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 1300 cols
[2022-05-20 19:13:41] [INFO ] Computed 300 place invariants in 8 ms
[2022-05-20 19:13:42] [INFO ] Implicit Places using invariants in 550 ms returned []
// Phase 1: matrix 1000 rows 1300 cols
[2022-05-20 19:13:42] [INFO ] Computed 300 place invariants in 7 ms
[2022-05-20 19:13:43] [INFO ] Implicit Places using invariants and state equation in 1161 ms returned []
Implicit Place search using SMT with State Equation took 1713 ms to find 0 implicit places.
[2022-05-20 19:13:43] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 1000 rows 1300 cols
[2022-05-20 19:13:43] [INFO ] Computed 300 place invariants in 5 ms
[2022-05-20 19:13:44] [INFO ] Dead Transitions using invariants and state equation in 503 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1300/1300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p1)]
Running random walk in product with property : Sudoku-COL-AN10-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(LEQ 1 (ADD s100 s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s115 s116 s117 s118 s119 s120 s121 s122 s123 s124 s125 s126 s127...], 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 1147 reset in 9086 ms.
Product exploration explored 100000 steps with 1147 reset in 9141 ms.
Computed a total of 1300 stabilizing places and 1000 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1300 transition count 1000
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p1), (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 137 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 40 ms :[(NOT p1)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [(NOT p1), (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 4 factoid took 239 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 25 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
// Phase 1: matrix 1000 rows 1300 cols
[2022-05-20 19:14:23] [INFO ] Computed 300 place invariants in 5 ms
[2022-05-20 19:14:28] [INFO ] [Real]Absence check using 300 positive place invariants in 98 ms returned sat
[2022-05-20 19:14:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 19:14:29] [INFO ] [Real]Absence check using state equation in 704 ms returned sat
[2022-05-20 19:14:29] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 37 ms.
[2022-05-20 19:14:29] [INFO ] Added : 0 causal constraints over 0 iterations in 128 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 1000 out of 1300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 24 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 1300 cols
[2022-05-20 19:14:29] [INFO ] Computed 300 place invariants in 2 ms
[2022-05-20 19:14:29] [INFO ] Implicit Places using invariants in 525 ms returned []
// Phase 1: matrix 1000 rows 1300 cols
[2022-05-20 19:14:29] [INFO ] Computed 300 place invariants in 2 ms
[2022-05-20 19:14:31] [INFO ] Implicit Places using invariants and state equation in 1174 ms returned []
Implicit Place search using SMT with State Equation took 1705 ms to find 0 implicit places.
[2022-05-20 19:14:31] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 1000 rows 1300 cols
[2022-05-20 19:14:31] [INFO ] Computed 300 place invariants in 4 ms
[2022-05-20 19:14:31] [INFO ] Dead Transitions using invariants and state equation in 536 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1300/1300 places, 1000/1000 transitions.
Computed a total of 1300 stabilizing places and 1000 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1300 transition count 1000
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p1), (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
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 33 ms :[(NOT p1)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [(NOT p1), (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 4 factoid took 162 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 33 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p1)]
// Phase 1: matrix 1000 rows 1300 cols
[2022-05-20 19:14:53] [INFO ] Computed 300 place invariants in 8 ms
[2022-05-20 19:14:57] [INFO ] [Real]Absence check using 300 positive place invariants in 100 ms returned sat
[2022-05-20 19:14:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 19:14:58] [INFO ] [Real]Absence check using state equation in 701 ms returned sat
[2022-05-20 19:14:58] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 37 ms.
[2022-05-20 19:14:58] [INFO ] Added : 0 causal constraints over 0 iterations in 127 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 36 ms :[(NOT p1)]
Product exploration explored 100000 steps with 1146 reset in 9109 ms.
Product exploration explored 100000 steps with 1147 reset in 9147 ms.
Built C files in :
/tmp/ltsmin17251206536238923089
[2022-05-20 19:15:17] [INFO ] Computing symmetric may disable matrix : 1000 transitions.
[2022-05-20 19:15:17] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 19:15:17] [INFO ] Computing symmetric may enable matrix : 1000 transitions.
[2022-05-20 19:15:17] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 19:15:17] [INFO ] Computing Do-Not-Accords matrix : 1000 transitions.
[2022-05-20 19:15:17] [INFO ] Computation of Completed DNA matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 19:15:17] [INFO ] Built C files in 119ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17251206536238923089
Running compilation step : cd /tmp/ltsmin17251206536238923089;'/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/ltsmin17251206536238923089;'/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/ltsmin17251206536238923089;'/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 1000 out of 1300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 22 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 1300 cols
[2022-05-20 19:15:20] [INFO ] Computed 300 place invariants in 5 ms
[2022-05-20 19:15:20] [INFO ] Implicit Places using invariants in 535 ms returned []
// Phase 1: matrix 1000 rows 1300 cols
[2022-05-20 19:15:20] [INFO ] Computed 300 place invariants in 4 ms
[2022-05-20 19:15:22] [INFO ] Implicit Places using invariants and state equation in 1216 ms returned []
Implicit Place search using SMT with State Equation took 1753 ms to find 0 implicit places.
[2022-05-20 19:15:22] [INFO ] Redundant transitions in 15 ms returned []
// Phase 1: matrix 1000 rows 1300 cols
[2022-05-20 19:15:22] [INFO ] Computed 300 place invariants in 3 ms
[2022-05-20 19:15:22] [INFO ] Dead Transitions using invariants and state equation in 500 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1300/1300 places, 1000/1000 transitions.
Built C files in :
/tmp/ltsmin1465999244568220721
[2022-05-20 19:15:22] [INFO ] Computing symmetric may disable matrix : 1000 transitions.
[2022-05-20 19:15:22] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 19:15:22] [INFO ] Computing symmetric may enable matrix : 1000 transitions.
[2022-05-20 19:15:22] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 19:15:22] [INFO ] Computing Do-Not-Accords matrix : 1000 transitions.
[2022-05-20 19:15:22] [INFO ] Computation of Completed DNA matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 19:15:22] [INFO ] Built C files in 123ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1465999244568220721
Running compilation step : cd /tmp/ltsmin1465999244568220721;'/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/ltsmin1465999244568220721;'/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/ltsmin1465999244568220721;'/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 19:15:25] [INFO ] Flatten gal took : 44 ms
[2022-05-20 19:15:25] [INFO ] Flatten gal took : 43 ms
[2022-05-20 19:15:25] [INFO ] Time to serialize gal into /tmp/LTL4139960291942997730.gal : 5 ms
[2022-05-20 19:15:25] [INFO ] Time to serialize properties into /tmp/LTL3194498729725221941.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/LTL4139960291942997730.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3194498729725221941.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/LTL4139960...266
Read 1 LTL properties
Checking formula 0 : !((("(((((((((((Board_0+Board_1)+(Board_2+Board_3))+((Board_4+Board_5)+(Board_6+Board_7)))+(((Board_8+Board_9)+(Board_10+Board_11))+((...23825
Formula 0 simplified : !("(((((((((((Board_0+Board_1)+(Board_2+Board_3))+((Board_4+Board_5)+(Board_6+Board_7)))+(((Board_8+Board_9)+(Board_10+Board_11))+((...23819
Detected timeout of ITS tools.
[2022-05-20 19:15:40] [INFO ] Flatten gal took : 50 ms
[2022-05-20 19:15:40] [INFO ] Applying decomposition
[2022-05-20 19:15:40] [INFO ] Flatten gal took : 42 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/graph7474964525716034871.txt' '-o' '/tmp/graph7474964525716034871.bin' '-w' '/tmp/graph7474964525716034871.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7474964525716034871.bin' '-l' '-1' '-v' '-w' '/tmp/graph7474964525716034871.weights' '-q' '0' '-e' '0.001'
[2022-05-20 19:15:43] [INFO ] Decomposing Gal with order
[2022-05-20 19:15:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 19:15:43] [INFO ] Removed a total of 1847 redundant transitions.
[2022-05-20 19:15:43] [INFO ] Flatten gal took : 290 ms
[2022-05-20 19:15:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 122 labels/synchronizations in 17 ms.
[2022-05-20 19:15:43] [INFO ] Time to serialize gal into /tmp/LTL3291987050004422382.gal : 6 ms
[2022-05-20 19:15:43] [INFO ] Time to serialize properties into /tmp/LTL5210807184576707120.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/LTL3291987050004422382.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5210807184576707120.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/LTL3291987...266
Read 1 LTL properties
Checking formula 0 : !((("(((((((((((gu0.Board_0+gu0.Board_1)+(gu0.Board_2+gu0.Board_3))+((gu0.Board_4+gu0.Board_5)+(gu0.Board_6+gu0.Board_7)))+(((gu0.Boar...31825
Formula 0 simplified : !("(((((((((((gu0.Board_0+gu0.Board_1)+(gu0.Board_2+gu0.Board_3))+((gu0.Board_4+gu0.Board_5)+(gu0.Board_6+gu0.Board_7)))+(((gu0.Boar...31819
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13415786126265584710
[2022-05-20 19:15:58] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13415786126265584710
Running compilation step : cd /tmp/ltsmin13415786126265584710;'/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 2247 ms.
Running link step : cd /tmp/ltsmin13415786126265584710;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin13415786126265584710;'/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) U <>([]((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Sudoku-COL-AN10-LTLCardinality-12 finished in 151852 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((F(X(G(X((true U p0)))))&&p0)) U X(!p0)))'
Support contains 1100 out of 1300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 11 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 1300 cols
[2022-05-20 19:16:13] [INFO ] Computed 300 place invariants in 2 ms
[2022-05-20 19:16:14] [INFO ] Implicit Places using invariants in 445 ms returned []
// Phase 1: matrix 1000 rows 1300 cols
[2022-05-20 19:16:14] [INFO ] Computed 300 place invariants in 7 ms
[2022-05-20 19:16:15] [INFO ] Implicit Places using invariants and state equation in 1027 ms returned []
Implicit Place search using SMT with State Equation took 1473 ms to find 0 implicit places.
// Phase 1: matrix 1000 rows 1300 cols
[2022-05-20 19:16:15] [INFO ] Computed 300 place invariants in 5 ms
[2022-05-20 19:16:15] [INFO ] Dead Transitions using invariants and state equation in 545 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1300/1300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 154 ms :[p0, p0, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN10-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ (ADD s100 s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s115 s116 s117 s118 s119 s120 s121 s122 s123 s124 s125 s126 s127 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 83 steps with 0 reset in 13 ms.
FORMULA Sudoku-COL-AN10-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN10-LTLCardinality-13 finished in 2225 ms.
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(G(p0)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U F(G(p1))))'
[2022-05-20 19:16:16] [INFO ] Flatten gal took : 54 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14982677183034135826
[2022-05-20 19:16:16] [INFO ] Computing symmetric may disable matrix : 1000 transitions.
[2022-05-20 19:16:16] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 19:16:16] [INFO ] Computing symmetric may enable matrix : 1000 transitions.
[2022-05-20 19:16:16] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 19:16:16] [INFO ] Applying decomposition
[2022-05-20 19:16:16] [INFO ] Flatten gal took : 43 ms
[2022-05-20 19:16:16] [INFO ] Computing Do-Not-Accords matrix : 1000 transitions.
[2022-05-20 19:16:16] [INFO ] Computation of Completed DNA matrix. took 27 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 19:16:16] [INFO ] Built C files in 559ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14982677183034135826
Running compilation step : cd /tmp/ltsmin14982677183034135826;'/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'
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/graph5874637966426486912.txt' '-o' '/tmp/graph5874637966426486912.bin' '-w' '/tmp/graph5874637966426486912.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5874637966426486912.bin' '-l' '-1' '-v' '-w' '/tmp/graph5874637966426486912.weights' '-q' '0' '-e' '0.001'
[2022-05-20 19:16:19] [INFO ] Decomposing Gal with order
[2022-05-20 19:16:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 19:16:20] [INFO ] Removed a total of 1800 redundant transitions.
[2022-05-20 19:16:20] [INFO ] Flatten gal took : 838 ms
[2022-05-20 19:16:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2022-05-20 19:16:20] [INFO ] Time to serialize gal into /tmp/LTLCardinality5102964795493870027.gal : 5 ms
[2022-05-20 19:16:20] [INFO ] Time to serialize properties into /tmp/LTLCardinality4864893558954685259.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/LTLCardinality5102964795493870027.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality4864893558954685259.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 : !((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...17312
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...17306
Compilation finished in 4232 ms.
Running link step : cd /tmp/ltsmin14982677183034135826;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin14982677183034135826;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.007: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.017: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.021: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.021: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.054: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.063: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.069: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.073: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.073: Initializing POR dependencies: labels 1004, guards 1000
pins2lts-mc-linux64( 4/ 8), 0.098: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.107: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.112: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.118: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 10.585: LTL layer: formula: <>([]((LTLAPp0==true)))
pins2lts-mc-linux64( 4/ 8), 10.585: "<>([]((LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 10.585: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 10.918: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 10.951: There are 1005 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 10.951: State length is 1301, there are 1004 groups
pins2lts-mc-linux64( 0/ 8), 10.951: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 10.951: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 10.951: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 10.951: Visible groups: 0 / 1004, labels: 1 / 1005
pins2lts-mc-linux64( 0/ 8), 10.951: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 10.951: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 0/ 8), 14.650: [Blue] ~85 levels ~960 states ~209928 transitions
pins2lts-mc-linux64( 0/ 8), 14.744: [Blue] ~85 levels ~1920 states ~213248 transitions
pins2lts-mc-linux64( 0/ 8), 14.906: [Blue] ~85 levels ~3840 states ~220968 transitions
pins2lts-mc-linux64( 0/ 8), 15.309: [Blue] ~85 levels ~7680 states ~238800 transitions
pins2lts-mc-linux64( 0/ 8), 16.045: [Blue] ~85 levels ~15360 states ~276040 transitions
pins2lts-mc-linux64( 0/ 8), 17.780: [Blue] ~86 levels ~30720 states ~363984 transitions
pins2lts-mc-linux64( 5/ 8), 21.100: [Blue] ~84 levels ~61440 states ~521704 transitions
pins2lts-mc-linux64( 5/ 8), 28.000: [Blue] ~85 levels ~122880 states ~878080 transitions
pins2lts-mc-linux64( 5/ 8), 41.637: [Blue] ~85 levels ~245760 states ~1622880 transitions
pins2lts-mc-linux64( 5/ 8), 71.168: [Blue] ~85 levels ~491520 states ~3237984 transitions
pins2lts-mc-linux64( 5/ 8), 130.323: [Blue] ~86 levels ~983040 states ~6573432 transitions
pins2lts-mc-linux64( 5/ 8), 257.878: [Blue] ~86 levels ~1966080 states ~14198944 transitions
pins2lts-mc-linux64( 5/ 8), 532.707: [Blue] ~86 levels ~3932160 states ~28303208 transitions
pins2lts-mc-linux64( 5/ 8), 1101.253: [Blue] ~86 levels ~7864320 states ~62205008 transitions
pins2lts-mc-linux64( 1/ 8), 1165.911: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1166.035:
pins2lts-mc-linux64( 0/ 8), 1166.035: Explored 7824883 states 65028963 transitions, fanout: 8.311
pins2lts-mc-linux64( 0/ 8), 1166.035: Total exploration time 1155.080 sec (1154.950 sec minimum, 1155.012 sec on average)
pins2lts-mc-linux64( 0/ 8), 1166.035: States per second: 6774, Transitions per second: 56298
pins2lts-mc-linux64( 0/ 8), 1166.035:
pins2lts-mc-linux64( 0/ 8), 1166.035: State space has 8028608 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 1166.035: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 1166.035: blue states: 7824883 (97.46%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 1166.035: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 1166.035: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 1166.035:
pins2lts-mc-linux64( 0/ 8), 1166.035: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 1166.035:
pins2lts-mc-linux64( 0/ 8), 1166.035: Queue width: 8B, total height: 710, memory: 0.01MB
pins2lts-mc-linux64( 0/ 8), 1166.035: Tree memory: 317.3MB, 41.4 B/state, compr.: 0.8%
pins2lts-mc-linux64( 0/ 8), 1166.035: Tree fill ratio (roots/leafs): 5.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 1166.036: Stored 1034 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1166.036: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1166.036: Est. total memory use: 317.3MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14982677183034135826;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14982677183034135826;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((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 19:40:43] [INFO ] Applying decomposition
[2022-05-20 19:40:44] [INFO ] Flatten gal took : 441 ms
[2022-05-20 19:40:44] [INFO ] Decomposing Gal with order
[2022-05-20 19:40:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 19:40:44] [INFO ] Removed a total of 2310 redundant transitions.
[2022-05-20 19:40:44] [INFO ] Flatten gal took : 157 ms
[2022-05-20 19:40:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 13 ms.
[2022-05-20 19:40:45] [INFO ] Time to serialize gal into /tmp/LTLCardinality9025087429924510137.gal : 31 ms
[2022-05-20 19:40:45] [INFO ] Time to serialize properties into /tmp/LTLCardinality9779085400219772330.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/LTLCardinality9025087429924510137.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality9779085400219772330.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 : !((F(G("((((((((gNN0.Rows_0+gNN1.Rows_1)+(gNN2.Rows_2+gNN3.Rows_3))+((gNN4.Rows_4+gNN5.Rows_5)+(gNN6.Rows_6+gNN7.Rows_7)))+(((gNN8.Row...21392
Formula 0 simplified : !FG"((((((((gNN0.Rows_0+gNN1.Rows_1)+(gNN2.Rows_2+gNN3.Rows_3))+((gNN4.Rows_4+gNN5.Rows_5)+(gNN6.Rows_6+gNN7.Rows_7)))+(((gNN8.Rows_...21386

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-AN10"
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-AN10, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r258-tall-165303545300115"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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