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-165303545300116.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 LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r258-tall-165303545300116
=====================================================================

--------------------
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-LTLFireability-00
FORMULA_NAME Sudoku-COL-AN10-LTLFireability-01
FORMULA_NAME Sudoku-COL-AN10-LTLFireability-02
FORMULA_NAME Sudoku-COL-AN10-LTLFireability-03
FORMULA_NAME Sudoku-COL-AN10-LTLFireability-04
FORMULA_NAME Sudoku-COL-AN10-LTLFireability-05
FORMULA_NAME Sudoku-COL-AN10-LTLFireability-06
FORMULA_NAME Sudoku-COL-AN10-LTLFireability-07
FORMULA_NAME Sudoku-COL-AN10-LTLFireability-08
FORMULA_NAME Sudoku-COL-AN10-LTLFireability-09
FORMULA_NAME Sudoku-COL-AN10-LTLFireability-10
FORMULA_NAME Sudoku-COL-AN10-LTLFireability-11
FORMULA_NAME Sudoku-COL-AN10-LTLFireability-12
FORMULA_NAME Sudoku-COL-AN10-LTLFireability-13
FORMULA_NAME Sudoku-COL-AN10-LTLFireability-14
FORMULA_NAME Sudoku-COL-AN10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653073441840

Running Version 202205111006
[2022-05-20 19:04:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -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:04:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 19:04:03] [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:04:03] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-20 19:04:03] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 497 ms
[2022-05-20 19:04:03] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 1300 PT places and 1000.0 transition bindings in 13 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
[2022-05-20 19:04:03] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 10 ms.
[2022-05-20 19:04:03] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
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).
All 16 properties of the HLPN use transition enablings in a way that makes the skeleton too coarse.
Domain [N(10), N(10)] of place Rows breaks symmetries in sort N
[2022-05-20 19:04:03] [INFO ] Unfolded HLPN to a Petri net with 1300 places and 1000 transitions 4000 arcs in 33 ms.
[2022-05-20 19:04:03] [INFO ] Unfolded 16 HLPN properties in 7 ms.
Initial state reduction rules removed 5 formulas.
FORMULA Sudoku-COL-AN10-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN10-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN10-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN10-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN10-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN10-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN10-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN10-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 300 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 26 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:04] [INFO ] Computed 29 place invariants in 83 ms
[2022-05-20 19:04:04] [INFO ] Implicit Places using invariants in 277 ms returned []
// Phase 1: matrix 1000 rows 300 cols
[2022-05-20 19:04:05] [INFO ] Computed 29 place invariants in 27 ms
[2022-05-20 19:04:05] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 642 ms to find 0 implicit places.
// Phase 1: matrix 1000 rows 300 cols
[2022-05-20 19:04:05] [INFO ] Computed 29 place invariants in 16 ms
[2022-05-20 19:04:05] [INFO ] Dead Transitions using invariants and state equation in 416 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.
Support contains 300 out of 300 places after structural reductions.
[2022-05-20 19:04:06] [INFO ] Flatten gal took : 299 ms
[2022-05-20 19:04:08] [INFO ] Flatten gal took : 339 ms
[2022-05-20 19:04:09] [INFO ] Input system was already deterministic with 1000 transitions.
Finished random walk after 86 steps, including 0 resets, run visited all 3 properties in 28 ms. (steps per millisecond=3 )
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).
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U G(X(X(X(p0))))))'
Support contains 300 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 3 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:04:10] [INFO ] Computed 29 place invariants in 21 ms
[2022-05-20 19:04:10] [INFO ] Implicit Places using invariants in 80 ms returned []
// Phase 1: matrix 1000 rows 300 cols
[2022-05-20 19:04:10] [INFO ] Computed 29 place invariants in 21 ms
[2022-05-20 19:04:10] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 365 ms to find 0 implicit places.
// Phase 1: matrix 1000 rows 300 cols
[2022-05-20 19:04:10] [INFO ] Computed 29 place invariants in 28 ms
[2022-05-20 19:04:11] [INFO ] Dead Transitions using invariants and state equation in 387 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 300/300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 278 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN10-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (AND (GEQ s15 1) (GEQ s119 1) (GEQ s295 1)) (AND (GEQ s82 1) (GEQ s181 1) (GEQ s212 1)) (AND (GEQ s24 1) (GEQ s121 1) (GEQ s214 1)) (AND (GEQ s73 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 85 steps with 0 reset in 12 ms.
FORMULA Sudoku-COL-AN10-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN10-LTLFireability-00 finished in 1124 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X(X(X(p0))))))'
Support contains 300 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 3 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:04:11] [INFO ] Computed 29 place invariants in 15 ms
[2022-05-20 19:04:11] [INFO ] Implicit Places using invariants in 74 ms returned []
// Phase 1: matrix 1000 rows 300 cols
[2022-05-20 19:04:11] [INFO ] Computed 29 place invariants in 19 ms
[2022-05-20 19:04:11] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
// Phase 1: matrix 1000 rows 300 cols
[2022-05-20 19:04:11] [INFO ] Computed 29 place invariants in 22 ms
[2022-05-20 19:04:12] [INFO ] Dead Transitions using invariants and state equation in 366 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 300/300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 186 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN10-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(OR (AND (GEQ s15 1) (GEQ s119 1) (GEQ s295 1)) (AND (GEQ s82 1) (GEQ s181 1) (GEQ s212 1)) (AND (GEQ s24 1) (GEQ s121 1) (GEQ s214 1)) (AND (GEQ s73 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration timeout after 84440 steps with 16888 reset in 10001 ms.
Product exploration timeout after 85750 steps with 17150 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 : [p0, true, (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 156 ms. Reduced automaton from 5 states, 5 edges and 1 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 297 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 85 steps, including 0 resets, run visited all 1 properties in 11 ms. (steps per millisecond=7 )
Knowledge obtained : [p0, true, (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 915 ms. Reduced automaton from 5 states, 5 edges and 1 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 181 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 192 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 300 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 4 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:04:38] [INFO ] Computed 29 place invariants in 18 ms
[2022-05-20 19:04:38] [INFO ] Implicit Places using invariants in 82 ms returned []
// Phase 1: matrix 1000 rows 300 cols
[2022-05-20 19:04:38] [INFO ] Computed 29 place invariants in 13 ms
[2022-05-20 19:04:38] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 354 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 14 ms
[2022-05-20 19:04:38] [INFO ] Dead Transitions using invariants and state equation in 336 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, true, (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 138 ms. Reduced automaton from 5 states, 5 edges and 1 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 86 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=10 )
Knowledge obtained : [p0, true, (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 155 ms. Reduced automaton from 5 states, 5 edges and 1 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 192 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 198 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration timeout after 77220 steps with 15444 reset in 10001 ms.
Product exploration timeout after 76870 steps with 15374 reset in 10001 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 187 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 300 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 10 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2022-05-20 19:05:04] [INFO ] Redundant transitions in 59 ms returned []
// Phase 1: matrix 1000 rows 300 cols
[2022-05-20 19:05:04] [INFO ] Computed 29 place invariants in 12 ms
[2022-05-20 19:05:04] [INFO ] Dead Transitions using invariants and state equation in 375 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 300/300 places, 1000/1000 transitions.
Product exploration timeout after 72510 steps with 14502 reset in 10001 ms.
Product exploration timeout after 72260 steps with 14452 reset in 10001 ms.
Built C files in :
/tmp/ltsmin1242917818781522543
[2022-05-20 19:05:24] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1242917818781522543
Running compilation step : cd /tmp/ltsmin1242917818781522543;'/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 2149 ms.
Running link step : cd /tmp/ltsmin1242917818781522543;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin1242917818781522543;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3966118772689430271.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 300 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 6 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:05:39] [INFO ] Computed 29 place invariants in 13 ms
[2022-05-20 19:05:39] [INFO ] Implicit Places using invariants in 94 ms returned []
// Phase 1: matrix 1000 rows 300 cols
[2022-05-20 19:05:39] [INFO ] Computed 29 place invariants in 17 ms
[2022-05-20 19:05:40] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 369 ms to find 0 implicit places.
// Phase 1: matrix 1000 rows 300 cols
[2022-05-20 19:05:40] [INFO ] Computed 29 place invariants in 16 ms
[2022-05-20 19:05:40] [INFO ] Dead Transitions using invariants and state equation in 380 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 300/300 places, 1000/1000 transitions.
Built C files in :
/tmp/ltsmin9280835164363015199
[2022-05-20 19:05:40] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9280835164363015199
Running compilation step : cd /tmp/ltsmin9280835164363015199;'/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 2119 ms.
Running link step : cd /tmp/ltsmin9280835164363015199;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin9280835164363015199;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2752175113130937338.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 19:05:56] [INFO ] Flatten gal took : 66 ms
[2022-05-20 19:05:56] [INFO ] Flatten gal took : 59 ms
[2022-05-20 19:05:56] [INFO ] Time to serialize gal into /tmp/LTL15833422324282005994.gal : 11 ms
[2022-05-20 19:05:56] [INFO ] Time to serialize properties into /tmp/LTL17615818837854710722.ltl : 241 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/LTL15833422324282005994.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17615818837854710722.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/LTL1583342...268
Read 1 LTL properties
Checking formula 0 : !((X(F(X(X(X("(((((((((((((Rows_15>=1)&&(Cells_19>=1))&&(Columns_95>=1))||(((Rows_82>=1)&&(Cells_81>=1))&&(Columns_12>=1)))||((((Rows_...51739
Formula 0 simplified : !XFXXX"(((((((((((((Rows_15>=1)&&(Cells_19>=1))&&(Columns_95>=1))||(((Rows_82>=1)&&(Cells_81>=1))&&(Columns_12>=1)))||((((Rows_24>=1...51727
Detected timeout of ITS tools.
[2022-05-20 19:06:11] [INFO ] Flatten gal took : 55 ms
[2022-05-20 19:06:11] [INFO ] Applying decomposition
[2022-05-20 19:06:11] [INFO ] Flatten gal took : 55 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph17479376468240145856.txt' '-o' '/tmp/graph17479376468240145856.bin' '-w' '/tmp/graph17479376468240145856.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17479376468240145856.bin' '-l' '-1' '-v' '-w' '/tmp/graph17479376468240145856.weights' '-q' '0' '-e' '0.001'
[2022-05-20 19:06:11] [INFO ] Decomposing Gal with order
[2022-05-20 19:06:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 19:06:12] [INFO ] Removed a total of 2700 redundant transitions.
[2022-05-20 19:06:12] [INFO ] Flatten gal took : 496 ms
[2022-05-20 19:06:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 11 ms.
[2022-05-20 19:06:12] [INFO ] Time to serialize gal into /tmp/LTL15114400004687571325.gal : 10 ms
[2022-05-20 19:06:12] [INFO ] Time to serialize properties into /tmp/LTL13566336894796120903.ltl : 9 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/LTL15114400004687571325.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13566336894796120903.ltl' '-c' '-stutter-deadlock'

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/LTL1511440...247
Read 1 LTL properties
Checking formula 0 : !((X(F(X(X(X("(((((((((((((u15.Rows_15>=1)&&(u119.Cells_19>=1))&&(u295.Columns_95>=1))||(((u82.Rows_82>=1)&&(u181.Cells_81>=1))&&(u212...65639
Formula 0 simplified : !XFXXX"(((((((((((((u15.Rows_15>=1)&&(u119.Cells_19>=1))&&(u295.Columns_95>=1))||(((u82.Rows_82>=1)&&(u181.Cells_81>=1))&&(u212.Colu...65627
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5378570092506856953
[2022-05-20 19:06:27] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5378570092506856953
Running compilation step : cd /tmp/ltsmin5378570092506856953;'/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 2024 ms.
Running link step : cd /tmp/ltsmin5378570092506856953;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin5378570092506856953;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(X(X(X((LTLAPp0==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Sudoku-COL-AN10-LTLFireability-03 finished in 151362 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F((G(X(p0)) U !X((p0 U p0))))&&p0)))'
Support contains 300 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 10 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:06:42] [INFO ] Computed 29 place invariants in 12 ms
[2022-05-20 19:06:42] [INFO ] Implicit Places using invariants in 79 ms returned []
// Phase 1: matrix 1000 rows 300 cols
[2022-05-20 19:06:42] [INFO ] Computed 29 place invariants in 18 ms
[2022-05-20 19:06:43] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 367 ms to find 0 implicit places.
[2022-05-20 19:06:43] [INFO ] Redundant transitions in 13 ms returned []
// Phase 1: matrix 1000 rows 300 cols
[2022-05-20 19:06:43] [INFO ] Computed 29 place invariants in 20 ms
[2022-05-20 19:06:43] [INFO ] Dead Transitions using invariants and state equation in 360 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 300/300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 88 ms :[true, p0]
Running random walk in product with property : Sudoku-COL-AN10-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s15 1) (GEQ s119 1) (GEQ s295 1)) (AND (GEQ s82 1) (GEQ s181 1) (GEQ s212 1)) (AND (GEQ s24 1) (GEQ s121 1) (GEQ s214 1)) (AND (GEQ s73 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1146 reset in 5631 ms.
Product exploration explored 100000 steps with 1147 reset in 5684 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 (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
Knowledge based reduction with 4 factoid took 101 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Sudoku-COL-AN10-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN10-LTLFireability-04 finished in 16445 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(X(p1))||p0)) U !p1))'
Support contains 300 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 3 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:06:59] [INFO ] Computed 29 place invariants in 13 ms
[2022-05-20 19:06:59] [INFO ] Implicit Places using invariants in 77 ms returned []
// Phase 1: matrix 1000 rows 300 cols
[2022-05-20 19:06:59] [INFO ] Computed 29 place invariants in 12 ms
[2022-05-20 19:06:59] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
// Phase 1: matrix 1000 rows 300 cols
[2022-05-20 19:06:59] [INFO ] Computed 29 place invariants in 14 ms
[2022-05-20 19:06:59] [INFO ] Dead Transitions using invariants and state equation in 331 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 300/300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 198 ms :[p1, (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), true]
Running random walk in product with property : Sudoku-COL-AN10-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=p1, acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (AND (GEQ s15 1) (GEQ s119 1) (GEQ s295 1)) (AND (GEQ s82 1) (GEQ s181 1) (GEQ s212 1)) (AND (GEQ s24 1) (GEQ s121 1) (GEQ s214 1)) (AND (GEQ s73 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 86 steps with 0 reset in 6 ms.
FORMULA Sudoku-COL-AN10-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN10-LTLFireability-05 finished in 952 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(!(F((F(X(p1))||p0)) U F(X(X(p1))))))'
Support contains 300 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 2 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:07:00] [INFO ] Computed 29 place invariants in 18 ms
[2022-05-20 19:07:00] [INFO ] Implicit Places using invariants in 100 ms returned []
// Phase 1: matrix 1000 rows 300 cols
[2022-05-20 19:07:00] [INFO ] Computed 29 place invariants in 28 ms
[2022-05-20 19:07:00] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
// Phase 1: matrix 1000 rows 300 cols
[2022-05-20 19:07:00] [INFO ] Computed 29 place invariants in 19 ms
[2022-05-20 19:07:00] [INFO ] Dead Transitions using invariants and state equation in 356 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 300/300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 413 ms :[true, p1, p1, p1]
Running random walk in product with property : Sudoku-COL-AN10-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(OR (AND (GEQ s15 1) (GEQ s119 1) (GEQ s295 1)) (AND (GEQ s82 1) (GEQ s181 1) (GEQ s212 1)) (AND (GEQ s24 1) (GEQ s121 1) (GEQ s214 1)) (AND (GEQ s73 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA Sudoku-COL-AN10-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN10-LTLFireability-06 finished in 1178 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(X(!(p0 U X(p0)))))))'
Support contains 300 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 11 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:07:01] [INFO ] Computed 29 place invariants in 15 ms
[2022-05-20 19:07:01] [INFO ] Implicit Places using invariants in 72 ms returned []
// Phase 1: matrix 1000 rows 300 cols
[2022-05-20 19:07:01] [INFO ] Computed 29 place invariants in 12 ms
[2022-05-20 19:07:01] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
[2022-05-20 19:07:01] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 1000 rows 300 cols
[2022-05-20 19:07:01] [INFO ] Computed 29 place invariants in 21 ms
[2022-05-20 19:07:01] [INFO ] Dead Transitions using invariants and state equation in 329 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 300/300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 30 ms :[p0]
Running random walk in product with property : Sudoku-COL-AN10-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s15 1) (GEQ s119 1) (GEQ s295 1)) (AND (GEQ s82 1) (GEQ s181 1) (GEQ s212 1)) (AND (GEQ s24 1) (GEQ s121 1) (GEQ s214 1)) (AND (GEQ s73 1...], 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 1148 reset in 5917 ms.
Product exploration explored 100000 steps with 1148 reset in 5941 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 (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
Knowledge based reduction with 4 factoid took 87 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Sudoku-COL-AN10-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN10-LTLFireability-11 finished in 16596 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U X(!(p0 U F(p0)))))'
Support contains 300 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 1 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:07:17] [INFO ] Computed 29 place invariants in 17 ms
[2022-05-20 19:07:17] [INFO ] Implicit Places using invariants in 73 ms returned []
// Phase 1: matrix 1000 rows 300 cols
[2022-05-20 19:07:17] [INFO ] Computed 29 place invariants in 13 ms
[2022-05-20 19:07:18] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 373 ms to find 0 implicit places.
// Phase 1: matrix 1000 rows 300 cols
[2022-05-20 19:07:18] [INFO ] Computed 29 place invariants in 12 ms
[2022-05-20 19:07:18] [INFO ] Dead Transitions using invariants and state equation in 450 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 300/300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 110 ms :[p0, p0, p0, true]
Running random walk in product with property : Sudoku-COL-AN10-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(OR (AND (GEQ s15 1) (GEQ s119 1) (GEQ s295 1)) (AND (GEQ s82 1) (GEQ s181 1) (GEQ s212 1)) (AND (GEQ s24 1) (GEQ s121 1) (GEQ s214 1)) (AND (GEQ s73 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1147 reset in 5838 ms.
Product exploration explored 100000 steps with 1147 reset in 5950 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 (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 140 ms. Reduced automaton from 4 states, 6 edges and 1 AP to 4 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 127 ms :[p0, p0, p0, true]
Finished random walk after 86 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=12 )
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 222 ms. Reduced automaton from 4 states, 6 edges and 1 AP to 4 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 108 ms :[p0, p0, p0, true]
Stuttering acceptance computed with spot in 99 ms :[p0, p0, p0, true]
// Phase 1: matrix 1000 rows 300 cols
[2022-05-20 19:07:37] [INFO ] Computed 29 place invariants in 19 ms
Could not prove EG p0
Support contains 300 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 2 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:07:52] [INFO ] Computed 29 place invariants in 14 ms
[2022-05-20 19:07:52] [INFO ] Implicit Places using invariants in 71 ms returned []
// Phase 1: matrix 1000 rows 300 cols
[2022-05-20 19:07:52] [INFO ] Computed 29 place invariants in 11 ms
[2022-05-20 19:07:52] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
// Phase 1: matrix 1000 rows 300 cols
[2022-05-20 19:07:52] [INFO ] Computed 29 place invariants in 12 ms
[2022-05-20 19:07:53] [INFO ] Dead Transitions using invariants and state equation in 385 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 (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 146 ms. Reduced automaton from 4 states, 6 edges and 1 AP to 4 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 102 ms :[p0, p0, p0, true]
Finished random walk after 87 steps, including 0 resets, run visited all 1 properties in 9 ms. (steps per millisecond=9 )
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 147 ms. Reduced automaton from 4 states, 6 edges and 1 AP to 4 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 103 ms :[p0, p0, p0, true]
Stuttering acceptance computed with spot in 105 ms :[p0, p0, p0, true]
// Phase 1: matrix 1000 rows 300 cols
[2022-05-20 19:07:58] [INFO ] Computed 29 place invariants in 17 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:878)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:518)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:686)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:652)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:356)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:322)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:78)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:686)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-20 19:08:13] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG p0
Could not prove EG p0
Stuttering acceptance computed with spot in 100 ms :[p0, p0, p0, true]
Product exploration explored 100000 steps with 1147 reset in 5863 ms.
Product exploration explored 100000 steps with 1146 reset in 6293 ms.
Applying partial POR strategy [true, true, false, true]
Stuttering acceptance computed with spot in 99 ms :[p0, p0, p0, true]
Support contains 300 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 6 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2022-05-20 19:08:26] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 1000 rows 300 cols
[2022-05-20 19:08:26] [INFO ] Computed 29 place invariants in 12 ms
[2022-05-20 19:08:26] [INFO ] Dead Transitions using invariants and state equation in 383 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 300/300 places, 1000/1000 transitions.
Product exploration explored 100000 steps with 1147 reset in 5895 ms.
Product exploration explored 100000 steps with 1145 reset in 5996 ms.
Built C files in :
/tmp/ltsmin587659665555178170
[2022-05-20 19:08:38] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin587659665555178170
Running compilation step : cd /tmp/ltsmin587659665555178170;'/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 2114 ms.
Running link step : cd /tmp/ltsmin587659665555178170;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin587659665555178170;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2464595799247030588.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 300 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 6 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:08:53] [INFO ] Computed 29 place invariants in 15 ms
[2022-05-20 19:08:53] [INFO ] Implicit Places using invariants in 85 ms returned []
// Phase 1: matrix 1000 rows 300 cols
[2022-05-20 19:08:53] [INFO ] Computed 29 place invariants in 15 ms
[2022-05-20 19:08:54] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
// Phase 1: matrix 1000 rows 300 cols
[2022-05-20 19:08:54] [INFO ] Computed 29 place invariants in 18 ms
[2022-05-20 19:08:54] [INFO ] Dead Transitions using invariants and state equation in 332 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 300/300 places, 1000/1000 transitions.
Built C files in :
/tmp/ltsmin752337982898037769
[2022-05-20 19:08:54] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin752337982898037769
Running compilation step : cd /tmp/ltsmin752337982898037769;'/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 2002 ms.
Running link step : cd /tmp/ltsmin752337982898037769;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin752337982898037769;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12508573565580420996.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 19:09:09] [INFO ] Flatten gal took : 70 ms
[2022-05-20 19:09:09] [INFO ] Flatten gal took : 68 ms
[2022-05-20 19:09:09] [INFO ] Time to serialize gal into /tmp/LTL788111384235012686.gal : 5 ms
[2022-05-20 19:09:09] [INFO ] Time to serialize properties into /tmp/LTL5216679235588143727.ltl : 13 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL788111384235012686.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5216679235588143727.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/LTL7881113...265
Read 1 LTL properties
Checking formula 0 : !(((X("(((((((((((((Rows_15>=1)&&(Cells_19>=1))&&(Columns_95>=1))||(((Rows_82>=1)&&(Cells_81>=1))&&(Columns_12>=1)))||((((Rows_24>=1)&...155142
Formula 0 simplified : !(X"(((((((((((((Rows_15>=1)&&(Cells_19>=1))&&(Columns_95>=1))||(((Rows_82>=1)&&(Cells_81>=1))&&(Columns_12>=1)))||((((Rows_24>=1)&&...155132
Detected timeout of ITS tools.
[2022-05-20 19:09:25] [INFO ] Flatten gal took : 79 ms
[2022-05-20 19:09:25] [INFO ] Applying decomposition
[2022-05-20 19:09:25] [INFO ] Flatten gal took : 76 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/graph11334457503611543322.txt' '-o' '/tmp/graph11334457503611543322.bin' '-w' '/tmp/graph11334457503611543322.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11334457503611543322.bin' '-l' '-1' '-v' '-w' '/tmp/graph11334457503611543322.weights' '-q' '0' '-e' '0.001'
[2022-05-20 19:09:25] [INFO ] Decomposing Gal with order
[2022-05-20 19:09:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 19:09:25] [INFO ] Removed a total of 2700 redundant transitions.
[2022-05-20 19:09:25] [INFO ] Flatten gal took : 123 ms
[2022-05-20 19:09:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2022-05-20 19:09:25] [INFO ] Time to serialize gal into /tmp/LTL17434327801959604879.gal : 7 ms
[2022-05-20 19:09:25] [INFO ] Time to serialize properties into /tmp/LTL14966680440464430035.ltl : 14 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17434327801959604879.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14966680440464430035.ltl' '-c' '-stutter-deadlock'

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/LTL1743432...247
Read 1 LTL properties
Checking formula 0 : !(((X("(((((((((((((u15.Rows_15>=1)&&(u119.Cells_19>=1))&&(u295.Columns_95>=1))||(((u82.Rows_82>=1)&&(u181.Cells_81>=1))&&(u212.Column...196842
Formula 0 simplified : !(X"(((((((((((((u15.Rows_15>=1)&&(u119.Cells_19>=1))&&(u295.Columns_95>=1))||(((u82.Rows_82>=1)&&(u181.Cells_81>=1))&&(u212.Columns...196832
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7620873095943598814
[2022-05-20 19:09:40] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7620873095943598814
Running compilation step : cd /tmp/ltsmin7620873095943598814;'/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 2028 ms.
Running link step : cd /tmp/ltsmin7620873095943598814;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin7620873095943598814;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X((LTLAPp0==true)) U X(!((LTLAPp0==true) U <>((LTLAPp0==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Sudoku-COL-AN10-LTLFireability-13 finished in 157766 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U !p0)&&(X(G(!(p0 U p0)))||X(X(!p0)))))'
Support contains 300 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 2 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:55] [INFO ] Computed 29 place invariants in 15 ms
[2022-05-20 19:09:55] [INFO ] Implicit Places using invariants in 71 ms returned []
// Phase 1: matrix 1000 rows 300 cols
[2022-05-20 19:09:55] [INFO ] Computed 29 place invariants in 12 ms
[2022-05-20 19:09:56] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 361 ms to find 0 implicit places.
// Phase 1: matrix 1000 rows 300 cols
[2022-05-20 19:09:56] [INFO ] Computed 29 place invariants in 15 ms
[2022-05-20 19:09:56] [INFO ] Dead Transitions using invariants and state equation in 359 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 300/300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 110 ms :[p0, p0, true, p0]
Running random walk in product with property : Sudoku-COL-AN10-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=3, aps=[p0:(OR (AND (GEQ s15 1) (GEQ s119 1) (GEQ s295 1)) (AND (GEQ s82 1) (GEQ s181 1) (GEQ s212 1)) (AND (GEQ s24 1) (GEQ s121 1) (GEQ s214 1)) (AND (GEQ s73 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA Sudoku-COL-AN10-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN10-LTLFireability-14 finished in 865 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X(X(X(p0))))))'
Found a CL insensitive property : Sudoku-COL-AN10-LTLFireability-03
Stuttering acceptance computed with spot in 230 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 300 out of 300 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 9 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:56] [INFO ] Computed 29 place invariants in 18 ms
[2022-05-20 19:09:56] [INFO ] Implicit Places using invariants in 88 ms returned []
// Phase 1: matrix 1000 rows 300 cols
[2022-05-20 19:09:56] [INFO ] Computed 29 place invariants in 14 ms
[2022-05-20 19:09:57] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
// Phase 1: matrix 1000 rows 300 cols
[2022-05-20 19:09:57] [INFO ] Computed 29 place invariants in 15 ms
[2022-05-20 19:09:57] [INFO ] Dead Transitions using invariants and state equation in 327 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 300/300 places, 1000/1000 transitions.
Running random walk in product with property : Sudoku-COL-AN10-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(OR (AND (GEQ s15 1) (GEQ s119 1) (GEQ s295 1)) (AND (GEQ s82 1) (GEQ s181 1) (GEQ s212 1)) (AND (GEQ s24 1) (GEQ s121 1) (GEQ s214 1)) (AND (GEQ s73 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration timeout after 77090 steps with 15418 reset in 10001 ms.
Product exploration timeout after 77030 steps with 15406 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 : [p0, true, (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 5 states, 5 edges and 1 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 87 steps, including 0 resets, run visited all 1 properties in 10 ms. (steps per millisecond=8 )
Knowledge obtained : [p0, true, (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 133 ms. Reduced automaton from 5 states, 5 edges and 1 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 207 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 460 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 300 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 2 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:22] [INFO ] Computed 29 place invariants in 12 ms
[2022-05-20 19:10:22] [INFO ] Implicit Places using invariants in 66 ms returned []
// Phase 1: matrix 1000 rows 300 cols
[2022-05-20 19:10:22] [INFO ] Computed 29 place invariants in 11 ms
[2022-05-20 19:10:22] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
// Phase 1: matrix 1000 rows 300 cols
[2022-05-20 19:10:22] [INFO ] Computed 29 place invariants in 15 ms
[2022-05-20 19:10:23] [INFO ] Dead Transitions using invariants and state equation in 390 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, true, (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 396 ms. Reduced automaton from 5 states, 5 edges and 1 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 87 steps, including 0 resets, run visited all 1 properties in 9 ms. (steps per millisecond=9 )
Knowledge obtained : [p0, true, (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 164 ms. Reduced automaton from 5 states, 5 edges and 1 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 166 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 158 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration timeout after 77260 steps with 15452 reset in 10002 ms.
Product exploration timeout after 76790 steps with 15358 reset in 10001 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 300 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 10 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2022-05-20 19:10:48] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 1000 rows 300 cols
[2022-05-20 19:10:48] [INFO ] Computed 29 place invariants in 12 ms
[2022-05-20 19:10:48] [INFO ] Dead Transitions using invariants and state equation in 346 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 300/300 places, 1000/1000 transitions.
Product exploration timeout after 71710 steps with 14342 reset in 10002 ms.
Product exploration timeout after 71310 steps with 14262 reset in 10001 ms.
Built C files in :
/tmp/ltsmin11203174578557572799
[2022-05-20 19:11:08] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11203174578557572799
Running compilation step : cd /tmp/ltsmin11203174578557572799;'/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 2125 ms.
Running link step : cd /tmp/ltsmin11203174578557572799;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin11203174578557572799;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2905993958173162630.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 300 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 2 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:23] [INFO ] Computed 29 place invariants in 13 ms
[2022-05-20 19:11:24] [INFO ] Implicit Places using invariants in 73 ms returned []
// Phase 1: matrix 1000 rows 300 cols
[2022-05-20 19:11:24] [INFO ] Computed 29 place invariants in 16 ms
[2022-05-20 19:11:24] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 389 ms to find 0 implicit places.
// Phase 1: matrix 1000 rows 300 cols
[2022-05-20 19:11:24] [INFO ] Computed 29 place invariants in 14 ms
[2022-05-20 19:11:24] [INFO ] Dead Transitions using invariants and state equation in 358 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 300/300 places, 1000/1000 transitions.
Built C files in :
/tmp/ltsmin1311386710486798625
[2022-05-20 19:11:24] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1311386710486798625
Running compilation step : cd /tmp/ltsmin1311386710486798625;'/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 2090 ms.
Running link step : cd /tmp/ltsmin1311386710486798625;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin1311386710486798625;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1199031803595676920.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 19:11:40] [INFO ] Flatten gal took : 46 ms
[2022-05-20 19:11:40] [INFO ] Flatten gal took : 45 ms
[2022-05-20 19:11:40] [INFO ] Time to serialize gal into /tmp/LTL4090705298872125800.gal : 5 ms
[2022-05-20 19:11:40] [INFO ] Time to serialize properties into /tmp/LTL13218321794528276735.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4090705298872125800.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13218321794528276735.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/LTL4090705...267
Read 1 LTL properties
Checking formula 0 : !((X(F(X(X(X("(((((((((((((Rows_15>=1)&&(Cells_19>=1))&&(Columns_95>=1))||(((Rows_82>=1)&&(Cells_81>=1))&&(Columns_12>=1)))||((((Rows_...51739
Formula 0 simplified : !XFXXX"(((((((((((((Rows_15>=1)&&(Cells_19>=1))&&(Columns_95>=1))||(((Rows_82>=1)&&(Cells_81>=1))&&(Columns_12>=1)))||((((Rows_24>=1...51727
Detected timeout of ITS tools.
[2022-05-20 19:11:55] [INFO ] Flatten gal took : 58 ms
[2022-05-20 19:11:55] [INFO ] Applying decomposition
[2022-05-20 19:11:55] [INFO ] Flatten gal took : 56 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph14503563226047285376.txt' '-o' '/tmp/graph14503563226047285376.bin' '-w' '/tmp/graph14503563226047285376.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14503563226047285376.bin' '-l' '-1' '-v' '-w' '/tmp/graph14503563226047285376.weights' '-q' '0' '-e' '0.001'
[2022-05-20 19:11:55] [INFO ] Decomposing Gal with order
[2022-05-20 19:11:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 19:11:55] [INFO ] Removed a total of 2700 redundant transitions.
[2022-05-20 19:11:55] [INFO ] Flatten gal took : 74 ms
[2022-05-20 19:11:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2022-05-20 19:11:55] [INFO ] Time to serialize gal into /tmp/LTL14820895291658177591.gal : 23 ms
[2022-05-20 19:11:55] [INFO ] Time to serialize properties into /tmp/LTL7712870539690339682.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14820895291658177591.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7712870539690339682.ltl' '-c' '-stutter-deadlock'

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/LTL1482089...246
Read 1 LTL properties
Checking formula 0 : !((X(F(X(X(X("(((((((((((((u15.Rows_15>=1)&&(u119.Cells_19>=1))&&(u295.Columns_95>=1))||(((u82.Rows_82>=1)&&(u181.Cells_81>=1))&&(u212...65639
Formula 0 simplified : !XFXXX"(((((((((((((u15.Rows_15>=1)&&(u119.Cells_19>=1))&&(u295.Columns_95>=1))||(((u82.Rows_82>=1)&&(u181.Cells_81>=1))&&(u212.Colu...65627
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4345273891963205799
[2022-05-20 19:12:10] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4345273891963205799
Running compilation step : cd /tmp/ltsmin4345273891963205799;'/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 2038 ms.
Running link step : cd /tmp/ltsmin4345273891963205799;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin4345273891963205799;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(X(X(X((LTLAPp0==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Sudoku-COL-AN10-LTLFireability-03 finished in 149202 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U X(!(p0 U F(p0)))))'
Found a SL insensitive property : Sudoku-COL-AN10-LTLFireability-13
Stuttering acceptance computed with spot in 97 ms :[p0, p0, p0, true]
Support contains 300 out of 300 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL 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:12:25] [INFO ] Computed 29 place invariants in 12 ms
[2022-05-20 19:12:25] [INFO ] Implicit Places using invariants in 66 ms returned []
// Phase 1: matrix 1000 rows 300 cols
[2022-05-20 19:12:25] [INFO ] Computed 29 place invariants in 12 ms
[2022-05-20 19:12:26] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
// Phase 1: matrix 1000 rows 300 cols
[2022-05-20 19:12:26] [INFO ] Computed 29 place invariants in 12 ms
[2022-05-20 19:12:26] [INFO ] Dead Transitions using invariants and state equation in 370 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 300/300 places, 1000/1000 transitions.
Running random walk in product with property : Sudoku-COL-AN10-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(OR (AND (GEQ s15 1) (GEQ s119 1) (GEQ s295 1)) (AND (GEQ s82 1) (GEQ s181 1) (GEQ s212 1)) (AND (GEQ s24 1) (GEQ s121 1) (GEQ s214 1)) (AND (GEQ s73 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1147 reset in 5970 ms.
Product exploration explored 100000 steps with 1147 reset in 5943 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 (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 126 ms. Reduced automaton from 4 states, 6 edges and 1 AP to 4 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 111 ms :[p0, p0, p0, true]
Finished random walk after 86 steps, including 0 resets, run visited all 1 properties in 11 ms. (steps per millisecond=7 )
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 160 ms. Reduced automaton from 4 states, 6 edges and 1 AP to 4 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 91 ms :[p0, p0, p0, true]
Stuttering acceptance computed with spot in 106 ms :[p0, p0, p0, true]
// Phase 1: matrix 1000 rows 300 cols
[2022-05-20 19:12:43] [INFO ] Computed 29 place invariants in 12 ms
Could not prove EG p0
Support contains 300 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 6 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:58] [INFO ] Computed 29 place invariants in 11 ms
[2022-05-20 19:12:59] [INFO ] Implicit Places using invariants in 144 ms returned []
// Phase 1: matrix 1000 rows 300 cols
[2022-05-20 19:12:59] [INFO ] Computed 29 place invariants in 12 ms
[2022-05-20 19:12:59] [INFO ] Implicit Places using invariants and state equation in 341 ms returned []
Implicit Place search using SMT with State Equation took 508 ms to find 0 implicit places.
// Phase 1: matrix 1000 rows 300 cols
[2022-05-20 19:12:59] [INFO ] Computed 29 place invariants in 12 ms
[2022-05-20 19:12:59] [INFO ] Dead Transitions using invariants and state equation in 408 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 (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 126 ms. Reduced automaton from 4 states, 6 edges and 1 AP to 4 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 112 ms :[p0, p0, p0, true]
Finished random walk after 85 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=12 )
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 147 ms. Reduced automaton from 4 states, 6 edges and 1 AP to 4 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 105 ms :[p0, p0, p0, true]
Stuttering acceptance computed with spot in 92 ms :[p0, p0, p0, true]
// Phase 1: matrix 1000 rows 300 cols
[2022-05-20 19:13:05] [INFO ] Computed 29 place invariants in 21 ms
Could not prove EG p0
Stuttering acceptance computed with spot in 109 ms :[p0, p0, p0, true]
Product exploration explored 100000 steps with 1147 reset in 5870 ms.
Product exploration explored 100000 steps with 1146 reset in 5954 ms.
Applying partial POR strategy [true, true, false, true]
Stuttering acceptance computed with spot in 102 ms :[p0, p0, p0, true]
Support contains 300 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 10 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2022-05-20 19:13:33] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 1000 rows 300 cols
[2022-05-20 19:13:33] [INFO ] Computed 29 place invariants in 12 ms
[2022-05-20 19:13:33] [INFO ] Dead Transitions using invariants and state equation in 358 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 300/300 places, 1000/1000 transitions.
Product exploration explored 100000 steps with 1147 reset in 5894 ms.
Product exploration explored 100000 steps with 1146 reset in 5989 ms.
Built C files in :
/tmp/ltsmin3016509428184561920
[2022-05-20 19:13:45] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3016509428184561920
Running compilation step : cd /tmp/ltsmin3016509428184561920;'/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 2087 ms.
Running link step : cd /tmp/ltsmin3016509428184561920;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin3016509428184561920;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased763653286044152896.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 300 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 3 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:14:00] [INFO ] Computed 29 place invariants in 11 ms
[2022-05-20 19:14:00] [INFO ] Implicit Places using invariants in 68 ms returned []
// Phase 1: matrix 1000 rows 300 cols
[2022-05-20 19:14:00] [INFO ] Computed 29 place invariants in 12 ms
[2022-05-20 19:14:00] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
// Phase 1: matrix 1000 rows 300 cols
[2022-05-20 19:14:00] [INFO ] Computed 29 place invariants in 13 ms
[2022-05-20 19:14:01] [INFO ] Dead Transitions using invariants and state equation in 341 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 300/300 places, 1000/1000 transitions.
Built C files in :
/tmp/ltsmin3437565869750542400
[2022-05-20 19:14:01] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3437565869750542400
Running compilation step : cd /tmp/ltsmin3437565869750542400;'/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 1992 ms.
Running link step : cd /tmp/ltsmin3437565869750542400;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin3437565869750542400;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14985539140451985290.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 19:14:16] [INFO ] Flatten gal took : 67 ms
[2022-05-20 19:14:16] [INFO ] Flatten gal took : 66 ms
[2022-05-20 19:14:16] [INFO ] Time to serialize gal into /tmp/LTL14240511710590575072.gal : 4 ms
[2022-05-20 19:14:16] [INFO ] Time to serialize properties into /tmp/LTL8540910438468301651.ltl : 18 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/LTL14240511710590575072.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8540910438468301651.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/LTL1424051...267
Read 1 LTL properties
Checking formula 0 : !(((X("(((((((((((((Rows_15>=1)&&(Cells_19>=1))&&(Columns_95>=1))||(((Rows_82>=1)&&(Cells_81>=1))&&(Columns_12>=1)))||((((Rows_24>=1)&...155142
Formula 0 simplified : !(X"(((((((((((((Rows_15>=1)&&(Cells_19>=1))&&(Columns_95>=1))||(((Rows_82>=1)&&(Cells_81>=1))&&(Columns_12>=1)))||((((Rows_24>=1)&&...155132
Detected timeout of ITS tools.
[2022-05-20 19:14:31] [INFO ] Flatten gal took : 68 ms
[2022-05-20 19:14:31] [INFO ] Applying decomposition
[2022-05-20 19:14:31] [INFO ] Flatten gal took : 66 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/graph18159295493540115878.txt' '-o' '/tmp/graph18159295493540115878.bin' '-w' '/tmp/graph18159295493540115878.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph18159295493540115878.bin' '-l' '-1' '-v' '-w' '/tmp/graph18159295493540115878.weights' '-q' '0' '-e' '0.001'
[2022-05-20 19:14:31] [INFO ] Decomposing Gal with order
[2022-05-20 19:14:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 19:14:32] [INFO ] Removed a total of 2700 redundant transitions.
[2022-05-20 19:14:32] [INFO ] Flatten gal took : 120 ms
[2022-05-20 19:14:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2022-05-20 19:14:32] [INFO ] Time to serialize gal into /tmp/LTL16386887003391046923.gal : 5 ms
[2022-05-20 19:14:32] [INFO ] Time to serialize properties into /tmp/LTL17078164334183957493.ltl : 11 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/LTL16386887003391046923.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17078164334183957493.ltl' '-c' '-stutter-deadlock'

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/LTL1638688...247
Read 1 LTL properties
Checking formula 0 : !(((X("(((((((((((((u15.Rows_15>=1)&&(u119.Cells_19>=1))&&(u295.Columns_95>=1))||(((u82.Rows_82>=1)&&(u181.Cells_81>=1))&&(u212.Column...196842
Formula 0 simplified : !(X"(((((((((((((u15.Rows_15>=1)&&(u119.Cells_19>=1))&&(u295.Columns_95>=1))||(((u82.Rows_82>=1)&&(u181.Cells_81>=1))&&(u212.Columns...196832
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17836030482179747953
[2022-05-20 19:14:47] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17836030482179747953
Running compilation step : cd /tmp/ltsmin17836030482179747953;'/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 2020 ms.
Running link step : cd /tmp/ltsmin17836030482179747953;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin17836030482179747953;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X((LTLAPp0==true)) U X(!((LTLAPp0==true) U <>((LTLAPp0==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Sudoku-COL-AN10-LTLFireability-13 finished in 156609 ms.
[2022-05-20 19:15:02] [INFO ] Flatten gal took : 75 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9015297489197673110
[2022-05-20 19:15:02] [INFO ] Computing symmetric may disable matrix : 1000 transitions.
[2022-05-20 19:15:02] [INFO ] Computation of Complete disable matrix. took 19 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 19:15:02] [INFO ] Applying decomposition
[2022-05-20 19:15:02] [INFO ] Computing symmetric may enable matrix : 1000 transitions.
[2022-05-20 19:15:02] [INFO ] Computation of Complete enable matrix. took 19 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 19:15:02] [INFO ] Flatten gal took : 75 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/graph17885853841637994158.txt' '-o' '/tmp/graph17885853841637994158.bin' '-w' '/tmp/graph17885853841637994158.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17885853841637994158.bin' '-l' '-1' '-v' '-w' '/tmp/graph17885853841637994158.weights' '-q' '0' '-e' '0.001'
[2022-05-20 19:15:02] [INFO ] Decomposing Gal with order
[2022-05-20 19:15:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 19:15:02] [INFO ] Removed a total of 2700 redundant transitions.
[2022-05-20 19:15:02] [INFO ] Flatten gal took : 174 ms
[2022-05-20 19:15:03] [INFO ] Computing Do-Not-Accords matrix : 1000 transitions.
[2022-05-20 19:15:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2022-05-20 19:15:03] [INFO ] Time to serialize gal into /tmp/LTLFireability17394442670305061340.gal : 19 ms
[2022-05-20 19:15:03] [INFO ] Computation of Completed DNA matrix. took 70 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 19:15:03] [INFO ] Time to serialize properties into /tmp/LTLFireability587936143551048275.ltl : 12 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/LTLFireability17394442670305061340.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability587936143551048275.ltl' '-c' '-stutter-deadlock'
[2022-05-20 19:15:03] [INFO ] Built C files in 668ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9015297489197673110
Running compilation step : cd /tmp/ltsmin9015297489197673110;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' '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'

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/LTLFireabi...267
Read 2 LTL properties
Checking formula 0 : !((X(F(X(X(X("(((((((((((((u15.Rows_15>=1)&&(u119.Cells_19>=1))&&(u295.Columns_95>=1))||(((u82.Rows_82>=1)&&(u181.Cells_81>=1))&&(u212...65639
Formula 0 simplified : !XFXXX"(((((((((((((u15.Rows_15>=1)&&(u119.Cells_19>=1))&&(u295.Columns_95>=1))||(((u82.Rows_82>=1)&&(u181.Cells_81>=1))&&(u212.Colu...65627
Compilation finished in 3763 ms.
Running link step : cd /tmp/ltsmin9015297489197673110;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin9015297489197673110;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(X(X(X((LTLAPp0==true))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.008: Loading model from ./gal.so
pins2lts-mc-linux64( 3/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.020: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.020: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.025: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.025: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.025: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.026: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.157: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.157: LTL layer: formula: X(<>(X(X(X((LTLAPp0==true))))))
pins2lts-mc-linux64( 3/ 8), 0.157: "X(<>(X(X(X((LTLAPp0==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.157: Using Spin LTL semantics
pins2lts-mc-linux64( 4/ 8), 0.215: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.269: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.278: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.317: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.317: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.318: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.321: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.384: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.584: DFS-FIFO for weak LTL, using special progress label 1002
pins2lts-mc-linux64( 0/ 8), 0.584: There are 1003 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.584: State length is 301, there are 1005 groups
pins2lts-mc-linux64( 0/ 8), 0.584: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.584: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.584: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.584: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 24.270: ~1 levels ~960 states ~933344 transitions
pins2lts-mc-linux64( 0/ 8), 32.754: ~1 levels ~1920 states ~1866464 transitions
pins2lts-mc-linux64( 0/ 8), 39.550: ~1 levels ~3840 states ~3732704 transitions
pins2lts-mc-linux64( 0/ 8), 48.999: ~1 levels ~7680 states ~7361872 transitions
pins2lts-mc-linux64( 0/ 8), 68.047: ~1 levels ~15360 states ~14615856 transitions
pins2lts-mc-linux64( 0/ 8), 117.740: ~1 levels ~30720 states ~29123744 transitions
pins2lts-mc-linux64( 1/ 8), 240.320: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 271.387:
pins2lts-mc-linux64( 0/ 8), 271.388: mean standard work distribution: 2.3% (states) 2.3% (transitions)
pins2lts-mc-linux64( 0/ 8), 271.388:
pins2lts-mc-linux64( 0/ 8), 271.388: Explored 58378 states 55163828 transitions, fanout: 944.942
pins2lts-mc-linux64( 0/ 8), 271.388: Total exploration time 270.780 sec (245.900 sec minimum, 256.454 sec on average)
pins2lts-mc-linux64( 0/ 8), 271.388: States per second: 216, Transitions per second: 203722
pins2lts-mc-linux64( 0/ 8), 271.388:
pins2lts-mc-linux64( 0/ 8), 271.388: Progress states detected: 37154917
pins2lts-mc-linux64( 0/ 8), 271.388: Redundant explorations: -99.8429
pins2lts-mc-linux64( 0/ 8), 271.388:
pins2lts-mc-linux64( 0/ 8), 271.388: Queue width: 8B, total height: 37581624, memory: 286.73MB
pins2lts-mc-linux64( 0/ 8), 271.388: Tree memory: 539.5MB, 15.2 B/state, compr.: 1.3%
pins2lts-mc-linux64( 0/ 8), 271.388: Tree fill ratio (roots/leafs): 27.0%/100.0%
pins2lts-mc-linux64( 0/ 8), 271.388: Stored 1017 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 271.389: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 271.389: Est. total memory use: 826.2MB (~1310.7MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9015297489197673110;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(X(X(X((LTLAPp0==true))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9015297489197673110;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(X(X(X((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)
ITS-tools command line returned an error code 137
[2022-05-20 19:27:20] [INFO ] Applying decomposition
[2022-05-20 19:27:20] [INFO ] Flatten gal took : 233 ms
[2022-05-20 19:27:20] [INFO ] Decomposing Gal with order
[2022-05-20 19:27:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 19:27:21] [INFO ] Removed a total of 2310 redundant transitions.
[2022-05-20 19:27:21] [INFO ] Flatten gal took : 507 ms
[2022-05-20 19:27:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 10 ms.
[2022-05-20 19:27:22] [INFO ] Time to serialize gal into /tmp/LTLFireability398369741515793789.gal : 35 ms
[2022-05-20 19:27:22] [INFO ] Time to serialize properties into /tmp/LTLFireability11092582461249325117.ltl : 116 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/LTLFireability398369741515793789.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11092582461249325117.ltl' '-c' '-stutter-deadlock'

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/LTLFireabi...267
Read 2 LTL properties
Checking formula 0 : !((X(F(X(X(X("(((((((((((((NN15.Rows_15>=1)&&(NN19.Cells_19>=1))&&(NN95.Columns_95>=1))||(((NN82.Rows_82>=1)&&(NN81.Cells_81>=1))&&(NN...66439
Formula 0 simplified : !XFXXX"(((((((((((((NN15.Rows_15>=1)&&(NN19.Cells_19>=1))&&(NN95.Columns_95>=1))||(((NN82.Rows_82>=1)&&(NN81.Cells_81>=1))&&(NN12.Co...66427
ITS-tools command line returned an error code 137
[2022-05-20 19:37:12] [INFO ] Flatten gal took : 296 ms
[2022-05-20 19:37:13] [INFO ] Input system was already deterministic with 1000 transitions.
[2022-05-20 19:37:13] [INFO ] Transformed 300 places.
[2022-05-20 19:37:13] [INFO ] Transformed 1000 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
java.lang.NullPointerException
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.computeOrderWithGreatSPN(MultiOrderRunner.java:57)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:135)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:737)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-20 19:37:14] [INFO ] Time to serialize gal into /tmp/LTLFireability13624067338491333715.gal : 10 ms
[2022-05-20 19:37:14] [INFO ] Time to serialize properties into /tmp/LTLFireability12488519545768228520.ltl : 57 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/LTLFireability13624067338491333715.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12488519545768228520.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...335
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(F(X(X(X("(((((((((((((Rows_15>=1)&&(Cells_19>=1))&&(Columns_95>=1))||(((Rows_82>=1)&&(Cells_81>=1))&&(Columns_12>=1)))||((((Rows_...51739
Formula 0 simplified : !XFXXX"(((((((((((((Rows_15>=1)&&(Cells_19>=1))&&(Columns_95>=1))||(((Rows_82>=1)&&(Cells_81>=1))&&(Columns_12>=1)))||((((Rows_24>=1...51727
ITS-tools command line returned an error code 137
Total runtime 2800460 ms.

BK_STOP 1653076245257

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 LTLFireability -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="LTLFireability"
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 LTLFireability"
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-165303545300116"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;