About the Execution of ITS-Tools for Sudoku-PT-AN10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16215.979 | 3600000.00 | 6958126.00 | 336520.20 | TFTFTF?FFFFFFFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r485-tall-167912699100235.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is Sudoku-PT-AN10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r485-tall-167912699100235
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 36M
-rw-r--r-- 1 mcc users 411K Feb 26 09:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.9M Feb 26 09:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.2M Feb 26 09:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 5.4M Feb 26 09:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 162K Feb 25 17:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 543K Feb 25 17:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 487K Feb 25 17:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 1.8M Feb 25 17:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 673K Feb 26 10:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 3.2M Feb 26 10:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.3M Feb 26 09:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16M Feb 26 09:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 74K Feb 25 17:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 184K Feb 25 17:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 564K Mar 5 18:23 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-AN10-LTLCardinality-00
FORMULA_NAME Sudoku-PT-AN10-LTLCardinality-01
FORMULA_NAME Sudoku-PT-AN10-LTLCardinality-02
FORMULA_NAME Sudoku-PT-AN10-LTLCardinality-03
FORMULA_NAME Sudoku-PT-AN10-LTLCardinality-04
FORMULA_NAME Sudoku-PT-AN10-LTLCardinality-05
FORMULA_NAME Sudoku-PT-AN10-LTLCardinality-06
FORMULA_NAME Sudoku-PT-AN10-LTLCardinality-07
FORMULA_NAME Sudoku-PT-AN10-LTLCardinality-08
FORMULA_NAME Sudoku-PT-AN10-LTLCardinality-09
FORMULA_NAME Sudoku-PT-AN10-LTLCardinality-10
FORMULA_NAME Sudoku-PT-AN10-LTLCardinality-11
FORMULA_NAME Sudoku-PT-AN10-LTLCardinality-12
FORMULA_NAME Sudoku-PT-AN10-LTLCardinality-13
FORMULA_NAME Sudoku-PT-AN10-LTLCardinality-14
FORMULA_NAME Sudoku-PT-AN10-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1679189676859
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=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-PT-AN10
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-19 01:34:38] [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]
[2023-03-19 01:34:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 01:34:38] [INFO ] Load time of PNML (sax parser for PT used): 317 ms
[2023-03-19 01:34:38] [INFO ] Transformed 1300 places.
[2023-03-19 01:34:38] [INFO ] Transformed 1000 transitions.
[2023-03-19 01:34:38] [INFO ] Parsed PT model containing 1300 places and 1000 transitions and 4000 arcs in 404 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 77 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA Sudoku-PT-AN10-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN10-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN10-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN10-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 1300 out of 1300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 25 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 1300 cols
[2023-03-19 01:34:38] [INFO ] Computed 300 place invariants in 22 ms
[2023-03-19 01:34:39] [INFO ] Implicit Places using invariants in 419 ms returned []
[2023-03-19 01:34:39] [INFO ] Invariant cache hit.
[2023-03-19 01:34:40] [INFO ] Implicit Places using invariants and state equation in 741 ms returned []
Implicit Place search using SMT with State Equation took 1183 ms to find 0 implicit places.
[2023-03-19 01:34:40] [INFO ] Invariant cache hit.
[2023-03-19 01:34:40] [INFO ] Dead Transitions using invariants and state equation in 569 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1780 ms. Remains : 1300/1300 places, 1000/1000 transitions.
Support contains 1300 out of 1300 places after structural reductions.
[2023-03-19 01:34:41] [INFO ] Flatten gal took : 134 ms
[2023-03-19 01:34:41] [INFO ] Flatten gal took : 84 ms
[2023-03-19 01:34:41] [INFO ] Input system was already deterministic with 1000 transitions.
Incomplete random walk after 10000 steps, including 114 resets, run finished after 1277 ms. (steps per millisecond=7 ) properties (out of 27) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
[2023-03-19 01:34:43] [INFO ] Invariant cache hit.
[2023-03-19 01:34:44] [INFO ] After 518ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-19 01:34:45] [INFO ] [Nat]Absence check using 300 positive place invariants in 62 ms returned sat
[2023-03-19 01:35:10] [INFO ] After 24215ms SMT Verify possible using state equation in natural domain returned unsat :10 sat :1
[2023-03-19 01:35:10] [INFO ] After 24219ms SMT Verify possible using trap constraints in natural domain returned unsat :10 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-19 01:35:10] [INFO ] After 25031ms SMT Verify possible using all constraints in natural domain returned unsat :10 sat :1
Fused 14 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 300 out of 1300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Graph (complete) has 3000 edges and 1300 vertex of which 300 are kept as prefixes of interest. Removing 1000 places using SCC suffix rule.4 ms
Discarding 1000 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 30 ms. Remains 300 /1300 variables (removed 1000) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 300/1300 places, 1000/1000 transitions.
Incomplete random walk after 10000 steps, including 114 resets, run finished after 841 ms. (steps per millisecond=11 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 120179 steps, run timeout after 3018 ms. (steps per millisecond=39 ) properties seen :{}
Probabilistic random walk after 120179 steps, saw 65847 distinct states, run finished after 3020 ms. (steps per millisecond=39 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1000 rows 300 cols
[2023-03-19 01:35:14] [INFO ] Computed 29 place invariants in 42 ms
[2023-03-19 01:35:14] [INFO ] [Real]Absence check using 0 positive and 29 generalized place invariants in 19 ms returned sat
[2023-03-19 01:35:39] [INFO ] After 25017ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 01:35:39] [INFO ] [Nat]Absence check using 0 positive and 29 generalized place invariants in 19 ms returned sat
[2023-03-19 01:36:04] [INFO ] After 24906ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 01:36:04] [INFO ] After 24910ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 0 ms.
[2023-03-19 01:36:04] [INFO ] After 25019ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 13 ms.
Support contains 200 out of 300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 22 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 300/300 places, 1000/1000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 17 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-19 01:36:04] [INFO ] Invariant cache hit.
[2023-03-19 01:36:04] [INFO ] Implicit Places using invariants in 130 ms returned []
[2023-03-19 01:36:04] [INFO ] Invariant cache hit.
[2023-03-19 01:36:05] [INFO ] Implicit Places using invariants and state equation in 516 ms returned []
Implicit Place search using SMT with State Equation took 649 ms to find 0 implicit places.
[2023-03-19 01:36:05] [INFO ] Redundant transitions in 62 ms returned []
[2023-03-19 01:36:05] [INFO ] Invariant cache hit.
[2023-03-19 01:36:05] [INFO ] Dead Transitions using invariants and state equation in 323 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1064 ms. Remains : 300/300 places, 1000/1000 transitions.
Applied a total of 0 rules in 11 ms. Remains 300 /300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-19 01:36:05] [INFO ] Invariant cache hit.
[2023-03-19 01:36:05] [INFO ] [Real]Absence check using 0 positive and 29 generalized place invariants in 18 ms returned sat
[2023-03-19 01:36:19] [INFO ] After 14158ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 01:36:19] [INFO ] [Nat]Absence check using 0 positive and 29 generalized place invariants in 19 ms returned sat
[2023-03-19 01:36:32] [INFO ] After 12679ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 01:36:35] [INFO ] After 15998ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9088 ms.
[2023-03-19 01:36:44] [INFO ] After 25187ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
FORMULA Sudoku-PT-AN10-LTLCardinality-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 10 atomic propositions for a total of 11 simplifications.
FORMULA Sudoku-PT-AN10-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN10-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN10-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN10-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN10-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1300 stabilizing places and 1000 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1300 transition count 1000
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((F(p0)&&F(p1)))||(F(p0)&&X((F(p1)&&X(F(p2))))))))'
Support contains 1200 out of 1300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 7 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 1300 cols
[2023-03-19 01:36:45] [INFO ] Computed 300 place invariants in 5 ms
[2023-03-19 01:36:45] [INFO ] Implicit Places using invariants in 325 ms returned []
[2023-03-19 01:36:45] [INFO ] Invariant cache hit.
[2023-03-19 01:36:46] [INFO ] Implicit Places using invariants and state equation in 848 ms returned []
Implicit Place search using SMT with State Equation took 1184 ms to find 0 implicit places.
[2023-03-19 01:36:46] [INFO ] Invariant cache hit.
[2023-03-19 01:36:46] [INFO ] Dead Transitions using invariants and state equation in 537 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1734 ms. Remains : 1300/1300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 484 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Sudoku-PT-AN10-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=true, acceptance={} source=3 dest: 5}, { cond=(NOT p0), acceptance={} source=3 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(LEQ 3 (ADD s1100 s1101 s1102 s1103 s1104 s1105 s1106 s1107 s1108 s1109 s1110 s1111 s1112 s1113 s1114 s1115 s1116 s1117 s1118 s1119 s1120 s1121 s1122 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration timeout after 62510 steps with 15627 reset in 10001 ms.
Product exploration timeout after 62980 steps with 15745 reset in 10002 ms.
Computed a total of 1300 stabilizing places and 1000 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1300 transition count 1000
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X p0), (X p1), true, (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 527 ms. Reduced automaton from 8 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 263 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 114 resets, run finished after 878 ms. (steps per millisecond=11 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 252 ms. (steps per millisecond=39 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 439 ms. (steps per millisecond=22 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-19 01:37:36] [INFO ] Invariant cache hit.
[2023-03-19 01:37:37] [INFO ] [Real]Absence check using 300 positive place invariants in 60 ms returned sat
[2023-03-19 01:37:37] [INFO ] After 641ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X p0), (X p1), true, (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND (NOT p2) (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F p2)]
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p0) (NOT p2))))
Knowledge based reduction with 11 factoid took 378 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN10-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN10-LTLCardinality-02 finished in 52759 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1100 out of 1300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 44 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-19 01:37:38] [INFO ] Invariant cache hit.
[2023-03-19 01:37:38] [INFO ] Implicit Places using invariants in 459 ms returned []
[2023-03-19 01:37:38] [INFO ] Invariant cache hit.
[2023-03-19 01:37:39] [INFO ] Implicit Places using invariants and state equation in 1043 ms returned []
Implicit Place search using SMT with State Equation took 1507 ms to find 0 implicit places.
[2023-03-19 01:37:39] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-19 01:37:39] [INFO ] Invariant cache hit.
[2023-03-19 01:37:40] [INFO ] Dead Transitions using invariants and state equation in 537 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2111 ms. Remains : 1300/1300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN10-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ (ADD s100 s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s115 s116 s117 s118 s119 s120 s121 s122 s123 s124 s125 s126 s127 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 87 steps with 0 reset in 17 ms.
FORMULA Sudoku-PT-AN10-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN10-LTLCardinality-03 finished in 2190 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1200 out of 1300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 24 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-19 01:37:40] [INFO ] Invariant cache hit.
[2023-03-19 01:37:40] [INFO ] Implicit Places using invariants in 306 ms returned []
[2023-03-19 01:37:40] [INFO ] Invariant cache hit.
[2023-03-19 01:37:41] [INFO ] Implicit Places using invariants and state equation in 804 ms returned []
Implicit Place search using SMT with State Equation took 1128 ms to find 0 implicit places.
[2023-03-19 01:37:41] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-19 01:37:41] [INFO ] Invariant cache hit.
[2023-03-19 01:37:41] [INFO ] Dead Transitions using invariants and state equation in 519 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1687 ms. Remains : 1300/1300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN10-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LEQ (ADD s1200 s1201 s1202 s1203 s1204 s1205 s1206 s1207 s1208 s1209 s1210 s1211 s1212 s1213 s1214 s1215 s1216 s1217 s1218 s1219 s1220 s1221 s1222...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration timeout after 75000 steps with 860 reset in 10001 ms.
Product exploration timeout after 74350 steps with 853 reset in 10001 ms.
Computed a total of 1300 stabilizing places and 1000 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1300 transition count 1000
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 152 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Finished random walk after 50 steps, including 0 resets, run visited all 1 properties in 9 ms. (steps per millisecond=5 )
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 158 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
[2023-03-19 01:38:47] [INFO ] Invariant cache hit.
[2023-03-19 01:38:57] [INFO ] [Real]Absence check using 300 positive place invariants in 147 ms returned sat
[2023-03-19 01:38:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 01:38:58] [INFO ] [Real]Absence check using state equation in 1052 ms returned sat
[2023-03-19 01:38:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 01:39:12] [INFO ] [Nat]Absence check using 300 positive place invariants in 4229 ms returned sat
[2023-03-19 01:39:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 01:39:13] [INFO ] [Nat]Absence check using state equation in 1755 ms returned unknown
Could not prove EG (NOT p0)
Support contains 1200 out of 1300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 22 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-19 01:39:13] [INFO ] Invariant cache hit.
[2023-03-19 01:39:14] [INFO ] Implicit Places using invariants in 323 ms returned []
[2023-03-19 01:39:14] [INFO ] Invariant cache hit.
[2023-03-19 01:39:15] [INFO ] Implicit Places using invariants and state equation in 785 ms returned []
Implicit Place search using SMT with State Equation took 1110 ms to find 0 implicit places.
[2023-03-19 01:39:15] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-19 01:39:15] [INFO ] Invariant cache hit.
[2023-03-19 01:39:15] [INFO ] Dead Transitions using invariants and state equation in 524 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1684 ms. Remains : 1300/1300 places, 1000/1000 transitions.
Computed a total of 1300 stabilizing places and 1000 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1300 transition count 1000
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 169 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 128 ms :[(NOT p0)]
Finished random walk after 50 steps, including 0 resets, run visited all 1 properties in 10 ms. (steps per millisecond=5 )
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 182 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
[2023-03-19 01:40:01] [INFO ] Invariant cache hit.
[2023-03-19 01:40:11] [INFO ] [Real]Absence check using 300 positive place invariants in 154 ms returned sat
[2023-03-19 01:40:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 01:40:12] [INFO ] [Real]Absence check using state equation in 1025 ms returned sat
[2023-03-19 01:40:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 01:40:25] [INFO ] [Nat]Absence check using 300 positive place invariants in 4278 ms returned sat
[2023-03-19 01:40:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 01:40:27] [INFO ] [Nat]Absence check using state equation in 1665 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Product exploration timeout after 75200 steps with 863 reset in 10002 ms.
Product exploration timeout after 74630 steps with 856 reset in 10003 ms.
Built C files in :
/tmp/ltsmin10773557148983571820
[2023-03-19 01:40:47] [INFO ] Computing symmetric may disable matrix : 1000 transitions.
[2023-03-19 01:40:47] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 01:40:47] [INFO ] Computing symmetric may enable matrix : 1000 transitions.
[2023-03-19 01:40:47] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 01:40:47] [INFO ] Computing Do-Not-Accords matrix : 1000 transitions.
[2023-03-19 01:40:47] [INFO ] Computation of Completed DNA matrix. took 31 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 01:40:47] [INFO ] Built C files in 275ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10773557148983571820
Running compilation step : cd /tmp/ltsmin10773557148983571820;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10773557148983571820;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10773557148983571820;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 1200 out of 1300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 13 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-19 01:40:50] [INFO ] Invariant cache hit.
[2023-03-19 01:40:50] [INFO ] Implicit Places using invariants in 291 ms returned []
[2023-03-19 01:40:50] [INFO ] Invariant cache hit.
[2023-03-19 01:40:51] [INFO ] Implicit Places using invariants and state equation in 834 ms returned []
Implicit Place search using SMT with State Equation took 1126 ms to find 0 implicit places.
[2023-03-19 01:40:51] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-19 01:40:51] [INFO ] Invariant cache hit.
[2023-03-19 01:40:52] [INFO ] Dead Transitions using invariants and state equation in 515 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1674 ms. Remains : 1300/1300 places, 1000/1000 transitions.
Built C files in :
/tmp/ltsmin6030856539175221531
[2023-03-19 01:40:52] [INFO ] Computing symmetric may disable matrix : 1000 transitions.
[2023-03-19 01:40:52] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 01:40:52] [INFO ] Computing symmetric may enable matrix : 1000 transitions.
[2023-03-19 01:40:52] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 01:40:52] [INFO ] Computing Do-Not-Accords matrix : 1000 transitions.
[2023-03-19 01:40:52] [INFO ] Computation of Completed DNA matrix. took 22 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 01:40:52] [INFO ] Built C files in 246ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6030856539175221531
Running compilation step : cd /tmp/ltsmin6030856539175221531;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6030856539175221531;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6030856539175221531;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-19 01:40:55] [INFO ] Flatten gal took : 62 ms
[2023-03-19 01:40:55] [INFO ] Flatten gal took : 59 ms
[2023-03-19 01:40:55] [INFO ] Time to serialize gal into /tmp/LTL10749428898094933673.gal : 13 ms
[2023-03-19 01:40:55] [INFO ] Time to serialize properties into /tmp/LTL12746467384276227808.prop : 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10749428898094933673.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9117130594266690570.hoa' '-atoms' '/tmp/LTL12746467384276227808.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL12746467384276227808.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9117130594266690570.hoa
Detected timeout of ITS tools.
[2023-03-19 01:41:11] [INFO ] Flatten gal took : 59 ms
[2023-03-19 01:41:11] [INFO ] Flatten gal took : 49 ms
[2023-03-19 01:41:11] [INFO ] Time to serialize gal into /tmp/LTL2796916278614884550.gal : 8 ms
[2023-03-19 01:41:11] [INFO ] Time to serialize properties into /tmp/LTL6986486725629765097.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2796916278614884550.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6986486725629765097.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G("(((((((((Columns_0_0+Columns_0_1)+(Columns_0_2+Columns_0_3))+((Columns_0_4+Columns_0_5)+(Columns_0_6+Columns_0_7)))+(((Columns...30534
Formula 0 simplified : GF!"(((((((((Columns_0_0+Columns_0_1)+(Columns_0_2+Columns_0_3))+((Columns_0_4+Columns_0_5)+(Columns_0_6+Columns_0_7)))+(((Columns_0...30528
Detected timeout of ITS tools.
[2023-03-19 01:41:26] [INFO ] Flatten gal took : 50 ms
[2023-03-19 01:41:26] [INFO ] Applying decomposition
[2023-03-19 01:41:26] [INFO ] Flatten gal took : 42 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph16557282210215895307.txt' '-o' '/tmp/graph16557282210215895307.bin' '-w' '/tmp/graph16557282210215895307.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph16557282210215895307.bin' '-l' '-1' '-v' '-w' '/tmp/graph16557282210215895307.weights' '-q' '0' '-e' '0.001'
[2023-03-19 01:41:29] [INFO ] Decomposing Gal with order
[2023-03-19 01:41:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 01:41:30] [INFO ] Removed a total of 1800 redundant transitions.
[2023-03-19 01:41:30] [INFO ] Flatten gal took : 983 ms
[2023-03-19 01:41:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 19 ms.
[2023-03-19 01:41:30] [INFO ] Time to serialize gal into /tmp/LTL18224191507910081866.gal : 13 ms
[2023-03-19 01:41:30] [INFO ] Time to serialize properties into /tmp/LTL16876265771499579799.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18224191507910081866.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16876265771499579799.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(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_0...47734
Formula 0 simplified : GF!"(((((((((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_0_6...47728
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10281415162687067610
[2023-03-19 01:41:45] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10281415162687067610
Running compilation step : cd /tmp/ltsmin10281415162687067610;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2315 ms.
Running link step : cd /tmp/ltsmin10281415162687067610;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin10281415162687067610;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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-AN10-LTLCardinality-06 finished in 260603 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))&&F(p1))))'
Support contains 1100 out of 1300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Applied a total of 0 rules in 12 ms. Remains 1300 /1300 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-19 01:42:00] [INFO ] Invariant cache hit.
[2023-03-19 01:42:01] [INFO ] Implicit Places using invariants in 466 ms returned []
[2023-03-19 01:42:01] [INFO ] Invariant cache hit.
[2023-03-19 01:42:02] [INFO ] Implicit Places using invariants and state equation in 1016 ms returned []
Implicit Place search using SMT with State Equation took 1484 ms to find 0 implicit places.
[2023-03-19 01:42:02] [INFO ] Invariant cache hit.
[2023-03-19 01:42:02] [INFO ] Dead Transitions using invariants and state equation in 524 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2021 ms. Remains : 1300/1300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-PT-AN10-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p0:(LEQ 2 (ADD s100 s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s115 s116 s117 s118 s119 s120 s121 s122 s123 s124 s125 s126 s127...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 85 steps with 0 reset in 14 ms.
FORMULA Sudoku-PT-AN10-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN10-LTLCardinality-07 finished in 2271 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&F(G(p1)))))'
Support contains 3 out of 1300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Graph (complete) has 3000 edges and 1300 vertex of which 301 are kept as prefixes of interest. Removing 999 places using SCC suffix rule.7 ms
Discarding 999 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 130 ms. Remains 301 /1300 variables (removed 999) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 301 cols
[2023-03-19 01:42:03] [INFO ] Computed 29 place invariants in 38 ms
[2023-03-19 01:42:03] [INFO ] Implicit Places using invariants in 329 ms returned []
[2023-03-19 01:42:03] [INFO ] Invariant cache hit.
[2023-03-19 01:42:04] [INFO ] Implicit Places using invariants and state equation in 1006 ms returned []
Implicit Place search using SMT with State Equation took 1341 ms to find 0 implicit places.
[2023-03-19 01:42:04] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-19 01:42:04] [INFO ] Invariant cache hit.
[2023-03-19 01:42:04] [INFO ] Dead Transitions using invariants and state equation in 335 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 301/1300 places, 1000/1000 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1831 ms. Remains : 301/1300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN10-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT 1 s35), p1:(LEQ s100 s123)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 330 steps with 3 reset in 24 ms.
FORMULA Sudoku-PT-AN10-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN10-LTLCardinality-08 finished in 1990 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&F(p1)))'
Support contains 5 out of 1300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1300/1300 places, 1000/1000 transitions.
Reduce places removed 997 places and 0 transitions.
Iterating post reduction 0 with 997 rules applied. Total rules applied 997 place count 303 transition count 1000
Applied a total of 997 rules in 16 ms. Remains 303 /1300 variables (removed 997) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 303 cols
[2023-03-19 01:42:05] [INFO ] Computed 29 place invariants in 68 ms
[2023-03-19 01:42:05] [INFO ] Implicit Places using invariants in 314 ms returned []
[2023-03-19 01:42:05] [INFO ] Invariant cache hit.
[2023-03-19 01:42:06] [INFO ] Implicit Places using invariants and state equation in 776 ms returned []
Implicit Place search using SMT with State Equation took 1092 ms to find 0 implicit places.
[2023-03-19 01:42:06] [INFO ] Invariant cache hit.
[2023-03-19 01:42:06] [INFO ] Dead Transitions using invariants and state equation in 328 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 303/1300 places, 1000/1000 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1438 ms. Remains : 303/1300 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : Sudoku-PT-AN10-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(OR (LEQ 2 s102) (GT s101 s290)), p0:(LEQ s100 s199)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 84 steps with 0 reset in 5 ms.
FORMULA Sudoku-PT-AN10-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN10-LTLCardinality-15 finished in 1579 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2023-03-19 01:42:06] [INFO ] Flatten gal took : 64 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17596139600393417522
[2023-03-19 01:42:06] [INFO ] Computing symmetric may disable matrix : 1000 transitions.
[2023-03-19 01:42:06] [INFO ] Applying decomposition
[2023-03-19 01:42:06] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 01:42:06] [INFO ] Computing symmetric may enable matrix : 1000 transitions.
[2023-03-19 01:42:06] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 01:42:06] [INFO ] Flatten gal took : 60 ms
[2023-03-19 01:42:07] [INFO ] Computing Do-Not-Accords matrix : 1000 transitions.
[2023-03-19 01:42:07] [INFO ] Computation of Completed DNA matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 01:42:07] [INFO ] Built C files in 365ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17596139600393417522
Running compilation step : cd /tmp/ltsmin17596139600393417522;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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.202303021504/bin/convert-linux64' '-i' '/tmp/graph10524426546267086483.txt' '-o' '/tmp/graph10524426546267086483.bin' '-w' '/tmp/graph10524426546267086483.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph10524426546267086483.bin' '-l' '-1' '-v' '-w' '/tmp/graph10524426546267086483.weights' '-q' '0' '-e' '0.001'
[2023-03-19 01:42:09] [INFO ] Decomposing Gal with order
[2023-03-19 01:42:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 01:42:10] [INFO ] Removed a total of 1800 redundant transitions.
[2023-03-19 01:42:10] [INFO ] Flatten gal took : 753 ms
[2023-03-19 01:42:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 10 ms.
[2023-03-19 01:42:10] [INFO ] Time to serialize gal into /tmp/LTLCardinality6490074408659672257.gal : 9 ms
[2023-03-19 01:42:10] [INFO ] Time to serialize properties into /tmp/LTLCardinality18154231268142555393.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality6490074408659672257.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality18154231268142555393.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !((F(G("(((((((((gi1.gu2.Columns_0_0+gi1.gu2.Columns_0_1)+(gi1.gu2.Columns_0_2+gi1.gu2.Columns_0_3))+((gi1.gu2.Columns_0_4+gi1.gu2.Col...47734
Formula 0 simplified : GF!"(((((((((gi1.gu2.Columns_0_0+gi1.gu2.Columns_0_1)+(gi1.gu2.Columns_0_2+gi1.gu2.Columns_0_3))+((gi1.gu2.Columns_0_4+gi1.gu2.Colum...47728
Compilation finished in 3603 ms.
Running link step : cd /tmp/ltsmin17596139600393417522;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 79 ms.
Running LTSmin : cd /tmp/ltsmin17596139600393417522;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.006: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.017: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.017: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.017: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.017: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.033: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.033: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.036: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.036: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.036: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.036: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.202: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.229: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.252: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.261: Initializing POR dependencies: labels 1001, guards 1000
pins2lts-mc-linux64( 5/ 8), 0.409: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 1.081: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 1.625: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 1.730: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 1.826: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 35.922: LTL layer: formula: <>([]((LTLAPp0==true)))
pins2lts-mc-linux64( 4/ 8), 35.922: "<>([]((LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 35.923: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 37.714: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 37.747: There are 1002 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 37.747: State length is 1301, there are 1004 groups
pins2lts-mc-linux64( 0/ 8), 37.747: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 37.747: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 37.747: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 37.747: Visible groups: 0 / 1004, labels: 1 / 1002
pins2lts-mc-linux64( 0/ 8), 37.747: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 37.747: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 0/ 8), 41.566: [Blue] ~88 levels ~960 states ~211120 transitions
pins2lts-mc-linux64( 6/ 8), 41.641: [Blue] ~88 levels ~1920 states ~214144 transitions
pins2lts-mc-linux64( 1/ 8), 41.843: [Blue] ~89 levels ~3840 states ~222912 transitions
pins2lts-mc-linux64( 1/ 8), 42.215: [Blue] ~89 levels ~7680 states ~240640 transitions
pins2lts-mc-linux64( 0/ 8), 43.042: [Blue] ~89 levels ~15360 states ~281328 transitions
pins2lts-mc-linux64( 3/ 8), 44.657: [Blue] ~91 levels ~30720 states ~358936 transitions
pins2lts-mc-linux64( 4/ 8), 52.427: [Blue] ~86 levels ~61440 states ~561904 transitions
pins2lts-mc-linux64( 2/ 8), 59.517: [Blue] ~86 levels ~122880 states ~907296 transitions
pins2lts-mc-linux64( 2/ 8), 77.889: [Blue] ~86 levels ~245760 states ~1715096 transitions
pins2lts-mc-linux64( 2/ 8), 107.462: [Blue] ~87 levels ~491520 states ~3361312 transitions
pins2lts-mc-linux64( 2/ 8), 185.474: [Blue] ~87 levels ~983040 states ~7001456 transitions
pins2lts-mc-linux64( 2/ 8), 309.076: [Blue] ~87 levels ~1966080 states ~14267944 transitions
pins2lts-mc-linux64( 2/ 8), 561.366: [Blue] ~88 levels ~3932160 states ~29029448 transitions
pins2lts-mc-linux64( 7/ 8), 1127.468: [Blue] ~88 levels ~7864320 states ~64881680 transitions
pins2lts-mc-linux64( 0/ 8), 1256.483: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1256.539:
pins2lts-mc-linux64( 0/ 8), 1256.539: Explored 8568439 states 72567758 transitions, fanout: 8.469
pins2lts-mc-linux64( 0/ 8), 1256.539: Total exploration time 1218.790 sec (1218.700 sec minimum, 1218.754 sec on average)
pins2lts-mc-linux64( 0/ 8), 1256.539: States per second: 7030, Transitions per second: 59541
pins2lts-mc-linux64( 0/ 8), 1256.539:
pins2lts-mc-linux64( 0/ 8), 1256.539: State space has 8770591 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 1256.539: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 1256.539: blue states: 8568439 (97.70%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 1256.539: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 1256.539: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 1256.539:
pins2lts-mc-linux64( 0/ 8), 1256.539: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 1256.539:
pins2lts-mc-linux64( 0/ 8), 1256.539: Queue width: 8B, total height: 714, memory: 0.01MB
pins2lts-mc-linux64( 0/ 8), 1256.539: Tree memory: 322.9MB, 38.6 B/state, compr.: 0.7%
pins2lts-mc-linux64( 0/ 8), 1256.539: Tree fill ratio (roots/leafs): 6.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 1256.539: Stored 1011 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1256.539: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1256.539: Est. total memory use: 322.9MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17596139600393417522;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17596139600393417522;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java: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.
[2023-03-19 02:04:40] [INFO ] Flatten gal took : 40 ms
[2023-03-19 02:04:40] [INFO ] Time to serialize gal into /tmp/LTLCardinality4710711021651296825.gal : 7 ms
[2023-03-19 02:04:40] [INFO ] Time to serialize properties into /tmp/LTLCardinality14872250176936209092.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality4710711021651296825.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality14872250176936209092.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !((F(G("(((((((((Columns_0_0+Columns_0_1)+(Columns_0_2+Columns_0_3))+((Columns_0_4+Columns_0_5)+(Columns_0_6+Columns_0_7)))+(((Columns...30534
Formula 0 simplified : GF!"(((((((((Columns_0_0+Columns_0_1)+(Columns_0_2+Columns_0_3))+((Columns_0_4+Columns_0_5)+(Columns_0_6+Columns_0_7)))+(((Columns_0...30528
Detected timeout of ITS tools.
[2023-03-19 02:27:12] [INFO ] Flatten gal took : 361 ms
[2023-03-19 02:27:14] [INFO ] Input system was already deterministic with 1000 transitions.
[2023-03-19 02:27:14] [INFO ] Transformed 1300 places.
[2023-03-19 02:27:14] [INFO ] Transformed 1000 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
[2023-03-19 02:27:14] [INFO ] Time to serialize gal into /tmp/LTLCardinality2455978085551450667.gal : 15 ms
[2023-03-19 02:27:14] [INFO ] Time to serialize properties into /tmp/LTLCardinality17292392573395363354.ltl : 8 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality2455978085551450667.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality17292392573395363354.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G("(((((((((Columns_0_0+Columns_0_1)+(Columns_0_2+Columns_0_3))+((Columns_0_4+Columns_0_5)+(Columns_0_6+Columns_0_7)))+(((Columns...30534
Formula 0 simplified : GF!"(((((((((Columns_0_0+Columns_0_1)+(Columns_0_2+Columns_0_3))+((Columns_0_4+Columns_0_5)+(Columns_0_6+Columns_0_7)))+(((Columns_0...30528
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 4678104 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15712512 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:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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-AN10"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is Sudoku-PT-AN10, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r485-tall-167912699100235"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-PT-AN10.tgz
mv Sudoku-PT-AN10 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
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 ;