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.r137-smll-167819417100027.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 ltsminxred
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 r137-smll-167819417100027
=====================================================================

--------------------
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 1678529220267

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=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Dekker-PT-050
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-11 10:07:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 10:07:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 10:07:03] [INFO ] Load time of PNML (sax parser for PT used): 321 ms
[2023-03-11 10:07:03] [INFO ] Transformed 250 places.
[2023-03-11 10:07:03] [INFO ] Transformed 2600 transitions.
[2023-03-11 10:07:03] [INFO ] Found NUPN structural information;
[2023-03-11 10:07:03] [INFO ] Parsed PT model containing 250 places and 2600 transitions and 20100 arcs in 486 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 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 116 ms. Remains 250 /250 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2023-03-11 10:07:04] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 250 cols
[2023-03-11 10:07:04] [INFO ] Computed 150 place invariants in 29 ms
[2023-03-11 10:07:06] [INFO ] Implicit Places using invariants in 2006 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 2056 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 44 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 2217 ms. Remains : 207/250 places, 2600/2600 transitions.
Support contains 34 out of 207 places after structural reductions.
[2023-03-11 10:07:07] [INFO ] Flatten gal took : 402 ms
[2023-03-11 10:07:07] [INFO ] Flatten gal took : 256 ms
[2023-03-11 10:07:07] [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 639 ms. (steps per millisecond=15 ) properties (out of 21) seen :14
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 32 ms. (steps per millisecond=312 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) 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 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 :2
Running SMT prover for 5 properties.
[2023-03-11 10:07:08] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 207 cols
[2023-03-11 10:07:08] [INFO ] Computed 107 place invariants in 6 ms
[2023-03-11 10:07:08] [INFO ] [Real]Absence check using 100 positive place invariants in 29 ms returned sat
[2023-03-11 10:07:08] [INFO ] [Real]Absence check using 100 positive and 7 generalized place invariants in 6 ms returned sat
[2023-03-11 10:07:09] [INFO ] After 459ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-11 10:07:09] [INFO ] [Nat]Absence check using 100 positive place invariants in 21 ms returned sat
[2023-03-11 10:07:09] [INFO ] [Nat]Absence check using 100 positive and 7 generalized place invariants in 4 ms returned sat
[2023-03-11 10:07:09] [INFO ] After 178ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-11 10:07:09] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-11 10:07:09] [INFO ] After 106ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-11 10:07:09] [INFO ] Deduced a trap composed of 4 places in 170 ms of which 9 ms to minimize.
[2023-03-11 10:07:10] [INFO ] Deduced a trap composed of 4 places in 181 ms of which 2 ms to minimize.
[2023-03-11 10:07:10] [INFO ] Deduced a trap composed of 4 places in 168 ms of which 2 ms to minimize.
[2023-03-11 10:07:10] [INFO ] Deduced a trap composed of 4 places in 144 ms of which 2 ms to minimize.
[2023-03-11 10:07:10] [INFO ] Deduced a trap composed of 4 places in 138 ms of which 1 ms to minimize.
[2023-03-11 10:07:10] [INFO ] Deduced a trap composed of 4 places in 131 ms of which 4 ms to minimize.
[2023-03-11 10:07:10] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 1 ms to minimize.
[2023-03-11 10:07:10] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 1 ms to minimize.
[2023-03-11 10:07:11] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 0 ms to minimize.
[2023-03-11 10:07:11] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 1 ms to minimize.
[2023-03-11 10:07:11] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 0 ms to minimize.
[2023-03-11 10:07:11] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1551 ms
[2023-03-11 10:07:11] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1552 ms
[2023-03-11 10:07:11] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 1 ms to minimize.
[2023-03-11 10:07:11] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 1 ms to minimize.
[2023-03-11 10:07:11] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 1 ms to minimize.
[2023-03-11 10:07:11] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 0 ms to minimize.
[2023-03-11 10:07:11] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2023-03-11 10:07:11] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
[2023-03-11 10:07:11] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2023-03-11 10:07:11] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
[2023-03-11 10:07:12] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2023-03-11 10:07:12] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2023-03-11 10:07:12] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2023-03-11 10:07:12] [INFO ] Trap strengthening procedure interrupted after too many repetitions 885 ms
[2023-03-11 10:07:12] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 885 ms
[2023-03-11 10:07:12] [INFO ] After 2666ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 73 ms.
[2023-03-11 10:07:12] [INFO ] After 3153ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 9 ms.
Support contains 7 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 179 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 180 ms. Remains : 207/207 places, 2600/2600 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 310 ms. (steps per millisecond=32 ) properties (out of 5) 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 5) 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 5) 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 5) 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 5) 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 5) seen :0
Interrupted probabilistic random walk after 175134 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :{}
Probabilistic random walk after 175134 steps, saw 145256 distinct states, run finished after 3008 ms. (steps per millisecond=58 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-11 10:07:15] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-11 10:07:15] [INFO ] Invariant cache hit.
[2023-03-11 10:07:16] [INFO ] [Real]Absence check using 100 positive place invariants in 50 ms returned sat
[2023-03-11 10:07:16] [INFO ] [Real]Absence check using 100 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-11 10:07:16] [INFO ] After 358ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-11 10:07:16] [INFO ] [Nat]Absence check using 100 positive place invariants in 25 ms returned sat
[2023-03-11 10:07:16] [INFO ] [Nat]Absence check using 100 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-11 10:07:16] [INFO ] After 163ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-11 10:07:16] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-11 10:07:16] [INFO ] After 85ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-11 10:07:16] [INFO ] Deduced a trap composed of 4 places in 175 ms of which 0 ms to minimize.
[2023-03-11 10:07:17] [INFO ] Deduced a trap composed of 4 places in 184 ms of which 0 ms to minimize.
[2023-03-11 10:07:17] [INFO ] Deduced a trap composed of 4 places in 157 ms of which 0 ms to minimize.
[2023-03-11 10:07:17] [INFO ] Deduced a trap composed of 4 places in 146 ms of which 1 ms to minimize.
[2023-03-11 10:07:17] [INFO ] Deduced a trap composed of 4 places in 123 ms of which 1 ms to minimize.
[2023-03-11 10:07:17] [INFO ] Deduced a trap composed of 4 places in 143 ms of which 1 ms to minimize.
[2023-03-11 10:07:17] [INFO ] Deduced a trap composed of 4 places in 123 ms of which 1 ms to minimize.
[2023-03-11 10:07:18] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 1 ms to minimize.
[2023-03-11 10:07:18] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 0 ms to minimize.
[2023-03-11 10:07:18] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 1 ms to minimize.
[2023-03-11 10:07:18] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 1 ms to minimize.
[2023-03-11 10:07:18] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1654 ms
[2023-03-11 10:07:18] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1655 ms
[2023-03-11 10:07:18] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 17 ms to minimize.
[2023-03-11 10:07:18] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 1 ms to minimize.
[2023-03-11 10:07:18] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 1 ms to minimize.
[2023-03-11 10:07:18] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 0 ms to minimize.
[2023-03-11 10:07:19] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 1 ms to minimize.
[2023-03-11 10:07:19] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 2 ms to minimize.
[2023-03-11 10:07:19] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 0 ms to minimize.
[2023-03-11 10:07:19] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2023-03-11 10:07:19] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 0 ms to minimize.
[2023-03-11 10:07:19] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2023-03-11 10:07:19] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2023-03-11 10:07:19] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1033 ms
[2023-03-11 10:07:19] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1034 ms
[2023-03-11 10:07:19] [INFO ] After 2873ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 71 ms.
[2023-03-11 10:07:19] [INFO ] After 3278ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 7 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 98 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 98 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 108 ms. Remains 207 /207 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2023-03-11 10:07:19] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-11 10:07:19] [INFO ] Invariant cache hit.
[2023-03-11 10:07:20] [INFO ] Implicit Places using invariants in 766 ms returned [104, 107, 155, 166, 169]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 772 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 202/207 places, 2600/2600 transitions.
Applied a total of 0 rules in 84 ms. Remains 202 /202 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 969 ms. Remains : 202/207 places, 2600/2600 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 334 ms. (steps per millisecond=29 ) properties (out of 5) 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 5) 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 5) 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 5) 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 5) 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 5) seen :0
Interrupted probabilistic random walk after 123012 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :{}
Probabilistic random walk after 123012 steps, saw 102946 distinct states, run finished after 3004 ms. (steps per millisecond=40 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-11 10:07:24] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 202 cols
[2023-03-11 10:07:24] [INFO ] Computed 102 place invariants in 5 ms
[2023-03-11 10:07:24] [INFO ] [Real]Absence check using 100 positive place invariants in 24 ms returned sat
[2023-03-11 10:07:24] [INFO ] [Real]Absence check using 100 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-11 10:07:24] [INFO ] After 307ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-11 10:07:24] [INFO ] [Nat]Absence check using 100 positive place invariants in 24 ms returned sat
[2023-03-11 10:07:24] [INFO ] [Nat]Absence check using 100 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-11 10:07:24] [INFO ] After 153ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-11 10:07:24] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-11 10:07:24] [INFO ] After 90ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-11 10:07:25] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 1 ms to minimize.
[2023-03-11 10:07:25] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 1 ms to minimize.
[2023-03-11 10:07:25] [INFO ] Deduced a trap composed of 4 places in 120 ms of which 0 ms to minimize.
[2023-03-11 10:07:25] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 0 ms to minimize.
[2023-03-11 10:07:25] [INFO ] Deduced a trap composed of 4 places in 163 ms of which 38 ms to minimize.
[2023-03-11 10:07:25] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 0 ms to minimize.
[2023-03-11 10:07:25] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 1 ms to minimize.
[2023-03-11 10:07:25] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 1 ms to minimize.
[2023-03-11 10:07:26] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 0 ms to minimize.
[2023-03-11 10:07:26] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 1 ms to minimize.
[2023-03-11 10:07:26] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 10 ms to minimize.
[2023-03-11 10:07:26] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1341 ms
[2023-03-11 10:07:26] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1341 ms
[2023-03-11 10:07:26] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 0 ms to minimize.
[2023-03-11 10:07:26] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 0 ms to minimize.
[2023-03-11 10:07:26] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2023-03-11 10:07:26] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2023-03-11 10:07:26] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2023-03-11 10:07:26] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2023-03-11 10:07:26] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2023-03-11 10:07:26] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2023-03-11 10:07:26] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 2 ms to minimize.
[2023-03-11 10:07:27] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2023-03-11 10:07:27] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 2 ms to minimize.
[2023-03-11 10:07:27] [INFO ] Trap strengthening procedure interrupted after too many repetitions 790 ms
[2023-03-11 10:07:27] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 790 ms
[2023-03-11 10:07:27] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2023-03-11 10:07:27] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2023-03-11 10:07:27] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2023-03-11 10:07:27] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2023-03-11 10:07:27] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2023-03-11 10:07:27] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2023-03-11 10:07:27] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2023-03-11 10:07:27] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2023-03-11 10:07:27] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2023-03-11 10:07:27] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2023-03-11 10:07:27] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 520 ms
[2023-03-11 10:07:27] [INFO ] After 2825ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 71 ms.
[2023-03-11 10:07:27] [INFO ] After 3215ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 7 out of 202 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 202/202 places, 2600/2600 transitions.
Applied a total of 0 rules in 77 ms. Remains 202 /202 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 202/202 places, 2600/2600 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 202/202 places, 2600/2600 transitions.
Applied a total of 0 rules in 79 ms. Remains 202 /202 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2023-03-11 10:07:27] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-11 10:07:27] [INFO ] Invariant cache hit.
[2023-03-11 10:07:28] [INFO ] Implicit Places using invariants in 642 ms returned []
[2023-03-11 10:07:28] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-11 10:07:28] [INFO ] Invariant cache hit.
[2023-03-11 10:07:28] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-11 10:07:29] [INFO ] Implicit Places using invariants and state equation in 839 ms returned []
Implicit Place search using SMT with State Equation took 1483 ms to find 0 implicit places.
[2023-03-11 10:07:29] [INFO ] Redundant transitions in 239 ms returned []
[2023-03-11 10:07:29] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-11 10:07:29] [INFO ] Invariant cache hit.
[2023-03-11 10:07:31] [INFO ] Dead Transitions using invariants and state equation in 1906 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3719 ms. Remains : 202/202 places, 2600/2600 transitions.
Graph (complete) has 310 edges and 202 vertex of which 30 are kept as prefixes of interest. Removing 172 places using SCC suffix rule.3 ms
Discarding 172 places :
Also discarding 2236 output transitions
Drop transitions removed 2236 transitions
Ensure Unique test removed 2 places
Ensure Unique test removed 336 transitions
Reduce isomorphic transitions removed 336 transitions.
Iterating post reduction 0 with 338 rules applied. Total rules applied 339 place count 28 transition count 28
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 351 place count 20 transition count 24
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 355 place count 20 transition count 20
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 357 place count 20 transition count 18
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 363 place count 16 transition count 16
Applied a total of 363 rules in 20 ms. Remains 16 /202 variables (removed 186) and now considering 16/2600 (removed 2584) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 16 rows 16 cols
[2023-03-11 10:07:31] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-11 10:07:31] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-11 10:07:31] [INFO ] After 16ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4 real:1
[2023-03-11 10:07:31] [INFO ] After 33ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-11 10:07:31] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-11 10:07:31] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-11 10:07:31] [INFO ] After 20ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-11 10:07:31] [INFO ] After 39ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-11 10:07:31] [INFO ] After 87ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
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 313 ms. Remains 207 /207 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2023-03-11 10:07:32] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 207 cols
[2023-03-11 10:07:32] [INFO ] Computed 107 place invariants in 5 ms
[2023-03-11 10:07:33] [INFO ] Implicit Places using invariants in 744 ms returned [104, 107, 134, 155, 166, 169, 188]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 748 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 101 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 1163 ms. Remains : 200/207 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 257 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 1929 reset in 1484 ms.
Stack based approach found an accepted trace after 238 steps with 8 reset with depth 29 and stack size 29 in 6 ms.
FORMULA Dekker-PT-050-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-050-LTLCardinality-01 finished in 2985 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-11 10:07:35] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-11 10:07:35] [INFO ] Invariant cache hit.
[2023-03-11 10:07:35] [INFO ] Implicit Places using invariants in 750 ms returned [104, 107, 134, 155, 166, 169]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 754 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 19 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 793 ms. Remains : 201/207 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 291 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 24927 reset in 1226 ms.
Stack based approach found an accepted trace after 495 steps with 156 reset with depth 11 and stack size 11 in 8 ms.
FORMULA Dekker-PT-050-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-050-LTLCardinality-04 finished in 2430 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 20 ms. Remains 207 /207 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2023-03-11 10:07:37] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-11 10:07:37] [INFO ] Invariant cache hit.
[2023-03-11 10:07:38] [INFO ] Implicit Places using invariants in 713 ms returned [104, 107, 134, 155, 166, 169, 188]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 724 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 21 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 767 ms. Remains : 200/207 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 194 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 934 reset in 1238 ms.
Stack based approach found an accepted trace after 90 steps with 1 reset with depth 64 and stack size 62 in 1 ms.
FORMULA Dekker-PT-050-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-050-LTLCardinality-05 finished in 2229 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 18 ms. Remains 207 /207 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2023-03-11 10:07:39] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-11 10:07:39] [INFO ] Invariant cache hit.
[2023-03-11 10:07:40] [INFO ] Implicit Places using invariants in 764 ms returned [104, 107, 134, 155, 166, 188]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 767 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 18 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 805 ms. Remains : 201/207 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 309 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 38 steps with 0 reset in 1 ms.
FORMULA Dekker-PT-050-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-050-LTLCardinality-06 finished in 1140 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 20 ms. Remains 207 /207 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2023-03-11 10:07:40] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-11 10:07:40] [INFO ] Invariant cache hit.
[2023-03-11 10:07:41] [INFO ] Implicit Places using invariants in 770 ms returned [104, 134, 166, 169, 188]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 773 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 18 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 812 ms. Remains : 202/207 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 86 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 3 steps with 0 reset in 1 ms.
FORMULA Dekker-PT-050-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-050-LTLCardinality-07 finished in 916 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 99 ms. Remains 207 /207 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2023-03-11 10:07:41] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-11 10:07:41] [INFO ] Invariant cache hit.
[2023-03-11 10:07:42] [INFO ] Implicit Places using invariants in 745 ms returned [104, 107, 155, 166, 169, 188]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 748 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 93 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 941 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 1788 reset in 1247 ms.
Stack based approach found an accepted trace after 27 steps with 0 reset with depth 28 and stack size 28 in 2 ms.
FORMULA Dekker-PT-050-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-050-LTLCardinality-08 finished in 2300 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 90 ms. Remains 207 /207 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2023-03-11 10:07:44] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-11 10:07:44] [INFO ] Invariant cache hit.
[2023-03-11 10:07:44] [INFO ] Implicit Places using invariants in 772 ms returned [107, 134, 155, 166, 169, 188]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 775 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 91 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 957 ms. Remains : 201/207 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 73 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 1031 reset in 1245 ms.
Stack based approach found an accepted trace after 24 steps with 0 reset with depth 25 and stack size 25 in 1 ms.
FORMULA Dekker-PT-050-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-050-LTLCardinality-09 finished in 2296 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 93 ms. Remains 207 /207 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2023-03-11 10:07:46] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-11 10:07:46] [INFO ] Invariant cache hit.
[2023-03-11 10:07:47] [INFO ] Implicit Places using invariants in 748 ms returned [104, 107, 134, 155, 169, 188]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 752 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 91 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 937 ms. Remains : 201/207 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 121 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 1313 ms.
Product exploration explored 100000 steps with 0 reset in 1448 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 387 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 118 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 350 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 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-11 10:07:51] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 201 cols
[2023-03-11 10:07:51] [INFO ] Computed 101 place invariants in 2 ms
[2023-03-11 10:07:51] [INFO ] [Real]Absence check using 100 positive place invariants in 24 ms returned sat
[2023-03-11 10:07:51] [INFO ] [Real]Absence check using 100 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 10:07:51] [INFO ] After 158ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-11 10:07:51] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-11 10:07:51] [INFO ] After 32ms SMT Verify possible using 50 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 10:07:51] [INFO ] After 324ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 10:07:51] [INFO ] [Nat]Absence check using 100 positive place invariants in 26 ms returned sat
[2023-03-11 10:07:51] [INFO ] [Nat]Absence check using 100 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 10:07:51] [INFO ] After 119ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 10:07:51] [INFO ] After 65ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 10:07:51] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 1 ms to minimize.
[2023-03-11 10:07:51] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 0 ms to minimize.
[2023-03-11 10:07:52] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 1 ms to minimize.
[2023-03-11 10:07:52] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 0 ms to minimize.
[2023-03-11 10:07:52] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 1 ms to minimize.
[2023-03-11 10:07:52] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 0 ms to minimize.
[2023-03-11 10:07:52] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 1 ms to minimize.
[2023-03-11 10:07:52] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 0 ms to minimize.
[2023-03-11 10:07:52] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 0 ms to minimize.
[2023-03-11 10:07:52] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 0 ms to minimize.
[2023-03-11 10:07:52] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 0 ms to minimize.
[2023-03-11 10:07:52] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1144 ms
[2023-03-11 10:07:52] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1145 ms
[2023-03-11 10:07:52] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2023-03-11 10:07:53] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2023-03-11 10:07:53] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
[2023-03-11 10:07:53] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2023-03-11 10:07:53] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2023-03-11 10:07:53] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2023-03-11 10:07:53] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2023-03-11 10:07:53] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2023-03-11 10:07:53] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2023-03-11 10:07:53] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2023-03-11 10:07:53] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2023-03-11 10:07:53] [INFO ] Trap strengthening procedure interrupted after too many repetitions 715 ms
[2023-03-11 10:07:53] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 715 ms
[2023-03-11 10:07:53] [INFO ] After 1981ms 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-11 10:07:53] [INFO ] After 2259ms 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 71 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 71 ms. Remains : 201/201 places, 2600/2600 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 365 ms. (steps per millisecond=27 ) 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 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 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 194361 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :{}
Probabilistic random walk after 194361 steps, saw 160883 distinct states, run finished after 3001 ms. (steps per millisecond=64 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-11 10:07:57] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-11 10:07:57] [INFO ] Invariant cache hit.
[2023-03-11 10:07:57] [INFO ] [Real]Absence check using 100 positive place invariants in 24 ms returned sat
[2023-03-11 10:07:57] [INFO ] [Real]Absence check using 100 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-11 10:07:57] [INFO ] After 271ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 10:07:57] [INFO ] [Nat]Absence check using 100 positive place invariants in 24 ms returned sat
[2023-03-11 10:07:57] [INFO ] [Nat]Absence check using 100 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 10:07:57] [INFO ] After 138ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 10:07:57] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-11 10:07:57] [INFO ] After 75ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 10:07:58] [INFO ] Deduced a trap composed of 4 places in 178 ms of which 1 ms to minimize.
[2023-03-11 10:07:58] [INFO ] Deduced a trap composed of 4 places in 138 ms of which 1 ms to minimize.
[2023-03-11 10:07:58] [INFO ] Deduced a trap composed of 4 places in 140 ms of which 1 ms to minimize.
[2023-03-11 10:07:58] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 1 ms to minimize.
[2023-03-11 10:07:58] [INFO ] Deduced a trap composed of 4 places in 128 ms of which 0 ms to minimize.
[2023-03-11 10:07:58] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 0 ms to minimize.
[2023-03-11 10:07:58] [INFO ] Deduced a trap composed of 4 places in 116 ms of which 1 ms to minimize.
[2023-03-11 10:07:58] [INFO ] Deduced a trap composed of 4 places in 119 ms of which 0 ms to minimize.
[2023-03-11 10:07:59] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 0 ms to minimize.
[2023-03-11 10:07:59] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 1 ms to minimize.
[2023-03-11 10:07:59] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 1 ms to minimize.
[2023-03-11 10:07:59] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1500 ms
[2023-03-11 10:07:59] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1501 ms
[2023-03-11 10:07:59] [INFO ] Deduced a trap composed of 4 places in 131 ms of which 1 ms to minimize.
[2023-03-11 10:07:59] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 1 ms to minimize.
[2023-03-11 10:07:59] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 0 ms to minimize.
[2023-03-11 10:07:59] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 0 ms to minimize.
[2023-03-11 10:07:59] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 0 ms to minimize.
[2023-03-11 10:08:00] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 1 ms to minimize.
[2023-03-11 10:08:00] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2023-03-11 10:08:00] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 0 ms to minimize.
[2023-03-11 10:08:00] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 1 ms to minimize.
[2023-03-11 10:08:00] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
[2023-03-11 10:08:00] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2023-03-11 10:08:00] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1033 ms
[2023-03-11 10:08:00] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1034 ms
[2023-03-11 10:08:00] [INFO ] After 2662ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 44 ms.
[2023-03-11 10:08:00] [INFO ] After 2979ms 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 72 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 73 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 77 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2023-03-11 10:08:00] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-11 10:08:00] [INFO ] Invariant cache hit.
[2023-03-11 10:08:01] [INFO ] Implicit Places using invariants in 650 ms returned []
[2023-03-11 10:08:01] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-11 10:08:01] [INFO ] Invariant cache hit.
[2023-03-11 10:08:01] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-11 10:08:02] [INFO ] Implicit Places using invariants and state equation in 857 ms returned []
Implicit Place search using SMT with State Equation took 1509 ms to find 0 implicit places.
[2023-03-11 10:08:02] [INFO ] Redundant transitions in 89 ms returned []
[2023-03-11 10:08:02] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-11 10:08:02] [INFO ] Invariant cache hit.
[2023-03-11 10:08:03] [INFO ] Dead Transitions using invariants and state equation in 1728 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3417 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.1 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 7 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-11 10:08:03] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-11 10:08:03] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-11 10:08:04] [INFO ] After 13ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3
[2023-03-11 10:08:04] [INFO ] After 24ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-11 10:08:04] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:1
[2023-03-11 10:08:04] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-11 10:08:04] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 10:08:04] [INFO ] After 23ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-11 10:08:04] [INFO ] After 61ms 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 397 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 117 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 116 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 93 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2023-03-11 10:08:04] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 201 cols
[2023-03-11 10:08:04] [INFO ] Computed 101 place invariants in 2 ms
[2023-03-11 10:08:05] [INFO ] Implicit Places using invariants in 642 ms returned []
[2023-03-11 10:08:05] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-11 10:08:05] [INFO ] Invariant cache hit.
[2023-03-11 10:08:05] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-11 10:08:06] [INFO ] Implicit Places using invariants and state equation in 860 ms returned []
Implicit Place search using SMT with State Equation took 1503 ms to find 0 implicit places.
[2023-03-11 10:08:06] [INFO ] Redundant transitions in 139 ms returned []
[2023-03-11 10:08:06] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-11 10:08:06] [INFO ] Invariant cache hit.
[2023-03-11 10:08:08] [INFO ] Dead Transitions using invariants and state equation in 2497 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4241 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 453 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 125 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 227 ms. (steps per millisecond=44 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) 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 3) 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 3) seen :0
Running SMT prover for 3 properties.
[2023-03-11 10:08:09] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-11 10:08:09] [INFO ] Invariant cache hit.
[2023-03-11 10:08:10] [INFO ] [Real]Absence check using 100 positive place invariants in 25 ms returned sat
[2023-03-11 10:08:10] [INFO ] [Real]Absence check using 100 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 10:08:10] [INFO ] After 255ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 10:08:10] [INFO ] [Nat]Absence check using 100 positive place invariants in 29 ms returned sat
[2023-03-11 10:08:10] [INFO ] [Nat]Absence check using 100 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 10:08:10] [INFO ] After 133ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 10:08:10] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-11 10:08:10] [INFO ] After 66ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 10:08:10] [INFO ] Deduced a trap composed of 4 places in 142 ms of which 0 ms to minimize.
[2023-03-11 10:08:10] [INFO ] Deduced a trap composed of 4 places in 140 ms of which 1 ms to minimize.
[2023-03-11 10:08:10] [INFO ] Deduced a trap composed of 4 places in 139 ms of which 0 ms to minimize.
[2023-03-11 10:08:11] [INFO ] Deduced a trap composed of 4 places in 139 ms of which 0 ms to minimize.
[2023-03-11 10:08:11] [INFO ] Deduced a trap composed of 4 places in 132 ms of which 1 ms to minimize.
[2023-03-11 10:08:11] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 1 ms to minimize.
[2023-03-11 10:08:11] [INFO ] Deduced a trap composed of 4 places in 130 ms of which 1 ms to minimize.
[2023-03-11 10:08:11] [INFO ] Deduced a trap composed of 4 places in 123 ms of which 1 ms to minimize.
[2023-03-11 10:08:11] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 0 ms to minimize.
[2023-03-11 10:08:11] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 0 ms to minimize.
[2023-03-11 10:08:12] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 1 ms to minimize.
[2023-03-11 10:08:12] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1511 ms
[2023-03-11 10:08:12] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1512 ms
[2023-03-11 10:08:12] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 0 ms to minimize.
[2023-03-11 10:08:12] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 0 ms to minimize.
[2023-03-11 10:08:12] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 1 ms to minimize.
[2023-03-11 10:08:12] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 2 ms to minimize.
[2023-03-11 10:08:12] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 0 ms to minimize.
[2023-03-11 10:08:12] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 0 ms to minimize.
[2023-03-11 10:08:12] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 0 ms to minimize.
[2023-03-11 10:08:12] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 1 ms to minimize.
[2023-03-11 10:08:12] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2023-03-11 10:08:12] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2023-03-11 10:08:13] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2023-03-11 10:08:13] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1013 ms
[2023-03-11 10:08:13] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1013 ms
[2023-03-11 10:08:13] [INFO ] After 2644ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 43 ms.
[2023-03-11 10:08:13] [INFO ] After 2952ms 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 73 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 73 ms. Remains : 201/201 places, 2600/2600 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 219 ms. (steps per millisecond=45 ) properties (out of 3) 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 3) 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 3) 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 3) seen :0
Interrupted probabilistic random walk after 198135 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :{}
Probabilistic random walk after 198135 steps, saw 163993 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-11 10:08:16] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-11 10:08:16] [INFO ] Invariant cache hit.
[2023-03-11 10:08:16] [INFO ] [Real]Absence check using 100 positive place invariants in 27 ms returned sat
[2023-03-11 10:08:16] [INFO ] [Real]Absence check using 100 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 10:08:16] [INFO ] After 274ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 10:08:16] [INFO ] [Nat]Absence check using 100 positive place invariants in 24 ms returned sat
[2023-03-11 10:08:16] [INFO ] [Nat]Absence check using 100 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 10:08:17] [INFO ] After 136ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 10:08:17] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-11 10:08:17] [INFO ] After 65ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 10:08:17] [INFO ] Deduced a trap composed of 4 places in 144 ms of which 0 ms to minimize.
[2023-03-11 10:08:17] [INFO ] Deduced a trap composed of 4 places in 141 ms of which 0 ms to minimize.
[2023-03-11 10:08:17] [INFO ] Deduced a trap composed of 4 places in 132 ms of which 1 ms to minimize.
[2023-03-11 10:08:17] [INFO ] Deduced a trap composed of 4 places in 122 ms of which 0 ms to minimize.
[2023-03-11 10:08:17] [INFO ] Deduced a trap composed of 4 places in 131 ms of which 1 ms to minimize.
[2023-03-11 10:08:17] [INFO ] Deduced a trap composed of 4 places in 121 ms of which 1 ms to minimize.
[2023-03-11 10:08:18] [INFO ] Deduced a trap composed of 4 places in 118 ms of which 1 ms to minimize.
[2023-03-11 10:08:18] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 1 ms to minimize.
[2023-03-11 10:08:18] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 1 ms to minimize.
[2023-03-11 10:08:18] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 1 ms to minimize.
[2023-03-11 10:08:18] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 1 ms to minimize.
[2023-03-11 10:08:18] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1454 ms
[2023-03-11 10:08:18] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1455 ms
[2023-03-11 10:08:18] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 1 ms to minimize.
[2023-03-11 10:08:18] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 1 ms to minimize.
[2023-03-11 10:08:18] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 1 ms to minimize.
[2023-03-11 10:08:19] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 1 ms to minimize.
[2023-03-11 10:08:19] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 1 ms to minimize.
[2023-03-11 10:08:19] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 1 ms to minimize.
[2023-03-11 10:08:19] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 1 ms to minimize.
[2023-03-11 10:08:19] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2023-03-11 10:08:19] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 0 ms to minimize.
[2023-03-11 10:08:19] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2023-03-11 10:08:19] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2023-03-11 10:08:19] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1015 ms
[2023-03-11 10:08:19] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1016 ms
[2023-03-11 10:08:19] [INFO ] After 2590ms 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-11 10:08:19] [INFO ] After 2897ms 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 74 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 74 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 73 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2023-03-11 10:08:19] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-11 10:08:19] [INFO ] Invariant cache hit.
[2023-03-11 10:08:20] [INFO ] Implicit Places using invariants in 643 ms returned []
[2023-03-11 10:08:20] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-11 10:08:20] [INFO ] Invariant cache hit.
[2023-03-11 10:08:20] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-11 10:08:21] [INFO ] Implicit Places using invariants and state equation in 844 ms returned []
Implicit Place search using SMT with State Equation took 1489 ms to find 0 implicit places.
[2023-03-11 10:08:21] [INFO ] Redundant transitions in 131 ms returned []
[2023-03-11 10:08:21] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-11 10:08:21] [INFO ] Invariant cache hit.
[2023-03-11 10:08:23] [INFO ] Dead Transitions using invariants and state equation in 2234 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3936 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 10 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-11 10:08:23] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-11 10:08:23] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-11 10:08:23] [INFO ] After 12ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3
[2023-03-11 10:08:23] [INFO ] After 25ms 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-11 10:08:23] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:1
[2023-03-11 10:08:23] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-11 10:08:23] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 10:08:23] [INFO ] After 23ms 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-11 10:08:23] [INFO ] After 59ms 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 388 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 116 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 1310 ms.
Product exploration explored 100000 steps with 0 reset in 1545 ms.
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 94 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2023-03-11 10:08:27] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 201 cols
[2023-03-11 10:08:27] [INFO ] Computed 101 place invariants in 1 ms
[2023-03-11 10:08:28] [INFO ] Implicit Places using invariants in 650 ms returned []
[2023-03-11 10:08:28] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-11 10:08:28] [INFO ] Invariant cache hit.
[2023-03-11 10:08:28] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-11 10:08:29] [INFO ] Implicit Places using invariants and state equation in 819 ms returned []
Implicit Place search using SMT with State Equation took 1474 ms to find 0 implicit places.
[2023-03-11 10:08:29] [INFO ] Redundant transitions in 131 ms returned []
[2023-03-11 10:08:29] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-11 10:08:29] [INFO ] Invariant cache hit.
[2023-03-11 10:08:30] [INFO ] Dead Transitions using invariants and state equation in 1768 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3477 ms. Remains : 201/201 places, 2600/2600 transitions.
Treatment of property Dekker-PT-050-LTLCardinality-11 finished in 45036 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 18 ms. Remains 207 /207 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2023-03-11 10:08:31] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 207 cols
[2023-03-11 10:08:31] [INFO ] Computed 107 place invariants in 2 ms
[2023-03-11 10:08:32] [INFO ] Implicit Places using invariants in 686 ms returned [104, 107, 134, 155, 166, 169, 188]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 690 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 18 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 729 ms. Remains : 200/207 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 196 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 1330 ms.
Stack based approach found an accepted trace after 59 steps with 0 reset with depth 60 and stack size 60 in 5 ms.
FORMULA Dekker-PT-050-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-050-LTLCardinality-13 finished in 2289 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-11 10:08:33] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-11 10:08:33] [INFO ] Invariant cache hit.
[2023-03-11 10:08:34] [INFO ] Implicit Places using invariants in 743 ms returned [104, 107, 134, 155, 166, 169, 188]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 746 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 17 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 782 ms. Remains : 200/207 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 123 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 1287 ms.
Product exploration explored 100000 steps with 0 reset in 1407 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 110 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 3757 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))))))'
[2023-03-11 10:08:37] [INFO ] Flatten gal took : 178 ms
[2023-03-11 10:08:37] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-11 10:08:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 207 places, 2600 transitions and 17907 arcs took 32 ms.
Total runtime 94627 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1530/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : Dekker-PT-050-LTLCardinality-11

BK_STOP 1678529319474

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name Dekker-PT-050-LTLCardinality-11
ltl formula formula --ltl=/tmp/1530/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 207 places, 2600 transitions and 17907 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.300 real 0.130 user 0.070 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1530/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1530/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1530/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1530/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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="ltsminxred"
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 ltsminxred"
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 r137-smll-167819417100027"
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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;