About the Execution of ITS-Tools for Dekker-PT-050
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1282.584 | 159251.00 | 221634.00 | 1049.10 | TFFTFFFFFFFFFFFF | normal |
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.r133-smll-167819410000027.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is Dekker-PT-050, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r133-smll-167819410000027
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 7.3K Feb 26 01:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 01:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 01:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 01:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 25 15:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 02:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Feb 26 02:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 26 02:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Feb 26 02:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.5M Mar 5 18:22 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 Dekker-PT-050-LTLCardinality-00
FORMULA_NAME Dekker-PT-050-LTLCardinality-01
FORMULA_NAME Dekker-PT-050-LTLCardinality-02
FORMULA_NAME Dekker-PT-050-LTLCardinality-03
FORMULA_NAME Dekker-PT-050-LTLCardinality-04
FORMULA_NAME Dekker-PT-050-LTLCardinality-05
FORMULA_NAME Dekker-PT-050-LTLCardinality-06
FORMULA_NAME Dekker-PT-050-LTLCardinality-07
FORMULA_NAME Dekker-PT-050-LTLCardinality-08
FORMULA_NAME Dekker-PT-050-LTLCardinality-09
FORMULA_NAME Dekker-PT-050-LTLCardinality-10
FORMULA_NAME Dekker-PT-050-LTLCardinality-11
FORMULA_NAME Dekker-PT-050-LTLCardinality-12
FORMULA_NAME Dekker-PT-050-LTLCardinality-13
FORMULA_NAME Dekker-PT-050-LTLCardinality-14
FORMULA_NAME Dekker-PT-050-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678257368994
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Dekker-PT-050
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-08 06:36:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-08 06:36:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 06:36:12] [INFO ] Load time of PNML (sax parser for PT used): 566 ms
[2023-03-08 06:36:12] [INFO ] Transformed 250 places.
[2023-03-08 06:36:12] [INFO ] Transformed 2600 transitions.
[2023-03-08 06:36:12] [INFO ] Found NUPN structural information;
[2023-03-08 06:36:12] [INFO ] Parsed PT model containing 250 places and 2600 transitions and 20100 arcs in 738 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Dekker-PT-050-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 2600/2600 transitions.
Applied a total of 0 rules in 141 ms. Remains 250 /250 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2023-03-08 06:36:13] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 250 cols
[2023-03-08 06:36:13] [INFO ] Computed 150 place invariants in 41 ms
[2023-03-08 06:36:15] [INFO ] Implicit Places using invariants in 2433 ms returned [100, 103, 112, 115, 118, 121, 124, 127, 130, 133, 136, 139, 142, 145, 151, 154, 157, 160, 163, 166, 169, 172, 175, 181, 184, 187, 190, 199, 202, 205, 208, 211, 214, 217, 220, 226, 229, 232, 235, 238, 241, 244, 247]
Discarding 43 places :
Implicit Place search using SMT only with invariants took 2569 ms to find 43 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 207/250 places, 2600/2600 transitions.
Applied a total of 0 rules in 28 ms. Remains 207 /207 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2741 ms. Remains : 207/250 places, 2600/2600 transitions.
Support contains 34 out of 207 places after structural reductions.
[2023-03-08 06:36:16] [INFO ] Flatten gal took : 432 ms
[2023-03-08 06:36:16] [INFO ] Flatten gal took : 249 ms
[2023-03-08 06:36:17] [INFO ] Input system was already deterministic with 2600 transitions.
Support contains 32 out of 207 places (down from 34) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1049 ms. (steps per millisecond=9 ) properties (out of 21) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-08 06:36:18] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 207 cols
[2023-03-08 06:36:18] [INFO ] Computed 107 place invariants in 9 ms
[2023-03-08 06:36:19] [INFO ] [Real]Absence check using 100 positive place invariants in 53 ms returned sat
[2023-03-08 06:36:19] [INFO ] [Real]Absence check using 100 positive and 7 generalized place invariants in 6 ms returned sat
[2023-03-08 06:36:19] [INFO ] After 753ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-08 06:36:19] [INFO ] [Nat]Absence check using 100 positive place invariants in 33 ms returned sat
[2023-03-08 06:36:19] [INFO ] [Nat]Absence check using 100 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-08 06:36:20] [INFO ] After 243ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-08 06:36:20] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-08 06:36:20] [INFO ] After 152ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-08 06:36:20] [INFO ] Deduced a trap composed of 4 places in 236 ms of which 11 ms to minimize.
[2023-03-08 06:36:20] [INFO ] Deduced a trap composed of 4 places in 225 ms of which 1 ms to minimize.
[2023-03-08 06:36:21] [INFO ] Deduced a trap composed of 4 places in 229 ms of which 2 ms to minimize.
[2023-03-08 06:36:21] [INFO ] Deduced a trap composed of 4 places in 315 ms of which 1 ms to minimize.
[2023-03-08 06:36:21] [INFO ] Deduced a trap composed of 4 places in 164 ms of which 2 ms to minimize.
[2023-03-08 06:36:21] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 0 ms to minimize.
[2023-03-08 06:36:21] [INFO ] Deduced a trap composed of 6 places in 102 ms of which 1 ms to minimize.
[2023-03-08 06:36:21] [INFO ] Deduced a trap composed of 4 places in 119 ms of which 1 ms to minimize.
[2023-03-08 06:36:22] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 1 ms to minimize.
[2023-03-08 06:36:22] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 1 ms to minimize.
[2023-03-08 06:36:22] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 1 ms to minimize.
[2023-03-08 06:36:22] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 1 ms to minimize.
[2023-03-08 06:36:22] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 0 ms to minimize.
[2023-03-08 06:36:22] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 1 ms to minimize.
[2023-03-08 06:36:22] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 1 ms to minimize.
[2023-03-08 06:36:22] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 1 ms to minimize.
[2023-03-08 06:36:23] [INFO ] Deduced a trap composed of 4 places in 125 ms of which 1 ms to minimize.
[2023-03-08 06:36:23] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 1 ms to minimize.
[2023-03-08 06:36:23] [INFO ] Trap strengthening procedure interrupted after too many repetitions 2846 ms
[2023-03-08 06:36:23] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2850 ms
[2023-03-08 06:36:23] [INFO ] Deduced a trap composed of 4 places in 224 ms of which 2 ms to minimize.
[2023-03-08 06:36:23] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 1 ms to minimize.
[2023-03-08 06:36:23] [INFO ] Deduced a trap composed of 4 places in 170 ms of which 1 ms to minimize.
[2023-03-08 06:36:23] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 2 ms to minimize.
[2023-03-08 06:36:23] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2023-03-08 06:36:23] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2023-03-08 06:36:24] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2023-03-08 06:36:24] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2023-03-08 06:36:24] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2023-03-08 06:36:24] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2023-03-08 06:36:24] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2023-03-08 06:36:24] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1044 ms
[2023-03-08 06:36:24] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1045 ms
[2023-03-08 06:36:24] [INFO ] After 4197ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 125 ms.
[2023-03-08 06:36:24] [INFO ] After 4848ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 16 ms.
Support contains 9 out of 207 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 2600/2600 transitions.
Applied a total of 0 rules in 176 ms. Remains 207 /207 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 177 ms. Remains : 207/207 places, 2600/2600 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 435 ms. (steps per millisecond=22 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 121278 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :{}
Probabilistic random walk after 121278 steps, saw 101550 distinct states, run finished after 3005 ms. (steps per millisecond=40 ) properties seen :0
Running SMT prover for 7 properties.
[2023-03-08 06:36:28] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-08 06:36:28] [INFO ] Invariant cache hit.
[2023-03-08 06:36:28] [INFO ] [Real]Absence check using 100 positive place invariants in 25 ms returned sat
[2023-03-08 06:36:28] [INFO ] [Real]Absence check using 100 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-08 06:36:28] [INFO ] After 377ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-08 06:36:28] [INFO ] [Nat]Absence check using 100 positive place invariants in 23 ms returned sat
[2023-03-08 06:36:28] [INFO ] [Nat]Absence check using 100 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-08 06:36:29] [INFO ] After 218ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-08 06:36:29] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-08 06:36:29] [INFO ] After 144ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-08 06:36:29] [INFO ] Deduced a trap composed of 4 places in 224 ms of which 1 ms to minimize.
[2023-03-08 06:36:29] [INFO ] Deduced a trap composed of 4 places in 207 ms of which 0 ms to minimize.
[2023-03-08 06:36:29] [INFO ] Deduced a trap composed of 4 places in 203 ms of which 1 ms to minimize.
[2023-03-08 06:36:30] [INFO ] Deduced a trap composed of 4 places in 172 ms of which 2 ms to minimize.
[2023-03-08 06:36:30] [INFO ] Deduced a trap composed of 4 places in 154 ms of which 0 ms to minimize.
[2023-03-08 06:36:30] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 1 ms to minimize.
[2023-03-08 06:36:30] [INFO ] Deduced a trap composed of 4 places in 167 ms of which 1 ms to minimize.
[2023-03-08 06:36:30] [INFO ] Deduced a trap composed of 4 places in 144 ms of which 1 ms to minimize.
[2023-03-08 06:36:30] [INFO ] Deduced a trap composed of 4 places in 134 ms of which 1 ms to minimize.
[2023-03-08 06:36:31] [INFO ] Deduced a trap composed of 4 places in 131 ms of which 1 ms to minimize.
[2023-03-08 06:36:31] [INFO ] Deduced a trap composed of 4 places in 123 ms of which 1 ms to minimize.
[2023-03-08 06:36:31] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1956 ms
[2023-03-08 06:36:31] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1956 ms
[2023-03-08 06:36:31] [INFO ] Deduced a trap composed of 4 places in 171 ms of which 1 ms to minimize.
[2023-03-08 06:36:31] [INFO ] Deduced a trap composed of 4 places in 156 ms of which 1 ms to minimize.
[2023-03-08 06:36:31] [INFO ] Deduced a trap composed of 4 places in 143 ms of which 1 ms to minimize.
[2023-03-08 06:36:31] [INFO ] Deduced a trap composed of 5 places in 146 ms of which 1 ms to minimize.
[2023-03-08 06:36:32] [INFO ] Deduced a trap composed of 4 places in 142 ms of which 1 ms to minimize.
[2023-03-08 06:36:32] [INFO ] Deduced a trap composed of 4 places in 134 ms of which 1 ms to minimize.
[2023-03-08 06:36:32] [INFO ] Deduced a trap composed of 4 places in 135 ms of which 1 ms to minimize.
[2023-03-08 06:36:32] [INFO ] Deduced a trap composed of 4 places in 123 ms of which 0 ms to minimize.
[2023-03-08 06:36:32] [INFO ] Deduced a trap composed of 4 places in 118 ms of which 1 ms to minimize.
[2023-03-08 06:36:32] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 2 ms to minimize.
[2023-03-08 06:36:32] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 1 ms to minimize.
[2023-03-08 06:36:32] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 0 ms to minimize.
[2023-03-08 06:36:33] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 1 ms to minimize.
[2023-03-08 06:36:33] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2023-03-08 06:36:33] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2023-03-08 06:36:33] [INFO ] Trap strengthening procedure interrupted after too many repetitions 2002 ms
[2023-03-08 06:36:33] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2002 ms
[2023-03-08 06:36:33] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2023-03-08 06:36:33] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2023-03-08 06:36:33] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2023-03-08 06:36:33] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2023-03-08 06:36:33] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2023-03-08 06:36:33] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2023-03-08 06:36:33] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2023-03-08 06:36:33] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 2 ms to minimize.
[2023-03-08 06:36:33] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2023-03-08 06:36:33] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 3 ms to minimize.
[2023-03-08 06:36:33] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2023-03-08 06:36:33] [INFO ] Trap strengthening procedure interrupted after too many repetitions 684 ms
[2023-03-08 06:36:33] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 685 ms
[2023-03-08 06:36:34] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2023-03-08 06:36:34] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2023-03-08 06:36:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 127 ms
[2023-03-08 06:36:34] [INFO ] After 5073ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 122 ms.
[2023-03-08 06:36:34] [INFO ] After 5609ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 9 out of 207 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 2600/2600 transitions.
Applied a total of 0 rules in 104 ms. Remains 207 /207 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 207/207 places, 2600/2600 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 2600/2600 transitions.
Applied a total of 0 rules in 117 ms. Remains 207 /207 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2023-03-08 06:36:34] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-08 06:36:34] [INFO ] Invariant cache hit.
[2023-03-08 06:36:35] [INFO ] Implicit Places using invariants in 1009 ms returned [104, 107, 155, 169]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 1015 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 203/207 places, 2600/2600 transitions.
Applied a total of 0 rules in 80 ms. Remains 203 /203 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1214 ms. Remains : 203/207 places, 2600/2600 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 457 ms. (steps per millisecond=21 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 179571 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :{}
Probabilistic random walk after 179571 steps, saw 148791 distinct states, run finished after 3002 ms. (steps per millisecond=59 ) properties seen :0
Running SMT prover for 7 properties.
[2023-03-08 06:36:39] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 203 cols
[2023-03-08 06:36:39] [INFO ] Computed 103 place invariants in 24 ms
[2023-03-08 06:36:39] [INFO ] [Real]Absence check using 100 positive place invariants in 28 ms returned sat
[2023-03-08 06:36:39] [INFO ] [Real]Absence check using 100 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-08 06:36:39] [INFO ] After 448ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-08 06:36:39] [INFO ] [Nat]Absence check using 100 positive place invariants in 19 ms returned sat
[2023-03-08 06:36:39] [INFO ] [Nat]Absence check using 100 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-08 06:36:40] [INFO ] After 242ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-08 06:36:40] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-08 06:36:40] [INFO ] After 145ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-08 06:36:40] [INFO ] Deduced a trap composed of 4 places in 156 ms of which 1 ms to minimize.
[2023-03-08 06:36:40] [INFO ] Deduced a trap composed of 4 places in 154 ms of which 1 ms to minimize.
[2023-03-08 06:36:40] [INFO ] Deduced a trap composed of 4 places in 244 ms of which 1 ms to minimize.
[2023-03-08 06:36:41] [INFO ] Deduced a trap composed of 4 places in 182 ms of which 1 ms to minimize.
[2023-03-08 06:36:41] [INFO ] Deduced a trap composed of 4 places in 175 ms of which 1 ms to minimize.
[2023-03-08 06:36:41] [INFO ] Deduced a trap composed of 4 places in 121 ms of which 1 ms to minimize.
[2023-03-08 06:36:41] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 0 ms to minimize.
[2023-03-08 06:36:41] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 0 ms to minimize.
[2023-03-08 06:36:41] [INFO ] Deduced a trap composed of 4 places in 121 ms of which 1 ms to minimize.
[2023-03-08 06:36:41] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 1 ms to minimize.
[2023-03-08 06:36:42] [INFO ] Deduced a trap composed of 4 places in 137 ms of which 1 ms to minimize.
[2023-03-08 06:36:42] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1825 ms
[2023-03-08 06:36:42] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1825 ms
[2023-03-08 06:36:42] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 1 ms to minimize.
[2023-03-08 06:36:42] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 1 ms to minimize.
[2023-03-08 06:36:42] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 1 ms to minimize.
[2023-03-08 06:36:42] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 1 ms to minimize.
[2023-03-08 06:36:42] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 1 ms to minimize.
[2023-03-08 06:36:42] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 0 ms to minimize.
[2023-03-08 06:36:42] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 1 ms to minimize.
[2023-03-08 06:36:43] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 1 ms to minimize.
[2023-03-08 06:36:43] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 0 ms to minimize.
[2023-03-08 06:36:43] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2023-03-08 06:36:43] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 1 ms to minimize.
[2023-03-08 06:36:43] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1102 ms
[2023-03-08 06:36:43] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1102 ms
[2023-03-08 06:36:43] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 0 ms to minimize.
[2023-03-08 06:36:43] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 1 ms to minimize.
[2023-03-08 06:36:43] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 1 ms to minimize.
[2023-03-08 06:36:43] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 1 ms to minimize.
[2023-03-08 06:36:43] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 0 ms to minimize.
[2023-03-08 06:36:43] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 0 ms to minimize.
[2023-03-08 06:36:44] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 1 ms to minimize.
[2023-03-08 06:36:44] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2023-03-08 06:36:44] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2023-03-08 06:36:44] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2023-03-08 06:36:44] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2023-03-08 06:36:44] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1043 ms
[2023-03-08 06:36:44] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1043 ms
[2023-03-08 06:36:44] [INFO ] After 4258ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 91 ms.
[2023-03-08 06:36:44] [INFO ] After 4766ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 9 out of 203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 2600/2600 transitions.
Applied a total of 0 rules in 117 ms. Remains 203 /203 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118 ms. Remains : 203/203 places, 2600/2600 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 2600/2600 transitions.
Applied a total of 0 rules in 120 ms. Remains 203 /203 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2023-03-08 06:36:44] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-08 06:36:44] [INFO ] Invariant cache hit.
[2023-03-08 06:36:45] [INFO ] Implicit Places using invariants in 979 ms returned []
[2023-03-08 06:36:45] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-08 06:36:45] [INFO ] Invariant cache hit.
[2023-03-08 06:36:45] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-08 06:36:46] [INFO ] Implicit Places using invariants and state equation in 935 ms returned []
Implicit Place search using SMT with State Equation took 1921 ms to find 0 implicit places.
[2023-03-08 06:36:46] [INFO ] Redundant transitions in 306 ms returned []
[2023-03-08 06:36:46] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-08 06:36:46] [INFO ] Invariant cache hit.
[2023-03-08 06:36:49] [INFO ] Dead Transitions using invariants and state equation in 2238 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4595 ms. Remains : 203/203 places, 2600/2600 transitions.
Graph (complete) has 315 edges and 203 vertex of which 39 are kept as prefixes of interest. Removing 164 places using SCC suffix rule.3 ms
Discarding 164 places :
Also discarding 2132 output transitions
Drop transitions removed 2132 transitions
Ensure Unique test removed 3 places
Ensure Unique test removed 432 transitions
Reduce isomorphic transitions removed 432 transitions.
Iterating post reduction 0 with 435 rules applied. Total rules applied 436 place count 36 transition count 36
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 15 rules applied. Total rules applied 451 place count 26 transition count 31
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 456 place count 26 transition count 26
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 459 place count 26 transition count 23
Ensure Unique test removed 3 places
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 468 place count 20 transition count 20
Applied a total of 468 rules in 30 ms. Remains 20 /203 variables (removed 183) and now considering 20/2600 (removed 2580) transitions.
Running SMT prover for 7 properties.
// Phase 1: matrix 20 rows 20 cols
[2023-03-08 06:36:49] [INFO ] Computed 10 place invariants in 0 ms
[2023-03-08 06:36:49] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-08 06:36:49] [INFO ] After 24ms SMT Verify possible using state equation in real domain returned unsat :0 sat :7
[2023-03-08 06:36:49] [INFO ] After 49ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:6
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-08 06:36:49] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-08 06:36:49] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-08 06:36:49] [INFO ] After 25ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-08 06:36:49] [INFO ] After 50ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-08 06:36:49] [INFO ] After 108ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 207 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 207/207 places, 2600/2600 transitions.
Applied a total of 0 rules in 310 ms. Remains 207 /207 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2023-03-08 06:36:50] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 207 cols
[2023-03-08 06:36:50] [INFO ] Computed 107 place invariants in 4 ms
[2023-03-08 06:36:51] [INFO ] Implicit Places using invariants in 990 ms returned [104, 107, 134, 155, 166, 169, 188]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 994 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 200/207 places, 2600/2600 transitions.
Applied a total of 0 rules in 100 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1410 ms. Remains : 200/207 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 230 ms :[(NOT p0)]
Running random walk in product with property : Dekker-PT-050-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s142 1) (EQ s121 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1923 reset in 1419 ms.
Stack based approach found an accepted trace after 94 steps with 0 reset with depth 95 and stack size 95 in 3 ms.
FORMULA Dekker-PT-050-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-050-LTLCardinality-01 finished in 3138 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(p1)&&p0))||X(X(F(p2)))))'
Support contains 4 out of 207 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 207/207 places, 2600/2600 transitions.
Applied a total of 0 rules in 18 ms. Remains 207 /207 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2023-03-08 06:36:52] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-08 06:36:52] [INFO ] Invariant cache hit.
[2023-03-08 06:36:53] [INFO ] Implicit Places using invariants in 1074 ms returned [104, 107, 134, 155, 166, 169]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 1080 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 201/207 places, 2600/2600 transitions.
Applied a total of 0 rules in 30 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1130 ms. Remains : 201/207 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 316 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : Dekker-PT-050-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}, { cond=p0, acceptance={} source=2 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s182 0) (EQ s157 1)), p1:(AND (EQ s166 0) (EQ s61 1)), p2:(OR (EQ s61 0) (EQ s166 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25492 reset in 1262 ms.
Stack based approach found an accepted trace after 252 steps with 70 reset with depth 23 and stack size 23 in 4 ms.
FORMULA Dekker-PT-050-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-050-LTLCardinality-04 finished in 2746 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0))&&F(p1))))'
Support contains 4 out of 207 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 207/207 places, 2600/2600 transitions.
Applied a total of 0 rules in 18 ms. Remains 207 /207 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2023-03-08 06:36:55] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-08 06:36:55] [INFO ] Invariant cache hit.
[2023-03-08 06:36:56] [INFO ] Implicit Places using invariants in 856 ms returned [104, 107, 134, 155, 166, 169, 188]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 860 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 200/207 places, 2600/2600 transitions.
Applied a total of 0 rules in 32 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 913 ms. Remains : 200/207 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 233 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : Dekker-PT-050-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s27 0) (EQ s143 1)), p1:(OR (EQ s157 0) (EQ s173 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 971 reset in 1207 ms.
Stack based approach found an accepted trace after 160 steps with 2 reset with depth 101 and stack size 101 in 5 ms.
FORMULA Dekker-PT-050-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-050-LTLCardinality-05 finished in 2389 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((G(p1)||p0)) U X(p2)))'
Support contains 5 out of 207 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 207/207 places, 2600/2600 transitions.
Applied a total of 0 rules in 29 ms. Remains 207 /207 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2023-03-08 06:36:58] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-08 06:36:58] [INFO ] Invariant cache hit.
[2023-03-08 06:36:58] [INFO ] Implicit Places using invariants in 791 ms returned [104, 107, 134, 155, 166, 188]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 796 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 201/207 places, 2600/2600 transitions.
Applied a total of 0 rules in 28 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 854 ms. Remains : 201/207 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 342 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), true, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Dekker-PT-050-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}, { cond=(OR p0 p1), acceptance={} source=0 dest: 4}], [{ cond=(NOT p2), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 5}, { cond=p1, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={} source=7 dest: 6}, { cond=p0, acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(OR (EQ s171 0) (EQ s23 1)), p1:(OR (EQ s164 0) (EQ s12 1)), p2:(EQ s39 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 186 steps with 0 reset in 3 ms.
FORMULA Dekker-PT-050-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-050-LTLCardinality-06 finished in 1239 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 207 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 207/207 places, 2600/2600 transitions.
Applied a total of 0 rules in 16 ms. Remains 207 /207 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2023-03-08 06:36:59] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-08 06:36:59] [INFO ] Invariant cache hit.
[2023-03-08 06:36:59] [INFO ] Implicit Places using invariants in 723 ms returned [104, 134, 166, 169, 188]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 727 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 202/207 places, 2600/2600 transitions.
Applied a total of 0 rules in 28 ms. Remains 202 /202 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 771 ms. Remains : 202/207 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 91 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Dekker-PT-050-LTLCardinality-07 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:(OR (EQ s153 0) (EQ s106 1))], 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 4 steps with 0 reset in 0 ms.
FORMULA Dekker-PT-050-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-050-LTLCardinality-07 finished in 886 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&(G(p2)||p1))))'
Support contains 5 out of 207 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 207/207 places, 2600/2600 transitions.
Applied a total of 0 rules in 180 ms. Remains 207 /207 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2023-03-08 06:37:00] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-08 06:37:00] [INFO ] Invariant cache hit.
[2023-03-08 06:37:01] [INFO ] Implicit Places using invariants in 760 ms returned [104, 107, 155, 166, 169, 188]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 764 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 201/207 places, 2600/2600 transitions.
Applied a total of 0 rules in 158 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1105 ms. Remains : 201/207 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 91 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : Dekker-PT-050-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (AND (NOT p1) (NOT p2))), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0} source=1 dest: 0}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s118 1), p1:(OR (EQ s75 0) (EQ s73 1)), p2:(OR (EQ s192 0) (EQ s132 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1645 reset in 1576 ms.
Stack based approach found an accepted trace after 121 steps with 4 reset with depth 16 and stack size 16 in 7 ms.
FORMULA Dekker-PT-050-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-050-LTLCardinality-08 finished in 2806 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 2 out of 207 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 207/207 places, 2600/2600 transitions.
Applied a total of 0 rules in 89 ms. Remains 207 /207 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2023-03-08 06:37:03] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-08 06:37:03] [INFO ] Invariant cache hit.
[2023-03-08 06:37:03] [INFO ] Implicit Places using invariants in 820 ms returned [107, 134, 155, 166, 169, 188]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 823 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 201/207 places, 2600/2600 transitions.
Applied a total of 0 rules in 89 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1001 ms. Remains : 201/207 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Dekker-PT-050-LTLCardinality-09 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:(AND (EQ s104 0) (EQ s41 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1017 reset in 1521 ms.
Stack based approach found an accepted trace after 8 steps with 0 reset with depth 9 and stack size 9 in 1 ms.
FORMULA Dekker-PT-050-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-050-LTLCardinality-09 finished in 2623 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(G((p0 U p1))))))'
Support contains 4 out of 207 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 207/207 places, 2600/2600 transitions.
Applied a total of 0 rules in 89 ms. Remains 207 /207 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2023-03-08 06:37:05] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-08 06:37:05] [INFO ] Invariant cache hit.
[2023-03-08 06:37:06] [INFO ] Implicit Places using invariants in 880 ms returned [104, 107, 134, 155, 169, 188]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 884 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 201/207 places, 2600/2600 transitions.
Applied a total of 0 rules in 86 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1060 ms. Remains : 201/207 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : Dekker-PT-050-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(OR p0 p1), acceptance={} 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: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s112 0) (EQ s80 1)), p1:(OR (EQ s119 0) (EQ s162 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 1324 ms.
Product exploration explored 100000 steps with 0 reset in 1518 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (OR p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR p0 p1))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 8 factoid took 506 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 355 ms. (steps per millisecond=28 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-08 06:37:10] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 201 cols
[2023-03-08 06:37:10] [INFO ] Computed 101 place invariants in 3 ms
[2023-03-08 06:37:10] [INFO ] [Real]Absence check using 100 positive place invariants in 23 ms returned sat
[2023-03-08 06:37:10] [INFO ] [Real]Absence check using 100 positive and 1 generalized place invariants in 7 ms returned sat
[2023-03-08 06:37:10] [INFO ] After 143ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-08 06:37:11] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-08 06:37:11] [INFO ] After 36ms SMT Verify possible using 50 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 06:37:11] [INFO ] After 319ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 06:37:11] [INFO ] [Nat]Absence check using 100 positive place invariants in 33 ms returned sat
[2023-03-08 06:37:11] [INFO ] [Nat]Absence check using 100 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 06:37:11] [INFO ] After 172ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 06:37:11] [INFO ] After 91ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-08 06:37:11] [INFO ] Deduced a trap composed of 4 places in 137 ms of which 1 ms to minimize.
[2023-03-08 06:37:11] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 1 ms to minimize.
[2023-03-08 06:37:11] [INFO ] Deduced a trap composed of 4 places in 131 ms of which 0 ms to minimize.
[2023-03-08 06:37:12] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 1 ms to minimize.
[2023-03-08 06:37:12] [INFO ] Deduced a trap composed of 4 places in 126 ms of which 1 ms to minimize.
[2023-03-08 06:37:12] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 1 ms to minimize.
[2023-03-08 06:37:12] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 0 ms to minimize.
[2023-03-08 06:37:12] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 0 ms to minimize.
[2023-03-08 06:37:12] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 1 ms to minimize.
[2023-03-08 06:37:12] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 1 ms to minimize.
[2023-03-08 06:37:12] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 1 ms to minimize.
[2023-03-08 06:37:12] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1277 ms
[2023-03-08 06:37:12] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1277 ms
[2023-03-08 06:37:12] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 0 ms to minimize.
[2023-03-08 06:37:12] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2023-03-08 06:37:13] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 1 ms to minimize.
[2023-03-08 06:37:13] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 1 ms to minimize.
[2023-03-08 06:37:13] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 0 ms to minimize.
[2023-03-08 06:37:13] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 1 ms to minimize.
[2023-03-08 06:37:13] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2023-03-08 06:37:13] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2023-03-08 06:37:13] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2023-03-08 06:37:13] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2023-03-08 06:37:13] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2023-03-08 06:37:13] [INFO ] Trap strengthening procedure interrupted after too many repetitions 911 ms
[2023-03-08 06:37:13] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 911 ms
[2023-03-08 06:37:13] [INFO ] After 2348ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 45 ms.
[2023-03-08 06:37:13] [INFO ] After 2712ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 201 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 201/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 66 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 201/201 places, 2600/2600 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 374 ms. (steps per millisecond=26 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 197829 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :{}
Probabilistic random walk after 197829 steps, saw 163745 distinct states, run finished after 3001 ms. (steps per millisecond=65 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-08 06:37:17] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-08 06:37:17] [INFO ] Invariant cache hit.
[2023-03-08 06:37:17] [INFO ] [Real]Absence check using 100 positive place invariants in 28 ms returned sat
[2023-03-08 06:37:17] [INFO ] [Real]Absence check using 100 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 06:37:17] [INFO ] After 298ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 06:37:17] [INFO ] [Nat]Absence check using 100 positive place invariants in 27 ms returned sat
[2023-03-08 06:37:17] [INFO ] [Nat]Absence check using 100 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 06:37:17] [INFO ] After 152ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 06:37:17] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-08 06:37:18] [INFO ] After 80ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-08 06:37:18] [INFO ] Deduced a trap composed of 4 places in 183 ms of which 1 ms to minimize.
[2023-03-08 06:37:18] [INFO ] Deduced a trap composed of 4 places in 174 ms of which 0 ms to minimize.
[2023-03-08 06:37:18] [INFO ] Deduced a trap composed of 4 places in 166 ms of which 1 ms to minimize.
[2023-03-08 06:37:18] [INFO ] Deduced a trap composed of 4 places in 164 ms of which 1 ms to minimize.
[2023-03-08 06:37:18] [INFO ] Deduced a trap composed of 4 places in 171 ms of which 1 ms to minimize.
[2023-03-08 06:37:19] [INFO ] Deduced a trap composed of 4 places in 159 ms of which 0 ms to minimize.
[2023-03-08 06:37:19] [INFO ] Deduced a trap composed of 4 places in 158 ms of which 0 ms to minimize.
[2023-03-08 06:37:19] [INFO ] Deduced a trap composed of 4 places in 145 ms of which 1 ms to minimize.
[2023-03-08 06:37:19] [INFO ] Deduced a trap composed of 4 places in 143 ms of which 1 ms to minimize.
[2023-03-08 06:37:19] [INFO ] Deduced a trap composed of 4 places in 141 ms of which 0 ms to minimize.
[2023-03-08 06:37:19] [INFO ] Deduced a trap composed of 4 places in 133 ms of which 1 ms to minimize.
[2023-03-08 06:37:19] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1860 ms
[2023-03-08 06:37:19] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1860 ms
[2023-03-08 06:37:20] [INFO ] Deduced a trap composed of 4 places in 157 ms of which 0 ms to minimize.
[2023-03-08 06:37:20] [INFO ] Deduced a trap composed of 4 places in 120 ms of which 0 ms to minimize.
[2023-03-08 06:37:20] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 3 ms to minimize.
[2023-03-08 06:37:20] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 1 ms to minimize.
[2023-03-08 06:37:20] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 0 ms to minimize.
[2023-03-08 06:37:20] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 0 ms to minimize.
[2023-03-08 06:37:20] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 1 ms to minimize.
[2023-03-08 06:37:20] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 1 ms to minimize.
[2023-03-08 06:37:21] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 1 ms to minimize.
[2023-03-08 06:37:21] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 1 ms to minimize.
[2023-03-08 06:37:21] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 0 ms to minimize.
[2023-03-08 06:37:21] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1326 ms
[2023-03-08 06:37:21] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1326 ms
[2023-03-08 06:37:21] [INFO ] After 3329ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 60 ms.
[2023-03-08 06:37:21] [INFO ] After 3700ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 201 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 201/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 109 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 201/201 places, 2600/2600 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 201/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 120 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2023-03-08 06:37:21] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-08 06:37:21] [INFO ] Invariant cache hit.
[2023-03-08 06:37:22] [INFO ] Implicit Places using invariants in 847 ms returned []
[2023-03-08 06:37:22] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-08 06:37:22] [INFO ] Invariant cache hit.
[2023-03-08 06:37:22] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-08 06:37:23] [INFO ] Implicit Places using invariants and state equation in 1048 ms returned []
Implicit Place search using SMT with State Equation took 1897 ms to find 0 implicit places.
[2023-03-08 06:37:23] [INFO ] Redundant transitions in 219 ms returned []
[2023-03-08 06:37:23] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-08 06:37:23] [INFO ] Invariant cache hit.
[2023-03-08 06:37:26] [INFO ] Dead Transitions using invariants and state equation in 2379 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4623 ms. Remains : 201/201 places, 2600/2600 transitions.
Graph (complete) has 305 edges and 201 vertex of which 17 are kept as prefixes of interest. Removing 184 places using SCC suffix rule.0 ms
Discarding 184 places :
Also discarding 2392 output transitions
Drop transitions removed 2392 transitions
Ensure Unique test removed 1 places
Ensure Unique test removed 192 transitions
Reduce isomorphic transitions removed 192 transitions.
Iterating post reduction 0 with 193 rules applied. Total rules applied 194 place count 16 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 197 place count 14 transition count 15
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 198 place count 14 transition count 14
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 200 place count 14 transition count 12
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 206 place count 10 transition count 10
Applied a total of 206 rules in 9 ms. Remains 10 /201 variables (removed 191) and now considering 10/2600 (removed 2590) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 10 rows 10 cols
[2023-03-08 06:37:26] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-08 06:37:26] [INFO ] [Real]Absence check using 5 positive place invariants in 0 ms returned sat
[2023-03-08 06:37:26] [INFO ] After 10ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3
[2023-03-08 06:37:26] [INFO ] After 19ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-08 06:37:26] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:1
[2023-03-08 06:37:26] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-08 06:37:26] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 06:37:26] [INFO ] After 19ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-08 06:37:26] [INFO ] After 54ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (OR p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR p0 p1))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 8 factoid took 456 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 4 out of 201 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 201/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 144 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2023-03-08 06:37:27] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 201 cols
[2023-03-08 06:37:27] [INFO ] Computed 101 place invariants in 1 ms
[2023-03-08 06:37:27] [INFO ] Implicit Places using invariants in 896 ms returned []
[2023-03-08 06:37:27] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-08 06:37:27] [INFO ] Invariant cache hit.
[2023-03-08 06:37:28] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-08 06:37:28] [INFO ] Implicit Places using invariants and state equation in 867 ms returned []
Implicit Place search using SMT with State Equation took 1767 ms to find 0 implicit places.
[2023-03-08 06:37:28] [INFO ] Redundant transitions in 113 ms returned []
[2023-03-08 06:37:28] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-08 06:37:28] [INFO ] Invariant cache hit.
[2023-03-08 06:37:31] [INFO ] Dead Transitions using invariants and state equation in 2104 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4139 ms. Remains : 201/201 places, 2600/2600 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (OR p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR p0 p1))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 8 factoid took 421 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 202 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 366 ms. (steps per millisecond=27 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-08 06:37:32] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-08 06:37:32] [INFO ] Invariant cache hit.
[2023-03-08 06:37:32] [INFO ] [Real]Absence check using 100 positive place invariants in 27 ms returned sat
[2023-03-08 06:37:32] [INFO ] [Real]Absence check using 100 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 06:37:32] [INFO ] After 290ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 06:37:32] [INFO ] [Nat]Absence check using 100 positive place invariants in 28 ms returned sat
[2023-03-08 06:37:32] [INFO ] [Nat]Absence check using 100 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 06:37:32] [INFO ] After 153ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 06:37:32] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-08 06:37:32] [INFO ] After 77ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-08 06:37:33] [INFO ] Deduced a trap composed of 4 places in 224 ms of which 1 ms to minimize.
[2023-03-08 06:37:33] [INFO ] Deduced a trap composed of 4 places in 210 ms of which 1 ms to minimize.
[2023-03-08 06:37:33] [INFO ] Deduced a trap composed of 4 places in 204 ms of which 0 ms to minimize.
[2023-03-08 06:37:33] [INFO ] Deduced a trap composed of 4 places in 217 ms of which 1 ms to minimize.
[2023-03-08 06:37:34] [INFO ] Deduced a trap composed of 4 places in 207 ms of which 1 ms to minimize.
[2023-03-08 06:37:34] [INFO ] Deduced a trap composed of 4 places in 202 ms of which 1 ms to minimize.
[2023-03-08 06:37:34] [INFO ] Deduced a trap composed of 4 places in 184 ms of which 1 ms to minimize.
[2023-03-08 06:37:34] [INFO ] Deduced a trap composed of 4 places in 192 ms of which 1 ms to minimize.
[2023-03-08 06:37:34] [INFO ] Deduced a trap composed of 4 places in 184 ms of which 1 ms to minimize.
[2023-03-08 06:37:35] [INFO ] Deduced a trap composed of 4 places in 187 ms of which 1 ms to minimize.
[2023-03-08 06:37:35] [INFO ] Deduced a trap composed of 4 places in 172 ms of which 1 ms to minimize.
[2023-03-08 06:37:35] [INFO ] Trap strengthening procedure interrupted after too many repetitions 2324 ms
[2023-03-08 06:37:35] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2324 ms
[2023-03-08 06:37:35] [INFO ] Deduced a trap composed of 4 places in 130 ms of which 0 ms to minimize.
[2023-03-08 06:37:35] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 0 ms to minimize.
[2023-03-08 06:37:35] [INFO ] Deduced a trap composed of 4 places in 121 ms of which 0 ms to minimize.
[2023-03-08 06:37:35] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 1 ms to minimize.
[2023-03-08 06:37:35] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 1 ms to minimize.
[2023-03-08 06:37:36] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 1 ms to minimize.
[2023-03-08 06:37:36] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 0 ms to minimize.
[2023-03-08 06:37:36] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 1 ms to minimize.
[2023-03-08 06:37:36] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 1 ms to minimize.
[2023-03-08 06:37:36] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 1 ms to minimize.
[2023-03-08 06:37:36] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 0 ms to minimize.
[2023-03-08 06:37:36] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1289 ms
[2023-03-08 06:37:36] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1289 ms
[2023-03-08 06:37:36] [INFO ] After 3749ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 68 ms.
[2023-03-08 06:37:36] [INFO ] After 4124ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 201 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 201/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 110 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112 ms. Remains : 201/201 places, 2600/2600 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 357 ms. (steps per millisecond=28 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 204918 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :{}
Probabilistic random walk after 204918 steps, saw 169653 distinct states, run finished after 3001 ms. (steps per millisecond=68 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-08 06:37:40] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-08 06:37:40] [INFO ] Invariant cache hit.
[2023-03-08 06:37:40] [INFO ] [Real]Absence check using 100 positive place invariants in 28 ms returned sat
[2023-03-08 06:37:40] [INFO ] [Real]Absence check using 100 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 06:37:40] [INFO ] After 288ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 06:37:40] [INFO ] [Nat]Absence check using 100 positive place invariants in 32 ms returned sat
[2023-03-08 06:37:40] [INFO ] [Nat]Absence check using 100 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 06:37:40] [INFO ] After 182ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 06:37:40] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-08 06:37:41] [INFO ] After 91ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-08 06:37:41] [INFO ] Deduced a trap composed of 4 places in 153 ms of which 1 ms to minimize.
[2023-03-08 06:37:41] [INFO ] Deduced a trap composed of 4 places in 179 ms of which 0 ms to minimize.
[2023-03-08 06:37:41] [INFO ] Deduced a trap composed of 4 places in 172 ms of which 0 ms to minimize.
[2023-03-08 06:37:41] [INFO ] Deduced a trap composed of 4 places in 175 ms of which 0 ms to minimize.
[2023-03-08 06:37:41] [INFO ] Deduced a trap composed of 4 places in 166 ms of which 0 ms to minimize.
[2023-03-08 06:37:42] [INFO ] Deduced a trap composed of 4 places in 162 ms of which 1 ms to minimize.
[2023-03-08 06:37:42] [INFO ] Deduced a trap composed of 4 places in 159 ms of which 0 ms to minimize.
[2023-03-08 06:37:42] [INFO ] Deduced a trap composed of 4 places in 151 ms of which 1 ms to minimize.
[2023-03-08 06:37:42] [INFO ] Deduced a trap composed of 4 places in 145 ms of which 1 ms to minimize.
[2023-03-08 06:37:42] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 1 ms to minimize.
[2023-03-08 06:37:42] [INFO ] Deduced a trap composed of 4 places in 138 ms of which 1 ms to minimize.
[2023-03-08 06:37:42] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1849 ms
[2023-03-08 06:37:42] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1850 ms
[2023-03-08 06:37:43] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 1 ms to minimize.
[2023-03-08 06:37:43] [INFO ] Deduced a trap composed of 4 places in 132 ms of which 0 ms to minimize.
[2023-03-08 06:37:43] [INFO ] Deduced a trap composed of 4 places in 142 ms of which 1 ms to minimize.
[2023-03-08 06:37:43] [INFO ] Deduced a trap composed of 4 places in 136 ms of which 1 ms to minimize.
[2023-03-08 06:37:43] [INFO ] Deduced a trap composed of 4 places in 130 ms of which 1 ms to minimize.
[2023-03-08 06:37:43] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 1 ms to minimize.
[2023-03-08 06:37:43] [INFO ] Deduced a trap composed of 4 places in 122 ms of which 1 ms to minimize.
[2023-03-08 06:37:44] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 0 ms to minimize.
[2023-03-08 06:37:44] [INFO ] Deduced a trap composed of 4 places in 118 ms of which 1 ms to minimize.
[2023-03-08 06:37:44] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 1 ms to minimize.
[2023-03-08 06:37:44] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 1 ms to minimize.
[2023-03-08 06:37:44] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1449 ms
[2023-03-08 06:37:44] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1449 ms
[2023-03-08 06:37:44] [INFO ] After 3465ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 67 ms.
[2023-03-08 06:37:44] [INFO ] After 3895ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 201 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 201/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 119 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 119 ms. Remains : 201/201 places, 2600/2600 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 201/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 106 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2023-03-08 06:37:44] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-08 06:37:44] [INFO ] Invariant cache hit.
[2023-03-08 06:37:45] [INFO ] Implicit Places using invariants in 1036 ms returned []
[2023-03-08 06:37:45] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-08 06:37:45] [INFO ] Invariant cache hit.
[2023-03-08 06:37:46] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-08 06:37:46] [INFO ] Implicit Places using invariants and state equation in 1152 ms returned []
Implicit Place search using SMT with State Equation took 2220 ms to find 0 implicit places.
[2023-03-08 06:37:47] [INFO ] Redundant transitions in 142 ms returned []
[2023-03-08 06:37:47] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-08 06:37:47] [INFO ] Invariant cache hit.
[2023-03-08 06:37:48] [INFO ] Dead Transitions using invariants and state equation in 1833 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4321 ms. Remains : 201/201 places, 2600/2600 transitions.
Graph (complete) has 305 edges and 201 vertex of which 17 are kept as prefixes of interest. Removing 184 places using SCC suffix rule.0 ms
Discarding 184 places :
Also discarding 2392 output transitions
Drop transitions removed 2392 transitions
Ensure Unique test removed 1 places
Ensure Unique test removed 192 transitions
Reduce isomorphic transitions removed 192 transitions.
Iterating post reduction 0 with 193 rules applied. Total rules applied 194 place count 16 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 197 place count 14 transition count 15
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 198 place count 14 transition count 14
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 200 place count 14 transition count 12
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 206 place count 10 transition count 10
Applied a total of 206 rules in 5 ms. Remains 10 /201 variables (removed 191) and now considering 10/2600 (removed 2590) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 10 rows 10 cols
[2023-03-08 06:37:48] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-08 06:37:48] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-08 06:37:48] [INFO ] After 10ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3
[2023-03-08 06:37:48] [INFO ] After 19ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-08 06:37:48] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:1
[2023-03-08 06:37:49] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-08 06:37:49] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 06:37:49] [INFO ] After 22ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-08 06:37:49] [INFO ] After 70ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (OR p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR p0 p1))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 8 factoid took 407 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 1727 ms.
Product exploration explored 100000 steps with 0 reset in 1747 ms.
Built C files in :
/tmp/ltsmin13233714259950106012
[2023-03-08 06:37:53] [INFO ] Too many transitions (2600) to apply POR reductions. Disabling POR matrices.
[2023-03-08 06:37:53] [INFO ] Built C files in 106ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13233714259950106012
Running compilation step : cd /tmp/ltsmin13233714259950106012;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13233714259950106012;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13233714259950106012;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 201 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 201/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 145 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2023-03-08 06:37:56] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 201 cols
[2023-03-08 06:37:56] [INFO ] Computed 101 place invariants in 2 ms
[2023-03-08 06:37:57] [INFO ] Implicit Places using invariants in 881 ms returned []
[2023-03-08 06:37:57] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-08 06:37:57] [INFO ] Invariant cache hit.
[2023-03-08 06:37:57] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-08 06:37:58] [INFO ] Implicit Places using invariants and state equation in 1147 ms returned []
Implicit Place search using SMT with State Equation took 2055 ms to find 0 implicit places.
[2023-03-08 06:37:59] [INFO ] Redundant transitions in 139 ms returned []
[2023-03-08 06:37:59] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-08 06:37:59] [INFO ] Invariant cache hit.
[2023-03-08 06:38:00] [INFO ] Dead Transitions using invariants and state equation in 1880 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4229 ms. Remains : 201/201 places, 2600/2600 transitions.
Built C files in :
/tmp/ltsmin12867232675117968057
[2023-03-08 06:38:00] [INFO ] Too many transitions (2600) to apply POR reductions. Disabling POR matrices.
[2023-03-08 06:38:00] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12867232675117968057
Running compilation step : cd /tmp/ltsmin12867232675117968057;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12867232675117968057;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12867232675117968057;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-08 06:38:04] [INFO ] Flatten gal took : 159 ms
[2023-03-08 06:38:04] [INFO ] Flatten gal took : 180 ms
[2023-03-08 06:38:04] [INFO ] Time to serialize gal into /tmp/LTL5989064739248326104.gal : 31 ms
[2023-03-08 06:38:04] [INFO ] Time to serialize properties into /tmp/LTL16108139545696036919.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5989064739248326104.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15100926324646873267.hoa' '-atoms' '/tmp/LTL16108139545696036919.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL16108139545696036919.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15100926324646873267.hoa
Reverse transition relation is NOT exact ! Due to transitions t51, t103, t155, t207, t259, t311, t363, t415, t467, t519, t571, t623, t675, t727, t779, t831...494
Detected timeout of ITS tools.
[2023-03-08 06:38:19] [INFO ] Flatten gal took : 127 ms
[2023-03-08 06:38:19] [INFO ] Flatten gal took : 122 ms
[2023-03-08 06:38:19] [INFO ] Time to serialize gal into /tmp/LTL9215269951438138077.gal : 18 ms
[2023-03-08 06:38:20] [INFO ] Time to serialize properties into /tmp/LTL12228773205642133236.ltl : 53 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9215269951438138077.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12228773205642133236.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((X(G(("((p1_6==0)||(flag_0_40==1))")U("((p3_9==0)||(p0_31==1))"))))&&("((p1_6==0)||(flag_0_40==1))"))))
Formula 0 simplified : G(!"((p1_6==0)||(flag_0_40==1))" | XF(!"((p1_6==0)||(flag_0_40==1))" R !"((p3_9==0)||(p0_31==1))"))
Reverse transition relation is NOT exact ! Due to transitions t51, t103, t155, t207, t259, t311, t363, t415, t467, t519, t571, t623, t675, t727, t779, t831...494
Detected timeout of ITS tools.
[2023-03-08 06:38:35] [INFO ] Flatten gal took : 108 ms
[2023-03-08 06:38:35] [INFO ] Applying decomposition
[2023-03-08 06:38:35] [INFO ] Flatten gal took : 112 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph6558176575578078613.txt' '-o' '/tmp/graph6558176575578078613.bin' '-w' '/tmp/graph6558176575578078613.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph6558176575578078613.bin' '-l' '-1' '-v' '-w' '/tmp/graph6558176575578078613.weights' '-q' '0' '-e' '0.001'
[2023-03-08 06:38:35] [INFO ] Decomposing Gal with order
[2023-03-08 06:38:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 06:38:36] [INFO ] Removed a total of 7249 redundant transitions.
[2023-03-08 06:38:36] [INFO ] Flatten gal took : 398 ms
[2023-03-08 06:38:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 57 ms.
[2023-03-08 06:38:36] [INFO ] Time to serialize gal into /tmp/LTL12398710070396136714.gal : 17 ms
[2023-03-08 06:38:36] [INFO ] Time to serialize properties into /tmp/LTL931475426046168966.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12398710070396136714.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL931475426046168966.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F((X(G(("((u6.p1_6==0)||(u40.flag_0_40==1))")U("((u9.p3_9==0)||(i31.u50.p0_31==1))"))))&&("((u6.p1_6==0)||(u40.flag_0_40==1))"))))
Formula 0 simplified : G(!"((u6.p1_6==0)||(u40.flag_0_40==1))" | XF(!"((u6.p1_6==0)||(u40.flag_0_40==1))" R !"((u9.p3_9==0)||(i31.u50.p0_31==1))"))
Reverse transition relation is NOT exact ! Due to transitions u0.t51, u1.t103, u2.t155, u3.t207, u4.t259, u5.t311, u6.t363, u7.t415, u8.t467, u9.t519, u10....684
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
265 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.82247,79392,1,0,170372,1353,19754,92977,175,1379,229509
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Dekker-PT-050-LTLCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property Dekker-PT-050-LTLCardinality-11 finished in 94067 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(F(((X(!p1)&&G(!p2))||G(!p1))))))'
Support contains 4 out of 207 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 207/207 places, 2600/2600 transitions.
Applied a total of 0 rules in 16 ms. Remains 207 /207 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2023-03-08 06:38:39] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 207 cols
[2023-03-08 06:38:39] [INFO ] Computed 107 place invariants in 1 ms
[2023-03-08 06:38:40] [INFO ] Implicit Places using invariants in 914 ms returned [104, 107, 134, 155, 166, 169, 188]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 919 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 200/207 places, 2600/2600 transitions.
Applied a total of 0 rules in 28 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 963 ms. Remains : 200/207 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 443 ms :[(OR (NOT p0) p1), (NOT p0), p1, p1, (AND p1 p2)]
Running random walk in product with property : Dekker-PT-050-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND (NOT p1) p2), acceptance={1} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={1} source=2 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={0, 1} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 4}], [{ cond=(AND p1 p2), acceptance={0, 1} source=3 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0, 1} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p1) p2), acceptance={1} source=4 dest: 2}, { cond=(AND p1 p2), acceptance={0, 1} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s194 0) (EQ s145 1)), p1:(OR (EQ s145 0) (EQ s194 1)), p2:(OR (EQ s160 0) (EQ s109 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1623 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 1 ms.
FORMULA Dekker-PT-050-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-050-LTLCardinality-13 finished in 3060 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||G(p1)))))'
Support contains 2 out of 207 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 207/207 places, 2600/2600 transitions.
Applied a total of 0 rules in 17 ms. Remains 207 /207 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2023-03-08 06:38:42] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-08 06:38:42] [INFO ] Invariant cache hit.
[2023-03-08 06:38:43] [INFO ] Implicit Places using invariants in 987 ms returned [104, 107, 134, 155, 166, 169, 188]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 1006 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 200/207 places, 2600/2600 transitions.
Applied a total of 0 rules in 29 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1052 ms. Remains : 200/207 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 211 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Dekker-PT-050-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(EQ s192 1), p0:(EQ s119 0)], 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]]
Product exploration explored 100000 steps with 0 reset in 1575 ms.
Product exploration explored 100000 steps with 0 reset in 1312 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), true, (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0)))]
Property proved to be false thanks to negative knowledge :(X (X (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 6 factoid took 263 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Dekker-PT-050-LTLCardinality-15 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Dekker-PT-050-LTLCardinality-15 finished in 4480 ms.
All properties solved by simple procedures.
Total runtime 154978 ms.
BK_STOP 1678257528245
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Dekker-PT-050"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is Dekker-PT-050, 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 r133-smll-167819410000027"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Dekker-PT-050.tgz
mv Dekker-PT-050 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;