Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r417-tall-171690556300382.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is Sudoku-PT-AN06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r417-tall-171690556300382
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.9M
-rw-r--r-- 1 mcc users 127K Apr 12 10:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 649K Apr 12 10:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 208K Apr 12 10:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 1009K Apr 12 10:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 40K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 143K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 101K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 368K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 202K Apr 12 11:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1001K Apr 12 11:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 335K Apr 12 10:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.6M Apr 12 10:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 5.1K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 13K Apr 23 08:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 132K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Sudoku-PT-AN06-LTLCardinality-00
FORMULA_NAME Sudoku-PT-AN06-LTLCardinality-01
FORMULA_NAME Sudoku-PT-AN06-LTLCardinality-02
FORMULA_NAME Sudoku-PT-AN06-LTLCardinality-03
FORMULA_NAME Sudoku-PT-AN06-LTLCardinality-04
FORMULA_NAME Sudoku-PT-AN06-LTLCardinality-05
FORMULA_NAME Sudoku-PT-AN06-LTLCardinality-06
FORMULA_NAME Sudoku-PT-AN06-LTLCardinality-07
FORMULA_NAME Sudoku-PT-AN06-LTLCardinality-08
FORMULA_NAME Sudoku-PT-AN06-LTLCardinality-09
FORMULA_NAME Sudoku-PT-AN06-LTLCardinality-10
FORMULA_NAME Sudoku-PT-AN06-LTLCardinality-11
FORMULA_NAME Sudoku-PT-AN06-LTLCardinality-12
FORMULA_NAME Sudoku-PT-AN06-LTLCardinality-13
FORMULA_NAME Sudoku-PT-AN06-LTLCardinality-14
FORMULA_NAME Sudoku-PT-AN06-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717146814323

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-PT-AN06
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-31 09:13:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-31 09:13:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 09:13:36] [INFO ] Load time of PNML (sax parser for PT used): 62 ms
[2024-05-31 09:13:36] [INFO ] Transformed 324 places.
[2024-05-31 09:13:36] [INFO ] Transformed 216 transitions.
[2024-05-31 09:13:36] [INFO ] Found NUPN structural information;
[2024-05-31 09:13:36] [INFO ] Parsed PT model containing 324 places and 216 transitions and 864 arcs in 127 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA Sudoku-PT-AN06-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN06-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN06-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN06-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 324 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Applied a total of 0 rules in 10 ms. Remains 324 /324 variables (removed 0) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 324 cols
[2024-05-31 09:13:36] [INFO ] Computed 108 invariants in 22 ms
[2024-05-31 09:13:36] [INFO ] Implicit Places using invariants in 236 ms returned []
[2024-05-31 09:13:36] [INFO ] Invariant cache hit.
[2024-05-31 09:13:36] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 433 ms to find 0 implicit places.
[2024-05-31 09:13:36] [INFO ] Invariant cache hit.
[2024-05-31 09:13:36] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 606 ms. Remains : 324/324 places, 216/216 transitions.
Support contains 324 out of 324 places after structural reductions.
[2024-05-31 09:13:37] [INFO ] Flatten gal took : 46 ms
[2024-05-31 09:13:37] [INFO ] Flatten gal took : 27 ms
[2024-05-31 09:13:37] [INFO ] Input system was already deterministic with 216 transitions.
Incomplete random walk after 10000 steps, including 318 resets, run finished after 664 ms. (steps per millisecond=15 ) properties (out of 19) seen :12
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2024-05-31 09:13:38] [INFO ] Invariant cache hit.
[2024-05-31 09:13:38] [INFO ] After 177ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-31 09:13:38] [INFO ] [Nat]Absence check using 108 positive place invariants in 124 ms returned sat
[2024-05-31 09:13:39] [INFO ] After 989ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :4
[2024-05-31 09:13:40] [INFO ] After 1798ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :4
Attempting to minimize the solution found.
Minimization took 673 ms.
[2024-05-31 09:13:41] [INFO ] After 2804ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :4
Fused 7 Parikh solutions to 4 different solutions.
Finished Parikh walk after 36 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=18 )
Parikh walk visited 1 properties in 10 ms.
Support contains 72 out of 324 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 324/324 places, 216/216 transitions.
Graph (complete) has 648 edges and 324 vertex of which 108 are kept as prefixes of interest. Removing 216 places using SCC suffix rule.1 ms
Discarding 216 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 10 ms. Remains 108 /324 variables (removed 216) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 108/324 places, 216/216 transitions.
Incomplete random walk after 10000 steps, including 317 resets, run finished after 305 ms. (steps per millisecond=32 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 917663 steps, run timeout after 3001 ms. (steps per millisecond=305 ) properties seen :{}
Probabilistic random walk after 917663 steps, saw 142489 distinct states, run finished after 3003 ms. (steps per millisecond=305 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 216 rows 108 cols
[2024-05-31 09:13:44] [INFO ] Computed 17 invariants in 10 ms
[2024-05-31 09:13:44] [INFO ] [Real]Absence check using 0 positive and 17 generalized place invariants in 5 ms returned sat
[2024-05-31 09:13:45] [INFO ] After 436ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:1
[2024-05-31 09:13:45] [INFO ] After 683ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:2
Attempting to minimize the solution found.
Minimization took 111 ms.
[2024-05-31 09:13:45] [INFO ] After 873ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-31 09:13:45] [INFO ] [Nat]Absence check using 0 positive and 17 generalized place invariants in 4 ms returned sat
[2024-05-31 09:13:45] [INFO ] After 299ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-31 09:13:46] [INFO ] After 580ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 248 ms.
[2024-05-31 09:13:46] [INFO ] After 874ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 36 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=12 )
Parikh walk visited 3 properties in 3 ms.
FORMULA Sudoku-PT-AN06-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Sudoku-PT-AN06-LTLCardinality-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 324 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 324 transition count 216
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 : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p1))&&p0)))'
Support contains 108 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Reduce places removed 216 places and 0 transitions.
Iterating post reduction 0 with 216 rules applied. Total rules applied 216 place count 108 transition count 216
Applied a total of 216 rules in 2 ms. Remains 108 /324 variables (removed 216) and now considering 216/216 (removed 0) transitions.
[2024-05-31 09:13:46] [INFO ] Invariant cache hit.
[2024-05-31 09:13:46] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-31 09:13:46] [INFO ] Invariant cache hit.
[2024-05-31 09:13:46] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
[2024-05-31 09:13:46] [INFO ] Invariant cache hit.
[2024-05-31 09:13:46] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 108/324 places, 216/216 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 240 ms. Remains : 108/324 places, 216/216 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 254 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN06-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GT (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35) (A...], 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA Sudoku-PT-AN06-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN06-LTLCardinality-01 finished in 546 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (F(p1)&&G((p2&&X(p2))))))'
Support contains 108 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Graph (complete) has 648 edges and 324 vertex of which 108 are kept as prefixes of interest. Removing 216 places using SCC suffix rule.2 ms
Discarding 216 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 9 ms. Remains 108 /324 variables (removed 216) and now considering 216/216 (removed 0) transitions.
[2024-05-31 09:13:47] [INFO ] Invariant cache hit.
[2024-05-31 09:13:47] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-31 09:13:47] [INFO ] Invariant cache hit.
[2024-05-31 09:13:47] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
[2024-05-31 09:13:47] [INFO ] Redundant transitions in 7 ms returned []
[2024-05-31 09:13:47] [INFO ] Invariant cache hit.
[2024-05-31 09:13:47] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 108/324 places, 216/216 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 276 ms. Remains : 108/324 places, 216/216 transitions.
Stuttering acceptance computed with spot in 178 ms :[(OR (NOT p2) (NOT p1)), true, (NOT p1), (NOT p2), (NOT p2), false]
Running random walk in product with property : Sudoku-PT-AN06-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND p2 p0), acceptance={0} source=0 dest: 4}, { cond=(AND p2 p0), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 1}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 1}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND p2 p0), acceptance={0} source=5 dest: 4}, { cond=(AND p2 p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(LEQ 2 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35)), p0...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 33385 reset in 2665 ms.
Product exploration explored 100000 steps with 33362 reset in 2603 ms.
Computed a total of 108 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 108 transition count 216
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 p2 p0 p1), (X (NOT (AND (NOT p2) (NOT p0)))), (X p1), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p1) p2))), (X (AND p2 p0)), (X p2), (X (NOT (AND p2 (NOT p0)))), true, (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p1)), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p2 p0))), (X (X p2)), (X (X (NOT (AND p2 (NOT p0))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 1145 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter insensitive) to 8 states, 21 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 271 ms :[(OR (NOT p2) (NOT p1)), true, (NOT p1), (NOT p2), (NOT p2), false, false, false]
Incomplete random walk after 10000 steps, including 319 resets, run finished after 473 ms. (steps per millisecond=21 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 329398 steps, run timeout after 3001 ms. (steps per millisecond=109 ) properties seen :{}
Probabilistic random walk after 329398 steps, saw 59086 distinct states, run finished after 3001 ms. (steps per millisecond=109 ) properties seen :0
Running SMT prover for 9 properties.
[2024-05-31 09:13:58] [INFO ] Invariant cache hit.
[2024-05-31 09:13:58] [INFO ] [Real]Absence check using 0 positive and 17 generalized place invariants in 4 ms returned sat
[2024-05-31 09:13:58] [INFO ] After 120ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:8
[2024-05-31 09:13:58] [INFO ] [Nat]Absence check using 0 positive and 17 generalized place invariants in 4 ms returned sat
[2024-05-31 09:13:59] [INFO ] After 416ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :4
[2024-05-31 09:13:59] [INFO ] After 724ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :4
Attempting to minimize the solution found.
Minimization took 348 ms.
[2024-05-31 09:14:00] [INFO ] After 1139ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :4
Fused 9 Parikh solutions to 4 different solutions.
Finished Parikh walk after 35 steps, including 0 resets, run visited all 4 properties in 4 ms. (steps per millisecond=8 )
Parikh walk visited 1 properties in 3 ms.
Support contains 108 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 216/216 transitions.
Applied a total of 0 rules in 4 ms. Remains 108 /108 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 108/108 places, 216/216 transitions.
Incomplete random walk after 10000 steps, including 319 resets, run finished after 245 ms. (steps per millisecond=40 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 875516 steps, run timeout after 3001 ms. (steps per millisecond=291 ) properties seen :{}
Probabilistic random walk after 875516 steps, saw 136018 distinct states, run finished after 3002 ms. (steps per millisecond=291 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-31 09:14:03] [INFO ] Invariant cache hit.
[2024-05-31 09:14:03] [INFO ] [Real]Absence check using 0 positive and 17 generalized place invariants in 5 ms returned sat
[2024-05-31 09:14:03] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-31 09:14:03] [INFO ] [Nat]Absence check using 0 positive and 17 generalized place invariants in 4 ms returned sat
[2024-05-31 09:14:03] [INFO ] After 318ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-31 09:14:04] [INFO ] After 616ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 271 ms.
[2024-05-31 09:14:04] [INFO ] After 934ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 35 steps, including 0 resets, run visited all 3 properties in 5 ms. (steps per millisecond=7 )
Parikh walk visited 3 properties in 4 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p2 p0 p1), (X (NOT (AND (NOT p2) (NOT p0)))), (X p1), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p1) p2))), (X (AND p2 p0)), (X p2), (X (NOT (AND p2 (NOT p0)))), true, (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p1)), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p2 p0))), (X (X p2)), (X (X (NOT (AND p2 (NOT p0))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p0 (NOT p1) p2))), (G p1)]
False Knowledge obtained : [(F (NOT (AND p0 p2))), (F (AND (NOT p0) p2)), (F (NOT (AND p0 p1 p2))), (F (AND p0 (NOT p2))), (F (AND (NOT p1) p2)), (F (AND (NOT p0) (NOT p2))), (F (NOT p2))]
Property proved to be false thanks to negative knowledge :(F (AND (NOT p1) p2))
Knowledge based reduction with 21 factoid took 2267 ms. Reduced automaton from 8 states, 21 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN06-LTLCardinality-02 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN06-LTLCardinality-02 finished in 19423 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||(p1&&G(p2)))))'
Support contains 72 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Reduce places removed 216 places and 0 transitions.
Iterating post reduction 0 with 216 rules applied. Total rules applied 216 place count 108 transition count 216
Applied a total of 216 rules in 5 ms. Remains 108 /324 variables (removed 216) and now considering 216/216 (removed 0) transitions.
[2024-05-31 09:14:06] [INFO ] Invariant cache hit.
[2024-05-31 09:14:06] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-31 09:14:06] [INFO ] Invariant cache hit.
[2024-05-31 09:14:06] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
[2024-05-31 09:14:06] [INFO ] Invariant cache hit.
[2024-05-31 09:14:07] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 108/324 places, 216/216 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 315 ms. Remains : 108/324 places, 216/216 transitions.
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Sudoku-PT-AN06-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(GT 1 (ADD s72 s73 s74 s75 s76 s77 s78 s79 s80 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s99 s100 s101 s102 s103 s104 s10...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 3190 reset in 1521 ms.
Product exploration explored 100000 steps with 3186 reset in 1517 ms.
Computed a total of 108 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 108 transition count 216
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (AND (NOT p0) p1 p2)), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) p2))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 469 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Incomplete random walk after 10000 steps, including 319 resets, run finished after 288 ms. (steps per millisecond=34 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 660792 steps, run timeout after 3001 ms. (steps per millisecond=220 ) properties seen :{}
Probabilistic random walk after 660792 steps, saw 109262 distinct states, run finished after 3001 ms. (steps per millisecond=220 ) properties seen :0
Running SMT prover for 5 properties.
[2024-05-31 09:14:14] [INFO ] Invariant cache hit.
[2024-05-31 09:14:14] [INFO ] [Real]Absence check using 0 positive and 17 generalized place invariants in 4 ms returned sat
[2024-05-31 09:14:14] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:4
[2024-05-31 09:14:14] [INFO ] [Nat]Absence check using 0 positive and 17 generalized place invariants in 4 ms returned sat
[2024-05-31 09:14:14] [INFO ] After 224ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :3
[2024-05-31 09:14:15] [INFO ] After 433ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :3
Attempting to minimize the solution found.
Minimization took 199 ms.
[2024-05-31 09:14:15] [INFO ] After 681ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :3
Fused 5 Parikh solutions to 3 different solutions.
Finished Parikh walk after 36 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=12 )
Parikh walk visited 2 properties in 2 ms.
Support contains 36 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 216/216 transitions.
Applied a total of 0 rules in 8 ms. Remains 108 /108 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 108/108 places, 216/216 transitions.
Incomplete random walk after 10000 steps, including 319 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1497913 steps, run timeout after 3001 ms. (steps per millisecond=499 ) properties seen :{}
Probabilistic random walk after 1497913 steps, saw 231017 distinct states, run finished after 3001 ms. (steps per millisecond=499 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-31 09:14:18] [INFO ] Invariant cache hit.
[2024-05-31 09:14:18] [INFO ] [Real]Absence check using 0 positive and 17 generalized place invariants in 4 ms returned sat
[2024-05-31 09:14:18] [INFO ] After 214ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 09:14:18] [INFO ] [Nat]Absence check using 0 positive and 17 generalized place invariants in 4 ms returned sat
[2024-05-31 09:14:18] [INFO ] After 103ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 09:14:18] [INFO ] After 182ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 59 ms.
[2024-05-31 09:14:18] [INFO ] After 283ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 36 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=18 )
Parikh walk visited 1 properties in 2 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (AND (NOT p0) p1 p2)), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) p2))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND p0 p2)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p2))), (F (AND p0 (NOT p2))), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 10 factoid took 2348 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 284 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false]
Stuttering acceptance computed with spot in 182 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false]
Support contains 72 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 216/216 transitions.
Applied a total of 0 rules in 6 ms. Remains 108 /108 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-05-31 09:14:21] [INFO ] Invariant cache hit.
[2024-05-31 09:14:21] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-31 09:14:21] [INFO ] Invariant cache hit.
[2024-05-31 09:14:22] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
[2024-05-31 09:14:22] [INFO ] Redundant transitions in 6 ms returned []
[2024-05-31 09:14:22] [INFO ] Invariant cache hit.
[2024-05-31 09:14:22] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 334 ms. Remains : 108/108 places, 216/216 transitions.
Computed a total of 108 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 108 transition count 216
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p2), (X p2), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (X p2)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 210 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 188 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false]
Incomplete random walk after 10000 steps, including 318 resets, run finished after 308 ms. (steps per millisecond=32 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 724109 steps, run timeout after 3001 ms. (steps per millisecond=241 ) properties seen :{}
Probabilistic random walk after 724109 steps, saw 117071 distinct states, run finished after 3001 ms. (steps per millisecond=241 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-31 09:14:26] [INFO ] Invariant cache hit.
[2024-05-31 09:14:26] [INFO ] [Real]Absence check using 0 positive and 17 generalized place invariants in 4 ms returned sat
[2024-05-31 09:14:26] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2024-05-31 09:14:26] [INFO ] [Nat]Absence check using 0 positive and 17 generalized place invariants in 4 ms returned sat
[2024-05-31 09:14:26] [INFO ] After 233ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2024-05-31 09:14:26] [INFO ] After 454ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 266 ms.
[2024-05-31 09:14:27] [INFO ] After 763ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 3 different solutions.
Finished Parikh walk after 36 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=18 )
Parikh walk visited 2 properties in 2 ms.
Support contains 36 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 216/216 transitions.
Applied a total of 0 rules in 9 ms. Remains 108 /108 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 108/108 places, 216/216 transitions.
Finished random walk after 7271 steps, including 230 resets, run visited all 1 properties in 88 ms. (steps per millisecond=82 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p2), (X p2), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (X p2)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p2)), (F p0), (F (AND (NOT p2) p0)), (F (AND (NOT p2) (NOT p0)))]
Knowledge based reduction with 11 factoid took 434 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 165 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false]
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false]
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false]
Product exploration explored 100000 steps with 3183 reset in 1266 ms.
Product exploration explored 100000 steps with 3183 reset in 1310 ms.
Built C files in :
/tmp/ltsmin15467939956480214566
[2024-05-31 09:14:32] [INFO ] Computing symmetric may disable matrix : 216 transitions.
[2024-05-31 09:14:32] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 09:14:32] [INFO ] Computing symmetric may enable matrix : 216 transitions.
[2024-05-31 09:14:32] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 09:14:32] [INFO ] Computing Do-Not-Accords matrix : 216 transitions.
[2024-05-31 09:14:32] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 09:14:32] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15467939956480214566
Running compilation step : cd /tmp/ltsmin15467939956480214566;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 507 ms.
Running link step : cd /tmp/ltsmin15467939956480214566;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin15467939956480214566;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8699713338393318315.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 72 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 216/216 transitions.
Applied a total of 0 rules in 8 ms. Remains 108 /108 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-05-31 09:14:47] [INFO ] Invariant cache hit.
[2024-05-31 09:14:47] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-31 09:14:47] [INFO ] Invariant cache hit.
[2024-05-31 09:14:47] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
[2024-05-31 09:14:47] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-31 09:14:47] [INFO ] Invariant cache hit.
[2024-05-31 09:14:47] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 321 ms. Remains : 108/108 places, 216/216 transitions.
Built C files in :
/tmp/ltsmin4952161113364019270
[2024-05-31 09:14:47] [INFO ] Computing symmetric may disable matrix : 216 transitions.
[2024-05-31 09:14:47] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 09:14:47] [INFO ] Computing symmetric may enable matrix : 216 transitions.
[2024-05-31 09:14:47] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 09:14:47] [INFO ] Computing Do-Not-Accords matrix : 216 transitions.
[2024-05-31 09:14:47] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 09:14:47] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4952161113364019270
Running compilation step : cd /tmp/ltsmin4952161113364019270;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 401 ms.
Running link step : cd /tmp/ltsmin4952161113364019270;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin4952161113364019270;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1501079240743989359.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-31 09:15:02] [INFO ] Flatten gal took : 13 ms
[2024-05-31 09:15:02] [INFO ] Flatten gal took : 12 ms
[2024-05-31 09:15:02] [INFO ] Time to serialize gal into /tmp/LTL7018554971923203026.gal : 4 ms
[2024-05-31 09:15:02] [INFO ] Time to serialize properties into /tmp/LTL16522866495161150224.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7018554971923203026.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4040925690308023556.hoa' '-atoms' '/tmp/LTL16522866495161150224.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL16522866495161150224.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4040925690308023556.hoa
Detected timeout of ITS tools.
[2024-05-31 09:15:17] [INFO ] Flatten gal took : 12 ms
[2024-05-31 09:15:17] [INFO ] Flatten gal took : 13 ms
[2024-05-31 09:15:17] [INFO ] Time to serialize gal into /tmp/LTL11133846026868123728.gal : 2 ms
[2024-05-31 09:15:17] [INFO ] Time to serialize properties into /tmp/LTL15019157186485704482.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11133846026868123728.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15019157186485704482.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X((F("(((((((Columns_0_0+Columns_0_1)+(Columns_0_2+Columns_0_3))+((Columns_0_4+Columns_0_5)+(Columns_1_0+Columns_1_1)))+(((Columns_...1354
Formula 0 simplified : X(G!"(((((((Columns_0_0+Columns_0_1)+(Columns_0_2+Columns_0_3))+((Columns_0_4+Columns_0_5)+(Columns_1_0+Columns_1_1)))+(((Columns_1_...1346
Detected timeout of ITS tools.
[2024-05-31 09:15:32] [INFO ] Flatten gal took : 12 ms
[2024-05-31 09:15:32] [INFO ] Applying decomposition
[2024-05-31 09:15:32] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph2356183006012794102.txt' '-o' '/tmp/graph2356183006012794102.bin' '-w' '/tmp/graph2356183006012794102.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph2356183006012794102.bin' '-l' '-1' '-v' '-w' '/tmp/graph2356183006012794102.weights' '-q' '0' '-e' '0.001'
[2024-05-31 09:15:32] [INFO ] Decomposing Gal with order
[2024-05-31 09:15:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 09:15:33] [INFO ] Removed a total of 540 redundant transitions.
[2024-05-31 09:15:33] [INFO ] Flatten gal took : 99 ms
[2024-05-31 09:15:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-31 09:15:33] [INFO ] Time to serialize gal into /tmp/LTL2741818027401872548.gal : 6 ms
[2024-05-31 09:15:33] [INFO ] Time to serialize properties into /tmp/LTL14338380204447837737.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2741818027401872548.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14338380204447837737.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((F("(((((((gu37.Columns_0_0+gu37.Columns_0_1)+(gu37.Columns_0_2+gu37.Columns_0_3))+((gu37.Columns_0_4+gu37.Columns_0_5)+(gu37.Col...1822
Formula 0 simplified : X(G!"(((((((gu37.Columns_0_0+gu37.Columns_0_1)+(gu37.Columns_0_2+gu37.Columns_0_3))+((gu37.Columns_0_4+gu37.Columns_0_5)+(gu37.Colum...1814
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5216459619737931008
[2024-05-31 09:15:48] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5216459619737931008
Running compilation step : cd /tmp/ltsmin5216459619737931008;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 354 ms.
Running link step : cd /tmp/ltsmin5216459619737931008;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin5216459619737931008;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((<>((LTLAPp0==true))||((LTLAPp1==true)&&[]((LTLAPp2==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Sudoku-PT-AN06-LTLCardinality-03 finished in 116611 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 252 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Applied a total of 0 rules in 11 ms. Remains 324 /324 variables (removed 0) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 324 cols
[2024-05-31 09:16:03] [INFO ] Computed 108 invariants in 5 ms
[2024-05-31 09:16:03] [INFO ] Implicit Places using invariants in 168 ms returned []
[2024-05-31 09:16:03] [INFO ] Invariant cache hit.
[2024-05-31 09:16:03] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 441 ms to find 0 implicit places.
[2024-05-31 09:16:03] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-31 09:16:03] [INFO ] Invariant cache hit.
[2024-05-31 09:16:03] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 603 ms. Remains : 324/324 places, 216/216 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN06-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT (ADD s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s7...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 5000 reset in 2208 ms.
Product exploration explored 100000 steps with 5000 reset in 2237 ms.
Computed a total of 324 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 324 transition count 216
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 994 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Finished random walk after 19 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=6 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 817 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
[2024-05-31 09:16:10] [INFO ] Invariant cache hit.
[2024-05-31 09:16:11] [INFO ] [Real]Absence check using 108 positive place invariants in 69 ms returned sat
[2024-05-31 09:16:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 09:16:11] [INFO ] [Real]Absence check using state equation in 662 ms returned sat
[2024-05-31 09:16:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 09:16:13] [INFO ] [Nat]Absence check using 108 positive place invariants in 273 ms returned sat
[2024-05-31 09:16:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 09:16:17] [INFO ] [Nat]Absence check using state equation in 4700 ms returned sat
[2024-05-31 09:16:17] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-31 09:16:17] [INFO ] Added : 0 causal constraints over 0 iterations in 149 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 252 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Applied a total of 0 rules in 7 ms. Remains 324 /324 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-05-31 09:16:17] [INFO ] Invariant cache hit.
[2024-05-31 09:16:18] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-05-31 09:16:18] [INFO ] Invariant cache hit.
[2024-05-31 09:16:18] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 401 ms to find 0 implicit places.
[2024-05-31 09:16:18] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-31 09:16:18] [INFO ] Invariant cache hit.
[2024-05-31 09:16:18] [INFO ] Dead Transitions using invariants and state equation in 149 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 571 ms. Remains : 324/324 places, 216/216 transitions.
Computed a total of 324 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 324 transition count 216
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 129 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Finished random walk after 19 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=6 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 114 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
[2024-05-31 09:16:19] [INFO ] Invariant cache hit.
[2024-05-31 09:16:19] [INFO ] [Real]Absence check using 108 positive place invariants in 67 ms returned sat
[2024-05-31 09:16:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 09:16:20] [INFO ] [Real]Absence check using state equation in 675 ms returned sat
[2024-05-31 09:16:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 09:16:21] [INFO ] [Nat]Absence check using 108 positive place invariants in 265 ms returned sat
[2024-05-31 09:16:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 09:16:26] [INFO ] [Nat]Absence check using state equation in 4567 ms returned sat
[2024-05-31 09:16:26] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-31 09:16:26] [INFO ] Added : 0 causal constraints over 0 iterations in 144 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Product exploration explored 100000 steps with 5000 reset in 2191 ms.
Product exploration explored 100000 steps with 5000 reset in 2228 ms.
Built C files in :
/tmp/ltsmin9085594707574987779
[2024-05-31 09:16:30] [INFO ] Computing symmetric may disable matrix : 216 transitions.
[2024-05-31 09:16:30] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 09:16:30] [INFO ] Computing symmetric may enable matrix : 216 transitions.
[2024-05-31 09:16:30] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 09:16:30] [INFO ] Computing Do-Not-Accords matrix : 216 transitions.
[2024-05-31 09:16:30] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 09:16:30] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9085594707574987779
Running compilation step : cd /tmp/ltsmin9085594707574987779;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 469 ms.
Running link step : cd /tmp/ltsmin9085594707574987779;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin9085594707574987779;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16158818509188131430.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 252 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Applied a total of 0 rules in 13 ms. Remains 324 /324 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-05-31 09:16:45] [INFO ] Invariant cache hit.
[2024-05-31 09:16:46] [INFO ] Implicit Places using invariants in 173 ms returned []
[2024-05-31 09:16:46] [INFO ] Invariant cache hit.
[2024-05-31 09:16:46] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 416 ms to find 0 implicit places.
[2024-05-31 09:16:46] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-31 09:16:46] [INFO ] Invariant cache hit.
[2024-05-31 09:16:46] [INFO ] Dead Transitions using invariants and state equation in 154 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 590 ms. Remains : 324/324 places, 216/216 transitions.
Built C files in :
/tmp/ltsmin8207711972423733976
[2024-05-31 09:16:46] [INFO ] Computing symmetric may disable matrix : 216 transitions.
[2024-05-31 09:16:46] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 09:16:46] [INFO ] Computing symmetric may enable matrix : 216 transitions.
[2024-05-31 09:16:46] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 09:16:46] [INFO ] Computing Do-Not-Accords matrix : 216 transitions.
[2024-05-31 09:16:46] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 09:16:46] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8207711972423733976
Running compilation step : cd /tmp/ltsmin8207711972423733976;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 471 ms.
Running link step : cd /tmp/ltsmin8207711972423733976;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin8207711972423733976;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased18195109473092130570.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-31 09:17:01] [INFO ] Flatten gal took : 16 ms
[2024-05-31 09:17:01] [INFO ] Flatten gal took : 14 ms
[2024-05-31 09:17:01] [INFO ] Time to serialize gal into /tmp/LTL642627072289661953.gal : 2 ms
[2024-05-31 09:17:01] [INFO ] Time to serialize properties into /tmp/LTL17813885109571998080.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL642627072289661953.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12419098621196057264.hoa' '-atoms' '/tmp/LTL17813885109571998080.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL17813885109571998080.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12419098621196057264.hoa
Detected timeout of ITS tools.
[2024-05-31 09:17:16] [INFO ] Flatten gal took : 13 ms
[2024-05-31 09:17:16] [INFO ] Flatten gal took : 15 ms
[2024-05-31 09:17:16] [INFO ] Time to serialize gal into /tmp/LTL4508658464292740303.gal : 2 ms
[2024-05-31 09:17:16] [INFO ] Time to serialize properties into /tmp/LTL10751515912435802141.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4508658464292740303.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10751515912435802141.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F("(((((((((Board_0_0_0+Board_0_0_1)+(Board_0_0_2+Board_0_0_3))+((Board_0_0_4+Board_0_0_5)+(Board_0_1_0+Board_0_1_1)))+(((Board_0_1...3448
Formula 0 simplified : G!"(((((((((Board_0_0_0+Board_0_0_1)+(Board_0_0_2+Board_0_0_3))+((Board_0_0_4+Board_0_0_5)+(Board_0_1_0+Board_0_1_1)))+(((Board_0_1_...3444
Detected timeout of ITS tools.
[2024-05-31 09:17:31] [INFO ] Flatten gal took : 18 ms
[2024-05-31 09:17:31] [INFO ] Applying decomposition
[2024-05-31 09:17:31] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph14936421625303522873.txt' '-o' '/tmp/graph14936421625303522873.bin' '-w' '/tmp/graph14936421625303522873.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph14936421625303522873.bin' '-l' '-1' '-v' '-w' '/tmp/graph14936421625303522873.weights' '-q' '0' '-e' '0.001'
[2024-05-31 09:17:31] [INFO ] Decomposing Gal with order
[2024-05-31 09:17:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 09:17:31] [INFO ] Removed a total of 276 redundant transitions.
[2024-05-31 09:17:31] [INFO ] Flatten gal took : 56 ms
[2024-05-31 09:17:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 57 labels/synchronizations in 6 ms.
[2024-05-31 09:17:31] [INFO ] Time to serialize gal into /tmp/LTL14495415735067798158.gal : 2 ms
[2024-05-31 09:17:32] [INFO ] Time to serialize properties into /tmp/LTL6234020396475087960.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14495415735067798158.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6234020396475087960.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F("(((((((((gu0.Board_0_0_0+gu0.Board_0_0_1)+(gu0.Board_0_0_2+gu0.Board_0_0_3))+((gu0.Board_0_0_4+gu0.Board_0_0_5)+(gu0.Board_0_1_0...4456
Formula 0 simplified : G!"(((((((((gu0.Board_0_0_0+gu0.Board_0_0_1)+(gu0.Board_0_0_2+gu0.Board_0_0_3))+((gu0.Board_0_0_4+gu0.Board_0_0_5)+(gu0.Board_0_1_0+...4452
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16880862617784849605
[2024-05-31 09:17:47] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16880862617784849605
Running compilation step : cd /tmp/ltsmin16880862617784849605;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 424 ms.
Running link step : cd /tmp/ltsmin16880862617784849605;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin16880862617784849605;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((LTLAPp0==true))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Sudoku-PT-AN06-LTLCardinality-05 finished in 118873 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Support contains 36 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Graph (complete) has 648 edges and 324 vertex of which 108 are kept as prefixes of interest. Removing 216 places using SCC suffix rule.3 ms
Discarding 216 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 17 ms. Remains 108 /324 variables (removed 216) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 108 cols
[2024-05-31 09:18:02] [INFO ] Computed 17 invariants in 9 ms
[2024-05-31 09:18:02] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-31 09:18:02] [INFO ] Invariant cache hit.
[2024-05-31 09:18:02] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
[2024-05-31 09:18:02] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-31 09:18:02] [INFO ] Invariant cache hit.
[2024-05-31 09:18:02] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 108/324 places, 216/216 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 403 ms. Remains : 108/324 places, 216/216 transitions.
Stuttering acceptance computed with spot in 41 ms :[p0]
Running random walk in product with property : Sudoku-PT-AN06-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 2 (ADD s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70...], 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 31 steps with 0 reset in 1 ms.
FORMULA Sudoku-PT-AN06-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN06-LTLCardinality-06 finished in 471 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 252 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Applied a total of 0 rules in 3 ms. Remains 324 /324 variables (removed 0) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 324 cols
[2024-05-31 09:18:02] [INFO ] Computed 108 invariants in 3 ms
[2024-05-31 09:18:02] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-05-31 09:18:02] [INFO ] Invariant cache hit.
[2024-05-31 09:18:03] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 413 ms to find 0 implicit places.
[2024-05-31 09:18:03] [INFO ] Invariant cache hit.
[2024-05-31 09:18:03] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 550 ms. Remains : 324/324 places, 216/216 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN06-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT (ADD s288 s289 s290 s291 s292 s293 s294 s295 s296 s297 s298 s299 s300 s301 s302 s303 s304 s305 s306 s307 s308 s309 s310 s311 s312 s313 s314 s315 s3...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 2043 ms.
Product exploration explored 100000 steps with 50000 reset in 2086 ms.
Computed a total of 324 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 324 transition count 216
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 19 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN06-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN06-LTLCardinality-07 finished in 5181 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 4 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Graph (complete) has 648 edges and 324 vertex of which 110 are kept as prefixes of interest. Removing 214 places using SCC suffix rule.3 ms
Discarding 214 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 9 ms. Remains 110 /324 variables (removed 214) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 110 cols
[2024-05-31 09:18:07] [INFO ] Computed 17 invariants in 4 ms
[2024-05-31 09:18:07] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-05-31 09:18:07] [INFO ] Invariant cache hit.
[2024-05-31 09:18:08] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 344 ms to find 0 implicit places.
[2024-05-31 09:18:08] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-31 09:18:08] [INFO ] Invariant cache hit.
[2024-05-31 09:18:08] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 110/324 places, 216/216 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 469 ms. Remains : 110/324 places, 216/216 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN06-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s82 0) (EQ s37 1) (EQ s17 0) (EQ s36 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][true]]
Stuttering criterion allowed to conclude after 81 steps with 4 reset in 5 ms.
FORMULA Sudoku-PT-AN06-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN06-LTLCardinality-08 finished in 515 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(!(F((X(p0)&&!p0)) U X(!X(!p1))))'
Support contains 4 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Reduce places removed 216 places and 0 transitions.
Iterating post reduction 0 with 216 rules applied. Total rules applied 216 place count 108 transition count 216
Applied a total of 216 rules in 1 ms. Remains 108 /324 variables (removed 216) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 108 cols
[2024-05-31 09:18:08] [INFO ] Computed 17 invariants in 6 ms
[2024-05-31 09:18:08] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-05-31 09:18:08] [INFO ] Invariant cache hit.
[2024-05-31 09:18:08] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
[2024-05-31 09:18:08] [INFO ] Invariant cache hit.
[2024-05-31 09:18:08] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 108/324 places, 216/216 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 413 ms. Remains : 108/324 places, 216/216 transitions.
Stuttering acceptance computed with spot in 443 ms :[true, (AND p0 p1), p0, p1, false, false, p1, p1, p1, p1, p1]
Running random walk in product with property : Sudoku-PT-AN06-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 8}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 6}, { cond=p0, acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND p0 p1), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 2}, { cond=p0, acceptance={} source=5 dest: 5}], [{ cond=p0, acceptance={} source=6 dest: 8}, { cond=(NOT p0), acceptance={} source=6 dest: 9}], [{ cond=(NOT p0), acceptance={} source=7 dest: 9}, { cond=p0, acceptance={} source=7 dest: 10}], [{ cond=p1, acceptance={} source=8 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=8 dest: 9}, { cond=(AND p0 (NOT p1)), acceptance={} source=8 dest: 10}], [{ cond=p1, acceptance={} source=9 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=9 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=9 dest: 8}], [{ cond=p1, acceptance={} source=10 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=10 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=10 dest: 4}]], initial=3, aps=[p0:(OR (EQ s95 0) (EQ s17 1)), p1:(OR (EQ s45 0) (EQ s73 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Sudoku-PT-AN06-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN06-LTLCardinality-09 finished in 881 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(F((p1||G(p2)))))))'
Support contains 5 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Graph (complete) has 648 edges and 324 vertex of which 109 are kept as prefixes of interest. Removing 215 places using SCC suffix rule.1 ms
Discarding 215 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 109 /324 variables (removed 215) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 109 cols
[2024-05-31 09:18:09] [INFO ] Computed 17 invariants in 3 ms
[2024-05-31 09:18:09] [INFO ] Implicit Places using invariants in 246 ms returned []
[2024-05-31 09:18:09] [INFO ] Invariant cache hit.
[2024-05-31 09:18:09] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 583 ms to find 0 implicit places.
[2024-05-31 09:18:09] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-31 09:18:09] [INFO ] Invariant cache hit.
[2024-05-31 09:18:09] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 109/324 places, 216/216 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 719 ms. Remains : 109/324 places, 216/216 transitions.
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : Sudoku-PT-AN06-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s64 0) (EQ s95 1)), p2:(AND (EQ s36 0) (EQ s24 1)), p1:(AND (EQ s12 0) (EQ s36 0) (EQ s24 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 118 steps with 6 reset in 2 ms.
FORMULA Sudoku-PT-AN06-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN06-LTLCardinality-12 finished in 805 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((p0&&X(F(p1))) U X(p2)))))'
Support contains 5 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Reduce places removed 216 places and 0 transitions.
Iterating post reduction 0 with 216 rules applied. Total rules applied 216 place count 108 transition count 216
Applied a total of 216 rules in 2 ms. Remains 108 /324 variables (removed 216) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 108 cols
[2024-05-31 09:18:10] [INFO ] Computed 17 invariants in 6 ms
[2024-05-31 09:18:10] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-05-31 09:18:10] [INFO ] Invariant cache hit.
[2024-05-31 09:18:10] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
[2024-05-31 09:18:10] [INFO ] Invariant cache hit.
[2024-05-31 09:18:10] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 108/324 places, 216/216 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 445 ms. Remains : 108/324 places, 216/216 transitions.
Stuttering acceptance computed with spot in 198 ms :[(NOT p2), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p2), false]
Running random walk in product with property : Sudoku-PT-AN06-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=p0, acceptance={0} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=3 dest: 3}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s88 0) (EQ s29 1)), p2:(OR (EQ s101 0) (EQ s52 1)), p1:(EQ s64 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 23793 steps with 9328 reset in 499 ms.
FORMULA Sudoku-PT-AN06-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN06-LTLCardinality-15 finished in 1163 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||(p1&&G(p2)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
[2024-05-31 09:18:11] [INFO ] Flatten gal took : 25 ms
Using solver Z3 to compute partial order matrices.
[2024-05-31 09:18:11] [INFO ] Applying decomposition
Built C files in :
/tmp/ltsmin18198046576530745073
[2024-05-31 09:18:11] [INFO ] Computing symmetric may disable matrix : 216 transitions.
[2024-05-31 09:18:11] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 09:18:11] [INFO ] Computing symmetric may enable matrix : 216 transitions.
[2024-05-31 09:18:11] [INFO ] Flatten gal took : 13 ms
[2024-05-31 09:18:11] [INFO ] Computation of Complete enable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 09:18:11] [INFO ] Computing Do-Not-Accords matrix : 216 transitions.
[2024-05-31 09:18:11] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 09:18:11] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18198046576530745073
Running compilation step : cd /tmp/ltsmin18198046576530745073;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph13292268444106569483.txt' '-o' '/tmp/graph13292268444106569483.bin' '-w' '/tmp/graph13292268444106569483.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13292268444106569483.bin' '-l' '-1' '-v' '-w' '/tmp/graph13292268444106569483.weights' '-q' '0' '-e' '0.001'
[2024-05-31 09:18:11] [INFO ] Decomposing Gal with order
[2024-05-31 09:18:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 09:18:11] [INFO ] Removed a total of 360 redundant transitions.
[2024-05-31 09:18:11] [INFO ] Flatten gal took : 68 ms
[2024-05-31 09:18:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2024-05-31 09:18:11] [INFO ] Time to serialize gal into /tmp/LTLCardinality14245941085451053892.gal : 4 ms
[2024-05-31 09:18:11] [INFO ] Time to serialize properties into /tmp/LTLCardinality4360357032809569332.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality14245941085451053892.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality4360357032809569332.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 2 LTL properties
Checking formula 0 : !((X((F("(((((((gu2.Columns_0_0+gu2.Columns_0_1)+(gu2.Columns_0_2+gu2.Columns_0_3))+((gu2.Columns_0_4+gu2.Columns_0_5)+(gu2.Columns_1_...1786
Formula 0 simplified : X(G!"(((((((gu2.Columns_0_0+gu2.Columns_0_1)+(gu2.Columns_0_2+gu2.Columns_0_3))+((gu2.Columns_0_4+gu2.Columns_0_5)+(gu2.Columns_1_0+...1778
Compilation finished in 545 ms.
Running link step : cd /tmp/ltsmin18198046576530745073;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin18198046576530745073;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((<>((LTLAPp0==true))||((LTLAPp1==true)&&[]((LTLAPp2==true)))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 4/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.013: LTL layer: formula: X((<>((LTLAPp0==true))||((LTLAPp1==true)&&[]((LTLAPp2==true)))))
pins2lts-mc-linux64( 6/ 8), 0.014: "X((<>((LTLAPp0==true))||((LTLAPp1==true)&&[]((LTLAPp2==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.014: Using Spin LTL semantics
pins2lts-mc-linux64( 4/ 8), 0.015: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.016: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.021: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.020: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.020: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.020: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.020: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.024: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.024: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.024: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.017: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.017: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.017: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.023: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.027: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.020: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.031: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.127: DFS-FIFO for weak LTL, using special progress label 221
pins2lts-mc-linux64( 0/ 8), 0.127: There are 222 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.127: State length is 325, there are 223 groups
pins2lts-mc-linux64( 0/ 8), 0.127: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.127: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.127: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.127: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 5/ 8), 2.512: ~1 levels ~960 states ~190304 transitions
pins2lts-mc-linux64( 5/ 8), 3.839: ~1 levels ~1920 states ~367648 transitions
pins2lts-mc-linux64( 6/ 8), 6.500: ~1 levels ~3840 states ~710080 transitions
pins2lts-mc-linux64( 1/ 8), 9.321: ~1 levels ~7680 states ~1421088 transitions
pins2lts-mc-linux64( 1/ 8), 12.864: ~1 levels ~15360 states ~2839856 transitions
pins2lts-mc-linux64( 1/ 8), 17.298: ~1 levels ~30720 states ~5522352 transitions
pins2lts-mc-linux64( 1/ 8), 22.970: ~1 levels ~61440 states ~10757616 transitions
pins2lts-mc-linux64( 2/ 8), 33.766: ~1 levels ~122880 states ~21042040 transitions
pins2lts-mc-linux64( 1/ 8), 56.559: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 61.046:
pins2lts-mc-linux64( 0/ 8), 61.046: mean standard work distribution: 6.8% (states) 6.5% (transitions)
pins2lts-mc-linux64( 0/ 8), 61.046:
pins2lts-mc-linux64( 0/ 8), 61.046: Explored 187996 states 32329564 transitions, fanout: 171.969
pins2lts-mc-linux64( 0/ 8), 61.046: Total exploration time 60.900 sec (56.920 sec minimum, 58.396 sec on average)
pins2lts-mc-linux64( 0/ 8), 61.046: States per second: 3087, Transitions per second: 530863
pins2lts-mc-linux64( 0/ 8), 61.046:
pins2lts-mc-linux64( 0/ 8), 61.046: Progress states detected: 14663878
pins2lts-mc-linux64( 0/ 8), 61.046: Redundant explorations: -98.7180
pins2lts-mc-linux64( 0/ 8), 61.046:
pins2lts-mc-linux64( 0/ 8), 61.046: Queue width: 8B, total height: 15806334, memory: 120.59MB
pins2lts-mc-linux64( 0/ 8), 61.046: Tree memory: 367.9MB, 26.3 B/state, compr.: 2.0%
pins2lts-mc-linux64( 0/ 8), 61.046: Tree fill ratio (roots/leafs): 10.0%/100.0%
pins2lts-mc-linux64( 0/ 8), 61.046: Stored 216 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 61.046: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 61.046: Est. total memory use: 488.5MB (~1144.6MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin18198046576530745073;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((<>((LTLAPp0==true))||((LTLAPp1==true)&&[]((LTLAPp2==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin18198046576530745073;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((<>((LTLAPp0==true))||((LTLAPp1==true)&&[]((LTLAPp2==true)))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2024-05-31 09:40:00] [INFO ] Applying decomposition
[2024-05-31 09:40:01] [INFO ] Flatten gal took : 171 ms
[2024-05-31 09:40:01] [INFO ] Decomposing Gal with order
[2024-05-31 09:40:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 09:40:01] [INFO ] Removed a total of 353 redundant transitions.
[2024-05-31 09:40:01] [INFO ] Flatten gal took : 148 ms
[2024-05-31 09:40:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 10 ms.
[2024-05-31 09:40:01] [INFO ] Time to serialize gal into /tmp/LTLCardinality6734003021527974390.gal : 24 ms
[2024-05-31 09:40:01] [INFO ] Time to serialize properties into /tmp/LTLCardinality5712756847488348018.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality6734003021527974390.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality5712756847488348018.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 2 LTL properties
Checking formula 0 : !((X((F("(((((((gu79.Columns_0_0+gu37.Columns_0_1)+(gu80.Columns_0_2+gu81.Columns_0_3))+((gu82.Columns_0_4+gu83.Columns_0_5)+(gu84.Col...1887
Formula 0 simplified : X(G!"(((((((gu79.Columns_0_0+gu37.Columns_0_1)+(gu80.Columns_0_2+gu81.Columns_0_3))+((gu82.Columns_0_4+gu83.Columns_0_5)+(gu84.Colum...1879
Detected timeout of ITS tools.
[2024-05-31 10:01:45] [INFO ] Flatten gal took : 138 ms
[2024-05-31 10:01:45] [INFO ] Input system was already deterministic with 216 transitions.
[2024-05-31 10:01:46] [INFO ] Transformed 324 places.
[2024-05-31 10:01:46] [INFO ] Transformed 216 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/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//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-31 10:01:46] [INFO ] Time to serialize gal into /tmp/LTLCardinality1736984194611232692.gal : 12 ms
[2024-05-31 10:01:46] [INFO ] Time to serialize properties into /tmp/LTLCardinality17339079263600987260.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality1736984194611232692.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality17339079263600987260.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X((F("(((((((Columns_0_0+Columns_0_1)+(Columns_0_2+Columns_0_3))+((Columns_0_4+Columns_0_5)+(Columns_1_0+Columns_1_1)))+(((Columns_...1354
Formula 0 simplified : X(G!"(((((((Columns_0_0+Columns_0_1)+(Columns_0_2+Columns_0_3))+((Columns_0_4+Columns_0_5)+(Columns_1_0+Columns_1_1)))+(((Columns_1_...1346
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 162648 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16153316 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Sudoku-PT-AN06"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is Sudoku-PT-AN06, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r417-tall-171690556300382"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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