Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r258-tall-165303545400195.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Sudoku-COL-BN16, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r258-tall-165303545400195
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 660K
-rw-r--r-- 1 mcc users 6.0K Apr 30 12:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Apr 30 12:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 30 11:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 30 11:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 9 09:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 09:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 09:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 09:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 09:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 09:13 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 446K May 10 09:34 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1653090388107

Running Version 202205111006
[2022-05-20 23:46:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-20 23:46:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 23:46:29] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-20 23:46:30] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-20 23:46:30] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 758 ms
[2022-05-20 23:46:30] [INFO ] Imported 5 HL places and 1 HL transitions for a total of 5120 PT places and 65536.0 transition bindings in 29 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2022-05-20 23:46:30] [INFO ] Built PT skeleton of HLPN with 5 places and 1 transitions 5 arcs in 5 ms.
[2022-05-20 23:46:30] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 3 formulas.
FORMULA Sudoku-COL-BN16-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN16-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN16-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN16-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 5 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 12 properties that can be checked using skeleton over-approximation.
Computed a total of 5 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Incomplete random walk after 10061 steps, including 38 resets, run finished after 57 ms. (steps per millisecond=176 ) properties (out of 19) seen :12
Incomplete Best-First random walk after 10061 steps, including 38 resets, run finished after 15 ms. (steps per millisecond=670 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10061 steps, including 38 resets, run finished after 13 ms. (steps per millisecond=773 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10061 steps, including 38 resets, run finished after 31 ms. (steps per millisecond=324 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10061 steps, including 38 resets, run finished after 20 ms. (steps per millisecond=503 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10061 steps, including 38 resets, run finished after 20 ms. (steps per millisecond=503 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10061 steps, including 38 resets, run finished after 7 ms. (steps per millisecond=1437 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10061 steps, including 38 resets, run finished after 21 ms. (steps per millisecond=479 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 1 rows 5 cols
[2022-05-20 23:46:30] [INFO ] Computed 4 place invariants in 4 ms
[2022-05-20 23:46:31] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:6
[2022-05-20 23:46:31] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-20 23:46:31] [INFO ] After 52ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :0
Fused 7 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 7 atomic propositions for a total of 12 simplifications.
FORMULA Sudoku-COL-BN16-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN16-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN16-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-20 23:46:31] [INFO ] Flatten gal took : 15 ms
[2022-05-20 23:46:31] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
FORMULA Sudoku-COL-BN16-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-20 23:46:31] [INFO ] Flatten gal took : 1 ms
Domain [N(16), N(16)] of place Rows breaks symmetries in sort N
[2022-05-20 23:46:31] [INFO ] Unfolded HLPN to a Petri net with 5120 places and 4096 transitions 20480 arcs in 191 ms.
[2022-05-20 23:46:31] [INFO ] Unfolded 8 HLPN properties in 4 ms.
Support contains 5120 out of 5120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 39 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 5120 cols
[2022-05-20 23:46:31] [INFO ] Computed 1024 place invariants in 68 ms
[2022-05-20 23:46:32] [INFO ] Implicit Places using invariants in 661 ms returned []
// Phase 1: matrix 4096 rows 5120 cols
[2022-05-20 23:46:32] [INFO ] Computed 1024 place invariants in 30 ms
[2022-05-20 23:46:32] [INFO ] Implicit Places using invariants and state equation in 543 ms returned []
Implicit Place search using SMT with State Equation took 1210 ms to find 0 implicit places.
// Phase 1: matrix 4096 rows 5120 cols
[2022-05-20 23:46:32] [INFO ] Computed 1024 place invariants in 24 ms
[2022-05-20 23:46:35] [INFO ] Dead Transitions using invariants and state equation in 2823 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5120/5120 places, 4096/4096 transitions.
Support contains 5120 out of 5120 places after structural reductions.
[2022-05-20 23:46:36] [INFO ] Flatten gal took : 417 ms
[2022-05-20 23:46:36] [INFO ] Flatten gal took : 268 ms
[2022-05-20 23:46:37] [INFO ] Input system was already deterministic with 4096 transitions.
Incomplete random walk after 10000 steps, including 47 resets, run finished after 7507 ms. (steps per millisecond=1 ) properties (out of 14) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2065 ms. (steps per millisecond=4 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 412 ms. (steps per millisecond=24 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 211 ms. (steps per millisecond=47 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 373 ms. (steps per millisecond=26 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 205 ms. (steps per millisecond=48 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 376 ms. (steps per millisecond=26 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 363 ms. (steps per millisecond=27 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 207 ms. (steps per millisecond=48 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 4096 rows 5120 cols
[2022-05-20 23:46:49] [INFO ] Computed 1024 place invariants in 22 ms
[2022-05-20 23:46:52] [INFO ] After 1191ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:9
[2022-05-20 23:46:53] [INFO ] [Nat]Absence check using 1024 positive place invariants in 336 ms returned sat
[2022-05-20 23:47:17] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-20 23:47:17] [INFO ] After 25047ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0 real:9
Fused 10 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1024 out of 5120 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Graph (complete) has 16384 edges and 5120 vertex of which 1024 are kept as prefixes of interest. Removing 4096 places using SCC suffix rule.12 ms
Discarding 4096 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 105 ms. Remains 1024 /5120 variables (removed 4096) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1024/5120 places, 4096/4096 transitions.
Incomplete random walk after 10000 steps, including 47 resets, run finished after 4382 ms. (steps per millisecond=2 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 213 ms. (steps per millisecond=46 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 220 ms. (steps per millisecond=45 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 364 ms. (steps per millisecond=27 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 197 ms. (steps per millisecond=50 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 360 ms. (steps per millisecond=27 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 208 ms. (steps per millisecond=48 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 363 ms. (steps per millisecond=27 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 222 ms. (steps per millisecond=45 ) properties (out of 8) seen :0
Probabilistic random walk after 178093 steps, saw 178042 distinct states, run finished after 18079 ms. (steps per millisecond=9 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 4096 rows 1024 cols
[2022-05-20 23:47:43] [INFO ] Computed 168 place invariants in 802 ms
[2022-05-20 23:47:43] [INFO ] [Real]Absence check using 0 positive and 168 generalized place invariants in 131 ms returned sat
[2022-05-20 23:47:43] [INFO ] After 447ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-05-20 23:47:44] [INFO ] [Nat]Absence check using 0 positive and 168 generalized place invariants in 124 ms returned sat
[2022-05-20 23:47:48] [INFO ] After 4364ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :5
[2022-05-20 23:47:49] [INFO ] After 5063ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :5
Attempting to minimize the solution found.
Minimization took 385 ms.
[2022-05-20 23:47:49] [INFO ] After 5938ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :5
Fused 8 Parikh solutions to 1 different solutions.
Finished Parikh walk after 256 steps, including 0 resets, run visited all 5 properties in 37 ms. (steps per millisecond=6 )
Parikh walk visited 5 properties in 39 ms.
FORMULA Sudoku-COL-BN16-LTLCardinality-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 5 atomic propositions for a total of 7 simplifications.
Computed a total of 5120 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5120 transition count 4096
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(true U F(G(p0))))'
Support contains 4352 out of 5120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 309 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 5120 cols
[2022-05-20 23:47:50] [INFO ] Computed 1024 place invariants in 19 ms
[2022-05-20 23:47:51] [INFO ] Implicit Places using invariants in 1461 ms returned []
// Phase 1: matrix 4096 rows 5120 cols
[2022-05-20 23:47:51] [INFO ] Computed 1024 place invariants in 30 ms
[2022-05-20 23:47:53] [INFO ] Implicit Places using invariants and state equation in 1451 ms returned []
Implicit Place search using SMT with State Equation took 2917 ms to find 0 implicit places.
[2022-05-20 23:47:53] [INFO ] Redundant transitions in 264 ms returned []
// Phase 1: matrix 4096 rows 5120 cols
[2022-05-20 23:47:53] [INFO ] Computed 1024 place invariants in 23 ms
[2022-05-20 23:47:56] [INFO ] Dead Transitions using invariants and state equation in 2737 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5120/5120 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 169 ms :[p0, p0]
Running random walk in product with property : Sudoku-COL-BN16-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ (ADD s4864 s4865 s4866 s4867 s4868 s4869 s4870 s4871 s4872 s4873 s4874 s4875 s4876 s4877 s4878 s4879 s4880 s4881 s4882 s4883 s4884 s4885 s4886 s48...], 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 207 steps with 0 reset in 109 ms.
FORMULA Sudoku-COL-BN16-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-BN16-LTLCardinality-02 finished in 6585 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((true U X(p0)))'
Support contains 256 out of 5120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Reduce places removed 4096 places and 0 transitions.
Iterating post reduction 0 with 4096 rules applied. Total rules applied 4096 place count 1024 transition count 4096
Applied a total of 4096 rules in 302 ms. Remains 1024 /5120 variables (removed 4096) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 1024 cols
[2022-05-20 23:47:57] [INFO ] Computed 168 place invariants in 586 ms
[2022-05-20 23:47:58] [INFO ] Implicit Places using invariants in 1718 ms returned []
// Phase 1: matrix 4096 rows 1024 cols
[2022-05-20 23:47:59] [INFO ] Computed 168 place invariants in 599 ms
[2022-05-20 23:48:02] [INFO ] Implicit Places using invariants and state equation in 4178 ms returned []
Implicit Place search using SMT with State Equation took 5899 ms to find 0 implicit places.
// Phase 1: matrix 4096 rows 1024 cols
[2022-05-20 23:48:03] [INFO ] Computed 168 place invariants in 585 ms
[2022-05-20 23:48:04] [INFO ] Dead Transitions using invariants and state equation in 2102 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1024/5120 places, 4096/4096 transitions.
Finished structural reductions, in 1 iterations. Remains : 1024/5120 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-BN16-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 (ADD s768 s769 s770 s771 s772 s773 s774 s775 s776 s777 s778 s779 s780 s781 s782 s783 s784 s785 s786 s787 s788 s789 s790 s791 s792 s793 s794 s795...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration timeout after 17420 steps with 8710 reset in 10001 ms.
Product exploration timeout after 17390 steps with 8695 reset in 10001 ms.
Computed a total of 1024 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1024 transition count 4096
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Sudoku-COL-BN16-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-BN16-LTLCardinality-04 finished in 29641 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4352 out of 5120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 126 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 5120 cols
[2022-05-20 23:48:26] [INFO ] Computed 1024 place invariants in 16 ms
[2022-05-20 23:48:27] [INFO ] Implicit Places using invariants in 1360 ms returned []
// Phase 1: matrix 4096 rows 5120 cols
[2022-05-20 23:48:27] [INFO ] Computed 1024 place invariants in 17 ms
[2022-05-20 23:48:29] [INFO ] Implicit Places using invariants and state equation in 1412 ms returned []
Implicit Place search using SMT with State Equation took 2780 ms to find 0 implicit places.
[2022-05-20 23:48:29] [INFO ] Redundant transitions in 243 ms returned []
// Phase 1: matrix 4096 rows 5120 cols
[2022-05-20 23:48:29] [INFO ] Computed 1024 place invariants in 23 ms
[2022-05-20 23:48:32] [INFO ] Dead Transitions using invariants and state equation in 2793 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5120/5120 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-BN16-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ (ADD s256 s257 s258 s259 s260 s261 s262 s263 s264 s265 s266 s267 s268 s269 s270 s271 s272 s273 s274 s275 s276 s277 s278 s279 s280 s281 s282 s283 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 213 steps with 0 reset in 118 ms.
FORMULA Sudoku-COL-BN16-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-BN16-LTLCardinality-05 finished in 6140 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 256 out of 5120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Graph (complete) has 16384 edges and 5120 vertex of which 1024 are kept as prefixes of interest. Removing 4096 places using SCC suffix rule.10 ms
Discarding 4096 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 152 ms. Remains 1024 /5120 variables (removed 4096) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 1024 cols
[2022-05-20 23:48:33] [INFO ] Computed 168 place invariants in 580 ms
[2022-05-20 23:48:34] [INFO ] Implicit Places using invariants in 1672 ms returned []
// Phase 1: matrix 4096 rows 1024 cols
[2022-05-20 23:48:34] [INFO ] Computed 168 place invariants in 597 ms
[2022-05-20 23:48:40] [INFO ] Implicit Places using invariants and state equation in 6132 ms returned []
Implicit Place search using SMT with State Equation took 7811 ms to find 0 implicit places.
[2022-05-20 23:48:40] [INFO ] Redundant transitions in 158 ms returned []
// Phase 1: matrix 4096 rows 1024 cols
[2022-05-20 23:48:41] [INFO ] Computed 168 place invariants in 590 ms
[2022-05-20 23:48:42] [INFO ] Dead Transitions using invariants and state equation in 2125 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1024/5120 places, 4096/4096 transitions.
Finished structural reductions, in 1 iterations. Remains : 1024/5120 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-BN16-LTLCardinality-07 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:(LEQ 1 (ADD s256 s257 s258 s259 s260 s261 s262 s263 s264 s265 s266 s267 s268 s269 s270 s271 s272 s273 s274 s275 s276 s277 s278 s279 s280 s281 s282 s283...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration timeout after 29340 steps with 139 reset in 10004 ms.
Product exploration timeout after 29610 steps with 140 reset in 10001 ms.
Computed a total of 1024 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1024 transition count 4096
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 146 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 47 resets, run finished after 3343 ms. (steps per millisecond=2 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 202 ms. (steps per millisecond=49 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 356576 steps, run timeout after 9005 ms. (steps per millisecond=39 ) properties seen :{}
Probabilistic random walk after 356576 steps, saw 356447 distinct states, run finished after 9008 ms. (steps per millisecond=39 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 4096 rows 1024 cols
[2022-05-20 23:49:17] [INFO ] Computed 168 place invariants in 646 ms
[2022-05-20 23:49:17] [INFO ] [Real]Absence check using 0 positive and 168 generalized place invariants in 132 ms returned sat
[2022-05-20 23:49:24] [INFO ] After 7741ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 23:49:25] [INFO ] [Nat]Absence check using 0 positive and 168 generalized place invariants in 130 ms returned sat
[2022-05-20 23:49:30] [INFO ] After 5578ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 23:49:30] [INFO ] After 5724ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 113 ms.
[2022-05-20 23:49:31] [INFO ] After 6115ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 256 steps, including 0 resets, run visited all 1 properties in 25 ms. (steps per millisecond=10 )
Parikh walk visited 1 properties in 25 ms.
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 147 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Support contains 256 out of 1024 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1024/1024 places, 4096/4096 transitions.
Applied a total of 0 rules in 127 ms. Remains 1024 /1024 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 1024 cols
[2022-05-20 23:49:32] [INFO ] Computed 168 place invariants in 604 ms
[2022-05-20 23:49:33] [INFO ] Implicit Places using invariants in 1726 ms returned []
// Phase 1: matrix 4096 rows 1024 cols
[2022-05-20 23:49:33] [INFO ] Computed 168 place invariants in 628 ms
[2022-05-20 23:49:37] [INFO ] Implicit Places using invariants and state equation in 4142 ms returned []
Implicit Place search using SMT with State Equation took 5873 ms to find 0 implicit places.
[2022-05-20 23:49:37] [INFO ] Redundant transitions in 158 ms returned []
// Phase 1: matrix 4096 rows 1024 cols
[2022-05-20 23:49:38] [INFO ] Computed 168 place invariants in 595 ms
[2022-05-20 23:49:39] [INFO ] Dead Transitions using invariants and state equation in 2139 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1024/1024 places, 4096/4096 transitions.
Computed a total of 1024 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1024 transition count 4096
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 47 resets, run finished after 3333 ms. (steps per millisecond=3 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 201 ms. (steps per millisecond=49 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 380683 steps, run timeout after 9005 ms. (steps per millisecond=42 ) properties seen :{}
Probabilistic random walk after 380683 steps, saw 380538 distinct states, run finished after 9006 ms. (steps per millisecond=42 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 4096 rows 1024 cols
[2022-05-20 23:49:54] [INFO ] Computed 168 place invariants in 676 ms
[2022-05-20 23:49:54] [INFO ] [Real]Absence check using 0 positive and 168 generalized place invariants in 138 ms returned sat
[2022-05-20 23:50:02] [INFO ] After 8261ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 23:50:02] [INFO ] [Nat]Absence check using 0 positive and 168 generalized place invariants in 135 ms returned sat
[2022-05-20 23:50:08] [INFO ] After 5848ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 23:50:08] [INFO ] After 5994ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 82 ms.
[2022-05-20 23:50:08] [INFO ] After 6361ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 256 steps, including 0 resets, run visited all 1 properties in 36 ms. (steps per millisecond=7 )
Parikh walk visited 1 properties in 36 ms.
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 135 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Product exploration timeout after 29650 steps with 140 reset in 10002 ms.
Product exploration timeout after 29770 steps with 141 reset in 10005 ms.
Built C files in :
/tmp/ltsmin3101560860841629706
[2022-05-20 23:50:29] [INFO ] Too many transitions (4096) to apply POR reductions. Disabling POR matrices.
[2022-05-20 23:50:29] [INFO ] Built C files in 65ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3101560860841629706
Running compilation step : cd /tmp/ltsmin3101560860841629706;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin3101560860841629706;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3101560860841629706;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 256 out of 1024 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1024/1024 places, 4096/4096 transitions.
Applied a total of 0 rules in 123 ms. Remains 1024 /1024 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 1024 cols
[2022-05-20 23:50:32] [INFO ] Computed 168 place invariants in 618 ms
[2022-05-20 23:50:34] [INFO ] Implicit Places using invariants in 1729 ms returned []
// Phase 1: matrix 4096 rows 1024 cols
[2022-05-20 23:50:34] [INFO ] Computed 168 place invariants in 611 ms
[2022-05-20 23:50:38] [INFO ] Implicit Places using invariants and state equation in 4305 ms returned []
Implicit Place search using SMT with State Equation took 6043 ms to find 0 implicit places.
[2022-05-20 23:50:38] [INFO ] Redundant transitions in 157 ms returned []
// Phase 1: matrix 4096 rows 1024 cols
[2022-05-20 23:50:39] [INFO ] Computed 168 place invariants in 646 ms
[2022-05-20 23:50:40] [INFO ] Dead Transitions using invariants and state equation in 2183 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1024/1024 places, 4096/4096 transitions.
Built C files in :
/tmp/ltsmin4123882031489963191
[2022-05-20 23:50:40] [INFO ] Too many transitions (4096) to apply POR reductions. Disabling POR matrices.
[2022-05-20 23:50:40] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4123882031489963191
Running compilation step : cd /tmp/ltsmin4123882031489963191;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin4123882031489963191;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4123882031489963191;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-20 23:50:44] [INFO ] Flatten gal took : 189 ms
[2022-05-20 23:50:44] [INFO ] Flatten gal took : 188 ms
[2022-05-20 23:50:44] [INFO ] Time to serialize gal into /tmp/LTL16540219310617828687.gal : 47 ms
[2022-05-20 23:50:44] [INFO ] Time to serialize properties into /tmp/LTL14274029665394188867.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16540219310617828687.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14274029665394188867.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1654021...268
Read 1 LTL properties
Checking formula 0 : !((G(F("(((((((((Regions_0+Regions_1)+(Regions_2+Regions_3))+((Regions_4+Regions_5)+(Regions_6+Regions_7)))+(((Regions_8+Regions_9)+(R...3510
Formula 0 simplified : !GF"(((((((((Regions_0+Regions_1)+(Regions_2+Regions_3))+((Regions_4+Regions_5)+(Regions_6+Regions_7)))+(((Regions_8+Regions_9)+(Reg...3504
Detected timeout of ITS tools.
[2022-05-20 23:50:59] [INFO ] Flatten gal took : 176 ms
[2022-05-20 23:50:59] [INFO ] Applying decomposition
[2022-05-20 23:51:00] [INFO ] Flatten gal took : 189 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph5520864683844720093.txt' '-o' '/tmp/graph5520864683844720093.bin' '-w' '/tmp/graph5520864683844720093.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5520864683844720093.bin' '-l' '-1' '-v' '-w' '/tmp/graph5520864683844720093.weights' '-q' '0' '-e' '0.001'
[2022-05-20 23:51:00] [INFO ] Decomposing Gal with order
[2022-05-20 23:51:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 23:51:02] [INFO ] Removed a total of 15360 redundant transitions.
[2022-05-20 23:51:02] [INFO ] Flatten gal took : 1456 ms
[2022-05-20 23:51:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 49 ms.
[2022-05-20 23:51:02] [INFO ] Time to serialize gal into /tmp/LTL8992350600204079394.gal : 15 ms
[2022-05-20 23:51:02] [INFO ] Time to serialize properties into /tmp/LTL6448363126450404686.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8992350600204079394.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6448363126450404686.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8992350...266
Read 1 LTL properties
Checking formula 0 : !((G(F("(((((((((gu256.Regions_0+gu256.Regions_1)+(gu256.Regions_2+gu256.Regions_3))+((gu256.Regions_4+gu256.Regions_5)+(gu256.Regions...5046
Formula 0 simplified : !GF"(((((((((gu256.Regions_0+gu256.Regions_1)+(gu256.Regions_2+gu256.Regions_3))+((gu256.Regions_4+gu256.Regions_5)+(gu256.Regions_6...5040
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8441689138391386665
[2022-05-20 23:51:17] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8441689138391386665
Running compilation step : cd /tmp/ltsmin8441689138391386665;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin8441689138391386665;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8441689138391386665;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property Sudoku-COL-BN16-LTLCardinality-07 finished in 168266 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((true U F(!(true U p0))))'
Support contains 256 out of 5120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Graph (complete) has 16384 edges and 5120 vertex of which 1024 are kept as prefixes of interest. Removing 4096 places using SCC suffix rule.6 ms
Discarding 4096 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 122 ms. Remains 1024 /5120 variables (removed 4096) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 1024 cols
[2022-05-20 23:51:21] [INFO ] Computed 168 place invariants in 595 ms
[2022-05-20 23:51:22] [INFO ] Implicit Places using invariants in 1660 ms returned []
// Phase 1: matrix 4096 rows 1024 cols
[2022-05-20 23:51:23] [INFO ] Computed 168 place invariants in 633 ms
[2022-05-20 23:51:27] [INFO ] Implicit Places using invariants and state equation in 5399 ms returned []
Implicit Place search using SMT with State Equation took 7072 ms to find 0 implicit places.
[2022-05-20 23:51:28] [INFO ] Redundant transitions in 163 ms returned []
// Phase 1: matrix 4096 rows 1024 cols
[2022-05-20 23:51:28] [INFO ] Computed 168 place invariants in 608 ms
[2022-05-20 23:51:30] [INFO ] Dead Transitions using invariants and state equation in 2134 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1024/5120 places, 4096/4096 transitions.
Finished structural reductions, in 1 iterations. Remains : 1024/5120 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 28 ms :[p0]
Running random walk in product with property : Sudoku-COL-BN16-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 2 (ADD 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 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 213 steps with 0 reset in 80 ms.
FORMULA Sudoku-COL-BN16-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-BN16-LTLCardinality-08 finished in 9643 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(F(G(F(p0)))))'
Support contains 4096 out of 5120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 180 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 5120 cols
[2022-05-20 23:51:30] [INFO ] Computed 1024 place invariants in 16 ms
[2022-05-20 23:51:32] [INFO ] Implicit Places using invariants in 1729 ms returned []
// Phase 1: matrix 4096 rows 5120 cols
[2022-05-20 23:51:32] [INFO ] Computed 1024 place invariants in 79 ms
[2022-05-20 23:51:34] [INFO ] Implicit Places using invariants and state equation in 1794 ms returned []
Implicit Place search using SMT with State Equation took 3525 ms to find 0 implicit places.
[2022-05-20 23:51:34] [INFO ] Redundant transitions in 164 ms returned []
// Phase 1: matrix 4096 rows 5120 cols
[2022-05-20 23:51:34] [INFO ] Computed 1024 place invariants in 18 ms
[2022-05-20 23:51:36] [INFO ] Dead Transitions using invariants and state equation in 2745 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5120/5120 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-BN16-LTLCardinality-13 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 2 (ADD s256 s257 s258 s259 s260 s261 s262 s263 s264 s265 s266 s267 s268 s269 s270 s271 s272 s273 s274 s275 s276 s277 s278 s279 s280 s281 s282 s283 ...], 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 201 steps with 0 reset in 88 ms.
FORMULA Sudoku-COL-BN16-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-BN16-LTLCardinality-13 finished in 6800 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((((G(p0) U true) U true)&&G((G(p1)||!p0))))'
Support contains 512 out of 5120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Graph (complete) has 16384 edges and 5120 vertex of which 1024 are kept as prefixes of interest. Removing 4096 places using SCC suffix rule.7 ms
Discarding 4096 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 91 ms. Remains 1024 /5120 variables (removed 4096) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 1024 cols
[2022-05-20 23:51:37] [INFO ] Computed 168 place invariants in 597 ms
[2022-05-20 23:51:38] [INFO ] Implicit Places using invariants in 1377 ms returned []
// Phase 1: matrix 4096 rows 1024 cols
[2022-05-20 23:51:39] [INFO ] Computed 168 place invariants in 597 ms
[2022-05-20 23:51:42] [INFO ] Implicit Places using invariants and state equation in 3635 ms returned []
Implicit Place search using SMT with State Equation took 5020 ms to find 0 implicit places.
[2022-05-20 23:51:42] [INFO ] Redundant transitions in 159 ms returned []
// Phase 1: matrix 4096 rows 1024 cols
[2022-05-20 23:51:43] [INFO ] Computed 168 place invariants in 598 ms
[2022-05-20 23:51:44] [INFO ] Dead Transitions using invariants and state equation in 2014 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1024/5120 places, 4096/4096 transitions.
Finished structural reductions, in 1 iterations. Remains : 1024/5120 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p1), (AND (NOT p1) p0)]
Running random walk in product with property : Sudoku-COL-BN16-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=2, aps=[p1:(LEQ 2 (ADD s768 s769 s770 s771 s772 s773 s774 s775 s776 s777 s778 s779 s780 s781 s782 s783 s784 s785 s786 s787 s788 s789 s790 s791 s792 s793 s794 s795...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration timeout after 28770 steps with 136 reset in 10005 ms.
Product exploration timeout after 28320 steps with 134 reset in 10005 ms.
Computed a total of 1024 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1024 transition count 4096
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X p1), (X p0), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 264 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 47 resets, run finished after 3400 ms. (steps per millisecond=2 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 214 ms. (steps per millisecond=46 ) properties (out of 1) seen :0
Probabilistic random walk after 334496 steps, saw 334381 distinct states, run finished after 9003 ms. (steps per millisecond=37 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 4096 rows 1024 cols
[2022-05-20 23:52:19] [INFO ] Computed 168 place invariants in 669 ms
[2022-05-20 23:52:19] [INFO ] [Real]Absence check using 0 positive and 168 generalized place invariants in 139 ms returned sat
[2022-05-20 23:52:26] [INFO ] After 7304ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 23:52:26] [INFO ] [Nat]Absence check using 0 positive and 168 generalized place invariants in 127 ms returned sat
[2022-05-20 23:52:34] [INFO ] After 7035ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 23:52:34] [INFO ] After 7182ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 81 ms.
[2022-05-20 23:52:34] [INFO ] After 7524ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 255 steps, including 0 resets, run visited all 1 properties in 19 ms. (steps per millisecond=13 )
Parikh walk visited 1 properties in 19 ms.
Knowledge obtained : [(AND p1 p0), (X p1), (X p0), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 7 factoid took 250 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p1), (NOT p1)]
Support contains 256 out of 1024 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 4096/4096 transitions.
Applied a total of 0 rules in 52 ms. Remains 1024 /1024 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 1024 cols
[2022-05-20 23:52:35] [INFO ] Computed 168 place invariants in 614 ms
[2022-05-20 23:52:36] [INFO ] Implicit Places using invariants in 1391 ms returned []
// Phase 1: matrix 4096 rows 1024 cols
[2022-05-20 23:52:36] [INFO ] Computed 168 place invariants in 586 ms
[2022-05-20 23:52:39] [INFO ] Implicit Places using invariants and state equation in 3487 ms returned []
Implicit Place search using SMT with State Equation took 4883 ms to find 0 implicit places.
// Phase 1: matrix 4096 rows 1024 cols
[2022-05-20 23:52:40] [INFO ] Computed 168 place invariants in 602 ms
[2022-05-20 23:52:41] [INFO ] Dead Transitions using invariants and state equation in 2028 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1024/1024 places, 4096/4096 transitions.
Computed a total of 1024 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1024 transition count 4096
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 : [p1, (X p1), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 47 resets, run finished after 3386 ms. (steps per millisecond=2 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 1) seen :0
Probabilistic random walk after 347851 steps, saw 347729 distinct states, run finished after 9008 ms. (steps per millisecond=38 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 4096 rows 1024 cols
[2022-05-20 23:52:56] [INFO ] Computed 168 place invariants in 661 ms
[2022-05-20 23:52:56] [INFO ] [Real]Absence check using 0 positive and 168 generalized place invariants in 133 ms returned sat
[2022-05-20 23:53:03] [INFO ] After 7256ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 23:53:03] [INFO ] [Nat]Absence check using 0 positive and 168 generalized place invariants in 126 ms returned sat
[2022-05-20 23:53:10] [INFO ] After 6991ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 23:53:10] [INFO ] After 7124ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 92 ms.
[2022-05-20 23:53:10] [INFO ] After 7471ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 255 steps, including 0 resets, run visited all 1 properties in 19 ms. (steps per millisecond=13 )
Parikh walk visited 1 properties in 19 ms.
Knowledge obtained : [p1, (X p1), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 126 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p1), (NOT p1)]
Product exploration timeout after 28770 steps with 136 reset in 10001 ms.
Product exploration timeout after 28580 steps with 135 reset in 10003 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p1), (NOT p1)]
Support contains 256 out of 1024 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1024/1024 places, 4096/4096 transitions.
Applied a total of 0 rules in 178 ms. Remains 1024 /1024 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2022-05-20 23:53:31] [INFO ] Redundant transitions in 161 ms returned []
// Phase 1: matrix 4096 rows 1024 cols
[2022-05-20 23:53:32] [INFO ] Computed 168 place invariants in 589 ms
[2022-05-20 23:53:33] [INFO ] Dead Transitions using invariants and state equation in 2047 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1024/1024 places, 4096/4096 transitions.
Product exploration timeout after 28670 steps with 136 reset in 10002 ms.
Product exploration timeout after 28670 steps with 136 reset in 10004 ms.
Built C files in :
/tmp/ltsmin9769400545767663165
[2022-05-20 23:53:53] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9769400545767663165
Running compilation step : cd /tmp/ltsmin9769400545767663165;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin9769400545767663165;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9769400545767663165;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 256 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 4096/4096 transitions.
Applied a total of 0 rules in 119 ms. Remains 1024 /1024 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 1024 cols
[2022-05-20 23:53:57] [INFO ] Computed 168 place invariants in 599 ms
[2022-05-20 23:53:58] [INFO ] Implicit Places using invariants in 1661 ms returned []
// Phase 1: matrix 4096 rows 1024 cols
[2022-05-20 23:53:59] [INFO ] Computed 168 place invariants in 596 ms
[2022-05-20 23:54:03] [INFO ] Implicit Places using invariants and state equation in 4304 ms returned []
Implicit Place search using SMT with State Equation took 5988 ms to find 0 implicit places.
// Phase 1: matrix 4096 rows 1024 cols
[2022-05-20 23:54:03] [INFO ] Computed 168 place invariants in 597 ms
[2022-05-20 23:54:05] [INFO ] Dead Transitions using invariants and state equation in 2164 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1024/1024 places, 4096/4096 transitions.
Built C files in :
/tmp/ltsmin1894696028888873586
[2022-05-20 23:54:05] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1894696028888873586
Running compilation step : cd /tmp/ltsmin1894696028888873586;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin1894696028888873586;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1894696028888873586;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-20 23:54:08] [INFO ] Flatten gal took : 206 ms
[2022-05-20 23:54:08] [INFO ] Flatten gal took : 199 ms
[2022-05-20 23:54:08] [INFO ] Time to serialize gal into /tmp/LTL6241009663127682798.gal : 19 ms
[2022-05-20 23:54:08] [INFO ] Time to serialize properties into /tmp/LTL12062826452386883524.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6241009663127682798.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12062826452386883524.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6241009...267
Read 1 LTL properties
Checking formula 0 : !((G((G("(((((((((Columns_0+Columns_1)+(Columns_2+Columns_3))+((Columns_4+Columns_5)+(Columns_6+Columns_7)))+(((Columns_8+Columns_9)+(...6481
Formula 0 simplified : !G("(((((((((Cells_0+Cells_1)+(Cells_2+Cells_3))+((Cells_4+Cells_5)+(Cells_6+Cells_7)))+(((Cells_8+Cells_9)+(Cells_10+Cells_11))+((C...6474
Detected timeout of ITS tools.
[2022-05-20 23:54:24] [INFO ] Flatten gal took : 187 ms
[2022-05-20 23:54:24] [INFO ] Applying decomposition
[2022-05-20 23:54:24] [INFO ] Flatten gal took : 180 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph6595625926968074330.txt' '-o' '/tmp/graph6595625926968074330.bin' '-w' '/tmp/graph6595625926968074330.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6595625926968074330.bin' '-l' '-1' '-v' '-w' '/tmp/graph6595625926968074330.weights' '-q' '0' '-e' '0.001'
[2022-05-20 23:54:24] [INFO ] Decomposing Gal with order
[2022-05-20 23:54:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 23:54:26] [INFO ] Removed a total of 15360 redundant transitions.
[2022-05-20 23:54:26] [INFO ] Flatten gal took : 1725 ms
[2022-05-20 23:54:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 28 ms.
[2022-05-20 23:54:26] [INFO ] Time to serialize gal into /tmp/LTL9331313948451083183.gal : 15 ms
[2022-05-20 23:54:26] [INFO ] Time to serialize properties into /tmp/LTL7885543509477707622.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9331313948451083183.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7885543509477707622.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9331313...266
Read 1 LTL properties
Checking formula 0 : !((G((G("(((((((((gu513.Columns_0+gu513.Columns_1)+(gu513.Columns_2+gu513.Columns_3))+((gu513.Columns_4+gu513.Columns_5)+(gu513.Column...9553
Formula 0 simplified : !G("(((((((((gu512.Cells_0+gu512.Cells_1)+(gu512.Cells_2+gu512.Cells_3))+((gu512.Cells_4+gu512.Cells_5)+(gu512.Cells_6+gu512.Cells_7...9546
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17099120861349813032
[2022-05-20 23:54:41] [INFO ] Built C files in 57ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17099120861349813032
Running compilation step : cd /tmp/ltsmin17099120861349813032;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin17099120861349813032;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17099120861349813032;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property Sudoku-COL-BN16-LTLCardinality-14 finished in 187717 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((((G(p0) U true) U true)&&G((G(p1)||!p0))))'
[2022-05-20 23:54:45] [INFO ] Flatten gal took : 297 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14717113048279702043
[2022-05-20 23:54:45] [INFO ] Too many transitions (4096) to apply POR reductions. Disabling POR matrices.
[2022-05-20 23:54:45] [INFO ] Built C files in 103ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14717113048279702043
Running compilation step : cd /tmp/ltsmin14717113048279702043;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-20 23:54:45] [INFO ] Applying decomposition
[2022-05-20 23:54:45] [INFO ] Flatten gal took : 305 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph18367364468086536807.txt' '-o' '/tmp/graph18367364468086536807.bin' '-w' '/tmp/graph18367364468086536807.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph18367364468086536807.bin' '-l' '-1' '-v' '-w' '/tmp/graph18367364468086536807.weights' '-q' '0' '-e' '0.001'
[2022-05-20 23:54:46] [INFO ] Decomposing Gal with order
[2022-05-20 23:54:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 23:54:50] [INFO ] Removed a total of 11520 redundant transitions.
[2022-05-20 23:54:50] [INFO ] Flatten gal took : 2906 ms
[2022-05-20 23:54:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 26 ms.
[2022-05-20 23:54:50] [INFO ] Time to serialize gal into /tmp/LTLCardinality13761218738254162074.gal : 30 ms
[2022-05-20 23:54:50] [INFO ] Time to serialize properties into /tmp/LTLCardinality14244186703641462376.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality13761218738254162074.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality14244186703641462376.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...290
Read 2 LTL properties
Checking formula 0 : !((G(F("(((((((((gu256.Regions_0+gu256.Regions_1)+(gu256.Regions_2+gu256.Regions_3))+((gu256.Regions_4+gu256.Regions_5)+(gu256.Regions...5046
Formula 0 simplified : !GF"(((((((((gu256.Regions_0+gu256.Regions_1)+(gu256.Regions_2+gu256.Regions_3))+((gu256.Regions_4+gu256.Regions_5)+(gu256.Regions_6...5040
Compilation finished in 15879 ms.
Running link step : cd /tmp/ltsmin14717113048279702043;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 64 ms.
Running LTSmin : cd /tmp/ltsmin14717113048279702043;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-21 00:17:37] [INFO ] Applying decomposition
[2022-05-21 00:17:39] [INFO ] Flatten gal took : 1669 ms
[2022-05-21 00:17:39] [INFO ] Decomposing Gal with order
[2022-05-21 00:17:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-21 00:17:44] [INFO ] Removed a total of 12816 redundant transitions.
[2022-05-21 00:17:45] [INFO ] Flatten gal took : 1695 ms
[2022-05-21 00:17:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 90 ms.
[2022-05-21 00:17:46] [INFO ] Time to serialize gal into /tmp/LTLCardinality1998648236673761854.gal : 564 ms
[2022-05-21 00:17:46] [INFO ] Time to serialize properties into /tmp/LTLCardinality11614882784949375698.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality1998648236673761854.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality11614882784949375698.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...289
Read 2 LTL properties
Checking formula 0 : !((G(F("(((((((((gNN0.Regions_0+gNN1.Regions_1)+(gNN2.Regions_2+gNN3.Regions_3))+((gNN4.Regions_4+gNN5.Regions_5)+(gNN6.Regions_6+gNN7...5192
Formula 0 simplified : !GF"(((((((((gNN0.Regions_0+gNN1.Regions_1)+(gNN2.Regions_2+gNN3.Regions_3))+((gNN4.Regions_4+gNN5.Regions_5)+(gNN6.Regions_6+gNN7.R...5186
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin14717113048279702043;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin14717113048279702043;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '((([]((LTLAPp1==true)) U true) U true)&&[](([]((LTLAPp2==true))||!(LTLAPp1==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-21 00:40:33] [INFO ] Flatten gal took : 589 ms
[2022-05-21 00:40:34] [INFO ] Input system was already deterministic with 4096 transitions.
[2022-05-21 00:40:34] [INFO ] Transformed 5120 places.
[2022-05-21 00:40:34] [INFO ] Transformed 4096 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-21 00:40:45] [INFO ] Time to serialize gal into /tmp/LTLCardinality5865544125229458983.gal : 56 ms
[2022-05-21 00:40:45] [INFO ] Time to serialize properties into /tmp/LTLCardinality9349946059634785541.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality5865544125229458983.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality9349946059634785541.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...333
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F("(((((((((Regions_0+Regions_1)+(Regions_2+Regions_3))+((Regions_4+Regions_5)+(Regions_6+Regions_7)))+(((Regions_8+Regions_9)+(R...3510
Formula 0 simplified : !GF"(((((((((Regions_0+Regions_1)+(Regions_2+Regions_3))+((Regions_4+Regions_5)+(Regions_6+Regions_7)))+(((Regions_8+Regions_9)+(Reg...3504

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Sudoku-COL-BN16"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is Sudoku-COL-BN16, 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 r258-tall-165303545400195"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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