Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 8.2K Feb 26 09:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Feb 26 09:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Feb 26 09:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 32K Feb 26 09:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 09:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K Feb 26 09:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Feb 26 09:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 26 09:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 6.5K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679146277593

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-COL-AN04
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202303021504
[2023-03-18 13:31:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-18 13:31:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 13:31:19] [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.
[2023-03-18 13:31:19] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-18 13:31:19] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 399 ms
[2023-03-18 13:31:19] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 112 PT places and 64.0 transition bindings in 10 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
[2023-03-18 13:31:19] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 4 ms.
[2023-03-18 13:31:19] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 1 formulas.
FORMULA Sudoku-COL-AN04-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 15 properties that can be checked using skeleton over-approximation.
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Incomplete random walk after 10007 steps, including 555 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 22) seen :15
Incomplete Best-First random walk after 10007 steps, including 555 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10007 steps, including 555 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10007 steps, including 555 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10007 steps, including 555 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10007 steps, including 555 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10007 steps, including 555 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10007 steps, including 555 resets, run finished after 23 ms. (steps per millisecond=435 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 1 rows 4 cols
[2023-03-18 13:31:20] [INFO ] Computed 3 place invariants in 6 ms
[2023-03-18 13:31:20] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-18 13:31:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-18 13:31:20] [INFO ] After 48ms 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 15 simplifications.
FORMULA Sudoku-COL-AN04-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN04-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN04-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 13:31:20] [INFO ] Flatten gal took : 13 ms
[2023-03-18 13:31:20] [INFO ] Flatten gal took : 1 ms
Domain [N(4), N(4)] of place Rows breaks symmetries in sort N
[2023-03-18 13:31:20] [INFO ] Unfolded HLPN to a Petri net with 112 places and 64 transitions 256 arcs in 9 ms.
[2023-03-18 13:31:20] [INFO ] Unfolded 12 HLPN properties in 1 ms.
Support contains 112 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Applied a total of 0 rules in 6 ms. Remains 112 /112 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 112 cols
[2023-03-18 13:31:20] [INFO ] Computed 48 place invariants in 3 ms
[2023-03-18 13:31:20] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-18 13:31:20] [INFO ] Invariant cache hit.
[2023-03-18 13:31:21] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
[2023-03-18 13:31:21] [INFO ] Invariant cache hit.
[2023-03-18 13:31:21] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 227 ms. Remains : 112/112 places, 64/64 transitions.
Support contains 112 out of 112 places after structural reductions.
[2023-03-18 13:31:21] [INFO ] Flatten gal took : 18 ms
[2023-03-18 13:31:21] [INFO ] Flatten gal took : 12 ms
[2023-03-18 13:31:21] [INFO ] Input system was already deterministic with 64 transitions.
Incomplete random walk after 10000 steps, including 690 resets, run finished after 220 ms. (steps per millisecond=45 ) properties (out of 17) seen :15
Incomplete Best-First random walk after 10000 steps, including 30 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-18 13:31:21] [INFO ] Invariant cache hit.
[2023-03-18 13:31:21] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 13:31:21] [INFO ] [Nat]Absence check using 48 positive place invariants in 8 ms returned sat
[2023-03-18 13:31:21] [INFO ] After 51ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
Computed a total of 112 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 112 transition count 64
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U (X((p1 U p2))||G(p3))))'
Support contains 48 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 48 transition count 64
Applied a total of 64 rules in 2 ms. Remains 48 /112 variables (removed 64) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 48 cols
[2023-03-18 13:31:21] [INFO ] Computed 11 place invariants in 9 ms
[2023-03-18 13:31:22] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-18 13:31:22] [INFO ] Invariant cache hit.
[2023-03-18 13:31:22] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2023-03-18 13:31:22] [INFO ] Invariant cache hit.
[2023-03-18 13:31:22] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 48/112 places, 64/64 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 137 ms. Remains : 48/112 places, 64/64 transitions.
Stuttering acceptance computed with spot in 396 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : Sudoku-COL-AN04-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND p3 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p3) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p3 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p3 (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p3 (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND p3 (NOT p0)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p3:(GT 1 (ADD s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47)), p0:(LEQ 3 (ADD s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s3...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 639 ms.
Product exploration explored 100000 steps with 50000 reset in 563 ms.
Computed a total of 48 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 48 transition count 64
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 p3) p0 p2 p1), (X (NOT (AND p3 (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p3 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p3) (NOT p0) (NOT p2)))), (X (NOT (AND p3 (NOT p2)))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND p3 (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p3 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p2))))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p3) p0 p2 p1)
Knowledge based reduction with 24 factoid took 1540 ms. Reduced automaton from 6 states, 14 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN04-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN04-LTLCardinality-00 finished in 3404 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 80 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Applied a total of 0 rules in 7 ms. Remains 112 /112 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 112 cols
[2023-03-18 13:31:25] [INFO ] Computed 48 place invariants in 1 ms
[2023-03-18 13:31:25] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-18 13:31:25] [INFO ] Invariant cache hit.
[2023-03-18 13:31:25] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
[2023-03-18 13:31:25] [INFO ] Invariant cache hit.
[2023-03-18 13:31:25] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 218 ms. Remains : 112/112 places, 64/64 transitions.
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN04-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ (ADD s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 9 steps with 0 reset in 1 ms.
FORMULA Sudoku-COL-AN04-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN04-LTLCardinality-01 finished in 331 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||(G(p1)&&X(G(p0))))))'
Support contains 16 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 48 transition count 64
Applied a total of 64 rules in 4 ms. Remains 48 /112 variables (removed 64) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 48 cols
[2023-03-18 13:31:25] [INFO ] Computed 11 place invariants in 4 ms
[2023-03-18 13:31:25] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-18 13:31:25] [INFO ] Invariant cache hit.
[2023-03-18 13:31:25] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
[2023-03-18 13:31:25] [INFO ] Invariant cache hit.
[2023-03-18 13:31:25] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 48/112 places, 64/64 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 163 ms. Remains : 48/112 places, 64/64 transitions.
Stuttering acceptance computed with spot in 229 ms :[true, (NOT p0), (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-COL-AN04-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(LEQ 1 (ADD s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31)), p1:(LEQ 2 (ADD s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s...], 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][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 444 ms.
Product exploration explored 100000 steps with 50000 reset in 492 ms.
Computed a total of 48 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 48 transition count 64
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), true, (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) p1)))
Knowledge based reduction with 8 factoid took 190 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN04-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN04-LTLCardinality-02 finished in 1590 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(p1))))'
Support contains 80 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Applied a total of 0 rules in 4 ms. Remains 112 /112 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 112 cols
[2023-03-18 13:31:27] [INFO ] Computed 48 place invariants in 2 ms
[2023-03-18 13:31:27] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-18 13:31:27] [INFO ] Invariant cache hit.
[2023-03-18 13:31:27] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
[2023-03-18 13:31:27] [INFO ] Invariant cache hit.
[2023-03-18 13:31:27] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 200 ms. Remains : 112/112 places, 64/64 transitions.
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-COL-AN04-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}]], initial=0, aps=[p1:(LEQ 1 (ADD s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 518 ms.
Product exploration explored 100000 steps with 50000 reset in 513 ms.
Computed a total of 112 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 112 transition count 64
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 5 factoid took 80 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN04-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN04-LTLCardinality-04 finished in 1524 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(p0)))'
Support contains 16 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 48 transition count 64
Applied a total of 64 rules in 2 ms. Remains 48 /112 variables (removed 64) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 48 cols
[2023-03-18 13:31:28] [INFO ] Computed 11 place invariants in 5 ms
[2023-03-18 13:31:28] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-18 13:31:28] [INFO ] Invariant cache hit.
[2023-03-18 13:31:28] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
[2023-03-18 13:31:28] [INFO ] Invariant cache hit.
[2023-03-18 13:31:28] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 48/112 places, 64/64 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 159 ms. Remains : 48/112 places, 64/64 transitions.
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN04-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=3, aps=[p0:(LEQ 3 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15))], 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][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 534 ms.
Product exploration explored 100000 steps with 33333 reset in 551 ms.
Computed a total of 48 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 48 transition count 64
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 3 factoid took 67 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN04-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN04-LTLCardinality-06 finished in 1500 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 80 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Applied a total of 0 rules in 9 ms. Remains 112 /112 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 112 cols
[2023-03-18 13:31:30] [INFO ] Computed 48 place invariants in 1 ms
[2023-03-18 13:31:30] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-18 13:31:30] [INFO ] Invariant cache hit.
[2023-03-18 13:31:30] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
[2023-03-18 13:31:30] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 13:31:30] [INFO ] Invariant cache hit.
[2023-03-18 13:31:30] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 224 ms. Remains : 112/112 places, 64/64 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN04-LTLCardinality-07 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 s96 s97 s98 s99 s100 s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111) (ADD s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 6948 reset in 692 ms.
Product exploration explored 100000 steps with 6954 reset in 763 ms.
Computed a total of 112 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 112 transition count 64
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 192 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Finished random walk after 8 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=8 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 166 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
[2023-03-18 13:31:32] [INFO ] Invariant cache hit.
[2023-03-18 13:31:32] [INFO ] [Real]Absence check using 48 positive place invariants in 7 ms returned sat
[2023-03-18 13:31:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 13:31:32] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2023-03-18 13:31:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 13:31:32] [INFO ] [Nat]Absence check using 48 positive place invariants in 12 ms returned sat
[2023-03-18 13:31:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 13:31:32] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2023-03-18 13:31:32] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-18 13:31:32] [INFO ] Added : 0 causal constraints over 0 iterations in 25 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 80 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 112 /112 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2023-03-18 13:31:32] [INFO ] Invariant cache hit.
[2023-03-18 13:31:32] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-18 13:31:32] [INFO ] Invariant cache hit.
[2023-03-18 13:31:32] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
[2023-03-18 13:31:32] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 13:31:32] [INFO ] Invariant cache hit.
[2023-03-18 13:31:32] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 181 ms. Remains : 112/112 places, 64/64 transitions.
Computed a total of 112 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 112 transition count 64
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 142 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Finished random walk after 8 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=4 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 137 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
[2023-03-18 13:31:33] [INFO ] Invariant cache hit.
[2023-03-18 13:31:33] [INFO ] [Real]Absence check using 48 positive place invariants in 8 ms returned sat
[2023-03-18 13:31:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 13:31:33] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2023-03-18 13:31:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 13:31:33] [INFO ] [Nat]Absence check using 48 positive place invariants in 11 ms returned sat
[2023-03-18 13:31:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 13:31:33] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2023-03-18 13:31:33] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-18 13:31:33] [INFO ] Added : 0 causal constraints over 0 iterations in 21 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 6939 reset in 634 ms.
Product exploration explored 100000 steps with 6954 reset in 646 ms.
Built C files in :
/tmp/ltsmin3368662295044204315
[2023-03-18 13:31:35] [INFO ] Computing symmetric may disable matrix : 64 transitions.
[2023-03-18 13:31:35] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 13:31:35] [INFO ] Computing symmetric may enable matrix : 64 transitions.
[2023-03-18 13:31:35] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 13:31:35] [INFO ] Computing Do-Not-Accords matrix : 64 transitions.
[2023-03-18 13:31:35] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 13:31:35] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3368662295044204315
Running compilation step : cd /tmp/ltsmin3368662295044204315;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 286 ms.
Running link step : cd /tmp/ltsmin3368662295044204315;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin3368662295044204315;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10822179250700013604.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 80 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Applied a total of 0 rules in 20 ms. Remains 112 /112 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2023-03-18 13:31:50] [INFO ] Invariant cache hit.
[2023-03-18 13:31:50] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-18 13:31:50] [INFO ] Invariant cache hit.
[2023-03-18 13:31:50] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
[2023-03-18 13:31:50] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 13:31:50] [INFO ] Invariant cache hit.
[2023-03-18 13:31:50] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 234 ms. Remains : 112/112 places, 64/64 transitions.
Built C files in :
/tmp/ltsmin1538167351984038801
[2023-03-18 13:31:50] [INFO ] Computing symmetric may disable matrix : 64 transitions.
[2023-03-18 13:31:50] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 13:31:50] [INFO ] Computing symmetric may enable matrix : 64 transitions.
[2023-03-18 13:31:50] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 13:31:50] [INFO ] Computing Do-Not-Accords matrix : 64 transitions.
[2023-03-18 13:31:50] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 13:31:50] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1538167351984038801
Running compilation step : cd /tmp/ltsmin1538167351984038801;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 186 ms.
Running link step : cd /tmp/ltsmin1538167351984038801;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin1538167351984038801;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15073433493821390275.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-18 13:32:05] [INFO ] Flatten gal took : 9 ms
[2023-03-18 13:32:05] [INFO ] Flatten gal took : 8 ms
[2023-03-18 13:32:05] [INFO ] Time to serialize gal into /tmp/LTL10495025513052042493.gal : 2 ms
[2023-03-18 13:32:05] [INFO ] Time to serialize properties into /tmp/LTL2141221029673533459.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10495025513052042493.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14132347008216681420.hoa' '-atoms' '/tmp/LTL2141221029673533459.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL2141221029673533459.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14132347008216681420.hoa
Detected timeout of ITS tools.
[2023-03-18 13:32:20] [INFO ] Flatten gal took : 6 ms
[2023-03-18 13:32:20] [INFO ] Flatten gal took : 6 ms
[2023-03-18 13:32:20] [INFO ] Time to serialize gal into /tmp/LTL6843099157190818128.gal : 2 ms
[2023-03-18 13:32:20] [INFO ] Time to serialize properties into /tmp/LTL6942165253797378126.ltl : 8 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6843099157190818128.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6942165253797378126.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G("(((((Columns_0+Columns_1)+(Columns_2+Columns_3))+((Columns_4+Columns_5)+(Columns_6+Columns_7)))+(((Columns_8+Columns_9)+(Colum...924
Formula 0 simplified : GF!"(((((Columns_0+Columns_1)+(Columns_2+Columns_3))+((Columns_4+Columns_5)+(Columns_6+Columns_7)))+(((Columns_8+Columns_9)+(Columns...918
Detected timeout of ITS tools.
[2023-03-18 13:32:35] [INFO ] Flatten gal took : 6 ms
[2023-03-18 13:32:35] [INFO ] Applying decomposition
[2023-03-18 13:32:35] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph8451641356731407793.txt' '-o' '/tmp/graph8451641356731407793.bin' '-w' '/tmp/graph8451641356731407793.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph8451641356731407793.bin' '-l' '-1' '-v' '-w' '/tmp/graph8451641356731407793.weights' '-q' '0' '-e' '0.001'
[2023-03-18 13:32:35] [INFO ] Decomposing Gal with order
[2023-03-18 13:32:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 13:32:35] [INFO ] Removed a total of 70 redundant transitions.
[2023-03-18 13:32:35] [INFO ] Flatten gal took : 60 ms
[2023-03-18 13:32:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 3 ms.
[2023-03-18 13:32:35] [INFO ] Time to serialize gal into /tmp/LTL2264030927449296231.gal : 11 ms
[2023-03-18 13:32:35] [INFO ] Time to serialize properties into /tmp/LTL7125148601420311292.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2264030927449296231.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7125148601420311292.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G("(((((gu22.Columns_0+gu22.Columns_1)+(gu22.Columns_2+gu22.Columns_3))+((gu22.Columns_4+gu22.Columns_5)+(gu22.Columns_6+gu22.Col...1324
Formula 0 simplified : GF!"(((((gu22.Columns_0+gu22.Columns_1)+(gu22.Columns_2+gu22.Columns_3))+((gu22.Columns_4+gu22.Columns_5)+(gu22.Columns_6+gu22.Colum...1318
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7912659469307939518
[2023-03-18 13:32:51] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7912659469307939518
Running compilation step : cd /tmp/ltsmin7912659469307939518;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 167 ms.
Running link step : cd /tmp/ltsmin7912659469307939518;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin7912659469307939518;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Sudoku-COL-AN04-LTLCardinality-07 finished in 95901 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((X(p0) U (X(G(p0))||(p1&&X(p0)))))||((X(p0) U (X(G(p0))||(p1&&X(p0))))&&X(F(!p1))))))'
Support contains 80 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Applied a total of 0 rules in 3 ms. Remains 112 /112 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2023-03-18 13:33:06] [INFO ] Invariant cache hit.
[2023-03-18 13:33:06] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-18 13:33:06] [INFO ] Invariant cache hit.
[2023-03-18 13:33:06] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
[2023-03-18 13:33:06] [INFO ] Invariant cache hit.
[2023-03-18 13:33:06] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 197 ms. Remains : 112/112 places, 64/64 transitions.
Stuttering acceptance computed with spot in 289 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0)), (NOT p0), (NOT p0), (AND p1 (NOT p0)), true, p1]
Running random walk in product with property : Sudoku-COL-AN04-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 7}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=p1, acceptance={0} source=7 dest: 7}]], initial=0, aps=[p1:(GT 3 (ADD s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 28615 reset in 654 ms.
Product exploration explored 100000 steps with 28588 reset in 669 ms.
Computed a total of 112 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 112 transition count 64
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), true, (X (X p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 349 ms. Reduced automaton from 8 states, 13 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 207 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Incomplete random walk after 10000 steps, including 694 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 13:33:08] [INFO ] Invariant cache hit.
[2023-03-18 13:33:09] [INFO ] [Real]Absence check using 48 positive place invariants in 314 ms returned sat
[2023-03-18 13:33:09] [INFO ] After 415ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X p1), true, (X (X p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND p1 (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p1 p0)))]
Property proved to be true thanks to knowledge :(G (NOT (AND p1 (NOT p0))))
Knowledge based reduction with 10 factoid took 326 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN04-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN04-LTLCardinality-08 finished in 3335 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G((F(!p1)&&F(p2))))))'
Support contains 80 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Applied a total of 0 rules in 6 ms. Remains 112 /112 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2023-03-18 13:33:09] [INFO ] Invariant cache hit.
[2023-03-18 13:33:09] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-18 13:33:09] [INFO ] Invariant cache hit.
[2023-03-18 13:33:09] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
[2023-03-18 13:33:09] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 13:33:09] [INFO ] Invariant cache hit.
[2023-03-18 13:33:09] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 214 ms. Remains : 112/112 places, 64/64 transitions.
Stuttering acceptance computed with spot in 126 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) p1), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Sudoku-COL-AN04-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ (ADD s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 0 ms.
FORMULA Sudoku-COL-AN04-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN04-LTLCardinality-10 finished in 356 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0 U (p1||G(p0))))))'
Support contains 32 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Graph (complete) has 192 edges and 112 vertex of which 48 are kept as prefixes of interest. Removing 64 places using SCC suffix rule.2 ms
Discarding 64 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 ms. Remains 48 /112 variables (removed 64) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 48 cols
[2023-03-18 13:33:09] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-18 13:33:09] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-18 13:33:09] [INFO ] Invariant cache hit.
[2023-03-18 13:33:09] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2023-03-18 13:33:09] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 13:33:09] [INFO ] Invariant cache hit.
[2023-03-18 13:33:10] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 48/112 places, 64/64 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 151 ms. Remains : 48/112 places, 64/64 transitions.
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-COL-AN04-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GT 1 (ADD s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47)) (GT 2 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15))), ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 0 ms.
FORMULA Sudoku-COL-AN04-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN04-LTLCardinality-12 finished in 243 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 80 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 112 /112 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 112 cols
[2023-03-18 13:33:10] [INFO ] Computed 48 place invariants in 2 ms
[2023-03-18 13:33:10] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-03-18 13:33:10] [INFO ] Invariant cache hit.
[2023-03-18 13:33:10] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
[2023-03-18 13:33:10] [INFO ] Invariant cache hit.
[2023-03-18 13:33:10] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 200 ms. Remains : 112/112 places, 64/64 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN04-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15) (ADD s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s3...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 473 ms.
Product exploration explored 100000 steps with 50000 reset in 476 ms.
Computed a total of 112 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 112 transition count 64
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 80 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN04-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN04-LTLCardinality-13 finished in 1379 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 16 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Graph (complete) has 192 edges and 112 vertex of which 48 are kept as prefixes of interest. Removing 64 places using SCC suffix rule.0 ms
Discarding 64 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 48 /112 variables (removed 64) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 48 cols
[2023-03-18 13:33:11] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-18 13:33:11] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-18 13:33:11] [INFO ] Invariant cache hit.
[2023-03-18 13:33:11] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2023-03-18 13:33:11] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 13:33:11] [INFO ] Invariant cache hit.
[2023-03-18 13:33:11] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 48/112 places, 64/64 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 165 ms. Remains : 48/112 places, 64/64 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN04-LTLCardinality-14 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 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31))], 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 89 steps with 5 reset in 1 ms.
FORMULA Sudoku-COL-AN04-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN04-LTLCardinality-14 finished in 263 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((!p0&&F(G(p0))))))'
Support contains 16 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 48 transition count 64
Applied a total of 64 rules in 2 ms. Remains 48 /112 variables (removed 64) and now considering 64/64 (removed 0) transitions.
[2023-03-18 13:33:11] [INFO ] Invariant cache hit.
[2023-03-18 13:33:11] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-18 13:33:11] [INFO ] Invariant cache hit.
[2023-03-18 13:33:11] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2023-03-18 13:33:11] [INFO ] Invariant cache hit.
[2023-03-18 13:33:11] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 48/112 places, 64/64 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 155 ms. Remains : 48/112 places, 64/64 transitions.
Stuttering acceptance computed with spot in 152 ms :[true, true, p0, (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN04-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ 2 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 16 steps with 0 reset in 1 ms.
FORMULA Sudoku-COL-AN04-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN04-LTLCardinality-15 finished in 322 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2023-03-18 13:33:12] [INFO ] Flatten gal took : 10 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1270752866525326690
[2023-03-18 13:33:12] [INFO ] Computing symmetric may disable matrix : 64 transitions.
[2023-03-18 13:33:12] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 13:33:12] [INFO ] Computing symmetric may enable matrix : 64 transitions.
[2023-03-18 13:33:12] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 13:33:12] [INFO ] Computing Do-Not-Accords matrix : 64 transitions.
[2023-03-18 13:33:12] [INFO ] Applying decomposition
[2023-03-18 13:33:12] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 13:33:12] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1270752866525326690
Running compilation step : cd /tmp/ltsmin1270752866525326690;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-18 13:33:12] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph1824897326093307945.txt' '-o' '/tmp/graph1824897326093307945.bin' '-w' '/tmp/graph1824897326093307945.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph1824897326093307945.bin' '-l' '-1' '-v' '-w' '/tmp/graph1824897326093307945.weights' '-q' '0' '-e' '0.001'
[2023-03-18 13:33:12] [INFO ] Decomposing Gal with order
[2023-03-18 13:33:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 13:33:12] [INFO ] Removed a total of 70 redundant transitions.
[2023-03-18 13:33:12] [INFO ] Flatten gal took : 33 ms
[2023-03-18 13:33:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 2 ms.
[2023-03-18 13:33:12] [INFO ] Time to serialize gal into /tmp/LTLCardinality1995028591542344148.gal : 1 ms
[2023-03-18 13:33:12] [INFO ] Time to serialize properties into /tmp/LTLCardinality16841534163317393687.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality1995028591542344148.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality16841534163317393687.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !((F(G("(((((gu3.Columns_0+gu3.Columns_1)+(gu3.Columns_2+gu3.Columns_3))+((gu3.Columns_4+gu3.Columns_5)+(gu3.Columns_6+gu3.Columns_7))...1244
Formula 0 simplified : GF!"(((((gu3.Columns_0+gu3.Columns_1)+(gu3.Columns_2+gu3.Columns_3))+((gu3.Columns_4+gu3.Columns_5)+(gu3.Columns_6+gu3.Columns_7)))+...1238
Compilation finished in 368 ms.
Running link step : cd /tmp/ltsmin1270752866525326690;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin1270752866525326690;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.019: LTL layer: formula: <>([]((LTLAPp0==true)))
pins2lts-mc-linux64( 4/ 8), 0.019: "<>([]((LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.019: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.023: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.023: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.024: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.028: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.028: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.028: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.042: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.043: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.043: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.051: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.051: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.051: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.056: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.056: Initializing POR dependencies: labels 65, guards 64
pins2lts-mc-linux64( 6/ 8), 0.066: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.066: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.089: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.103: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.130: There are 66 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.130: State length is 113, there are 68 groups
pins2lts-mc-linux64( 0/ 8), 0.130: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.130: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.130: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.130: Visible groups: 0 / 68, labels: 1 / 66
pins2lts-mc-linux64( 0/ 8), 0.130: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.130: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 3/ 8), 0.278: [Blue] ~15 levels ~960 states ~5024 transitions
pins2lts-mc-linux64( 3/ 8), 0.307: [Blue] ~15 levels ~1920 states ~8784 transitions
pins2lts-mc-linux64( 3/ 8), 0.512: [Blue] ~15 levels ~3840 states ~16240 transitions
pins2lts-mc-linux64( 3/ 8), 0.696: [Blue] ~16 levels ~7680 states ~34200 transitions
pins2lts-mc-linux64( 5/ 8), 1.222: [Blue] ~17 levels ~15360 states ~68528 transitions
pins2lts-mc-linux64( 7/ 8), 2.295: [Blue] ~15 levels ~30720 states ~138224 transitions
pins2lts-mc-linux64( 7/ 8), 3.530: [Blue] ~15 levels ~61440 states ~297464 transitions
pins2lts-mc-linux64( 0/ 8), 4.192: [Blue] ~17 levels ~122880 states ~601088 transitions
pins2lts-mc-linux64( 0/ 8), 5.195: [Blue] ~17 levels ~245760 states ~1325896 transitions
pins2lts-mc-linux64( 0/ 8), 6.895: [Blue] ~17 levels ~491520 states ~2750216 transitions
pins2lts-mc-linux64( 5/ 8), 10.035: [Blue] ~17 levels ~983040 states ~5925480 transitions
pins2lts-mc-linux64( 0/ 8), 15.792: [Blue] ~17 levels ~1966080 states ~12144624 transitions
pins2lts-mc-linux64( 0/ 8), 27.983: [Blue] ~17 levels ~3932160 states ~26306192 transitions
pins2lts-mc-linux64( 5/ 8), 53.549: [Blue] ~17 levels ~7864320 states ~53586944 transitions
pins2lts-mc-linux64( 7/ 8), 111.137: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 111.195:
pins2lts-mc-linux64( 0/ 8), 111.195: Explored 14681995 states 108790453 transitions, fanout: 7.410
pins2lts-mc-linux64( 0/ 8), 111.195: Total exploration time 111.060 sec (110.990 sec minimum, 111.019 sec on average)
pins2lts-mc-linux64( 0/ 8), 111.195: States per second: 132199, Transitions per second: 979565
pins2lts-mc-linux64( 0/ 8), 111.195:
pins2lts-mc-linux64( 0/ 8), 111.195: State space has 14682881 states, 539 are accepting
pins2lts-mc-linux64( 0/ 8), 111.195: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 111.195: blue states: 14681995 (99.99%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 111.195: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 111.195: all-red states: 539 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 111.195:
pins2lts-mc-linux64( 0/ 8), 111.195: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 111.195:
pins2lts-mc-linux64( 0/ 8), 111.195: Queue width: 8B, total height: 136, memory: 0.00MB
pins2lts-mc-linux64( 0/ 8), 111.195: Tree memory: 368.0MB, 26.3 B/state, compr.: 5.8%
pins2lts-mc-linux64( 0/ 8), 111.195: Tree fill ratio (roots/leafs): 10.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 111.195: Stored 64 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 111.195: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 111.196: Est. total memory use: 368.0MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin1270752866525326690;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin1270752866525326690;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2023-03-18 13:53:55] [INFO ] Applying decomposition
[2023-03-18 13:53:56] [INFO ] Flatten gal took : 163 ms
[2023-03-18 13:53:56] [INFO ] Decomposing Gal with order
[2023-03-18 13:53:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 13:53:56] [INFO ] Removed a total of 84 redundant transitions.
[2023-03-18 13:53:56] [INFO ] Flatten gal took : 197 ms
[2023-03-18 13:53:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2023-03-18 13:53:56] [INFO ] Time to serialize gal into /tmp/LTLCardinality8015841179224701110.gal : 41 ms
[2023-03-18 13:53:56] [INFO ] Time to serialize properties into /tmp/LTLCardinality11642035464344267663.ltl : 22 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality8015841179224701110.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality11642035464344267663.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !((F(G("(((((gNN0.Columns_0+gNN1.Columns_1)+(gNN2.Columns_2+gNN3.Columns_3))+((gNN4.Columns_4+gNN5.Columns_5)+(gNN6.Columns_6+gNN7.Col...1448
Formula 0 simplified : GF!"(((((gNN0.Columns_0+gNN1.Columns_1)+(gNN2.Columns_2+gNN3.Columns_3))+((gNN4.Columns_4+gNN5.Columns_5)+(gNN6.Columns_6+gNN7.Colum...1442
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 409584 deadlock states
Detected timeout of ITS tools.
[2023-03-18 14:14:38] [INFO ] Flatten gal took : 181 ms
[2023-03-18 14:14:38] [INFO ] Input system was already deterministic with 64 transitions.
[2023-03-18 14:14:38] [INFO ] Transformed 112 places.
[2023-03-18 14:14:38] [INFO ] Transformed 64 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-18 14:14:39] [INFO ] Time to serialize gal into /tmp/LTLCardinality11819594140488945914.gal : 6 ms
[2023-03-18 14:14:39] [INFO ] Time to serialize properties into /tmp/LTLCardinality13284590779792060465.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality11819594140488945914.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality13284590779792060465.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...344
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G("(((((Columns_0+Columns_1)+(Columns_2+Columns_3))+((Columns_4+Columns_5)+(Columns_6+Columns_7)))+(((Columns_8+Columns_9)+(Colum...924
Formula 0 simplified : GF!"(((((Columns_0+Columns_1)+(Columns_2+Columns_3))+((Columns_4+Columns_5)+(Columns_6+Columns_7)))+(((Columns_8+Columns_9)+(Columns...918
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 166488 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16199956 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is Sudoku-COL-AN04, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r485-tall-167912698800027"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-COL-AN04.tgz
mv Sudoku-COL-AN04 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 ;