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-167912702800259.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-PT-AN13, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r487-tall-167912702800259
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 58M
-rw-r--r-- 1 mcc users 806K Feb 26 09:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 3.6M Feb 26 09:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6M Feb 26 08:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 13M Feb 26 08:46 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 399K Feb 25 17:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 1.3M Feb 25 17:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 934K Feb 25 17:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 3.3M Feb 25 17:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.2M Feb 26 10:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 5.5M Feb 26 10:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.3M Feb 26 09:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21M Feb 26 09:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 49K Feb 25 17:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 120K Feb 25 17:17 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.2M Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679179670303

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-PT-AN13
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-18 22:47:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-18 22:47:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 22:47:52] [INFO ] Load time of PNML (sax parser for PT used): 153 ms
[2023-03-18 22:47:52] [INFO ] Transformed 2704 places.
[2023-03-18 22:47:52] [INFO ] Transformed 2197 transitions.
[2023-03-18 22:47:52] [INFO ] Parsed PT model containing 2704 places and 2197 transitions and 8788 arcs in 231 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 152 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA Sudoku-PT-AN13-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN13-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN13-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 2704 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 28 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 2704 cols
[2023-03-18 22:47:52] [INFO ] Computed 507 place invariants in 41 ms
[2023-03-18 22:47:53] [INFO ] Implicit Places using invariants in 568 ms returned []
[2023-03-18 22:47:53] [INFO ] Invariant cache hit.
[2023-03-18 22:47:54] [INFO ] Implicit Places using invariants and state equation in 1564 ms returned []
Implicit Place search using SMT with State Equation took 2153 ms to find 0 implicit places.
[2023-03-18 22:47:54] [INFO ] Invariant cache hit.
[2023-03-18 22:47:56] [INFO ] Dead Transitions using invariants and state equation in 1343 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3530 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Support contains 2704 out of 2704 places after structural reductions.
[2023-03-18 22:47:56] [INFO ] Flatten gal took : 211 ms
[2023-03-18 22:47:56] [INFO ] Flatten gal took : 134 ms
[2023-03-18 22:47:56] [INFO ] Input system was already deterministic with 2197 transitions.
Incomplete random walk after 10000 steps, including 67 resets, run finished after 2147 ms. (steps per millisecond=4 ) properties (out of 26) seen :9
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 17) seen :0
Running SMT prover for 17 properties.
[2023-03-18 22:47:59] [INFO ] Invariant cache hit.
[2023-03-18 22:48:00] [INFO ] [Real]Absence check using 507 positive place invariants in 124 ms returned sat
[2023-03-18 22:48:02] [INFO ] After 2919ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:16
[2023-03-18 22:48:03] [INFO ] [Nat]Absence check using 507 positive place invariants in 129 ms returned sat
[2023-03-18 22:48:27] [INFO ] After 16834ms SMT Verify possible using state equation in natural domain returned unsat :9 sat :7
[2023-03-18 22:48:27] [INFO ] After 16840ms SMT Verify possible using trap constraints in natural domain returned unsat :9 sat :7
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-18 22:48:27] [INFO ] After 25035ms SMT Verify possible using all constraints in natural domain returned unsat :9 sat :7
Fused 17 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 507 out of 2704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Graph (complete) has 6591 edges and 2704 vertex of which 507 are kept as prefixes of interest. Removing 2197 places using SCC suffix rule.6 ms
Discarding 2197 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 49 ms. Remains 507 /2704 variables (removed 2197) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 507/2704 places, 2197/2197 transitions.
Incomplete random walk after 10000 steps, including 67 resets, run finished after 1951 ms. (steps per millisecond=5 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 8) seen :0
Probabilistic random walk after 117212 steps, saw 117124 distinct states, run finished after 6010 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 2197 rows 507 cols
[2023-03-18 22:48:36] [INFO ] Computed 38 place invariants in 103 ms
[2023-03-18 22:48:37] [INFO ] [Real]Absence check using 0 positive and 38 generalized place invariants in 29 ms returned sat
[2023-03-18 22:49:02] [INFO ] After 24768ms SMT Verify possible using state equation in real domain returned unsat :0 sat :7
[2023-03-18 22:49:02] [INFO ] After 24775ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-18 22:49:02] [INFO ] After 25026ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :7
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 15 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 507/507 places, 2197/2197 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 13 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-18 22:49:02] [INFO ] Invariant cache hit.
[2023-03-18 22:49:02] [INFO ] Implicit Places using invariants in 91 ms returned []
[2023-03-18 22:49:02] [INFO ] Invariant cache hit.
[2023-03-18 22:49:02] [INFO ] Implicit Places using invariants and state equation in 570 ms returned []
Implicit Place search using SMT with State Equation took 663 ms to find 0 implicit places.
[2023-03-18 22:49:02] [INFO ] Redundant transitions in 117 ms returned []
[2023-03-18 22:49:02] [INFO ] Invariant cache hit.
[2023-03-18 22:49:03] [INFO ] Dead Transitions using invariants and state equation in 659 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1462 ms. Remains : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 11 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
Running SMT prover for 8 properties.
[2023-03-18 22:49:03] [INFO ] Invariant cache hit.
[2023-03-18 22:49:04] [INFO ] [Real]Absence check using 0 positive and 38 generalized place invariants in 32 ms returned sat
[2023-03-18 22:49:06] [INFO ] After 2781ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-18 22:49:06] [INFO ] [Nat]Absence check using 0 positive and 38 generalized place invariants in 27 ms returned sat
[2023-03-18 22:49:08] [INFO ] After 1747ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-18 22:49:09] [INFO ] After 2387ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 330 ms.
[2023-03-18 22:49:09] [INFO ] After 2929ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Successfully simplified 9 atomic propositions for a total of 13 simplifications.
FORMULA Sudoku-PT-AN13-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN13-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN13-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2704 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2704 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 169 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Reduce places removed 2197 places and 0 transitions.
Iterating post reduction 0 with 2197 rules applied. Total rules applied 2197 place count 507 transition count 2197
Applied a total of 2197 rules in 82 ms. Remains 507 /2704 variables (removed 2197) and now considering 2197/2197 (removed 0) transitions.
[2023-03-18 22:49:09] [INFO ] Invariant cache hit.
[2023-03-18 22:49:10] [INFO ] Implicit Places using invariants in 375 ms returned []
[2023-03-18 22:49:10] [INFO ] Invariant cache hit.
[2023-03-18 22:49:12] [INFO ] Implicit Places using invariants and state equation in 2004 ms returned []
Implicit Place search using SMT with State Equation took 2381 ms to find 0 implicit places.
[2023-03-18 22:49:12] [INFO ] Invariant cache hit.
[2023-03-18 22:49:12] [INFO ] Dead Transitions using invariants and state equation in 643 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 507/2704 places, 2197/2197 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3109 ms. Remains : 507/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 199 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN13-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT 2 (ADD s169 s170 s171 s172 s173 s174 s175 s176 s177 s178 s179 s180 s181 s182 s183 s184 s185 s186 s187 s188 s189 s190 s191 s192 s193 s194 s195 s196 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 4 ms.
FORMULA Sudoku-PT-AN13-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN13-LTLCardinality-00 finished in 3374 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 2197 out of 2704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 196 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 2704 cols
[2023-03-18 22:49:13] [INFO ] Computed 507 place invariants in 13 ms
[2023-03-18 22:49:14] [INFO ] Implicit Places using invariants in 1209 ms returned []
[2023-03-18 22:49:14] [INFO ] Invariant cache hit.
[2023-03-18 22:49:17] [INFO ] Implicit Places using invariants and state equation in 3301 ms returned []
Implicit Place search using SMT with State Equation took 4512 ms to find 0 implicit places.
[2023-03-18 22:49:17] [INFO ] Redundant transitions in 101 ms returned []
[2023-03-18 22:49:17] [INFO ] Invariant cache hit.
[2023-03-18 22:49:19] [INFO ] Dead Transitions using invariants and state equation in 1299 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6119 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN13-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:(GT 1 (ADD s169 s170 s171 s172 s173 s174 s175 s176 s177 s178 s179 s180 s181 s182 s183 s184 s185 s186 s187 s188 s189 s190 s191 s192 s193 s194 s195 s196 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 149 steps with 0 reset in 44 ms.
FORMULA Sudoku-PT-AN13-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN13-LTLCardinality-02 finished in 6256 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(p1)))))'
Support contains 169 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Reduce places removed 2197 places and 0 transitions.
Iterating post reduction 0 with 2197 rules applied. Total rules applied 2197 place count 507 transition count 2197
Applied a total of 2197 rules in 30 ms. Remains 507 /2704 variables (removed 2197) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 507 cols
[2023-03-18 22:49:19] [INFO ] Computed 38 place invariants in 68 ms
[2023-03-18 22:49:19] [INFO ] Implicit Places using invariants in 461 ms returned []
[2023-03-18 22:49:19] [INFO ] Invariant cache hit.
[2023-03-18 22:49:26] [INFO ] Implicit Places using invariants and state equation in 6828 ms returned []
Implicit Place search using SMT with State Equation took 7293 ms to find 0 implicit places.
[2023-03-18 22:49:26] [INFO ] Invariant cache hit.
[2023-03-18 22:49:27] [INFO ] Dead Transitions using invariants and state equation in 687 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 507/2704 places, 2197/2197 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8011 ms. Remains : 507/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 551 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-PT-AN13-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(LEQ 1 (ADD s338 s339 s340 s341 s342 s343 s344 s345 s346 s347 s348 s349 s350 s351 s352 s353 s354 s355 s356 s357 s358 s359 s360 s361 s362 s363 s364 s365...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration timeout after 75880 steps with 511 reset in 10003 ms.
Product exploration timeout after 75350 steps with 508 reset in 10002 ms.
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 215 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 67 resets, run finished after 1466 ms. (steps per millisecond=6 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 2) seen :0
Probabilistic random walk after 114225 steps, saw 114139 distinct states, run finished after 3010 ms. (steps per millisecond=37 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-18 22:49:53] [INFO ] Invariant cache hit.
[2023-03-18 22:49:53] [INFO ] [Real]Absence check using 0 positive and 38 generalized place invariants in 27 ms returned sat
[2023-03-18 22:49:57] [INFO ] After 3589ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-18 22:49:57] [INFO ] [Nat]Absence check using 0 positive and 38 generalized place invariants in 25 ms returned sat
[2023-03-18 22:50:00] [INFO ] After 3227ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-18 22:50:00] [INFO ] After 3316ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 48 ms.
[2023-03-18 22:50:00] [INFO ] After 3472ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 167 steps, including 0 resets, run visited all 1 properties in 11 ms. (steps per millisecond=15 )
Parikh walk visited 1 properties in 15 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p0))))]
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p1) (NOT p0))))
Knowledge based reduction with 6 factoid took 191 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN13-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN13-LTLCardinality-03 finished in 41413 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(p0)&&X((F(p2)||p1))))'
Support contains 169 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Reduce places removed 2197 places and 0 transitions.
Iterating post reduction 0 with 2197 rules applied. Total rules applied 2197 place count 507 transition count 2197
Applied a total of 2197 rules in 24 ms. Remains 507 /2704 variables (removed 2197) and now considering 2197/2197 (removed 0) transitions.
[2023-03-18 22:50:00] [INFO ] Invariant cache hit.
[2023-03-18 22:50:01] [INFO ] Implicit Places using invariants in 352 ms returned []
[2023-03-18 22:50:01] [INFO ] Invariant cache hit.
[2023-03-18 22:50:03] [INFO ] Implicit Places using invariants and state equation in 2466 ms returned []
Implicit Place search using SMT with State Equation took 2821 ms to find 0 implicit places.
[2023-03-18 22:50:03] [INFO ] Invariant cache hit.
[2023-03-18 22:50:04] [INFO ] Dead Transitions using invariants and state equation in 618 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 507/2704 places, 2197/2197 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3465 ms. Remains : 507/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 252 ms :[(NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p2)), true, (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : Sudoku-PT-AN13-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(OR (AND p0 p1) (AND p0 p2)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 p2), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 1}, { cond=(NOT p0), acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(LEQ 1 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s...], 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]]
Product exploration timeout after 77660 steps with 523 reset in 10001 ms.
Product exploration timeout after 77650 steps with 523 reset in 10002 ms.
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X p0), (X (OR (AND p0 p1) (AND p0 p2))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 1586 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 60 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 67 resets, run finished after 1266 ms. (steps per millisecond=7 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 220252 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :{}
Probabilistic random walk after 220252 steps, saw 215738 distinct states, run finished after 3002 ms. (steps per millisecond=73 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 22:50:31] [INFO ] Invariant cache hit.
[2023-03-18 22:50:31] [INFO ] [Real]Absence check using 0 positive and 38 generalized place invariants in 26 ms returned sat
[2023-03-18 22:50:33] [INFO ] After 2276ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 22:50:33] [INFO ] [Nat]Absence check using 0 positive and 38 generalized place invariants in 26 ms returned sat
[2023-03-18 22:50:34] [INFO ] After 1439ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 22:50:34] [INFO ] After 1509ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 40 ms.
[2023-03-18 22:50:34] [INFO ] After 1654ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 169 steps, including 0 resets, run visited all 1 properties in 9 ms. (steps per millisecond=18 )
Parikh walk visited 1 properties in 9 ms.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X p0), (X (OR (AND p0 p1) (AND p0 p2))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 7 factoid took 380 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Support contains 169 out of 507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 25 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-18 22:50:35] [INFO ] Invariant cache hit.
[2023-03-18 22:50:35] [INFO ] Implicit Places using invariants in 357 ms returned []
[2023-03-18 22:50:35] [INFO ] Invariant cache hit.
[2023-03-18 22:50:37] [INFO ] Implicit Places using invariants and state equation in 2100 ms returned []
Implicit Place search using SMT with State Equation took 2459 ms to find 0 implicit places.
[2023-03-18 22:50:37] [INFO ] Invariant cache hit.
[2023-03-18 22:50:38] [INFO ] Dead Transitions using invariants and state equation in 681 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3165 ms. Remains : 507/507 places, 2197/2197 transitions.
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 67 resets, run finished after 1314 ms. (steps per millisecond=7 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 219308 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :{}
Probabilistic random walk after 219308 steps, saw 215526 distinct states, run finished after 3001 ms. (steps per millisecond=73 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 22:50:43] [INFO ] Invariant cache hit.
[2023-03-18 22:50:43] [INFO ] [Real]Absence check using 0 positive and 38 generalized place invariants in 26 ms returned sat
[2023-03-18 22:50:46] [INFO ] After 2349ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 22:50:46] [INFO ] [Nat]Absence check using 0 positive and 38 generalized place invariants in 26 ms returned sat
[2023-03-18 22:50:47] [INFO ] After 1413ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 22:50:47] [INFO ] After 1497ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 48 ms.
[2023-03-18 22:50:47] [INFO ] After 1647ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 169 steps, including 0 resets, run visited all 1 properties in 9 ms. (steps per millisecond=18 )
Parikh walk visited 1 properties in 8 ms.
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 132 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p0), (NOT p0)]
Product exploration timeout after 77590 steps with 522 reset in 10001 ms.
Product exploration timeout after 77250 steps with 521 reset in 10003 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Support contains 169 out of 507 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 108 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-18 22:51:08] [INFO ] Redundant transitions in 48 ms returned []
[2023-03-18 22:51:08] [INFO ] Invariant cache hit.
[2023-03-18 22:51:09] [INFO ] Dead Transitions using invariants and state equation in 648 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 821 ms. Remains : 507/507 places, 2197/2197 transitions.
Support contains 169 out of 507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 28 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-18 22:51:09] [INFO ] Invariant cache hit.
[2023-03-18 22:51:09] [INFO ] Implicit Places using invariants in 361 ms returned []
[2023-03-18 22:51:09] [INFO ] Invariant cache hit.
[2023-03-18 22:51:11] [INFO ] Implicit Places using invariants and state equation in 2044 ms returned []
Implicit Place search using SMT with State Equation took 2407 ms to find 0 implicit places.
[2023-03-18 22:51:11] [INFO ] Invariant cache hit.
[2023-03-18 22:51:12] [INFO ] Dead Transitions using invariants and state equation in 623 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3059 ms. Remains : 507/507 places, 2197/2197 transitions.
Treatment of property Sudoku-PT-AN13-LTLCardinality-04 finished in 71712 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)||G(p1)))))'
Support contains 2535 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 13 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 2704 cols
[2023-03-18 22:51:12] [INFO ] Computed 507 place invariants in 12 ms
[2023-03-18 22:51:13] [INFO ] Implicit Places using invariants in 718 ms returned []
[2023-03-18 22:51:13] [INFO ] Invariant cache hit.
[2023-03-18 22:51:15] [INFO ] Implicit Places using invariants and state equation in 2310 ms returned []
Implicit Place search using SMT with State Equation took 3030 ms to find 0 implicit places.
[2023-03-18 22:51:15] [INFO ] Invariant cache hit.
[2023-03-18 22:51:16] [INFO ] Dead Transitions using invariants and state equation in 1184 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4229 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 165 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-PT-AN13-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 2}]], initial=4, aps=[p1:(GT (ADD s169 s170 s171 s172 s173 s174 s175 s176 s177 s178 s179 s180 s181 s182 s183 s184 s185 s186 s187 s188 s189 s190 s191 s192 s193 s194 s195 s196 s1...], 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, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA Sudoku-PT-AN13-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN13-LTLCardinality-05 finished in 4424 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 U X(p1)))))'
Support contains 2366 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 24 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-18 22:51:16] [INFO ] Invariant cache hit.
[2023-03-18 22:51:18] [INFO ] Implicit Places using invariants in 1024 ms returned []
[2023-03-18 22:51:18] [INFO ] Invariant cache hit.
[2023-03-18 22:51:20] [INFO ] Implicit Places using invariants and state equation in 2732 ms returned []
Implicit Place search using SMT with State Equation took 3758 ms to find 0 implicit places.
[2023-03-18 22:51:20] [INFO ] Invariant cache hit.
[2023-03-18 22:51:22] [INFO ] Dead Transitions using invariants and state equation in 1279 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5063 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN13-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}, { cond=p0, acceptance={0} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT 2 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s3...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 38450 steps with 441 reset in 10002 ms.
Product exploration timeout after 37770 steps with 434 reset in 10002 ms.
Computed a total of 2704 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2704 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 200 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[(NOT p1), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 67 resets, run finished after 1474 ms. (steps per millisecond=6 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 636 ms. (steps per millisecond=15 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-18 22:51:45] [INFO ] Invariant cache hit.
[2023-03-18 22:51:46] [INFO ] [Real]Absence check using 507 positive place invariants in 134 ms returned sat
[2023-03-18 22:52:10] [INFO ] After 25022ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 22:52:11] [INFO ] [Nat]Absence check using 507 positive place invariants in 129 ms returned sat
[2023-03-18 22:52:26] [INFO ] After 15729ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 169 out of 2704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Graph (complete) has 6591 edges and 2704 vertex of which 507 are kept as prefixes of interest. Removing 2197 places using SCC suffix rule.4 ms
Discarding 2197 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 33 ms. Remains 507 /2704 variables (removed 2197) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 507/2704 places, 2197/2197 transitions.
Incomplete random walk after 10000 steps, including 67 resets, run finished after 1307 ms. (steps per millisecond=7 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 216837 steps, run timeout after 3001 ms. (steps per millisecond=72 ) properties seen :{}
Probabilistic random walk after 216837 steps, saw 215095 distinct states, run finished after 3001 ms. (steps per millisecond=72 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2197 rows 507 cols
[2023-03-18 22:52:31] [INFO ] Computed 38 place invariants in 56 ms
[2023-03-18 22:52:31] [INFO ] [Real]Absence check using 0 positive and 38 generalized place invariants in 27 ms returned sat
[2023-03-18 22:52:33] [INFO ] After 2635ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 22:52:33] [INFO ] [Nat]Absence check using 0 positive and 38 generalized place invariants in 25 ms returned sat
[2023-03-18 22:52:35] [INFO ] After 1484ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 22:52:35] [INFO ] After 1564ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 40 ms.
[2023-03-18 22:52:35] [INFO ] After 1705ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 168 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=21 )
Parikh walk visited 1 properties in 8 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F p0), (F (OR p0 p1)), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 347 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p1), (NOT p1)]
// Phase 1: matrix 2197 rows 2704 cols
[2023-03-18 22:52:36] [INFO ] Computed 507 place invariants in 8 ms
Could not prove EG (NOT p1)
Support contains 2366 out of 2704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 39 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-18 22:52:51] [INFO ] Invariant cache hit.
[2023-03-18 22:52:52] [INFO ] Implicit Places using invariants in 936 ms returned []
[2023-03-18 22:52:52] [INFO ] Invariant cache hit.
[2023-03-18 22:52:55] [INFO ] Implicit Places using invariants and state equation in 2579 ms returned []
Implicit Place search using SMT with State Equation took 3517 ms to find 0 implicit places.
[2023-03-18 22:52:55] [INFO ] Redundant transitions in 50 ms returned []
[2023-03-18 22:52:55] [INFO ] Invariant cache hit.
[2023-03-18 22:52:56] [INFO ] Dead Transitions using invariants and state equation in 1221 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4834 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Computed a total of 2704 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2704 transition count 2197
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 p1), (X (NOT p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 2 states, 4 edges and 1 AP (stutter insensitive) to 2 states, 4 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p1), (NOT p1)]
Finished random walk after 85 steps, including 0 resets, run visited all 1 properties in 25 ms. (steps per millisecond=3 )
Knowledge obtained : [(NOT p1), (X (NOT p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 2 states, 4 edges and 1 AP (stutter insensitive) to 2 states, 4 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p1), (NOT p1)]
[2023-03-18 22:52:58] [INFO ] Invariant cache hit.
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 57 ms :[(NOT p1), (NOT p1)]
Product exploration timeout after 28920 steps with 328 reset in 10003 ms.
Product exploration timeout after 29490 steps with 335 reset in 10001 ms.
Support contains 2366 out of 2704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 39 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-18 22:53:33] [INFO ] Invariant cache hit.
[2023-03-18 22:53:34] [INFO ] Implicit Places using invariants in 923 ms returned []
[2023-03-18 22:53:34] [INFO ] Invariant cache hit.
[2023-03-18 22:53:37] [INFO ] Implicit Places using invariants and state equation in 2675 ms returned []
Implicit Place search using SMT with State Equation took 3601 ms to find 0 implicit places.
[2023-03-18 22:53:37] [INFO ] Redundant transitions in 49 ms returned []
[2023-03-18 22:53:37] [INFO ] Invariant cache hit.
[2023-03-18 22:53:38] [INFO ] Dead Transitions using invariants and state equation in 1225 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4922 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Treatment of property Sudoku-PT-AN13-LTLCardinality-06 finished in 141666 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Reduce places removed 2196 places and 0 transitions.
Iterating post reduction 0 with 2196 rules applied. Total rules applied 2196 place count 508 transition count 2197
Applied a total of 2196 rules in 63 ms. Remains 508 /2704 variables (removed 2196) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 508 cols
[2023-03-18 22:53:38] [INFO ] Computed 38 place invariants in 88 ms
[2023-03-18 22:53:39] [INFO ] Implicit Places using invariants in 569 ms returned []
[2023-03-18 22:53:39] [INFO ] Invariant cache hit.
[2023-03-18 22:53:41] [INFO ] Implicit Places using invariants and state equation in 1809 ms returned []
Implicit Place search using SMT with State Equation took 2382 ms to find 0 implicit places.
[2023-03-18 22:53:41] [INFO ] Invariant cache hit.
[2023-03-18 22:53:41] [INFO ] Dead Transitions using invariants and state equation in 605 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 508/2704 places, 2197/2197 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3052 ms. Remains : 508/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN13-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s383 s169)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 1870 steps with 24 reset in 335 ms.
FORMULA Sudoku-PT-AN13-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN13-LTLCardinality-09 finished in 3481 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' '!((p0||F(G(p1))))'
Support contains 4 out of 2704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Graph (complete) has 6591 edges and 2704 vertex of which 508 are kept as prefixes of interest. Removing 2196 places using SCC suffix rule.4 ms
Discarding 2196 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 56 ms. Remains 508 /2704 variables (removed 2196) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 508 cols
[2023-03-18 22:53:42] [INFO ] Computed 38 place invariants in 142 ms
[2023-03-18 22:53:42] [INFO ] Implicit Places using invariants in 610 ms returned []
[2023-03-18 22:53:42] [INFO ] Invariant cache hit.
[2023-03-18 22:53:44] [INFO ] Implicit Places using invariants and state equation in 2191 ms returned []
Implicit Place search using SMT with State Equation took 2807 ms to find 0 implicit places.
[2023-03-18 22:53:45] [INFO ] Redundant transitions in 52 ms returned []
[2023-03-18 22:53:45] [INFO ] Invariant cache hit.
[2023-03-18 22:53:45] [INFO ] Dead Transitions using invariants and state equation in 601 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 508/2704 places, 2197/2197 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3525 ms. Remains : 508/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN13-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s185 s169), p1:(LEQ s205 s431)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1940 steps with 12 reset in 241 ms.
FORMULA Sudoku-PT-AN13-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN13-LTLCardinality-11 finished in 3851 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 5 out of 2704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Graph (complete) has 6591 edges and 2704 vertex of which 508 are kept as prefixes of interest. Removing 2196 places using SCC suffix rule.5 ms
Discarding 2196 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 57 ms. Remains 508 /2704 variables (removed 2196) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 508 cols
[2023-03-18 22:53:46] [INFO ] Computed 38 place invariants in 62 ms
[2023-03-18 22:53:46] [INFO ] Implicit Places using invariants in 534 ms returned []
[2023-03-18 22:53:46] [INFO ] Invariant cache hit.
[2023-03-18 22:53:48] [INFO ] Implicit Places using invariants and state equation in 1612 ms returned []
Implicit Place search using SMT with State Equation took 2149 ms to find 0 implicit places.
[2023-03-18 22:53:48] [INFO ] Redundant transitions in 51 ms returned []
[2023-03-18 22:53:48] [INFO ] Invariant cache hit.
[2023-03-18 22:53:48] [INFO ] Dead Transitions using invariants and state equation in 616 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 508/2704 places, 2197/2197 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2876 ms. Remains : 508/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-PT-AN13-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LEQ s370 s169) (LEQ s123 s474)), p1:(OR (LEQ 1 s13) (GT s123 s474))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration timeout after 82090 steps with 553 reset in 10001 ms.
Product exploration timeout after 80800 steps with 544 reset in 10001 ms.
Computed a total of 508 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 508 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 4 factoid took 272 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 67 resets, run finished after 1259 ms. (steps per millisecond=7 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 22:54:10] [INFO ] Invariant cache hit.
[2023-03-18 22:54:10] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (F (NOT (AND p0 p1))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1))]
Property proved to be true thanks to knowledge :(F (OR (G p0) (G (NOT p0))))
Knowledge based reduction with 5 factoid took 303 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN13-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN13-LTLCardinality-13 finished in 25306 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 2 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Reduce places removed 2196 places and 0 transitions.
Iterating post reduction 0 with 2196 rules applied. Total rules applied 2196 place count 508 transition count 2197
Applied a total of 2196 rules in 48 ms. Remains 508 /2704 variables (removed 2196) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 508 cols
[2023-03-18 22:54:11] [INFO ] Computed 38 place invariants in 96 ms
[2023-03-18 22:54:11] [INFO ] Implicit Places using invariants in 563 ms returned []
[2023-03-18 22:54:11] [INFO ] Invariant cache hit.
[2023-03-18 22:54:13] [INFO ] Implicit Places using invariants and state equation in 1658 ms returned []
Implicit Place search using SMT with State Equation took 2223 ms to find 0 implicit places.
[2023-03-18 22:54:13] [INFO ] Invariant cache hit.
[2023-03-18 22:54:14] [INFO ] Dead Transitions using invariants and state equation in 607 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 508/2704 places, 2197/2197 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2878 ms. Remains : 508/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN13-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ s122 s169)], 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 2 steps with 0 reset in 4 ms.
FORMULA Sudoku-PT-AN13-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN13-LTLCardinality-14 finished in 2991 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(p0)&&X((F(p2)||p1))))'
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 U X(p1)))))'
Found a Lengthening insensitive property : Sudoku-PT-AN13-LTLCardinality-06
Stuttering acceptance computed with spot in 104 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 2366 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 42 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 2704 cols
[2023-03-18 22:54:14] [INFO ] Computed 507 place invariants in 7 ms
[2023-03-18 22:54:15] [INFO ] Implicit Places using invariants in 979 ms returned []
[2023-03-18 22:54:15] [INFO ] Invariant cache hit.
[2023-03-18 22:54:18] [INFO ] Implicit Places using invariants and state equation in 2783 ms returned []
Implicit Place search using SMT with State Equation took 3764 ms to find 0 implicit places.
[2023-03-18 22:54:18] [INFO ] Invariant cache hit.
[2023-03-18 22:54:19] [INFO ] Dead Transitions using invariants and state equation in 1240 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 5048 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Running random walk in product with property : Sudoku-PT-AN13-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}, { cond=p0, acceptance={0} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT 2 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s3...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 38620 steps with 443 reset in 10002 ms.
Product exploration timeout after 38450 steps with 442 reset in 10003 ms.
Computed a total of 2704 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2704 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 217 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p1), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 67 resets, run finished after 1481 ms. (steps per millisecond=6 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 551 ms. (steps per millisecond=18 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-18 22:54:42] [INFO ] Invariant cache hit.
[2023-03-18 22:54:43] [INFO ] [Real]Absence check using 507 positive place invariants in 122 ms returned sat
[2023-03-18 22:55:08] [INFO ] After 25018ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 22:55:08] [INFO ] [Nat]Absence check using 507 positive place invariants in 124 ms returned sat
[2023-03-18 22:55:23] [INFO ] After 14875ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 169 out of 2704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Graph (complete) has 6591 edges and 2704 vertex of which 507 are kept as prefixes of interest. Removing 2197 places using SCC suffix rule.68 ms
Discarding 2197 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 95 ms. Remains 507 /2704 variables (removed 2197) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 507/2704 places, 2197/2197 transitions.
Incomplete random walk after 10000 steps, including 67 resets, run finished after 1275 ms. (steps per millisecond=7 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 217560 steps, run timeout after 3001 ms. (steps per millisecond=72 ) properties seen :{}
Probabilistic random walk after 217560 steps, saw 215245 distinct states, run finished after 3001 ms. (steps per millisecond=72 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2197 rows 507 cols
[2023-03-18 22:55:27] [INFO ] Computed 38 place invariants in 66 ms
[2023-03-18 22:55:27] [INFO ] [Real]Absence check using 0 positive and 38 generalized place invariants in 27 ms returned sat
[2023-03-18 22:55:30] [INFO ] After 2806ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 22:55:30] [INFO ] [Nat]Absence check using 0 positive and 38 generalized place invariants in 27 ms returned sat
[2023-03-18 22:55:32] [INFO ] After 1551ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 22:55:32] [INFO ] After 1632ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 42 ms.
[2023-03-18 22:55:32] [INFO ] After 1780ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 168 steps, including 0 resets, run visited all 1 properties in 19 ms. (steps per millisecond=8 )
Parikh walk visited 1 properties in 19 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F p0), (F (OR p0 p1)), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 307 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p1), (NOT p1)]
// Phase 1: matrix 2197 rows 2704 cols
[2023-03-18 22:55:33] [INFO ] Computed 507 place invariants in 16 ms
Could not prove EG (NOT p1)
Support contains 2366 out of 2704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 32 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-18 22:55:48] [INFO ] Invariant cache hit.
[2023-03-18 22:55:49] [INFO ] Implicit Places using invariants in 934 ms returned []
[2023-03-18 22:55:49] [INFO ] Invariant cache hit.
[2023-03-18 22:55:52] [INFO ] Implicit Places using invariants and state equation in 2598 ms returned []
Implicit Place search using SMT with State Equation took 3534 ms to find 0 implicit places.
[2023-03-18 22:55:52] [INFO ] Redundant transitions in 46 ms returned []
[2023-03-18 22:55:52] [INFO ] Invariant cache hit.
[2023-03-18 22:55:53] [INFO ] Dead Transitions using invariants and state equation in 1216 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4838 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Computed a total of 2704 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2704 transition count 2197
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 p1), (X (NOT p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 2 states, 4 edges and 1 AP (stutter insensitive) to 2 states, 4 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (NOT p1)]
Finished random walk after 85 steps, including 0 resets, run visited all 1 properties in 24 ms. (steps per millisecond=3 )
Knowledge obtained : [(NOT p1), (X (NOT p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 117 ms. Reduced automaton from 2 states, 4 edges and 1 AP (stutter insensitive) to 2 states, 4 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p1), (NOT p1)]
[2023-03-18 22:55:55] [INFO ] Invariant cache hit.
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 80 ms :[(NOT p1), (NOT p1)]
Product exploration timeout after 29230 steps with 331 reset in 10001 ms.
Product exploration timeout after 29160 steps with 331 reset in 10001 ms.
Support contains 2366 out of 2704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 44 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-18 22:56:30] [INFO ] Invariant cache hit.
[2023-03-18 22:56:31] [INFO ] Implicit Places using invariants in 982 ms returned []
[2023-03-18 22:56:31] [INFO ] Invariant cache hit.
[2023-03-18 22:56:33] [INFO ] Implicit Places using invariants and state equation in 2751 ms returned []
Implicit Place search using SMT with State Equation took 3737 ms to find 0 implicit places.
[2023-03-18 22:56:33] [INFO ] Redundant transitions in 52 ms returned []
[2023-03-18 22:56:33] [INFO ] Invariant cache hit.
[2023-03-18 22:56:35] [INFO ] Dead Transitions using invariants and state equation in 1335 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5180 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Treatment of property Sudoku-PT-AN13-LTLCardinality-06 finished in 141048 ms.
[2023-03-18 22:56:35] [INFO ] Flatten gal took : 91 ms
[2023-03-18 22:56:35] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-18 22:56:35] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2704 places, 2197 transitions and 8788 arcs took 10 ms.
Total runtime 523564 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT Sudoku-PT-AN13
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/367
LTLCardinality

FORMULA Sudoku-PT-AN13-LTLCardinality-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679180357640

--------------------
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:
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
+ 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/367/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/367/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/367/LTLCardinality.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:535
lola: rewrite Frontend/Parser/formula_rewrite.k:436
lola: rewrite Frontend/Parser/formula_rewrite.k:355
lola: rewrite Frontend/Parser/formula_rewrite.k:352
lola: rewrite Frontend/Parser/formula_rewrite.k:376
lola: rewrite Frontend/Parser/formula_rewrite.k:521
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 12 (type SKEL/FNDP) for 0 Sudoku-PT-AN13-LTLCardinality-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 13 (type SKEL/EQUN) for 0 Sudoku-PT-AN13-LTLCardinality-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 14 (type SKEL/SRCH) for 0 Sudoku-PT-AN13-LTLCardinality-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 15 (type SKEL/SRCH) for 0 Sudoku-PT-AN13-LTLCardinality-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 14 (type SKEL/SRCH) for Sudoku-PT-AN13-LTLCardinality-04
lola: result : true
lola: markings : 170
lola: fired transitions : 169
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 12 (type FNDP) for Sudoku-PT-AN13-LTLCardinality-04 (obsolete)
lola: CANCELED task # 13 (type EQUN) for Sudoku-PT-AN13-LTLCardinality-04 (obsolete)
lola: CANCELED task # 15 (type SRCH) for Sudoku-PT-AN13-LTLCardinality-04 (obsolete)
lola: FINISHED task # 12 (type SKEL/FNDP) for Sudoku-PT-AN13-LTLCardinality-04
lola: result : true
lola: fired transitions : 168
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: Created skeleton in 0.000000 secs.
sara: try reading problem file /home/mcc/execution/367/LTLCardinality-13.sara.
lola: NOTDEADLOCKFREE

lola: FINISHED task # 13 (type SKEL/EQUN) for Sudoku-PT-AN13-LTLCardinality-04
lola: result : true
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: LAUNCH task # 5 (type EXCL) for 0 Sudoku-PT-AN13-LTLCardinality-04
lola: time limit : 1199 sec
lola: memory limit: 32 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 17 (type FNDP) for 0 Sudoku-PT-AN13-LTLCardinality-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 18 (type EQUN) for 0 Sudoku-PT-AN13-LTLCardinality-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 20 (type SRCH) for 0 Sudoku-PT-AN13-LTLCardinality-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 20 (type SRCH) for Sudoku-PT-AN13-LTLCardinality-04
lola: result : unknown
lola: time used : 0.000000
lola: memory pages used : 1
lola: FINISHED task # 5 (type EXCL) for Sudoku-PT-AN13-LTLCardinality-04
lola: result : true
lola: markings : 2198
lola: fired transitions : 2197
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 19 (type EXCL) for 0 Sudoku-PT-AN13-LTLCardinality-04
lola: time limit : 1799 sec
lola: memory limit: 32 pages
sara: try reading problem file /home/mcc/execution/367/LTLCardinality-18.sara.
sara: place or transition ordering is non-deterministic
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN13-LTLCardinality-04: CONJ 0 0 3 0 6 0 0 1
Sudoku-PT-AN13-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
17 EF FNDP 4/3598 0/5 Sudoku-PT-AN13-LTLCardinality-04 70648 t fired, 470 attempts, .
18 EF STEQ 4/3598 0/5 Sudoku-PT-AN13-LTLCardinality-04 sara is running.
19 EF EXCL 4/1799 1/32 Sudoku-PT-AN13-LTLCardinality-04 86472 m, 17294 m/sec, 513677 t fired, .

Time elapsed: 6 secs. Pages in use: 2
# running tasks: 3 of 4 Visible: 2

lola: FINISHED task # 18 (type EQUN) for Sudoku-PT-AN13-LTLCardinality-04
lola: result : true
lola: CANCELED task # 17 (type FNDP) for Sudoku-PT-AN13-LTLCardinality-04 (obsolete)
lola: CANCELED task # 19 (type EXCL) for Sudoku-PT-AN13-LTLCardinality-04 (obsolete)
lola: LAUNCH task # 8 (type EXCL) for 7 Sudoku-PT-AN13-LTLCardinality-06
lola: time limit : 3591 sec
lola: memory limit: 32 pages
lola: FINISHED task # 17 (type FNDP) for Sudoku-PT-AN13-LTLCardinality-04
lola: result : unknown
lola: fired transitions : 115140
lola: tried executions : 766
lola: time used : 7.000000
lola: memory pages used : 0
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-PT-AN13-LTLCardinality-04: CONJ false state equation

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN13-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 2/3591 1/32 Sudoku-PT-AN13-LTLCardinality-06 34850 m, 6970 m/sec, 174286 t fired, .

Time elapsed: 11 secs. Pages in use: 2
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-PT-AN13-LTLCardinality-04: CONJ false state equation

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN13-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 7/3591 3/32 Sudoku-PT-AN13-LTLCardinality-06 97488 m, 12527 m/sec, 578427 t fired, .

Time elapsed: 16 secs. Pages in use: 3
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-PT-AN13-LTLCardinality-04: CONJ false state equation

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN13-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 12/3591 4/32 Sudoku-PT-AN13-LTLCardinality-06 157606 m, 12023 m/sec, 981979 t fired, .

Time elapsed: 21 secs. Pages in use: 4
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-PT-AN13-LTLCardinality-04: CONJ false state equation

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN13-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 17/3591 5/32 Sudoku-PT-AN13-LTLCardinality-06 223124 m, 13103 m/sec, 1384937 t fired, .

Time elapsed: 26 secs. Pages in use: 5
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-PT-AN13-LTLCardinality-04: CONJ false state equation

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN13-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 22/3591 6/32 Sudoku-PT-AN13-LTLCardinality-06 282641 m, 11903 m/sec, 1792888 t fired, .

Time elapsed: 31 secs. Pages in use: 6
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-PT-AN13-LTLCardinality-04: CONJ false state equation

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN13-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 27/3591 7/32 Sudoku-PT-AN13-LTLCardinality-06 344461 m, 12364 m/sec, 2193730 t fired, .

Time elapsed: 36 secs. Pages in use: 7
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-PT-AN13-LTLCardinality-04: CONJ false state equation

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN13-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 32/3591 9/32 Sudoku-PT-AN13-LTLCardinality-06 403768 m, 11861 m/sec, 2603999 t fired, .

Time elapsed: 41 secs. Pages in use: 9
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-PT-AN13-LTLCardinality-04: CONJ false state equation

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN13-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 37/3591 9/32 Sudoku-PT-AN13-LTLCardinality-06 449676 m, 9181 m/sec, 3024993 t fired, .

Time elapsed: 46 secs. Pages in use: 9
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-PT-AN13-LTLCardinality-04: CONJ false state equation

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN13-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 42/3591 10/32 Sudoku-PT-AN13-LTLCardinality-06 493953 m, 8855 m/sec, 3444826 t fired, .

Time elapsed: 51 secs. Pages in use: 10
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-PT-AN13-LTLCardinality-04: CONJ false state equation

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN13-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 47/3591 12/32 Sudoku-PT-AN13-LTLCardinality-06 559356 m, 13080 m/sec, 3845229 t fired, .

Time elapsed: 56 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-PT-AN13-LTLCardinality-04: CONJ false state equation

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN13-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 52/3591 13/32 Sudoku-PT-AN13-LTLCardinality-06 625074 m, 13143 m/sec, 4244988 t fired, .

Time elapsed: 61 secs. Pages in use: 13
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-PT-AN13-LTLCardinality-04: CONJ false state equation

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN13-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 57/3591 14/32 Sudoku-PT-AN13-LTLCardinality-06 687518 m, 12488 m/sec, 4643724 t fired, .

Time elapsed: 66 secs. Pages in use: 14
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-PT-AN13-LTLCardinality-04: CONJ false state equation

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN13-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 62/3591 15/32 Sudoku-PT-AN13-LTLCardinality-06 747678 m, 12032 m/sec, 5042609 t fired, .

Time elapsed: 71 secs. Pages in use: 15
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-PT-AN13-LTLCardinality-04: CONJ false state equation

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN13-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 67/3591 17/32 Sudoku-PT-AN13-LTLCardinality-06 808209 m, 12106 m/sec, 5445863 t fired, .

Time elapsed: 76 secs. Pages in use: 17
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-PT-AN13-LTLCardinality-04: CONJ false state equation

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN13-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 72/3591 18/32 Sudoku-PT-AN13-LTLCardinality-06 865875 m, 11533 m/sec, 5851599 t fired, .

Time elapsed: 81 secs. Pages in use: 18
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-PT-AN13-LTLCardinality-04: CONJ false state equation

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN13-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 77/3591 19/32 Sudoku-PT-AN13-LTLCardinality-06 919844 m, 10793 m/sec, 6261964 t fired, .

Time elapsed: 86 secs. Pages in use: 19
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-PT-AN13-LTLCardinality-04: CONJ false state equation

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN13-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 82/3591 20/32 Sudoku-PT-AN13-LTLCardinality-06 968687 m, 9768 m/sec, 6672888 t fired, .

Time elapsed: 91 secs. Pages in use: 20
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-PT-AN13-LTLCardinality-04: CONJ false state equation

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN13-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 87/3591 20/32 Sudoku-PT-AN13-LTLCardinality-06 1011308 m, 8524 m/sec, 7084461 t fired, .

Time elapsed: 96 secs. Pages in use: 20
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-PT-AN13-LTLCardinality-04: CONJ false state equation

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN13-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 92/3591 21/32 Sudoku-PT-AN13-LTLCardinality-06 1061485 m, 10035 m/sec, 7495651 t fired, .

Time elapsed: 101 secs. Pages in use: 21
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-PT-AN13-LTLCardinality-04: CONJ false state equation

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN13-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 97/3591 22/32 Sudoku-PT-AN13-LTLCardinality-06 1113605 m, 10424 m/sec, 7906307 t fired, .

Time elapsed: 106 secs. Pages in use: 22
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-PT-AN13-LTLCardinality-04: CONJ false state equation

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN13-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 102/3591 23/32 Sudoku-PT-AN13-LTLCardinality-06 1159495 m, 9178 m/sec, 8317917 t fired, .

Time elapsed: 111 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-PT-AN13-LTLCardinality-04: CONJ false state equation

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN13-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 107/3591 24/32 Sudoku-PT-AN13-LTLCardinality-06 1209006 m, 9902 m/sec, 8727269 t fired, .

Time elapsed: 116 secs. Pages in use: 24
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-PT-AN13-LTLCardinality-04: CONJ false state equation

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN13-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 112/3591 25/32 Sudoku-PT-AN13-LTLCardinality-06 1255136 m, 9226 m/sec, 9136864 t fired, .

Time elapsed: 121 secs. Pages in use: 25
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-PT-AN13-LTLCardinality-04: CONJ false state equation

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN13-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 117/3591 26/32 Sudoku-PT-AN13-LTLCardinality-06 1304344 m, 9841 m/sec, 9544373 t fired, .

Time elapsed: 126 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-PT-AN13-LTLCardinality-04: CONJ false state equation

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN13-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 122/3591 27/32 Sudoku-PT-AN13-LTLCardinality-06 1348814 m, 8894 m/sec, 9956094 t fired, .

Time elapsed: 131 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-PT-AN13-LTLCardinality-04: CONJ false state equation

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN13-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 127/3591 28/32 Sudoku-PT-AN13-LTLCardinality-06 1396304 m, 9498 m/sec, 10368813 t fired, .

Time elapsed: 136 secs. Pages in use: 28
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-PT-AN13-LTLCardinality-04: CONJ false state equation

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN13-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 132/3591 29/32 Sudoku-PT-AN13-LTLCardinality-06 1434163 m, 7571 m/sec, 10785670 t fired, .

Time elapsed: 141 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-PT-AN13-LTLCardinality-04: CONJ false state equation

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN13-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 137/3591 30/32 Sudoku-PT-AN13-LTLCardinality-06 1473119 m, 7791 m/sec, 11201182 t fired, .

Time elapsed: 146 secs. Pages in use: 30
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-PT-AN13-LTLCardinality-04: CONJ false state equation

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN13-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 142/3591 31/32 Sudoku-PT-AN13-LTLCardinality-06 1525631 m, 10502 m/sec, 11609006 t fired, .

Time elapsed: 151 secs. Pages in use: 31
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-PT-AN13-LTLCardinality-04: CONJ false state equation

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN13-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 147/3591 32/32 Sudoku-PT-AN13-LTLCardinality-06 1588061 m, 12486 m/sec, 12014244 t fired, .

Time elapsed: 156 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 8 (type EXCL) for Sudoku-PT-AN13-LTLCardinality-06 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-PT-AN13-LTLCardinality-04: CONJ false state equation

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN13-LTLCardinality-06: LTL 0 0 0 0 1 0 1 0

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

Time elapsed: 161 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-PT-AN13-LTLCardinality-04: CONJ false state equation
Sudoku-PT-AN13-LTLCardinality-06: LTL unknown AGGR


Time elapsed: 161 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-PT-AN13"
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-PT-AN13, 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-167912702800259"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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