About the Execution of 2023-gold for Sudoku-PT-AN14
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16220.552 | 3600000.00 | 3183559.00 | 570349.80 | TFFFFTT?TFTFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r417-tall-171690556400422.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is Sudoku-PT-AN14, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r417-tall-171690556400422
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 70M
-rw-r--r-- 1 mcc users 1.2M Apr 12 12:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 5.1M Apr 12 12:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1M Apr 12 10:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 15M Apr 12 10:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 702K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 2.2M Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.5M Apr 23 08:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 5.2M Apr 23 08:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.5M Apr 12 13:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 7.0M Apr 12 13:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.6M Apr 12 12:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22M Apr 12 12:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 98K Apr 23 08:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 237K Apr 23 08:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.5M May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME Sudoku-PT-AN14-LTLCardinality-00
FORMULA_NAME Sudoku-PT-AN14-LTLCardinality-01
FORMULA_NAME Sudoku-PT-AN14-LTLCardinality-02
FORMULA_NAME Sudoku-PT-AN14-LTLCardinality-03
FORMULA_NAME Sudoku-PT-AN14-LTLCardinality-04
FORMULA_NAME Sudoku-PT-AN14-LTLCardinality-05
FORMULA_NAME Sudoku-PT-AN14-LTLCardinality-06
FORMULA_NAME Sudoku-PT-AN14-LTLCardinality-07
FORMULA_NAME Sudoku-PT-AN14-LTLCardinality-08
FORMULA_NAME Sudoku-PT-AN14-LTLCardinality-09
FORMULA_NAME Sudoku-PT-AN14-LTLCardinality-10
FORMULA_NAME Sudoku-PT-AN14-LTLCardinality-11
FORMULA_NAME Sudoku-PT-AN14-LTLCardinality-12
FORMULA_NAME Sudoku-PT-AN14-LTLCardinality-13
FORMULA_NAME Sudoku-PT-AN14-LTLCardinality-14
FORMULA_NAME Sudoku-PT-AN14-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1717156288487
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-PT-AN14
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-31 11:51:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-31 11:51:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 11:51:30] [INFO ] Load time of PNML (sax parser for PT used): 198 ms
[2024-05-31 11:51:30] [INFO ] Transformed 3332 places.
[2024-05-31 11:51:30] [INFO ] Transformed 2744 transitions.
[2024-05-31 11:51:30] [INFO ] Found NUPN structural information;
[2024-05-31 11:51:30] [INFO ] Parsed PT model containing 3332 places and 2744 transitions and 10976 arcs in 287 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 384 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 7 formulas.
FORMULA Sudoku-PT-AN14-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN14-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN14-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN14-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN14-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN14-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN14-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN14-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN14-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 3332 out of 3332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 37 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
// Phase 1: matrix 2744 rows 3332 cols
[2024-05-31 11:51:30] [INFO ] Computed 588 invariants in 46 ms
[2024-05-31 11:51:31] [INFO ] Implicit Places using invariants in 1057 ms returned []
[2024-05-31 11:51:32] [INFO ] Invariant cache hit.
[2024-05-31 11:51:32] [INFO ] Implicit Places using invariants and state equation in 557 ms returned []
Implicit Place search using SMT with State Equation took 1642 ms to find 0 implicit places.
[2024-05-31 11:51:32] [INFO ] Invariant cache hit.
[2024-05-31 11:51:34] [INFO ] Dead Transitions using invariants and state equation in 1735 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3430 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Support contains 3332 out of 3332 places after structural reductions.
[2024-05-31 11:51:34] [INFO ] Flatten gal took : 250 ms
[2024-05-31 11:51:34] [INFO ] Flatten gal took : 154 ms
[2024-05-31 11:51:35] [INFO ] Input system was already deterministic with 2744 transitions.
Incomplete random walk after 10000 steps, including 57 resets, run finished after 2159 ms. (steps per millisecond=4 ) properties (out of 13) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 246 ms. (steps per millisecond=40 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-31 11:51:37] [INFO ] Invariant cache hit.
[2024-05-31 11:51:38] [INFO ] After 621ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 11:51:39] [INFO ] [Nat]Absence check using 588 positive place invariants in 184 ms returned sat
[2024-05-31 11:52:03] [INFO ] After 25029ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 196 out of 3332 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Graph (complete) has 8232 edges and 3332 vertex of which 588 are kept as prefixes of interest. Removing 2744 places using SCC suffix rule.13 ms
Discarding 2744 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 134 ms. Remains 588 /3332 variables (removed 2744) and now considering 2744/2744 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 135 ms. Remains : 588/3332 places, 2744/2744 transitions.
Incomplete random walk after 10000 steps, including 58 resets, run finished after 1686 ms. (steps per millisecond=5 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 170269 steps, run timeout after 3007 ms. (steps per millisecond=56 ) properties seen :{}
Probabilistic random walk after 170269 steps, saw 170185 distinct states, run finished after 3009 ms. (steps per millisecond=56 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2744 rows 588 cols
[2024-05-31 11:52:08] [INFO ] Computed 41 invariants in 227 ms
[2024-05-31 11:52:09] [INFO ] [Real]Absence check using 0 positive and 41 generalized place invariants in 31 ms returned sat
[2024-05-31 11:52:11] [INFO ] After 2153ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 11:52:11] [INFO ] [Nat]Absence check using 0 positive and 41 generalized place invariants in 30 ms returned sat
[2024-05-31 11:52:13] [INFO ] After 2148ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 11:52:13] [INFO ] After 2257ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 57 ms.
[2024-05-31 11:52:13] [INFO ] After 2480ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 196 steps, including 0 resets, run visited all 1 properties in 11 ms. (steps per millisecond=17 )
Parikh walk visited 1 properties in 13 ms.
Successfully simplified 1 atomic propositions for a total of 7 simplifications.
Computed a total of 3332 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3332 transition count 2744
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 196 out of 3332 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Graph (complete) has 8232 edges and 3332 vertex of which 588 are kept as prefixes of interest. Removing 2744 places using SCC suffix rule.11 ms
Discarding 2744 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 55 ms. Remains 588 /3332 variables (removed 2744) and now considering 2744/2744 (removed 0) transitions.
[2024-05-31 11:52:13] [INFO ] Invariant cache hit.
[2024-05-31 11:52:16] [INFO ] Implicit Places using invariants in 2134 ms returned []
[2024-05-31 11:52:16] [INFO ] Invariant cache hit.
[2024-05-31 11:52:32] [INFO ] Implicit Places using invariants and state equation in 16429 ms returned []
Implicit Place search using SMT with State Equation took 18565 ms to find 0 implicit places.
[2024-05-31 11:52:32] [INFO ] Redundant transitions in 159 ms returned []
[2024-05-31 11:52:32] [INFO ] Invariant cache hit.
[2024-05-31 11:52:34] [INFO ] Dead Transitions using invariants and state equation in 2067 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 588/3332 places, 2744/2744 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 20855 ms. Remains : 588/3332 places, 2744/2744 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 207 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN14-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 1 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s3...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 163 steps with 0 reset in 42 ms.
FORMULA Sudoku-PT-AN14-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN14-LTLCardinality-01 finished in 21163 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((G(F(p0))&&F(p1))))))'
Support contains 3136 out of 3332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 38 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
// Phase 1: matrix 2744 rows 3332 cols
[2024-05-31 11:52:35] [INFO ] Computed 588 invariants in 17 ms
[2024-05-31 11:52:35] [INFO ] Implicit Places using invariants in 715 ms returned []
[2024-05-31 11:52:35] [INFO ] Invariant cache hit.
[2024-05-31 11:52:36] [INFO ] Implicit Places using invariants and state equation in 756 ms returned []
Implicit Place search using SMT with State Equation took 1476 ms to find 0 implicit places.
[2024-05-31 11:52:36] [INFO ] Invariant cache hit.
[2024-05-31 11:52:38] [INFO ] Dead Transitions using invariants and state equation in 1622 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3139 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 281 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN14-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=true, acceptance={} source=3 dest: 5}, { cond=(NOT p1), acceptance={} source=3 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(LEQ (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration timeout after 31230 steps with 314 reset in 10003 ms.
Product exploration timeout after 31230 steps with 314 reset in 10001 ms.
Computed a total of 3332 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3332 transition count 2744
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 117 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 318 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Finished random walk after 99 steps, including 0 resets, run visited all 2 properties in 42 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 3 factoid took 179 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 314 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 297 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
[2024-05-31 11:53:01] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
[2024-05-31 11:53:17] [INFO ] Invariant cache hit.
Could not prove EG (NOT p1)
Support contains 3136 out of 3332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 31 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2024-05-31 11:53:32] [INFO ] Invariant cache hit.
[2024-05-31 11:53:33] [INFO ] Implicit Places using invariants in 783 ms returned []
[2024-05-31 11:53:33] [INFO ] Invariant cache hit.
[2024-05-31 11:53:34] [INFO ] Implicit Places using invariants and state equation in 780 ms returned []
Implicit Place search using SMT with State Equation took 1566 ms to find 0 implicit places.
[2024-05-31 11:53:34] [INFO ] Invariant cache hit.
[2024-05-31 11:53:36] [INFO ] Dead Transitions using invariants and state equation in 1847 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3447 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Computed a total of 3332 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3332 transition count 2744
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 121 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 282 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Finished random walk after 99 steps, including 0 resets, run visited all 2 properties in 45 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 3 factoid took 169 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 319 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 279 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
[2024-05-31 11:53:39] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
[2024-05-31 11:53:55] [INFO ] Invariant cache hit.
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 286 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Product exploration timeout after 31140 steps with 313 reset in 10001 ms.
Product exploration timeout after 31360 steps with 315 reset in 10002 ms.
Applying partial POR strategy [false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 448 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Support contains 3136 out of 3332 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 65 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2024-05-31 11:54:31] [INFO ] Redundant transitions in 198 ms returned []
[2024-05-31 11:54:31] [INFO ] Invariant cache hit.
[2024-05-31 11:54:33] [INFO ] Dead Transitions using invariants and state equation in 1802 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2077 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Built C files in :
/tmp/ltsmin14341070488152124336
[2024-05-31 11:54:33] [INFO ] Built C files in 62ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14341070488152124336
Running compilation step : cd /tmp/ltsmin14341070488152124336;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin14341070488152124336;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14341070488152124336;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' 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 3136 out of 3332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 12 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2024-05-31 11:54:36] [INFO ] Invariant cache hit.
[2024-05-31 11:54:37] [INFO ] Implicit Places using invariants in 761 ms returned []
[2024-05-31 11:54:37] [INFO ] Invariant cache hit.
[2024-05-31 11:54:38] [INFO ] Implicit Places using invariants and state equation in 764 ms returned []
Implicit Place search using SMT with State Equation took 1529 ms to find 0 implicit places.
[2024-05-31 11:54:38] [INFO ] Invariant cache hit.
[2024-05-31 11:54:39] [INFO ] Dead Transitions using invariants and state equation in 1871 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3414 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Built C files in :
/tmp/ltsmin4975615973296255750
[2024-05-31 11:54:40] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4975615973296255750
Running compilation step : cd /tmp/ltsmin4975615973296255750;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin4975615973296255750;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4975615973296255750;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' 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)
[2024-05-31 11:54:43] [INFO ] Flatten gal took : 130 ms
[2024-05-31 11:54:43] [INFO ] Flatten gal took : 128 ms
[2024-05-31 11:54:43] [INFO ] Time to serialize gal into /tmp/LTL12441891612737750810.gal : 27 ms
[2024-05-31 11:54:43] [INFO ] Time to serialize properties into /tmp/LTL16184595873805852069.prop : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12441891612737750810.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9097463447038654615.hoa' '-atoms' '/tmp/LTL16184595873805852069.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL16184595873805852069.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9097463447038654615.hoa
Detected timeout of ITS tools.
[2024-05-31 11:54:58] [INFO ] Flatten gal took : 124 ms
[2024-05-31 11:54:58] [INFO ] Flatten gal took : 129 ms
[2024-05-31 11:54:59] [INFO ] Time to serialize gal into /tmp/LTL17465369565926386710.gal : 25 ms
[2024-05-31 11:54:59] [INFO ] Time to serialize properties into /tmp/LTL302238128586528575.ltl : 10 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17465369565926386710.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL302238128586528575.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(X((G(F("(((((((((Rows_0_0+Rows_0_1)+(Rows_0_2+Rows_0_3))+((Rows_0_4+Rows_0_5)+(Rows_0_6+Rows_0_7)))+(((Rows_0_8+Rows_0_9)+(Rows...86709
Formula 0 simplified : XXX(FG!"(((((((((Rows_0_0+Rows_0_1)+(Rows_0_2+Rows_0_3))+((Rows_0_4+Rows_0_5)+(Rows_0_6+Rows_0_7)))+(((Rows_0_8+Rows_0_9)+(Rows_0_10...86695
Detected timeout of ITS tools.
[2024-05-31 11:55:14] [INFO ] Flatten gal took : 106 ms
[2024-05-31 11:55:14] [INFO ] Applying decomposition
[2024-05-31 11:55:14] [INFO ] Flatten gal took : 126 ms
[2024-05-31 11:55:30] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.util.concurrent.TimeoutException: Subprocess running '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph798554951341125443.txt' '-o' '/tmp/graph798554951341125443.bin' '-w' '/tmp/graph798554951341125443.weights' killed by timeout after 10 SECONDS
at fr.lip6.move.gal.process.Runner.waitForOrTimeout(Runner.java:76)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:47)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:27)
at fr.lip6.move.gal.louvain.GraphBuilder.convertGraphToBin(GraphBuilder.java:258)
at fr.lip6.move.gal.louvain.GraphBuilder.computeLouvain(GraphBuilder.java:189)
at fr.lip6.move.gal.louvain.GraphBuilder.computeLouvain(GraphBuilder.java:157)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:226)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:277)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:663)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:341)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-31 11:55:30] [INFO ] Flatten gal took : 111 ms
[2024-05-31 11:55:30] [INFO ] Time to serialize gal into /tmp/LTL5857547634717646468.gal : 19 ms
[2024-05-31 11:55:30] [INFO ] Time to serialize properties into /tmp/LTL4659302352146676302.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5857547634717646468.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4659302352146676302.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(X((G(F("(((((((((Rows_0_0+Rows_0_1)+(Rows_0_2+Rows_0_3))+((Rows_0_4+Rows_0_5)+(Rows_0_6+Rows_0_7)))+(((Rows_0_8+Rows_0_9)+(Rows...86709
Formula 0 simplified : XXX(FG!"(((((((((Rows_0_0+Rows_0_1)+(Rows_0_2+Rows_0_3))+((Rows_0_4+Rows_0_5)+(Rows_0_6+Rows_0_7)))+(((Rows_0_8+Rows_0_9)+(Rows_0_10...86695
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14204053322829358455
[2024-05-31 11:55:45] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14204053322829358455
Running compilation step : cd /tmp/ltsmin14204053322829358455;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin14204053322829358455;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14204053322829358455;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' 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)
Treatment of property Sudoku-PT-AN14-LTLCardinality-07 finished in 193745 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||X(p1))))'
Support contains 4 out of 3332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Reduce places removed 2744 places and 0 transitions.
Iterating post reduction 0 with 2744 rules applied. Total rules applied 2744 place count 588 transition count 2744
Applied a total of 2744 rules in 151 ms. Remains 588 /3332 variables (removed 2744) and now considering 2744/2744 (removed 0) transitions.
// Phase 1: matrix 2744 rows 588 cols
[2024-05-31 11:55:49] [INFO ] Computed 41 invariants in 152 ms
[2024-05-31 11:55:52] [INFO ] Implicit Places using invariants in 3180 ms returned []
[2024-05-31 11:55:52] [INFO ] Invariant cache hit.
[2024-05-31 11:56:06] [INFO ] Implicit Places using invariants and state equation in 14087 ms returned []
Implicit Place search using SMT with State Equation took 17273 ms to find 0 implicit places.
[2024-05-31 11:56:06] [INFO ] Invariant cache hit.
[2024-05-31 11:56:08] [INFO ] Dead Transitions using invariants and state equation in 1917 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 588/3332 places, 2744/2744 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19342 ms. Remains : 588/3332 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 229 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN14-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=2, aps=[p1:(OR (EQ s503 0) (EQ s290 1)), p0:(AND (EQ s70 0) (EQ s525 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 98 steps with 32 reset in 35 ms.
FORMULA Sudoku-PT-AN14-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN14-LTLCardinality-09 finished in 19636 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 3332 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Graph (complete) has 8232 edges and 3332 vertex of which 588 are kept as prefixes of interest. Removing 2744 places using SCC suffix rule.8 ms
Discarding 2744 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 79 ms. Remains 588 /3332 variables (removed 2744) and now considering 2744/2744 (removed 0) transitions.
[2024-05-31 11:56:08] [INFO ] Invariant cache hit.
[2024-05-31 11:56:11] [INFO ] Implicit Places using invariants in 2989 ms returned []
[2024-05-31 11:56:11] [INFO ] Invariant cache hit.
[2024-05-31 11:56:29] [INFO ] Implicit Places using invariants and state equation in 18046 ms returned []
Implicit Place search using SMT with State Equation took 21041 ms to find 0 implicit places.
[2024-05-31 11:56:29] [INFO ] Redundant transitions in 59 ms returned []
[2024-05-31 11:56:29] [INFO ] Invariant cache hit.
[2024-05-31 11:56:31] [INFO ] Dead Transitions using invariants and state equation in 1928 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 588/3332 places, 2744/2744 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 23114 ms. Remains : 588/3332 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN14-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s504 0) (EQ s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 352 steps with 2 reset in 80 ms.
FORMULA Sudoku-PT-AN14-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN14-LTLCardinality-11 finished in 23294 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 4 out of 3332 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Graph (complete) has 8232 edges and 3332 vertex of which 588 are kept as prefixes of interest. Removing 2744 places using SCC suffix rule.4 ms
Discarding 2744 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 69 ms. Remains 588 /3332 variables (removed 2744) and now considering 2744/2744 (removed 0) transitions.
[2024-05-31 11:56:31] [INFO ] Invariant cache hit.
[2024-05-31 11:56:34] [INFO ] Implicit Places using invariants in 3062 ms returned []
[2024-05-31 11:56:34] [INFO ] Invariant cache hit.
[2024-05-31 11:56:47] [INFO ] Implicit Places using invariants and state equation in 12436 ms returned []
Implicit Place search using SMT with State Equation took 15503 ms to find 0 implicit places.
[2024-05-31 11:56:47] [INFO ] Redundant transitions in 58 ms returned []
[2024-05-31 11:56:47] [INFO ] Invariant cache hit.
[2024-05-31 11:56:49] [INFO ] Dead Transitions using invariants and state equation in 1833 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 588/3332 places, 2744/2744 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17480 ms. Remains : 588/3332 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-PT-AN14-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s191 0) (EQ s352 1)), p1:(OR (EQ s544 0) (EQ s35 1) (EQ s191 0) (EQ s352 1))], nbAcceptance=2, 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 5184 steps with 29 reset in 853 ms.
FORMULA Sudoku-PT-AN14-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN14-LTLCardinality-12 finished in 18413 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U G(p1))||X(p0))))'
Support contains 4 out of 3332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Reduce places removed 2743 places and 0 transitions.
Iterating post reduction 0 with 2743 rules applied. Total rules applied 2743 place count 589 transition count 2744
Applied a total of 2743 rules in 126 ms. Remains 589 /3332 variables (removed 2743) and now considering 2744/2744 (removed 0) transitions.
// Phase 1: matrix 2744 rows 589 cols
[2024-05-31 11:56:50] [INFO ] Computed 41 invariants in 158 ms
[2024-05-31 11:56:53] [INFO ] Implicit Places using invariants in 3422 ms returned []
[2024-05-31 11:56:53] [INFO ] Invariant cache hit.
[2024-05-31 11:57:10] [INFO ] Implicit Places using invariants and state equation in 16706 ms returned []
Implicit Place search using SMT with State Equation took 20134 ms to find 0 implicit places.
[2024-05-31 11:57:10] [INFO ] Invariant cache hit.
[2024-05-31 11:57:12] [INFO ] Dead Transitions using invariants and state equation in 1822 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 589/3332 places, 2744/2744 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22085 ms. Remains : 589/3332 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 237 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN14-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(OR p1 p0), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=2, aps=[p0:(OR (EQ s53 0) (EQ s474 1)), p1:(OR (EQ s413 0) (EQ s196 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 68 steps with 22 reset in 29 ms.
FORMULA Sudoku-PT-AN14-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN14-LTLCardinality-14 finished in 22387 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)&&X(G(p1))))))'
Support contains 2 out of 3332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Reduce places removed 2744 places and 0 transitions.
Iterating post reduction 0 with 2744 rules applied. Total rules applied 2744 place count 588 transition count 2744
Applied a total of 2744 rules in 72 ms. Remains 588 /3332 variables (removed 2744) and now considering 2744/2744 (removed 0) transitions.
// Phase 1: matrix 2744 rows 588 cols
[2024-05-31 11:57:12] [INFO ] Computed 41 invariants in 117 ms
[2024-05-31 11:57:15] [INFO ] Implicit Places using invariants in 3318 ms returned []
[2024-05-31 11:57:15] [INFO ] Invariant cache hit.
[2024-05-31 11:57:32] [INFO ] Implicit Places using invariants and state equation in 16393 ms returned []
Implicit Place search using SMT with State Equation took 19721 ms to find 0 implicit places.
[2024-05-31 11:57:32] [INFO ] Invariant cache hit.
[2024-05-31 11:57:34] [INFO ] Dead Transitions using invariants and state equation in 1874 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 588/3332 places, 2744/2744 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21669 ms. Remains : 588/3332 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 251 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : Sudoku-PT-AN14-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 5}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=4, aps=[p1:(OR (EQ s220 0) (EQ s15 1)), p0:(AND (EQ s15 0) (EQ s220 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 111 steps with 0 reset in 35 ms.
FORMULA Sudoku-PT-AN14-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN14-LTLCardinality-15 finished in 21976 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((G(F(p0))&&F(p1))))))'
Found a Shortening insensitive property : Sudoku-PT-AN14-LTLCardinality-07
Stuttering acceptance computed with spot in 411 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Support contains 3136 out of 3332 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 33 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
// Phase 1: matrix 2744 rows 3332 cols
[2024-05-31 11:57:34] [INFO ] Computed 588 invariants in 16 ms
[2024-05-31 11:57:35] [INFO ] Implicit Places using invariants in 764 ms returned []
[2024-05-31 11:57:35] [INFO ] Invariant cache hit.
[2024-05-31 11:57:36] [INFO ] Implicit Places using invariants and state equation in 801 ms returned []
Implicit Place search using SMT with State Equation took 1566 ms to find 0 implicit places.
[2024-05-31 11:57:36] [INFO ] Invariant cache hit.
[2024-05-31 11:57:38] [INFO ] Dead Transitions using invariants and state equation in 1866 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 3467 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Running random walk in product with property : Sudoku-PT-AN14-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=true, acceptance={} source=3 dest: 5}, { cond=(NOT p1), acceptance={} source=3 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(LEQ (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration timeout after 31050 steps with 312 reset in 10001 ms.
Product exploration timeout after 31050 steps with 312 reset in 10002 ms.
Computed a total of 3332 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3332 transition count 2744
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 114 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 290 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Finished random walk after 99 steps, including 0 resets, run visited all 2 properties in 44 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 3 factoid took 152 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 270 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 268 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
[2024-05-31 11:58:01] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
[2024-05-31 11:58:17] [INFO ] Invariant cache hit.
Could not prove EG (NOT p1)
Support contains 3136 out of 3332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 15 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2024-05-31 11:58:32] [INFO ] Invariant cache hit.
[2024-05-31 11:58:33] [INFO ] Implicit Places using invariants in 698 ms returned []
[2024-05-31 11:58:33] [INFO ] Invariant cache hit.
[2024-05-31 11:58:34] [INFO ] Implicit Places using invariants and state equation in 715 ms returned []
Implicit Place search using SMT with State Equation took 1414 ms to find 0 implicit places.
[2024-05-31 11:58:34] [INFO ] Invariant cache hit.
[2024-05-31 11:58:35] [INFO ] Dead Transitions using invariants and state equation in 1685 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3116 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Computed a total of 3332 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3332 transition count 2744
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 262 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 288 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Finished random walk after 99 steps, including 0 resets, run visited all 2 properties in 43 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 3 factoid took 158 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 291 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 291 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
[2024-05-31 11:58:39] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
[2024-05-31 11:58:55] [INFO ] Invariant cache hit.
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 291 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Product exploration timeout after 31280 steps with 314 reset in 10001 ms.
Product exploration timeout after 30430 steps with 306 reset in 10001 ms.
Applying partial POR strategy [false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 280 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Support contains 3136 out of 3332 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 44 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2024-05-31 11:59:30] [INFO ] Redundant transitions in 62 ms returned []
[2024-05-31 11:59:30] [INFO ] Invariant cache hit.
[2024-05-31 11:59:32] [INFO ] Dead Transitions using invariants and state equation in 1693 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1814 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Built C files in :
/tmp/ltsmin7547860295684975543
[2024-05-31 11:59:32] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7547860295684975543
Running compilation step : cd /tmp/ltsmin7547860295684975543;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin7547860295684975543;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7547860295684975543;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' 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 3136 out of 3332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 12 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2024-05-31 11:59:35] [INFO ] Invariant cache hit.
[2024-05-31 11:59:36] [INFO ] Implicit Places using invariants in 725 ms returned []
[2024-05-31 11:59:36] [INFO ] Invariant cache hit.
[2024-05-31 11:59:37] [INFO ] Implicit Places using invariants and state equation in 693 ms returned []
Implicit Place search using SMT with State Equation took 1424 ms to find 0 implicit places.
[2024-05-31 11:59:37] [INFO ] Invariant cache hit.
[2024-05-31 11:59:38] [INFO ] Dead Transitions using invariants and state equation in 1696 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3136 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Built C files in :
/tmp/ltsmin2964155849834104499
[2024-05-31 11:59:38] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2964155849834104499
Running compilation step : cd /tmp/ltsmin2964155849834104499;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin2964155849834104499;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2964155849834104499;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' 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)
[2024-05-31 11:59:42] [INFO ] Flatten gal took : 120 ms
[2024-05-31 11:59:42] [INFO ] Flatten gal took : 114 ms
[2024-05-31 11:59:42] [INFO ] Time to serialize gal into /tmp/LTL14797683880194077427.gal : 16 ms
[2024-05-31 11:59:42] [INFO ] Time to serialize properties into /tmp/LTL14669810840597005852.prop : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14797683880194077427.gal' '-t' 'CGAL' '-hoa' '/tmp/aut118350176668210368.hoa' '-atoms' '/tmp/LTL14669810840597005852.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL14669810840597005852.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut118350176668210368.hoa
Detected timeout of ITS tools.
[2024-05-31 11:59:57] [INFO ] Flatten gal took : 97 ms
[2024-05-31 11:59:57] [INFO ] Flatten gal took : 122 ms
[2024-05-31 11:59:57] [INFO ] Time to serialize gal into /tmp/LTL1840132736799805971.gal : 16 ms
[2024-05-31 11:59:57] [INFO ] Time to serialize properties into /tmp/LTL5773080106956562651.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1840132736799805971.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5773080106956562651.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(X((G(F("(((((((((Rows_0_0+Rows_0_1)+(Rows_0_2+Rows_0_3))+((Rows_0_4+Rows_0_5)+(Rows_0_6+Rows_0_7)))+(((Rows_0_8+Rows_0_9)+(Rows...86709
Formula 0 simplified : XXX(FG!"(((((((((Rows_0_0+Rows_0_1)+(Rows_0_2+Rows_0_3))+((Rows_0_4+Rows_0_5)+(Rows_0_6+Rows_0_7)))+(((Rows_0_8+Rows_0_9)+(Rows_0_10...86695
Detected timeout of ITS tools.
[2024-05-31 12:00:12] [INFO ] Flatten gal took : 101 ms
[2024-05-31 12:00:12] [INFO ] Applying decomposition
[2024-05-31 12:00:12] [INFO ] Flatten gal took : 100 ms
[2024-05-31 12:00:30] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.util.concurrent.TimeoutException: Subprocess running '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph6553484028881964600.txt' '-o' '/tmp/graph6553484028881964600.bin' '-w' '/tmp/graph6553484028881964600.weights' killed by timeout after 10 SECONDS
at fr.lip6.move.gal.process.Runner.waitForOrTimeout(Runner.java:76)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:47)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:27)
at fr.lip6.move.gal.louvain.GraphBuilder.convertGraphToBin(GraphBuilder.java:258)
at fr.lip6.move.gal.louvain.GraphBuilder.computeLouvain(GraphBuilder.java:189)
at fr.lip6.move.gal.louvain.GraphBuilder.computeLouvain(GraphBuilder.java:157)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:226)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:277)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:663)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:341)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:804)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-31 12:00:30] [INFO ] Flatten gal took : 127 ms
[2024-05-31 12:00:30] [INFO ] Time to serialize gal into /tmp/LTL8869413035473960648.gal : 13 ms
[2024-05-31 12:00:30] [INFO ] Time to serialize properties into /tmp/LTL12797117281622161712.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8869413035473960648.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12797117281622161712.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(X((G(F("(((((((((Rows_0_0+Rows_0_1)+(Rows_0_2+Rows_0_3))+((Rows_0_4+Rows_0_5)+(Rows_0_6+Rows_0_7)))+(((Rows_0_8+Rows_0_9)+(Rows...86709
Formula 0 simplified : XXX(FG!"(((((((((Rows_0_0+Rows_0_1)+(Rows_0_2+Rows_0_3))+((Rows_0_4+Rows_0_5)+(Rows_0_6+Rows_0_7)))+(((Rows_0_8+Rows_0_9)+(Rows_0_10...86695
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8905341224808724761
[2024-05-31 12:00:45] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8905341224808724761
Running compilation step : cd /tmp/ltsmin8905341224808724761;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin8905341224808724761;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8905341224808724761;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' 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)
Treatment of property Sudoku-PT-AN14-LTLCardinality-07 finished in 193916 ms.
[2024-05-31 12:00:48] [INFO ] Flatten gal took : 107 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3925229870793092063
[2024-05-31 12:00:48] [INFO ] Too many transitions (2744) to apply POR reductions. Disabling POR matrices.
[2024-05-31 12:00:48] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3925229870793092063
Running compilation step : cd /tmp/ltsmin3925229870793092063;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-31 12:00:48] [INFO ] Applying decomposition
[2024-05-31 12:00:48] [INFO ] Flatten gal took : 110 ms
Compilation finished in 8713 ms.
Running link step : cd /tmp/ltsmin3925229870793092063;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 63 ms.
Running LTSmin : cd /tmp/ltsmin3925229870793092063;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X(([](<>((LTLAPp0==true)))&&<>((LTLAPp1==true))))))' '--buchi-type=spotba'
[2024-05-31 12:01:04] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.util.concurrent.TimeoutException: Subprocess running '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph6815807706199481268.txt' '-o' '/tmp/graph6815807706199481268.bin' '-w' '/tmp/graph6815807706199481268.weights' killed by timeout after 10 SECONDS
at fr.lip6.move.gal.process.Runner.waitForOrTimeout(Runner.java:76)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:47)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:27)
at fr.lip6.move.gal.louvain.GraphBuilder.convertGraphToBin(GraphBuilder.java:258)
at fr.lip6.move.gal.louvain.GraphBuilder.computeLouvain(GraphBuilder.java:189)
at fr.lip6.move.gal.louvain.GraphBuilder.computeLouvain(GraphBuilder.java:157)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:226)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:277)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:106)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:855)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-31 12:01:05] [INFO ] Flatten gal took : 306 ms
[2024-05-31 12:01:05] [INFO ] Time to serialize gal into /tmp/LTLCardinality6046267379447160947.gal : 26 ms
[2024-05-31 12:01:05] [INFO ] Time to serialize properties into /tmp/LTLCardinality14522671537317789306.ltl : 26 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality6046267379447160947.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality14522671537317789306.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !((X(X(X((G(F("(((((((((Rows_0_0+Rows_0_1)+(Rows_0_2+Rows_0_3))+((Rows_0_4+Rows_0_5)+(Rows_0_6+Rows_0_7)))+(((Rows_0_8+Rows_0_9)+(Rows...86709
Formula 0 simplified : XXX(FG!"(((((((((Rows_0_0+Rows_0_1)+(Rows_0_2+Rows_0_3))+((Rows_0_4+Rows_0_5)+(Rows_0_6+Rows_0_7)))+(((Rows_0_8+Rows_0_9)+(Rows_0_10...86695
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.051: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.051: LTL layer: formula: X(X(X(([](<>((LTLAPp0==true)))&&<>((LTLAPp1==true))))))
pins2lts-mc-linux64( 0/ 8), 0.052: "X(X(X(([](<>((LTLAPp0==true)))&&<>((LTLAPp1==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.053: Using Spin LTL semantics
pins2lts-mc-linux64( 6/ 8), 0.078: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.080: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.084: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.086: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.092: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.097: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.103: buchi has 7 states
pins2lts-mc-linux64( 7/ 8), 0.107: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.138: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 3.332: DFS-FIFO for weak LTL, using special progress label 2747
pins2lts-mc-linux64( 0/ 8), 3.332: There are 2748 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 3.332: State length is 3333, there are 2754 groups
pins2lts-mc-linux64( 0/ 8), 3.332: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 3.332: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 3.332: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 3.332: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 4/ 8), 23.280: ~1 levels ~960 states ~2573952 transitions
pins2lts-mc-linux64( 4/ 8), 41.156: ~1 levels ~1920 states ~5131744 transitions
pins2lts-mc-linux64( 4/ 8), 78.202: ~1 levels ~3840 states ~10247264 transitions
pins2lts-mc-linux64( 2/ 8), 89.401: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 151.284:
pins2lts-mc-linux64( 0/ 8), 151.285: mean standard work distribution: 0.9% (states) 1.1% (transitions)
pins2lts-mc-linux64( 0/ 8), 151.285:
pins2lts-mc-linux64( 0/ 8), 151.285: Explored 4256 states 11417206 transitions, fanout: 2682.614
pins2lts-mc-linux64( 0/ 8), 151.285: Total exploration time 147.930 sec (92.250 sec minimum, 116.506 sec on average)
pins2lts-mc-linux64( 0/ 8), 151.285: States per second: 29, Transitions per second: 77180
pins2lts-mc-linux64( 0/ 8), 151.285:
pins2lts-mc-linux64( 0/ 8), 151.285: Progress states detected: 8732255
pins2lts-mc-linux64( 0/ 8), 151.285: Redundant explorations: -99.9513
pins2lts-mc-linux64( 0/ 8), 151.285:
pins2lts-mc-linux64( 0/ 8), 151.285: Queue width: 8B, total height: 11539293, memory: 88.04MB
pins2lts-mc-linux64( 0/ 8), 151.285: Tree memory: 322.6MB, 38.7 B/state, compr.: 0.3%
pins2lts-mc-linux64( 0/ 8), 151.285: Tree fill ratio (roots/leafs): 6.0%/100.0%
pins2lts-mc-linux64( 0/ 8), 151.285: Stored 3208 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 151.285: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 151.285: Est. total memory use: 410.7MB (~1112.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin3925229870793092063;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X(([](<>((LTLAPp0==true)))&&<>((LTLAPp1==true))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin3925229870793092063;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X(([](<>((LTLAPp0==true)))&&<>((LTLAPp1==true))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2024-05-31 12:24:33] [INFO ] Applying decomposition
[2024-05-31 12:24:34] [INFO ] Flatten gal took : 255 ms
[2024-05-31 12:24:34] [INFO ] Decomposing Gal with order
[2024-05-31 12:24:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 12:24:36] [INFO ] Removed a total of 5056 redundant transitions.
[2024-05-31 12:24:36] [INFO ] Flatten gal took : 709 ms
[2024-05-31 12:24:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 24 ms.
[2024-05-31 12:24:41] [INFO ] Time to serialize gal into /tmp/LTLCardinality2089983876984005074.gal : 81 ms
[2024-05-31 12:24:41] [INFO ] Time to serialize properties into /tmp/LTLCardinality13162207566470765876.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality2089983876984005074.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality13162207566470765876.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !((X(X(X((G(F("(((((((((gu213.Rows_0_0+gu214.Rows_0_1)+(gu215.Rows_0_2+gu216.Rows_0_3))+((gu217.Rows_0_4+gu218.Rows_0_5)+(gu219.Rows_0...118876
Formula 0 simplified : XXX(FG!"(((((((((gu213.Rows_0_0+gu214.Rows_0_1)+(gu215.Rows_0_2+gu216.Rows_0_3))+((gu217.Rows_0_4+gu218.Rows_0_5)+(gu219.Rows_0_6+gu...118862
Detected timeout of ITS tools.
[2024-05-31 12:47:49] [INFO ] Flatten gal took : 392 ms
[2024-05-31 12:47:50] [INFO ] Input system was already deterministic with 2744 transitions.
[2024-05-31 12:48:00] [INFO ] Transformed 3332 places.
[2024-05-31 12:48:00] [INFO ] Transformed 2744 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-31 12:48:02] [INFO ] Time to serialize gal into /tmp/LTLCardinality889235875584748336.gal : 17 ms
[2024-05-31 12:48:02] [INFO ] Time to serialize properties into /tmp/LTLCardinality11061882149810769434.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality889235875584748336.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality11061882149810769434.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(X(X((G(F("(((((((((Rows_0_0+Rows_0_1)+(Rows_0_2+Rows_0_3))+((Rows_0_4+Rows_0_5)+(Rows_0_6+Rows_0_7)))+(((Rows_0_8+Rows_0_9)+(Rows...86709
Formula 0 simplified : XXX(FG!"(((((((((Rows_0_0+Rows_0_1)+(Rows_0_2+Rows_0_3))+((Rows_0_4+Rows_0_5)+(Rows_0_6+Rows_0_7)))+(((Rows_0_8+Rows_0_9)+(Rows_0_10...86695
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 10826920 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15656912 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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Sudoku-PT-AN14"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is Sudoku-PT-AN14, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r417-tall-171690556400422"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-PT-AN14.tgz
mv Sudoku-PT-AN14 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 ;