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.r487-tall-167912702500051.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 lolaxred
Input is Sudoku-COL-AN07, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r487-tall-167912702500051
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 7.0K Feb 26 08:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 26 08:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 08:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 08:45 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.6K Feb 25 17:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 26 09:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 178K Feb 26 09:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Feb 26 08:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 26 08:52 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-AN07-LTLCardinality-00
FORMULA_NAME Sudoku-COL-AN07-LTLCardinality-01
FORMULA_NAME Sudoku-COL-AN07-LTLCardinality-02
FORMULA_NAME Sudoku-COL-AN07-LTLCardinality-03
FORMULA_NAME Sudoku-COL-AN07-LTLCardinality-04
FORMULA_NAME Sudoku-COL-AN07-LTLCardinality-05
FORMULA_NAME Sudoku-COL-AN07-LTLCardinality-06
FORMULA_NAME Sudoku-COL-AN07-LTLCardinality-07
FORMULA_NAME Sudoku-COL-AN07-LTLCardinality-08
FORMULA_NAME Sudoku-COL-AN07-LTLCardinality-09
FORMULA_NAME Sudoku-COL-AN07-LTLCardinality-10
FORMULA_NAME Sudoku-COL-AN07-LTLCardinality-11
FORMULA_NAME Sudoku-COL-AN07-LTLCardinality-12
FORMULA_NAME Sudoku-COL-AN07-LTLCardinality-13
FORMULA_NAME Sudoku-COL-AN07-LTLCardinality-14
FORMULA_NAME Sudoku-COL-AN07-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679159231060

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=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-COL-AN07
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-18 17:07:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-18 17:07:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 17:07:12] [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 17:07:12] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-18 17:07:13] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 625 ms
[2023-03-18 17:07:13] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 490 PT places and 343.0 transition bindings in 9 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2023-03-18 17:07:13] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 215 ms.
[2023-03-18 17:07:13] [INFO ] Skeletonized 16 HLPN properties in 7 ms.
Initial state reduction rules removed 3 formulas.
FORMULA Sudoku-COL-AN07-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN07-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN07-LTLCardinality-13 FALSE 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 13 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 10046 steps, including 196 resets, run finished after 71 ms. (steps per millisecond=141 ) properties (out of 18) seen :12
Incomplete Best-First random walk after 10046 steps, including 196 resets, run finished after 28 ms. (steps per millisecond=358 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10046 steps, including 196 resets, run finished after 27 ms. (steps per millisecond=372 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10046 steps, including 196 resets, run finished after 27 ms. (steps per millisecond=372 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10046 steps, including 196 resets, run finished after 25 ms. (steps per millisecond=401 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10046 steps, including 196 resets, run finished after 24 ms. (steps per millisecond=418 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10046 steps, including 196 resets, run finished after 23 ms. (steps per millisecond=436 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1 rows 4 cols
[2023-03-18 17:07:13] [INFO ] Computed 3 place invariants in 5 ms
[2023-03-18 17:07:13] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-18 17:07:13] [INFO ] After 108ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:5
[2023-03-18 17:07:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-18 17:07:14] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :2
[2023-03-18 17:07:14] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :2
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-18 17:07:14] [INFO ] After 49ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :2
Fused 6 Parikh solutions to 2 different solutions.
Finished Parikh walk after 48 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=24 )
Parikh walk visited 2 properties in 2 ms.
Successfully simplified 4 atomic propositions for a total of 13 simplifications.
FORMULA Sudoku-COL-AN07-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 17:07:14] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2023-03-18 17:07:14] [INFO ] Flatten gal took : 17 ms
FORMULA Sudoku-COL-AN07-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 17:07:14] [INFO ] Flatten gal took : 2 ms
Domain [N(7), N(7)] of place Rows breaks symmetries in sort N
[2023-03-18 17:07:14] [INFO ] Unfolded HLPN to a Petri net with 490 places and 343 transitions 1372 arcs in 15 ms.
[2023-03-18 17:07:14] [INFO ] Unfolded 11 HLPN properties in 1 ms.
Support contains 490 out of 490 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 10 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
// Phase 1: matrix 343 rows 490 cols
[2023-03-18 17:07:14] [INFO ] Computed 147 place invariants in 19 ms
[2023-03-18 17:07:14] [INFO ] Implicit Places using invariants in 162 ms returned []
[2023-03-18 17:07:14] [INFO ] Invariant cache hit.
[2023-03-18 17:07:14] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 388 ms to find 0 implicit places.
[2023-03-18 17:07:14] [INFO ] Invariant cache hit.
[2023-03-18 17:07:14] [INFO ] Dead Transitions using invariants and state equation in 228 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 627 ms. Remains : 490/490 places, 343/343 transitions.
Support contains 490 out of 490 places after structural reductions.
[2023-03-18 17:07:14] [INFO ] Flatten gal took : 47 ms
[2023-03-18 17:07:15] [INFO ] Flatten gal took : 37 ms
[2023-03-18 17:07:15] [INFO ] Input system was already deterministic with 343 transitions.
Incomplete random walk after 10000 steps, including 235 resets, run finished after 588 ms. (steps per millisecond=17 ) properties (out of 16) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-18 17:07:15] [INFO ] Invariant cache hit.
[2023-03-18 17:07:16] [INFO ] After 142ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-18 17:07:16] [INFO ] [Nat]Absence check using 147 positive place invariants in 27 ms returned sat
[2023-03-18 17:07:17] [INFO ] After 902ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :3
[2023-03-18 17:07:18] [INFO ] After 1760ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :3
Attempting to minimize the solution found.
Minimization took 681 ms.
[2023-03-18 17:07:18] [INFO ] After 2645ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :3
Fused 6 Parikh solutions to 3 different solutions.
Finished Parikh walk after 49 steps, including 0 resets, run visited all 3 properties in 8 ms. (steps per millisecond=6 )
Parikh walk visited 3 properties in 9 ms.
Successfully simplified 3 atomic propositions for a total of 11 simplifications.
Computed a total of 490 stabilizing places and 343 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 490 transition count 343
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G((p0&&F(p1)))))))'
Support contains 441 out of 490 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 7 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2023-03-18 17:07:19] [INFO ] Invariant cache hit.
[2023-03-18 17:07:19] [INFO ] Implicit Places using invariants in 132 ms returned []
[2023-03-18 17:07:19] [INFO ] Invariant cache hit.
[2023-03-18 17:07:19] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 397 ms to find 0 implicit places.
[2023-03-18 17:07:19] [INFO ] Invariant cache hit.
[2023-03-18 17:07:19] [INFO ] Dead Transitions using invariants and state equation in 204 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 608 ms. Remains : 490/490 places, 343/343 transitions.
Stuttering acceptance computed with spot in 371 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : Sudoku-COL-AN07-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(GT (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 25 steps with 0 reset in 10 ms.
FORMULA Sudoku-COL-AN07-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN07-LTLCardinality-01 finished in 1050 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 392 out of 490 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 24 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2023-03-18 17:07:20] [INFO ] Invariant cache hit.
[2023-03-18 17:07:20] [INFO ] Implicit Places using invariants in 167 ms returned []
[2023-03-18 17:07:20] [INFO ] Invariant cache hit.
[2023-03-18 17:07:20] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 489 ms to find 0 implicit places.
[2023-03-18 17:07:20] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-18 17:07:20] [INFO ] Invariant cache hit.
[2023-03-18 17:07:20] [INFO ] Dead Transitions using invariants and state equation in 180 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 729 ms. Remains : 490/490 places, 343/343 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN07-LTLCardinality-02 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 (ADD s392 s393 s394 s395 s396 s397 s398 s399 s400 s401 s402 s403 s404 s405 s406 s407 s408 s409 s410 s411 s412 s413 s414 s415 s416 s417 s418 s419 s...], 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 explored 100000 steps with 3846 reset in 3742 ms.
Product exploration explored 100000 steps with 3846 reset in 3714 ms.
Computed a total of 490 stabilizing places and 343 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 490 transition count 343
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 157 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Finished random walk after 25 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=12 )
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 148 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 179 ms :[(NOT p0), (NOT p0)]
[2023-03-18 17:07:30] [INFO ] Invariant cache hit.
[2023-03-18 17:07:30] [INFO ] [Real]Absence check using 147 positive place invariants in 36 ms returned sat
[2023-03-18 17:07:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 17:07:31] [INFO ] [Real]Absence check using state equation in 202 ms returned sat
[2023-03-18 17:07:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 17:07:32] [INFO ] [Nat]Absence check using 147 positive place invariants in 226 ms returned sat
[2023-03-18 17:07:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 17:07:32] [INFO ] [Nat]Absence check using state equation in 569 ms returned sat
[2023-03-18 17:07:32] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 15 ms.
[2023-03-18 17:07:32] [INFO ] Added : 0 causal constraints over 0 iterations in 59 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 392 out of 490 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 20 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2023-03-18 17:07:32] [INFO ] Invariant cache hit.
[2023-03-18 17:07:32] [INFO ] Implicit Places using invariants in 155 ms returned []
[2023-03-18 17:07:32] [INFO ] Invariant cache hit.
[2023-03-18 17:07:33] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 475 ms to find 0 implicit places.
[2023-03-18 17:07:33] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-18 17:07:33] [INFO ] Invariant cache hit.
[2023-03-18 17:07:33] [INFO ] Dead Transitions using invariants and state equation in 181 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 688 ms. Remains : 490/490 places, 343/343 transitions.
Computed a total of 490 stabilizing places and 343 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 490 transition count 343
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 143 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Finished random walk after 25 steps, including 0 resets, run visited all 1 properties in 3 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 145 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0)]
[2023-03-18 17:07:35] [INFO ] Invariant cache hit.
[2023-03-18 17:07:35] [INFO ] [Real]Absence check using 147 positive place invariants in 41 ms returned sat
[2023-03-18 17:07:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 17:07:36] [INFO ] [Real]Absence check using state equation in 210 ms returned sat
[2023-03-18 17:07:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 17:07:37] [INFO ] [Nat]Absence check using 147 positive place invariants in 230 ms returned sat
[2023-03-18 17:07:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 17:07:37] [INFO ] [Nat]Absence check using state equation in 543 ms returned sat
[2023-03-18 17:07:37] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 14 ms.
[2023-03-18 17:07:37] [INFO ] Added : 0 causal constraints over 0 iterations in 55 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3846 reset in 3660 ms.
Product exploration explored 100000 steps with 3846 reset in 3714 ms.
Support contains 392 out of 490 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 9 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2023-03-18 17:07:45] [INFO ] Invariant cache hit.
[2023-03-18 17:07:45] [INFO ] Implicit Places using invariants in 170 ms returned []
[2023-03-18 17:07:45] [INFO ] Invariant cache hit.
[2023-03-18 17:07:45] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 463 ms to find 0 implicit places.
[2023-03-18 17:07:45] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-18 17:07:45] [INFO ] Invariant cache hit.
[2023-03-18 17:07:45] [INFO ] Dead Transitions using invariants and state equation in 183 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 678 ms. Remains : 490/490 places, 343/343 transitions.
Treatment of property Sudoku-COL-AN07-LTLCardinality-02 finished in 25810 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 49 out of 490 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Graph (complete) has 1029 edges and 490 vertex of which 147 are kept as prefixes of interest. Removing 343 places using SCC suffix rule.3 ms
Discarding 343 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 14 ms. Remains 147 /490 variables (removed 343) and now considering 343/343 (removed 0) transitions.
// Phase 1: matrix 343 rows 147 cols
[2023-03-18 17:07:46] [INFO ] Computed 20 place invariants in 15 ms
[2023-03-18 17:07:46] [INFO ] Implicit Places using invariants in 106 ms returned []
[2023-03-18 17:07:46] [INFO ] Invariant cache hit.
[2023-03-18 17:07:46] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
[2023-03-18 17:07:46] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-18 17:07:46] [INFO ] Invariant cache hit.
[2023-03-18 17:07:46] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 147/490 places, 343/343 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 438 ms. Remains : 147/490 places, 343/343 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN07-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 (ADD s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s77 s78 s79 s80 s81 s82 s83...], 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 2349 reset in 2036 ms.
Product exploration explored 100000 steps with 2349 reset in 2068 ms.
Computed a total of 147 stabilizing places and 343 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 147 transition count 343
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 : []
Knowledge based reduction with 4 factoid took 150 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 26 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 235 resets, run finished after 206 ms. (steps per millisecond=48 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1255190 steps, run timeout after 3001 ms. (steps per millisecond=418 ) properties seen :{}
Probabilistic random walk after 1255190 steps, saw 187532 distinct states, run finished after 3002 ms. (steps per millisecond=418 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 17:07:54] [INFO ] Invariant cache hit.
[2023-03-18 17:07:54] [INFO ] [Real]Absence check using 0 positive and 20 generalized place invariants in 7 ms returned sat
[2023-03-18 17:07:54] [INFO ] After 552ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 17:07:54] [INFO ] [Nat]Absence check using 0 positive and 20 generalized place invariants in 7 ms returned sat
[2023-03-18 17:07:55] [INFO ] After 242ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 17:07:55] [INFO ] After 361ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 136 ms.
[2023-03-18 17:07:55] [INFO ] After 541ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 49 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=16 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 146 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 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Support contains 49 out of 147 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 147/147 places, 343/343 transitions.
Applied a total of 0 rules in 10 ms. Remains 147 /147 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2023-03-18 17:07:55] [INFO ] Invariant cache hit.
[2023-03-18 17:07:55] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-18 17:07:55] [INFO ] Invariant cache hit.
[2023-03-18 17:07:56] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
[2023-03-18 17:07:56] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 17:07:56] [INFO ] Invariant cache hit.
[2023-03-18 17:07:56] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 423 ms. Remains : 147/147 places, 343/343 transitions.
Computed a total of 147 stabilizing places and 343 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 147 transition count 343
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 : []
Knowledge based reduction with 4 factoid took 154 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 35 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 233 resets, run finished after 198 ms. (steps per millisecond=50 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1280572 steps, run timeout after 3001 ms. (steps per millisecond=426 ) properties seen :{}
Probabilistic random walk after 1280572 steps, saw 192204 distinct states, run finished after 3001 ms. (steps per millisecond=426 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 17:07:59] [INFO ] Invariant cache hit.
[2023-03-18 17:08:00] [INFO ] [Real]Absence check using 0 positive and 20 generalized place invariants in 8 ms returned sat
[2023-03-18 17:08:00] [INFO ] After 557ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 17:08:00] [INFO ] [Nat]Absence check using 0 positive and 20 generalized place invariants in 7 ms returned sat
[2023-03-18 17:08:00] [INFO ] After 260ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 17:08:00] [INFO ] After 383ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 145 ms.
[2023-03-18 17:08:01] [INFO ] After 571ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 49 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=16 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
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 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2345 reset in 2034 ms.
Stuttering criterion allowed to conclude after 89218 steps with 2094 reset in 1829 ms.
FORMULA Sudoku-COL-AN07-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN07-LTLCardinality-03 finished in 19272 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&F(p1)&&X(F(!p0)))))'
Support contains 392 out of 490 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 16 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
// Phase 1: matrix 343 rows 490 cols
[2023-03-18 17:08:05] [INFO ] Computed 147 place invariants in 9 ms
[2023-03-18 17:08:05] [INFO ] Implicit Places using invariants in 165 ms returned []
[2023-03-18 17:08:05] [INFO ] Invariant cache hit.
[2023-03-18 17:08:05] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 450 ms to find 0 implicit places.
[2023-03-18 17:08:05] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-18 17:08:05] [INFO ] Invariant cache hit.
[2023-03-18 17:08:05] [INFO ] Dead Transitions using invariants and state equation in 186 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 666 ms. Remains : 490/490 places, 343/343 transitions.
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p1), p0]
Running random walk in product with property : Sudoku-COL-AN07-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(GT (ADD s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s77 s78 s79 s80 s81 s82 s83 s8...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 40 steps with 0 reset in 4 ms.
FORMULA Sudoku-COL-AN07-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN07-LTLCardinality-04 finished in 809 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(!p0))))'
Support contains 392 out of 490 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 6 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2023-03-18 17:08:06] [INFO ] Invariant cache hit.
[2023-03-18 17:08:06] [INFO ] Implicit Places using invariants in 169 ms returned []
[2023-03-18 17:08:06] [INFO ] Invariant cache hit.
[2023-03-18 17:08:06] [INFO ] Implicit Places using invariants and state equation in 317 ms returned []
Implicit Place search using SMT with State Equation took 487 ms to find 0 implicit places.
[2023-03-18 17:08:06] [INFO ] Invariant cache hit.
[2023-03-18 17:08:06] [INFO ] Dead Transitions using invariants and state equation in 186 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 680 ms. Remains : 490/490 places, 343/343 transitions.
Stuttering acceptance computed with spot in 125 ms :[true, p0, p0, p0]
Running random walk in product with property : Sudoku-COL-AN07-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(GT (ADD s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s77 s78 s79 s80 s81 s82 s83 s8...], 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, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 25 steps with 0 reset in 2 ms.
FORMULA Sudoku-COL-AN07-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN07-LTLCardinality-05 finished in 824 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))&&F(p1)))'
Support contains 441 out of 490 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 5 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2023-03-18 17:08:06] [INFO ] Invariant cache hit.
[2023-03-18 17:08:07] [INFO ] Implicit Places using invariants in 132 ms returned []
[2023-03-18 17:08:07] [INFO ] Invariant cache hit.
[2023-03-18 17:08:07] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 385 ms to find 0 implicit places.
[2023-03-18 17:08:07] [INFO ] Invariant cache hit.
[2023-03-18 17:08:07] [INFO ] Dead Transitions using invariants and state equation in 176 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 568 ms. Remains : 490/490 places, 343/343 transitions.
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-COL-AN07-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(GT 3 (ADD s392 s393 s394 s395 s396 s397 s398 s399 s400 s401 s402 s403 s404 s405 s406 s407 s408 s409 s410 s411 s412 s413 s414 s415 s416 s417 s418 s419 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Sudoku-COL-AN07-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN07-LTLCardinality-07 finished in 727 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 343 out of 490 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 14 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2023-03-18 17:08:07] [INFO ] Invariant cache hit.
[2023-03-18 17:08:07] [INFO ] Implicit Places using invariants in 188 ms returned []
[2023-03-18 17:08:07] [INFO ] Invariant cache hit.
[2023-03-18 17:08:08] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 527 ms to find 0 implicit places.
[2023-03-18 17:08:08] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-18 17:08:08] [INFO ] Invariant cache hit.
[2023-03-18 17:08:08] [INFO ] Dead Transitions using invariants and state equation in 194 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 742 ms. Remains : 490/490 places, 343/343 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN07-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 3 (ADD s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s77 s78 s79 s80 s81 s82 s83 ...], 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 42 steps with 0 reset in 4 ms.
FORMULA Sudoku-COL-AN07-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN07-LTLCardinality-09 finished in 797 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(X(F(p0)))))'
Support contains 343 out of 490 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 6 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2023-03-18 17:08:08] [INFO ] Invariant cache hit.
[2023-03-18 17:08:08] [INFO ] Implicit Places using invariants in 214 ms returned []
[2023-03-18 17:08:08] [INFO ] Invariant cache hit.
[2023-03-18 17:08:09] [INFO ] Implicit Places using invariants and state equation in 384 ms returned []
Implicit Place search using SMT with State Equation took 600 ms to find 0 implicit places.
[2023-03-18 17:08:09] [INFO ] Invariant cache hit.
[2023-03-18 17:08:09] [INFO ] Dead Transitions using invariants and state equation in 189 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 798 ms. Remains : 490/490 places, 343/343 transitions.
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN07-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(LEQ 2 (ADD s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s77 s78 s79 s80 s81 s82 s83...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 4066 ms.
Product exploration explored 100000 steps with 25000 reset in 4017 ms.
Computed a total of 490 stabilizing places and 343 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 490 transition count 343
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), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 124 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2023-03-18 17:08:18] [INFO ] Invariant cache hit.
[2023-03-18 17:08:19] [INFO ] [Real]Absence check using 147 positive place invariants in 35 ms returned sat
[2023-03-18 17:08:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 17:08:19] [INFO ] [Real]Absence check using state equation in 170 ms returned sat
[2023-03-18 17:08:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 17:08:20] [INFO ] [Nat]Absence check using 147 positive place invariants in 46 ms returned sat
[2023-03-18 17:08:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 17:08:20] [INFO ] [Nat]Absence check using state equation in 365 ms returned sat
[2023-03-18 17:08:20] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 15 ms.
[2023-03-18 17:08:20] [INFO ] Added : 0 causal constraints over 0 iterations in 50 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 343 out of 490 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 8 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2023-03-18 17:08:20] [INFO ] Invariant cache hit.
[2023-03-18 17:08:20] [INFO ] Implicit Places using invariants in 198 ms returned []
[2023-03-18 17:08:20] [INFO ] Invariant cache hit.
[2023-03-18 17:08:21] [INFO ] Implicit Places using invariants and state equation in 355 ms returned []
Implicit Place search using SMT with State Equation took 554 ms to find 0 implicit places.
[2023-03-18 17:08:21] [INFO ] Invariant cache hit.
[2023-03-18 17:08:21] [INFO ] Dead Transitions using invariants and state equation in 176 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 739 ms. Remains : 490/490 places, 343/343 transitions.
Computed a total of 490 stabilizing places and 343 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 490 transition count 343
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), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 278 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(NOT p0), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 128 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2023-03-18 17:08:22] [INFO ] Invariant cache hit.
[2023-03-18 17:08:23] [INFO ] [Real]Absence check using 147 positive place invariants in 35 ms returned sat
[2023-03-18 17:08:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 17:08:23] [INFO ] [Real]Absence check using state equation in 173 ms returned sat
[2023-03-18 17:08:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 17:08:23] [INFO ] [Nat]Absence check using 147 positive place invariants in 43 ms returned sat
[2023-03-18 17:08:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 17:08:24] [INFO ] [Nat]Absence check using state equation in 354 ms returned sat
[2023-03-18 17:08:24] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 20 ms.
[2023-03-18 17:08:24] [INFO ] Added : 0 causal constraints over 0 iterations in 54 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 4180 ms.
Product exploration explored 100000 steps with 25000 reset in 4232 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 343 out of 490 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 31 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2023-03-18 17:08:33] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 17:08:33] [INFO ] Invariant cache hit.
[2023-03-18 17:08:33] [INFO ] Dead Transitions using invariants and state equation in 182 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 228 ms. Remains : 490/490 places, 343/343 transitions.
Support contains 343 out of 490 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 6 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2023-03-18 17:08:33] [INFO ] Invariant cache hit.
[2023-03-18 17:08:33] [INFO ] Implicit Places using invariants in 202 ms returned []
[2023-03-18 17:08:33] [INFO ] Invariant cache hit.
[2023-03-18 17:08:34] [INFO ] Implicit Places using invariants and state equation in 365 ms returned []
Implicit Place search using SMT with State Equation took 571 ms to find 0 implicit places.
[2023-03-18 17:08:34] [INFO ] Invariant cache hit.
[2023-03-18 17:08:34] [INFO ] Dead Transitions using invariants and state equation in 169 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 746 ms. Remains : 490/490 places, 343/343 transitions.
Treatment of property Sudoku-COL-AN07-LTLCardinality-10 finished in 25861 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)&&F((G(F(p2))||(G(!p1)&&F(p2)))))))'
Support contains 441 out of 490 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 4 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2023-03-18 17:08:34] [INFO ] Invariant cache hit.
[2023-03-18 17:08:34] [INFO ] Implicit Places using invariants in 108 ms returned []
[2023-03-18 17:08:34] [INFO ] Invariant cache hit.
[2023-03-18 17:08:34] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
[2023-03-18 17:08:34] [INFO ] Invariant cache hit.
[2023-03-18 17:08:34] [INFO ] Dead Transitions using invariants and state equation in 185 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 541 ms. Remains : 490/490 places, 343/343 transitions.
Stuttering acceptance computed with spot in 148 ms :[p1, (OR (NOT p2) p1), (OR (NOT p0) (NOT p2) p1), (OR (NOT p2) (NOT p0) p1), true]
Running random walk in product with property : Sudoku-COL-AN07-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p1) p2), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 4}], [{ cond=(AND p0 (NOT p1) p2), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(OR (NOT p0) p1), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(LEQ 2 (ADD s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s77 s78 s79 s80 s81 s82 s83...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA Sudoku-COL-AN07-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN07-LTLCardinality-11 finished in 716 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 49 out of 490 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Graph (complete) has 1029 edges and 490 vertex of which 147 are kept as prefixes of interest. Removing 343 places using SCC suffix rule.2 ms
Discarding 343 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 9 ms. Remains 147 /490 variables (removed 343) and now considering 343/343 (removed 0) transitions.
// Phase 1: matrix 343 rows 147 cols
[2023-03-18 17:08:34] [INFO ] Computed 20 place invariants in 15 ms
[2023-03-18 17:08:35] [INFO ] Implicit Places using invariants in 98 ms returned []
[2023-03-18 17:08:35] [INFO ] Invariant cache hit.
[2023-03-18 17:08:35] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
[2023-03-18 17:08:35] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-18 17:08:35] [INFO ] Invariant cache hit.
[2023-03-18 17:08:35] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 147/490 places, 343/343 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 439 ms. Remains : 147/490 places, 343/343 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN07-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 3 (ADD s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s77 s78 s79 s80 s81 s82 s83 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 42 steps with 0 reset in 2 ms.
FORMULA Sudoku-COL-AN07-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN07-LTLCardinality-12 finished in 483 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)&&F(G(p1)))))'
Support contains 441 out of 490 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 7 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
// Phase 1: matrix 343 rows 490 cols
[2023-03-18 17:08:35] [INFO ] Computed 147 place invariants in 6 ms
[2023-03-18 17:08:35] [INFO ] Implicit Places using invariants in 121 ms returned []
[2023-03-18 17:08:35] [INFO ] Invariant cache hit.
[2023-03-18 17:08:35] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 353 ms to find 0 implicit places.
[2023-03-18 17:08:35] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-18 17:08:35] [INFO ] Invariant cache hit.
[2023-03-18 17:08:35] [INFO ] Dead Transitions using invariants and state equation in 164 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 537 ms. Remains : 490/490 places, 343/343 transitions.
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Sudoku-COL-AN07-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT 1 (ADD s441 s442 s443 s444 s445 s446 s447 s448 s449 s450 s451 s452 s453 s454 s455 s456 s457 s458 s459 s460 s461 s462 s463 s464 s465 s466 s467 s468 ...], 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 41 steps with 0 reset in 1 ms.
FORMULA Sudoku-COL-AN07-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN07-LTLCardinality-15 finished in 655 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)))'
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(X(F(p0)))))'
Found a Shortening insensitive property : Sudoku-COL-AN07-LTLCardinality-10
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 343 out of 490 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 12 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2023-03-18 17:08:36] [INFO ] Invariant cache hit.
[2023-03-18 17:08:36] [INFO ] Implicit Places using invariants in 188 ms returned []
[2023-03-18 17:08:36] [INFO ] Invariant cache hit.
[2023-03-18 17:08:36] [INFO ] Implicit Places using invariants and state equation in 334 ms returned []
Implicit Place search using SMT with State Equation took 524 ms to find 0 implicit places.
[2023-03-18 17:08:36] [INFO ] Invariant cache hit.
[2023-03-18 17:08:37] [INFO ] Dead Transitions using invariants and state equation in 185 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 723 ms. Remains : 490/490 places, 343/343 transitions.
Running random walk in product with property : Sudoku-COL-AN07-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(LEQ 2 (ADD s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s77 s78 s79 s80 s81 s82 s83...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 4084 ms.
Product exploration explored 100000 steps with 25000 reset in 4145 ms.
Computed a total of 490 stabilizing places and 343 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 490 transition count 343
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), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 125 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 134 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2023-03-18 17:08:46] [INFO ] Invariant cache hit.
[2023-03-18 17:08:47] [INFO ] [Real]Absence check using 147 positive place invariants in 33 ms returned sat
[2023-03-18 17:08:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 17:08:47] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2023-03-18 17:08:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 17:08:47] [INFO ] [Nat]Absence check using 147 positive place invariants in 42 ms returned sat
[2023-03-18 17:08:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 17:08:48] [INFO ] [Nat]Absence check using state equation in 352 ms returned sat
[2023-03-18 17:08:48] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 16 ms.
[2023-03-18 17:08:48] [INFO ] Added : 0 causal constraints over 0 iterations in 49 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 343 out of 490 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 6 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2023-03-18 17:08:48] [INFO ] Invariant cache hit.
[2023-03-18 17:08:48] [INFO ] Implicit Places using invariants in 185 ms returned []
[2023-03-18 17:08:48] [INFO ] Invariant cache hit.
[2023-03-18 17:08:48] [INFO ] Implicit Places using invariants and state equation in 328 ms returned []
Implicit Place search using SMT with State Equation took 515 ms to find 0 implicit places.
[2023-03-18 17:08:48] [INFO ] Invariant cache hit.
[2023-03-18 17:08:49] [INFO ] Dead Transitions using invariants and state equation in 166 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 688 ms. Remains : 490/490 places, 343/343 transitions.
Computed a total of 490 stabilizing places and 343 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 490 transition count 343
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), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(NOT p0), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 152 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2023-03-18 17:08:50] [INFO ] Invariant cache hit.
[2023-03-18 17:08:50] [INFO ] [Real]Absence check using 147 positive place invariants in 33 ms returned sat
[2023-03-18 17:08:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 17:08:50] [INFO ] [Real]Absence check using state equation in 167 ms returned sat
[2023-03-18 17:08:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 17:08:51] [INFO ] [Nat]Absence check using 147 positive place invariants in 42 ms returned sat
[2023-03-18 17:08:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 17:08:51] [INFO ] [Nat]Absence check using state equation in 319 ms returned sat
[2023-03-18 17:08:51] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 16 ms.
[2023-03-18 17:08:51] [INFO ] Added : 0 causal constraints over 0 iterations in 48 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 4103 ms.
Product exploration explored 100000 steps with 25000 reset in 4128 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 343 out of 490 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 11 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2023-03-18 17:09:00] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-18 17:09:00] [INFO ] Invariant cache hit.
[2023-03-18 17:09:00] [INFO ] Dead Transitions using invariants and state equation in 166 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 185 ms. Remains : 490/490 places, 343/343 transitions.
Support contains 343 out of 490 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 7 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2023-03-18 17:09:00] [INFO ] Invariant cache hit.
[2023-03-18 17:09:00] [INFO ] Implicit Places using invariants in 188 ms returned []
[2023-03-18 17:09:00] [INFO ] Invariant cache hit.
[2023-03-18 17:09:01] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 519 ms to find 0 implicit places.
[2023-03-18 17:09:01] [INFO ] Invariant cache hit.
[2023-03-18 17:09:01] [INFO ] Dead Transitions using invariants and state equation in 180 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 706 ms. Remains : 490/490 places, 343/343 transitions.
Treatment of property Sudoku-COL-AN07-LTLCardinality-10 finished in 25275 ms.
[2023-03-18 17:09:01] [INFO ] Flatten gal took : 29 ms
[2023-03-18 17:09:01] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-18 17:09:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 490 places, 343 transitions and 1372 arcs took 3 ms.
Total runtime 108991 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT Sudoku-COL-AN07
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLCardinality

BK_STOP 1679159423163

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/LTLCardinality.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: LAUNCH task # 1 (type EXCL) for 0 Sudoku-COL-AN07-LTLCardinality-02
lola: time limit : 1800 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN07-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN07-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/1800 6/32 Sudoku-COL-AN07-LTLCardinality-02 606127 m, 121225 m/sec, 1778753 t fired, .

Time elapsed: 5 secs. Pages in use: 6
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN07-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN07-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/1800 11/32 Sudoku-COL-AN07-LTLCardinality-02 1171974 m, 113169 m/sec, 3630637 t fired, .

Time elapsed: 10 secs. Pages in use: 11
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN07-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN07-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/1800 16/32 Sudoku-COL-AN07-LTLCardinality-02 1672038 m, 100012 m/sec, 5492087 t fired, .

Time elapsed: 15 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN07-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN07-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/1800 20/32 Sudoku-COL-AN07-LTLCardinality-02 2110838 m, 87760 m/sec, 7459706 t fired, .

Time elapsed: 20 secs. Pages in use: 20
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN07-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN07-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/1800 22/32 Sudoku-COL-AN07-LTLCardinality-02 2419569 m, 61746 m/sec, 9426472 t fired, .

Time elapsed: 25 secs. Pages in use: 22
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN07-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN07-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/1800 26/32 Sudoku-COL-AN07-LTLCardinality-02 2859285 m, 87943 m/sec, 10766767 t fired, .

Time elapsed: 30 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN07-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN07-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/1800 30/32 Sudoku-COL-AN07-LTLCardinality-02 3310315 m, 90206 m/sec, 12188456 t fired, .

Time elapsed: 35 secs. Pages in use: 30
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 1 (type EXCL) for Sudoku-COL-AN07-LTLCardinality-02 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN07-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN07-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 40 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: LAUNCH task # 4 (type EXCL) for 3 Sudoku-COL-AN07-LTLCardinality-10
lola: time limit : 3560 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN07-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN07-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/3560 5/32 Sudoku-COL-AN07-LTLCardinality-10 560524 m, 112104 m/sec, 1107887 t fired, .

Time elapsed: 45 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN07-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN07-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/3560 9/32 Sudoku-COL-AN07-LTLCardinality-10 1094665 m, 106828 m/sec, 2213771 t fired, .

Time elapsed: 50 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN07-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN07-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 15/3560 13/32 Sudoku-COL-AN07-LTLCardinality-10 1622893 m, 105645 m/sec, 3355105 t fired, .

Time elapsed: 55 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN07-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN07-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 20/3560 17/32 Sudoku-COL-AN07-LTLCardinality-10 2151834 m, 105788 m/sec, 4525545 t fired, .

Time elapsed: 60 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN07-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN07-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 25/3560 22/32 Sudoku-COL-AN07-LTLCardinality-10 2670560 m, 103745 m/sec, 5764586 t fired, .

Time elapsed: 65 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN07-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN07-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 30/3560 26/32 Sudoku-COL-AN07-LTLCardinality-10 3180186 m, 101925 m/sec, 7044200 t fired, .

Time elapsed: 70 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN07-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN07-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 35/3560 30/32 Sudoku-COL-AN07-LTLCardinality-10 3678589 m, 99680 m/sec, 8353382 t fired, .

Time elapsed: 75 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 4 (type EXCL) for Sudoku-COL-AN07-LTLCardinality-10 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN07-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN07-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 80 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: Portfolio finished: no open tasks 2

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN07-LTLCardinality-02: LTL unknown AGGR
Sudoku-COL-AN07-LTLCardinality-10: LTL unknown AGGR


Time elapsed: 80 secs. Pages in use: 32

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-AN07"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is Sudoku-COL-AN07, 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 r487-tall-167912702500051"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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