About the Execution of ITS-Tools for Sudoku-COL-AN08
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16214.268 | 3600000.00 | 4215553.00 | 470816.10 | ?TFTTFTFFFFTTTFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r258-tall-165303545300100.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-AN08, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r258-tall-165303545300100
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 208K
-rw-r--r-- 1 mcc users 5.8K Apr 30 12:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Apr 30 12:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Apr 30 12:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 34K Apr 30 12:30 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.6K May 9 09:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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.7K 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-AN08-LTLFireability-00
FORMULA_NAME Sudoku-COL-AN08-LTLFireability-01
FORMULA_NAME Sudoku-COL-AN08-LTLFireability-02
FORMULA_NAME Sudoku-COL-AN08-LTLFireability-03
FORMULA_NAME Sudoku-COL-AN08-LTLFireability-04
FORMULA_NAME Sudoku-COL-AN08-LTLFireability-05
FORMULA_NAME Sudoku-COL-AN08-LTLFireability-06
FORMULA_NAME Sudoku-COL-AN08-LTLFireability-07
FORMULA_NAME Sudoku-COL-AN08-LTLFireability-08
FORMULA_NAME Sudoku-COL-AN08-LTLFireability-09
FORMULA_NAME Sudoku-COL-AN08-LTLFireability-10
FORMULA_NAME Sudoku-COL-AN08-LTLFireability-11
FORMULA_NAME Sudoku-COL-AN08-LTLFireability-12
FORMULA_NAME Sudoku-COL-AN08-LTLFireability-13
FORMULA_NAME Sudoku-COL-AN08-LTLFireability-14
FORMULA_NAME Sudoku-COL-AN08-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1653069744675
Running Version 202205111006
[2022-05-20 18:02:25] [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 18:02:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 18:02:26] [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 18:02:26] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-20 18:02:26] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 503 ms
[2022-05-20 18:02:26] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 704 PT places and 512.0 transition bindings in 14 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2022-05-20 18:02:26] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 8 ms.
[2022-05-20 18:02:26] [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(8), N(8)] of place Rows breaks symmetries in sort N
[2022-05-20 18:02:26] [INFO ] Unfolded HLPN to a Petri net with 704 places and 512 transitions 2048 arcs in 27 ms.
[2022-05-20 18:02:26] [INFO ] Unfolded 16 HLPN properties in 5 ms.
Initial state reduction rules removed 2 formulas.
FORMULA Sudoku-COL-AN08-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN08-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN08-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 192 out of 704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Reduce places removed 512 places and 0 transitions.
Iterating post reduction 0 with 512 rules applied. Total rules applied 512 place count 192 transition count 512
Applied a total of 512 rules in 15 ms. Remains 192 /704 variables (removed 512) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 192 cols
[2022-05-20 18:02:27] [INFO ] Computed 23 place invariants in 35 ms
[2022-05-20 18:02:27] [INFO ] Implicit Places using invariants in 169 ms returned []
// Phase 1: matrix 512 rows 192 cols
[2022-05-20 18:02:27] [INFO ] Computed 23 place invariants in 21 ms
[2022-05-20 18:02:27] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 413 ms to find 0 implicit places.
// Phase 1: matrix 512 rows 192 cols
[2022-05-20 18:02:27] [INFO ] Computed 23 place invariants in 11 ms
[2022-05-20 18:02:28] [INFO ] Dead Transitions using invariants and state equation in 258 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 192/704 places, 512/512 transitions.
Finished structural reductions, in 1 iterations. Remains : 192/704 places, 512/512 transitions.
Support contains 192 out of 192 places after structural reductions.
[2022-05-20 18:02:28] [INFO ] Flatten gal took : 290 ms
[2022-05-20 18:02:30] [INFO ] Flatten gal took : 235 ms
[2022-05-20 18:02:31] [INFO ] Input system was already deterministic with 512 transitions.
Incomplete random walk after 10000 steps, including 179 resets, run finished after 447 ms. (steps per millisecond=22 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1714 ms. (steps per millisecond=5 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 512 rows 192 cols
[2022-05-20 18:02:34] [INFO ] Computed 23 place invariants in 13 ms
[2022-05-20 18:02:35] [INFO ] After 137ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA Sudoku-COL-AN08-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 192 stabilizing places and 512 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 192 transition count 512
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' '!((p0 U G(X(!(X(p0) U p0)))))'
Support contains 192 out of 192 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 192/192 places, 512/512 transitions.
Applied a total of 0 rules in 7 ms. Remains 192 /192 variables (removed 0) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 192 cols
[2022-05-20 18:02:36] [INFO ] Computed 23 place invariants in 6 ms
[2022-05-20 18:02:36] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 512 rows 192 cols
[2022-05-20 18:02:36] [INFO ] Computed 23 place invariants in 8 ms
[2022-05-20 18:02:37] [INFO ] Implicit Places using invariants and state equation in 1133 ms returned []
Implicit Place search using SMT with State Equation took 1188 ms to find 0 implicit places.
[2022-05-20 18:02:37] [INFO ] Redundant transitions in 32 ms returned []
// Phase 1: matrix 512 rows 192 cols
[2022-05-20 18:02:37] [INFO ] Computed 23 place invariants in 6 ms
[2022-05-20 18:02:37] [INFO ] Dead Transitions using invariants and state equation in 432 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 192/192 places, 512/512 transitions.
Stuttering acceptance computed with spot in 203 ms :[true, p0, p0]
Running random walk in product with property : Sudoku-COL-AN08-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (GEQ s39 1) (GEQ s103 1) (GEQ s191 1)) (AND (GEQ s51 1) (GEQ s116 1) (GEQ s163 1)) (AND (GEQ s12 1) (GEQ s72 1) (GEQ s132 1)) (AND (GEQ s38 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1796 reset in 3337 ms.
Product exploration explored 100000 steps with 1796 reset in 3249 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 192 transition count 512
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), true, (X (X p0)), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 207 ms. Reduced automaton from 3 states, 5 edges and 1 AP to 3 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 75 ms :[p0, true, p0]
Finished random walk after 56 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=14 )
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 225 ms. Reduced automaton from 3 states, 5 edges and 1 AP to 3 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 79 ms :[p0, true, p0]
Stuttering acceptance computed with spot in 77 ms :[p0, true, p0]
// Phase 1: matrix 512 rows 192 cols
[2022-05-20 18:02:46] [INFO ] Computed 23 place invariants in 19 ms
[2022-05-20 18:02:52] [INFO ] [Real]Absence check using 0 positive and 23 generalized place invariants in 38 ms returned sat
[2022-05-20 18:02:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 18:02:53] [INFO ] [Real]Absence check using state equation in 940 ms returned sat
[2022-05-20 18:02:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 18:02:58] [INFO ] [Nat]Absence check using 0 positive and 23 generalized place invariants in 21 ms returned sat
[2022-05-20 18:02:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 18:02:59] [INFO ] [Nat]Absence check using state equation in 375 ms returned sat
[2022-05-20 18:02:59] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 28 ms.
[2022-05-20 18:02:59] [INFO ] Added : 0 causal constraints over 0 iterations in 87 ms. Result :sat
Could not prove EG p0
Support contains 192 out of 192 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 192/192 places, 512/512 transitions.
Applied a total of 0 rules in 14 ms. Remains 192 /192 variables (removed 0) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 192 cols
[2022-05-20 18:02:59] [INFO ] Computed 23 place invariants in 10 ms
[2022-05-20 18:02:59] [INFO ] Implicit Places using invariants in 64 ms returned []
// Phase 1: matrix 512 rows 192 cols
[2022-05-20 18:02:59] [INFO ] Computed 23 place invariants in 7 ms
[2022-05-20 18:02:59] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
[2022-05-20 18:02:59] [INFO ] Redundant transitions in 41 ms returned []
// Phase 1: matrix 512 rows 192 cols
[2022-05-20 18:02:59] [INFO ] Computed 23 place invariants in 13 ms
[2022-05-20 18:02:59] [INFO ] Dead Transitions using invariants and state equation in 201 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 192/192 places, 512/512 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 192 transition count 512
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)), true, (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 236 ms. Reduced automaton from 3 states, 5 edges and 1 AP to 3 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 71 ms :[p0, true, p0]
Finished random walk after 55 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=13 )
Knowledge obtained : [p0, (X p0), (X (X p0)), true, (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 195 ms. Reduced automaton from 3 states, 5 edges and 1 AP to 3 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 82 ms :[p0, true, p0]
Stuttering acceptance computed with spot in 74 ms :[p0, true, p0]
// Phase 1: matrix 512 rows 192 cols
[2022-05-20 18:03:01] [INFO ] Computed 23 place invariants in 13 ms
[2022-05-20 18:03:07] [INFO ] [Real]Absence check using 0 positive and 23 generalized place invariants in 29 ms returned sat
[2022-05-20 18:03:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 18:03:08] [INFO ] [Real]Absence check using state equation in 950 ms returned sat
[2022-05-20 18:03:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 18:03:14] [INFO ] [Nat]Absence check using 0 positive and 23 generalized place invariants in 20 ms returned sat
[2022-05-20 18:03:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 18:03:14] [INFO ] [Nat]Absence check using state equation in 370 ms returned sat
[2022-05-20 18:03:14] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 25 ms.
[2022-05-20 18:03:14] [INFO ] Added : 0 causal constraints over 0 iterations in 89 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 79 ms :[p0, true, p0]
Product exploration explored 100000 steps with 1799 reset in 3272 ms.
Product exploration explored 100000 steps with 1797 reset in 3228 ms.
Built C files in :
/tmp/ltsmin18163465595471284395
[2022-05-20 18:03:21] [INFO ] Computing symmetric may disable matrix : 512 transitions.
[2022-05-20 18:03:21] [INFO ] Computation of Complete disable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 18:03:21] [INFO ] Computing symmetric may enable matrix : 512 transitions.
[2022-05-20 18:03:21] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 18:03:21] [INFO ] Computing Do-Not-Accords matrix : 512 transitions.
[2022-05-20 18:03:21] [INFO ] Computation of Completed DNA matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 18:03:21] [INFO ] Built C files in 145ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18163465595471284395
Running compilation step : cd /tmp/ltsmin18163465595471284395;'/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 1398 ms.
Running link step : cd /tmp/ltsmin18163465595471284395;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin18163465595471284395;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16753846532184421905.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 192 out of 192 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 192/192 places, 512/512 transitions.
Applied a total of 0 rules in 7 ms. Remains 192 /192 variables (removed 0) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 192 cols
[2022-05-20 18:03:36] [INFO ] Computed 23 place invariants in 10 ms
[2022-05-20 18:03:36] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 512 rows 192 cols
[2022-05-20 18:03:36] [INFO ] Computed 23 place invariants in 14 ms
[2022-05-20 18:03:36] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
[2022-05-20 18:03:36] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 512 rows 192 cols
[2022-05-20 18:03:36] [INFO ] Computed 23 place invariants in 8 ms
[2022-05-20 18:03:36] [INFO ] Dead Transitions using invariants and state equation in 190 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 192/192 places, 512/512 transitions.
Built C files in :
/tmp/ltsmin13719757769132961617
[2022-05-20 18:03:37] [INFO ] Computing symmetric may disable matrix : 512 transitions.
[2022-05-20 18:03:37] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 18:03:37] [INFO ] Computing symmetric may enable matrix : 512 transitions.
[2022-05-20 18:03:37] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 18:03:37] [INFO ] Computing Do-Not-Accords matrix : 512 transitions.
[2022-05-20 18:03:37] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 18:03:37] [INFO ] Built C files in 91ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13719757769132961617
Running compilation step : cd /tmp/ltsmin13719757769132961617;'/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 1283 ms.
Running link step : cd /tmp/ltsmin13719757769132961617;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin13719757769132961617;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6254303764187340677.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 18:03:52] [INFO ] Flatten gal took : 50 ms
[2022-05-20 18:03:52] [INFO ] Flatten gal took : 47 ms
[2022-05-20 18:03:52] [INFO ] Time to serialize gal into /tmp/LTL17029594630866434759.gal : 8 ms
[2022-05-20 18:03:52] [INFO ] Time to serialize properties into /tmp/LTL6044864274804855292.ltl : 16 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/LTL17029594630866434759.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6044864274804855292.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/LTL1702959...267
Read 1 LTL properties
Checking formula 0 : !((("((((((((((((Rows_39>=1)&&(Cells_39>=1))&&(Columns_63>=1))||(((Rows_51>=1)&&(Cells_52>=1))&&(Columns_35>=1)))||((((Rows_12>=1)&&(C...79194
Formula 0 simplified : !("((((((((((((Rows_39>=1)&&(Cells_39>=1))&&(Columns_63>=1))||(((Rows_51>=1)&&(Cells_52>=1))&&(Columns_35>=1)))||((((Rows_12>=1)&&(C...79184
Detected timeout of ITS tools.
[2022-05-20 18:04:07] [INFO ] Flatten gal took : 45 ms
[2022-05-20 18:04:07] [INFO ] Applying decomposition
[2022-05-20 18:04:07] [INFO ] Flatten gal took : 41 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/graph3708511436839387770.txt' '-o' '/tmp/graph3708511436839387770.bin' '-w' '/tmp/graph3708511436839387770.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3708511436839387770.bin' '-l' '-1' '-v' '-w' '/tmp/graph3708511436839387770.weights' '-q' '0' '-e' '0.001'
[2022-05-20 18:04:07] [INFO ] Decomposing Gal with order
[2022-05-20 18:04:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 18:04:08] [INFO ] Removed a total of 1344 redundant transitions.
[2022-05-20 18:04:08] [INFO ] Flatten gal took : 146 ms
[2022-05-20 18:04:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2022-05-20 18:04:08] [INFO ] Time to serialize gal into /tmp/LTL12441702193966190699.gal : 6 ms
[2022-05-20 18:04:08] [INFO ] Time to serialize properties into /tmp/LTL779757576264375935.ltl : 10 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/LTL12441702193966190699.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL779757576264375935.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/LTL1244170...245
Read 1 LTL properties
Checking formula 0 : !((("((((((((((((u39.Rows_39>=1)&&(u103.Cells_39>=1))&&(u191.Columns_63>=1))||(((u51.Rows_51>=1)&&(u116.Cells_52>=1))&&(u163.Columns_3...99594
Formula 0 simplified : !("((((((((((((u39.Rows_39>=1)&&(u103.Cells_39>=1))&&(u191.Columns_63>=1))||(((u51.Rows_51>=1)&&(u116.Cells_52>=1))&&(u163.Columns_3...99584
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10291795644148844374
[2022-05-20 18:04:23] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10291795644148844374
Running compilation step : cd /tmp/ltsmin10291795644148844374;'/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 961 ms.
Running link step : cd /tmp/ltsmin10291795644148844374;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin10291795644148844374;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((LTLAPp0==true) U [](X(!(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-AN08-LTLFireability-00 finished in 122413 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(!(X(!p0) U X((F(p0)&&p0)))))'
Support contains 192 out of 192 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 192/192 places, 512/512 transitions.
Applied a total of 0 rules in 6 ms. Remains 192 /192 variables (removed 0) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 192 cols
[2022-05-20 18:04:38] [INFO ] Computed 23 place invariants in 9 ms
[2022-05-20 18:04:38] [INFO ] Implicit Places using invariants in 76 ms returned []
// Phase 1: matrix 512 rows 192 cols
[2022-05-20 18:04:38] [INFO ] Computed 23 place invariants in 12 ms
[2022-05-20 18:04:38] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
[2022-05-20 18:04:38] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 512 rows 192 cols
[2022-05-20 18:04:38] [INFO ] Computed 23 place invariants in 6 ms
[2022-05-20 18:04:38] [INFO ] Dead Transitions using invariants and state equation in 190 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 192/192 places, 512/512 transitions.
Stuttering acceptance computed with spot in 31 ms :[p0]
Running random walk in product with property : Sudoku-COL-AN08-LTLFireability-01 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 s39 1) (GEQ s103 1) (GEQ s191 1)) (AND (GEQ s51 1) (GEQ s116 1) (GEQ s163 1)) (AND (GEQ s12 1) (GEQ s72 1) (GEQ s132 1)) (AND (GEQ s38 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 1797 reset in 3208 ms.
Product exploration explored 100000 steps with 1799 reset in 3246 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 192 transition count 512
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 93 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Sudoku-COL-AN08-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN08-LTLFireability-01 finished in 7916 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F(X(G(p0))))))'
Support contains 192 out of 192 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 192/192 places, 512/512 transitions.
Applied a total of 0 rules in 7 ms. Remains 192 /192 variables (removed 0) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 192 cols
[2022-05-20 18:04:46] [INFO ] Computed 23 place invariants in 11 ms
[2022-05-20 18:04:46] [INFO ] Implicit Places using invariants in 60 ms returned []
// Phase 1: matrix 512 rows 192 cols
[2022-05-20 18:04:46] [INFO ] Computed 23 place invariants in 7 ms
[2022-05-20 18:04:46] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
[2022-05-20 18:04:46] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 512 rows 192 cols
[2022-05-20 18:04:46] [INFO ] Computed 23 place invariants in 7 ms
[2022-05-20 18:04:46] [INFO ] Dead Transitions using invariants and state equation in 182 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 192/192 places, 512/512 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN08-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s39 1) (GEQ s103 1) (GEQ s191 1)) (AND (GEQ s51 1) (GEQ s116 1) (GEQ s163 1)) (AND (GEQ s12 1) (GEQ s72 1) (GEQ s132 1)) (AND (GEQ s38 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 54 steps with 0 reset in 4 ms.
FORMULA Sudoku-COL-AN08-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN08-LTLFireability-02 finished in 499 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(X((X(!(G(X(p0)) U p0))||!p0))))))'
Support contains 192 out of 192 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 192/192 places, 512/512 transitions.
Applied a total of 0 rules in 6 ms. Remains 192 /192 variables (removed 0) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 192 cols
[2022-05-20 18:04:46] [INFO ] Computed 23 place invariants in 13 ms
[2022-05-20 18:04:46] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 512 rows 192 cols
[2022-05-20 18:04:46] [INFO ] Computed 23 place invariants in 7 ms
[2022-05-20 18:04:47] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
[2022-05-20 18:04:47] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 512 rows 192 cols
[2022-05-20 18:04:47] [INFO ] Computed 23 place invariants in 13 ms
[2022-05-20 18:04:47] [INFO ] Dead Transitions using invariants and state equation in 202 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 192/192 places, 512/512 transitions.
Stuttering acceptance computed with spot in 71 ms :[p0, p0]
Running random walk in product with property : Sudoku-COL-AN08-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s39 1) (GEQ s103 1) (GEQ s191 1)) (AND (GEQ s51 1) (GEQ s116 1) (GEQ s163 1)) (AND (GEQ s12 1) (GEQ s72 1) (GEQ s132 1)) (AND (GEQ s38 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1799 reset in 2971 ms.
Product exploration explored 100000 steps with 1799 reset in 2994 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 192 transition count 512
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 2 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Sudoku-COL-AN08-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN08-LTLFireability-03 finished in 7457 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((F(X(p0))&&p0))&&G(p0))))'
Support contains 192 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 512/512 transitions.
Applied a total of 0 rules in 4 ms. Remains 192 /192 variables (removed 0) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 192 cols
[2022-05-20 18:04:54] [INFO ] Computed 23 place invariants in 8 ms
[2022-05-20 18:04:54] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 512 rows 192 cols
[2022-05-20 18:04:54] [INFO ] Computed 23 place invariants in 13 ms
[2022-05-20 18:04:54] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
// Phase 1: matrix 512 rows 192 cols
[2022-05-20 18:04:54] [INFO ] Computed 23 place invariants in 12 ms
[2022-05-20 18:04:54] [INFO ] Dead Transitions using invariants and state equation in 202 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 192/192 places, 512/512 transitions.
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN08-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (GEQ s39 1) (GEQ s103 1) (GEQ s191 1)) (AND (GEQ s51 1) (GEQ s116 1) (GEQ s163 1)) (AND (GEQ s12 1) (GEQ s72 1) (GEQ s132 1)) (AND (GEQ s38 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 54 steps with 0 reset in 7 ms.
FORMULA Sudoku-COL-AN08-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN08-LTLFireability-05 finished in 541 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((F(X(p1))&&p0))||X(F(!p1))))'
Support contains 192 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 512/512 transitions.
Applied a total of 0 rules in 2 ms. Remains 192 /192 variables (removed 0) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 192 cols
[2022-05-20 18:04:54] [INFO ] Computed 23 place invariants in 7 ms
[2022-05-20 18:04:54] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 512 rows 192 cols
[2022-05-20 18:04:54] [INFO ] Computed 23 place invariants in 11 ms
[2022-05-20 18:04:54] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
// Phase 1: matrix 512 rows 192 cols
[2022-05-20 18:04:55] [INFO ] Computed 23 place invariants in 7 ms
[2022-05-20 18:04:55] [INFO ] Dead Transitions using invariants and state equation in 190 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 192/192 places, 512/512 transitions.
Stuttering acceptance computed with spot in 102 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : Sudoku-COL-AN08-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(OR (AND (GEQ s39 1) (GEQ s103 1) (GEQ s191 1)) (AND (GEQ s51 1) (GEQ s116 1) (GEQ s163 1)) (AND (GEQ s12 1) (GEQ s72 1) (GEQ s132 1)) (AND (GEQ s38 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][false, false, false]]
Product exploration explored 100000 steps with 1798 reset in 2957 ms.
Product exploration explored 100000 steps with 1795 reset in 3000 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 192 transition count 512
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X p1), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X p1)), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G (NOT p1)))
Knowledge based reduction with 9 factoid took 186 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Sudoku-COL-AN08-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN08-LTLFireability-06 finished in 7717 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X((X((X(p0)||F(p0)))&&X(p0))))))'
Support contains 192 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 512/512 transitions.
Applied a total of 0 rules in 4 ms. Remains 192 /192 variables (removed 0) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 192 cols
[2022-05-20 18:05:02] [INFO ] Computed 23 place invariants in 10 ms
[2022-05-20 18:05:02] [INFO ] Implicit Places using invariants in 60 ms returned []
// Phase 1: matrix 512 rows 192 cols
[2022-05-20 18:05:02] [INFO ] Computed 23 place invariants in 13 ms
[2022-05-20 18:05:02] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
// Phase 1: matrix 512 rows 192 cols
[2022-05-20 18:05:02] [INFO ] Computed 23 place invariants in 13 ms
[2022-05-20 18:05:02] [INFO ] Dead Transitions using invariants and state equation in 200 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 192/192 places, 512/512 transitions.
Stuttering acceptance computed with spot in 235 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN08-LTLFireability-08 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 s39 1) (GEQ s103 1) (GEQ s191 1)) (AND (GEQ s51 1) (GEQ s116 1) (GEQ s163 1)) (AND (GEQ s12 1) (GEQ s72 1) (GEQ s132 1)) (AND (GEQ s38 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 57 steps with 0 reset in 6 ms.
FORMULA Sudoku-COL-AN08-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN08-LTLFireability-08 finished in 712 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U G((G(p0)||p1)))))'
Support contains 192 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 512/512 transitions.
Applied a total of 0 rules in 3 ms. Remains 192 /192 variables (removed 0) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 192 cols
[2022-05-20 18:05:03] [INFO ] Computed 23 place invariants in 8 ms
[2022-05-20 18:05:03] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 512 rows 192 cols
[2022-05-20 18:05:03] [INFO ] Computed 23 place invariants in 6 ms
[2022-05-20 18:05:03] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
// Phase 1: matrix 512 rows 192 cols
[2022-05-20 18:05:03] [INFO ] Computed 23 place invariants in 11 ms
[2022-05-20 18:05:03] [INFO ] Dead Transitions using invariants and state equation in 199 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 192/192 places, 512/512 transitions.
Stuttering acceptance computed with spot in 211 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-COL-AN08-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(OR (AND (GEQ s39 1) (GEQ s103 1) (GEQ s191 1)) (AND (GEQ s51 1) (GEQ s116 1) (GEQ s163 1)) (AND (GEQ s12 1) (GEQ s72 1) (GEQ s132 1)) (AND (GEQ s38 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 55 steps with 0 reset in 4 ms.
FORMULA Sudoku-COL-AN08-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN08-LTLFireability-09 finished in 661 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U F(!p0))&&X((F(p0) U X(!p0)))))'
Support contains 192 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 512/512 transitions.
Applied a total of 0 rules in 2 ms. Remains 192 /192 variables (removed 0) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 192 cols
[2022-05-20 18:05:03] [INFO ] Computed 23 place invariants in 6 ms
[2022-05-20 18:05:03] [INFO ] Implicit Places using invariants in 54 ms returned []
// Phase 1: matrix 512 rows 192 cols
[2022-05-20 18:05:03] [INFO ] Computed 23 place invariants in 6 ms
[2022-05-20 18:05:04] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
// Phase 1: matrix 512 rows 192 cols
[2022-05-20 18:05:04] [INFO ] Computed 23 place invariants in 6 ms
[2022-05-20 18:05:04] [INFO ] Dead Transitions using invariants and state equation in 183 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 192/192 places, 512/512 transitions.
Stuttering acceptance computed with spot in 112 ms :[p0, p0, p0]
Running random walk in product with property : Sudoku-COL-AN08-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (AND (GEQ s39 1) (GEQ s103 1) (GEQ s191 1)) (AND (GEQ s51 1) (GEQ s116 1) (GEQ s163 1)) (AND (GEQ s12 1) (GEQ s72 1) (GEQ s132 1)) (AND (GEQ s38 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][false, false, false]]
Product exploration explored 100000 steps with 1796 reset in 2959 ms.
Product exploration explored 100000 steps with 1797 reset in 3032 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 192 transition count 512
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 (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 3 factoid took 78 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Sudoku-COL-AN08-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN08-LTLFireability-12 finished in 7493 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p1)&&p0)))'
Support contains 192 out of 192 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 192/192 places, 512/512 transitions.
Applied a total of 0 rules in 8 ms. Remains 192 /192 variables (removed 0) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 192 cols
[2022-05-20 18:05:11] [INFO ] Computed 23 place invariants in 9 ms
[2022-05-20 18:05:11] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 512 rows 192 cols
[2022-05-20 18:05:11] [INFO ] Computed 23 place invariants in 9 ms
[2022-05-20 18:05:11] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
[2022-05-20 18:05:11] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 512 rows 192 cols
[2022-05-20 18:05:11] [INFO ] Computed 23 place invariants in 8 ms
[2022-05-20 18:05:11] [INFO ] Dead Transitions using invariants and state equation in 183 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 192/192 places, 512/512 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-COL-AN08-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(AND (OR (LT s39 1) (LT s103 1) (LT s191 1)) (OR (LT s51 1) (LT s116 1) (LT s163 1)) (OR (LT s12 1) (LT s72 1) (LT s132 1)) (OR (LT s38 1) (LT s99 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 1800 reset in 3214 ms.
Product exploration explored 100000 steps with 1799 reset in 3256 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 192 transition count 512
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (F (G p1)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 9 factoid took 227 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Sudoku-COL-AN08-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN08-LTLFireability-13 finished in 8258 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G((G((!p0 U p0))&&p0)))))'
Support contains 192 out of 192 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 192/192 places, 512/512 transitions.
Applied a total of 0 rules in 9 ms. Remains 192 /192 variables (removed 0) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 192 cols
[2022-05-20 18:05:19] [INFO ] Computed 23 place invariants in 7 ms
[2022-05-20 18:05:19] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 512 rows 192 cols
[2022-05-20 18:05:19] [INFO ] Computed 23 place invariants in 11 ms
[2022-05-20 18:05:19] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
[2022-05-20 18:05:19] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 512 rows 192 cols
[2022-05-20 18:05:19] [INFO ] Computed 23 place invariants in 10 ms
[2022-05-20 18:05:20] [INFO ] Dead Transitions using invariants and state equation in 184 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 192/192 places, 512/512 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN08-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s39 1) (GEQ s103 1) (GEQ s191 1)) (AND (GEQ s51 1) (GEQ s116 1) (GEQ s163 1)) (AND (GEQ s12 1) (GEQ s72 1) (GEQ s132 1)) (AND (GEQ s38 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 55 steps with 0 reset in 4 ms.
FORMULA Sudoku-COL-AN08-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN08-LTLFireability-14 finished in 512 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F((F(p0)||p0)))))'
Support contains 192 out of 192 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 192/192 places, 512/512 transitions.
Applied a total of 0 rules in 6 ms. Remains 192 /192 variables (removed 0) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 192 cols
[2022-05-20 18:05:20] [INFO ] Computed 23 place invariants in 11 ms
[2022-05-20 18:05:20] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 512 rows 192 cols
[2022-05-20 18:05:20] [INFO ] Computed 23 place invariants in 16 ms
[2022-05-20 18:05:20] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
[2022-05-20 18:05:20] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 512 rows 192 cols
[2022-05-20 18:05:20] [INFO ] Computed 23 place invariants in 10 ms
[2022-05-20 18:05:20] [INFO ] Dead Transitions using invariants and state equation in 187 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 192/192 places, 512/512 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN08-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (LT s39 1) (LT s103 1) (LT s191 1)) (OR (LT s51 1) (LT s116 1) (LT s163 1)) (OR (LT s12 1) (LT s72 1) (LT s132 1)) (OR (LT s38 1) (LT s99 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1795 reset in 2976 ms.
Product exploration explored 100000 steps with 1798 reset in 3017 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 192 transition count 512
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 98 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Sudoku-COL-AN08-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN08-LTLFireability-15 finished in 7420 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G(X(!(X(p0) U p0)))))'
[2022-05-20 18:05:27] [INFO ] Flatten gal took : 40 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8546142583704424087
[2022-05-20 18:05:27] [INFO ] Computing symmetric may disable matrix : 512 transitions.
[2022-05-20 18:05:27] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 18:05:27] [INFO ] Computing symmetric may enable matrix : 512 transitions.
[2022-05-20 18:05:27] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 18:05:27] [INFO ] Applying decomposition
[2022-05-20 18:05:27] [INFO ] Flatten gal took : 36 ms
[2022-05-20 18:05:27] [INFO ] Computing Do-Not-Accords matrix : 512 transitions.
[2022-05-20 18:05:27] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 18:05:27] [INFO ] Built C files in 119ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8546142583704424087
Running compilation step : cd /tmp/ltsmin8546142583704424087;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/graph18012684628765945829.txt' '-o' '/tmp/graph18012684628765945829.bin' '-w' '/tmp/graph18012684628765945829.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph18012684628765945829.bin' '-l' '-1' '-v' '-w' '/tmp/graph18012684628765945829.weights' '-q' '0' '-e' '0.001'
[2022-05-20 18:05:27] [INFO ] Decomposing Gal with order
[2022-05-20 18:05:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 18:05:28] [INFO ] Removed a total of 1344 redundant transitions.
[2022-05-20 18:05:28] [INFO ] Flatten gal took : 83 ms
[2022-05-20 18:05:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2022-05-20 18:05:28] [INFO ] Time to serialize gal into /tmp/LTLFireability17069637080761695370.gal : 10 ms
[2022-05-20 18:05:28] [INFO ] Time to serialize properties into /tmp/LTLFireability2023800185117236754.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability17069637080761695370.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2023800185117236754.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...268
Read 1 LTL properties
Checking formula 0 : !((("((((((((((((u39.Rows_39>=1)&&(u103.Cells_39>=1))&&(u191.Columns_63>=1))||(((u51.Rows_51>=1)&&(u116.Cells_52>=1))&&(u163.Columns_3...99594
Formula 0 simplified : !("((((((((((((u39.Rows_39>=1)&&(u103.Cells_39>=1))&&(u191.Columns_63>=1))||(((u51.Rows_51>=1)&&(u116.Cells_52>=1))&&(u163.Columns_3...99584
Compilation finished in 1345 ms.
Running link step : cd /tmp/ltsmin8546142583704424087;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin8546142583704424087;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((LTLAPp0==true) U [](X(!(X((LTLAPp0==true)) U (LTLAPp0==true)))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.009: Loading model from ./gal.so
pins2lts-mc-linux64( 6/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.010: LTL layer: formula: ((LTLAPp0==true) U [](X(!(X((LTLAPp0==true)) U (LTLAPp0==true)))))
pins2lts-mc-linux64( 1/ 8), 0.010: "((LTLAPp0==true) U [](X(!(X((LTLAPp0==true)) U (LTLAPp0==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.010: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.016: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.018: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.018: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.021: completed 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( 6/ 8), 0.023: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.025: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.028: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.104: DFS-FIFO for weak LTL, using special progress label 514
pins2lts-mc-linux64( 0/ 8), 0.104: There are 515 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.104: State length is 193, there are 517 groups
pins2lts-mc-linux64( 0/ 8), 0.104: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.104: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.104: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.104: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 3/ 8), 0.726: ~55 levels ~960 states ~73144 transitions
pins2lts-mc-linux64( 3/ 8), 0.751: ~55 levels ~1920 states ~76736 transitions
pins2lts-mc-linux64( 6/ 8), 0.796: ~58 levels ~3840 states ~82472 transitions
pins2lts-mc-linux64( 6/ 8), 0.874: ~58 levels ~7680 states ~102416 transitions
pins2lts-mc-linux64( 3/ 8), 1.009: ~55 levels ~15360 states ~141256 transitions
pins2lts-mc-linux64( 4/ 8), 1.292: ~57 levels ~30720 states ~217072 transitions
pins2lts-mc-linux64( 3/ 8), 1.868: ~56 levels ~61440 states ~406360 transitions
pins2lts-mc-linux64( 5/ 8), 2.907: ~54 levels ~122880 states ~749568 transitions
pins2lts-mc-linux64( 5/ 8), 4.986: ~54 levels ~245760 states ~1466200 transitions
pins2lts-mc-linux64( 5/ 8), 8.882: ~55 levels ~491520 states ~3048768 transitions
pins2lts-mc-linux64( 5/ 8), 16.235: ~56 levels ~983040 states ~6427952 transitions
pins2lts-mc-linux64( 0/ 8), 30.993: ~58 levels ~1966080 states ~13993568 transitions
pins2lts-mc-linux64( 5/ 8), 64.537: ~57 levels ~3932160 states ~27950848 transitions
pins2lts-mc-linux64( 0/ 8), 134.795: ~58 levels ~7864320 states ~62521840 transitions
pins2lts-mc-linux64( 0/ 8), 266.300: ~58 levels ~15728640 states ~131113528 transitions
pins2lts-mc-linux64( 3/ 8), 435.078: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 435.281:
pins2lts-mc-linux64( 0/ 8), 435.281: mean standard work distribution: 2.2% (states) 1.3% (transitions)
pins2lts-mc-linux64( 0/ 8), 435.281:
pins2lts-mc-linux64( 0/ 8), 435.281: Explored 24429168 states 207656304 transitions, fanout: 8.500
pins2lts-mc-linux64( 0/ 8), 435.281: Total exploration time 435.160 sec (434.960 sec minimum, 435.007 sec on average)
pins2lts-mc-linux64( 0/ 8), 435.281: States per second: 56138, Transitions per second: 477195
pins2lts-mc-linux64( 0/ 8), 435.281:
pins2lts-mc-linux64( 0/ 8), 435.281: Progress states detected: 22675
pins2lts-mc-linux64( 0/ 8), 435.281: Redundant explorations: -0.3628
pins2lts-mc-linux64( 0/ 8), 435.281:
pins2lts-mc-linux64( 0/ 8), 435.281: Queue width: 8B, total height: 23145, memory: 0.18MB
pins2lts-mc-linux64( 0/ 8), 435.281: Tree memory: 443.1MB, 18.9 B/state, compr.: 2.4%
pins2lts-mc-linux64( 0/ 8), 435.281: Tree fill ratio (roots/leafs): 18.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 435.281: Stored 518 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 435.282: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 435.282: Est. total memory use: 443.2MB (~1024.2MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin8546142583704424087;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((LTLAPp0==true) U [](X(!(X((LTLAPp0==true)) U (LTLAPp0==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin8546142583704424087;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((LTLAPp0==true) U [](X(!(X((LTLAPp0==true)) U (LTLAPp0==true)))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-20 18:26:50] [INFO ] Applying decomposition
[2022-05-20 18:26:50] [INFO ] Flatten gal took : 400 ms
[2022-05-20 18:26:50] [INFO ] Decomposing Gal with order
[2022-05-20 18:26:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 18:26:51] [INFO ] Removed a total of 1096 redundant transitions.
[2022-05-20 18:26:51] [INFO ] Flatten gal took : 344 ms
[2022-05-20 18:26:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 12 ms.
[2022-05-20 18:26:51] [INFO ] Time to serialize gal into /tmp/LTLFireability16861725664192309371.gal : 23 ms
[2022-05-20 18:26:51] [INFO ] Time to serialize properties into /tmp/LTLFireability6158560981522294781.ltl : 29 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/LTLFireability16861725664192309371.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6158560981522294781.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...268
Read 1 LTL properties
Checking formula 0 : !((("((((((((((((NN39.Rows_39>=1)&&(NN39.Cells_39>=1))&&(NN63.Columns_63>=1))||(((NN51.Rows_51>=1)&&(NN52.Cells_52>=1))&&(NN35.Columns...101514
Formula 0 simplified : !("((((((((((((NN39.Rows_39>=1)&&(NN39.Cells_39>=1))&&(NN63.Columns_63>=1))||(((NN51.Rows_51>=1)&&(NN52.Cells_52>=1))&&(NN35.Columns...101504
ITS-tools command line returned an error code 137
[2022-05-20 18:44:55] [INFO ] Flatten gal took : 359 ms
[2022-05-20 18:44:56] [INFO ] Input system was already deterministic with 512 transitions.
[2022-05-20 18:44:56] [INFO ] Transformed 192 places.
[2022-05-20 18:44:56] [INFO ] Transformed 512 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 18:44:56] [INFO ] Time to serialize gal into /tmp/LTLFireability16229340636374139946.gal : 17 ms
[2022-05-20 18:44:56] [INFO ] Time to serialize properties into /tmp/LTLFireability7465514408741759681.ltl : 22 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/LTLFireability16229340636374139946.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7465514408741759681.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...334
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((("((((((((((((Rows_39>=1)&&(Cells_39>=1))&&(Columns_63>=1))||(((Rows_51>=1)&&(Cells_52>=1))&&(Columns_35>=1)))||((((Rows_12>=1)&&(C...79194
Formula 0 simplified : !("((((((((((((Rows_39>=1)&&(Cells_39>=1))&&(Columns_63>=1))||(((Rows_51>=1)&&(Cells_52>=1))&&(Columns_35>=1)))||((((Rows_12>=1)&&(C...79184
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination 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-AN08"
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-AN08, 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-165303545300100"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-COL-AN08.tgz
mv Sudoku-COL-AN08 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 '
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 ;