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.r135-smll-167819413300027.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is Dekker-PT-050, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r135-smll-167819413300027
=====================================================================

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

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Dekker-PT-050
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 09:33:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-08 09:33:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 09:33:07] [INFO ] Load time of PNML (sax parser for PT used): 455 ms
[2023-03-08 09:33:07] [INFO ] Transformed 250 places.
[2023-03-08 09:33:07] [INFO ] Transformed 2600 transitions.
[2023-03-08 09:33:07] [INFO ] Found NUPN structural information;
[2023-03-08 09:33:07] [INFO ] Parsed PT model containing 250 places and 2600 transitions and 20100 arcs in 620 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 110 ms. Remains 250 /250 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2023-03-08 09:33:08] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 250 cols
[2023-03-08 09:33:08] [INFO ] Computed 150 place invariants in 28 ms
[2023-03-08 09:33:10] [INFO ] Implicit Places using invariants in 2038 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 2083 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 35 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 2229 ms. Remains : 207/250 places, 2600/2600 transitions.
Support contains 34 out of 207 places after structural reductions.
[2023-03-08 09:33:11] [INFO ] Flatten gal took : 481 ms
[2023-03-08 09:33:11] [INFO ] Flatten gal took : 210 ms
[2023-03-08 09:33:11] [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 1072 ms. (steps per millisecond=9 ) properties (out of 21) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-08 09:33:13] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 207 cols
[2023-03-08 09:33:13] [INFO ] Computed 107 place invariants in 3 ms
[2023-03-08 09:33:13] [INFO ] [Real]Absence check using 100 positive place invariants in 31 ms returned sat
[2023-03-08 09:33:13] [INFO ] [Real]Absence check using 100 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-08 09:33:13] [INFO ] After 714ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-08 09:33:14] [INFO ] [Nat]Absence check using 100 positive place invariants in 36 ms returned sat
[2023-03-08 09:33:14] [INFO ] [Nat]Absence check using 100 positive and 7 generalized place invariants in 4 ms returned sat
[2023-03-08 09:33:14] [INFO ] After 227ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-08 09:33:14] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-08 09:33:14] [INFO ] After 145ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-08 09:33:14] [INFO ] Deduced a trap composed of 4 places in 212 ms of which 9 ms to minimize.
[2023-03-08 09:33:15] [INFO ] Deduced a trap composed of 4 places in 174 ms of which 1 ms to minimize.
[2023-03-08 09:33:15] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 1 ms to minimize.
[2023-03-08 09:33:15] [INFO ] Deduced a trap composed of 4 places in 121 ms of which 1 ms to minimize.
[2023-03-08 09:33:15] [INFO ] Deduced a trap composed of 4 places in 121 ms of which 1 ms to minimize.
[2023-03-08 09:33:15] [INFO ] Deduced a trap composed of 4 places in 120 ms of which 1 ms to minimize.
[2023-03-08 09:33:15] [INFO ] Deduced a trap composed of 6 places in 133 ms of which 1 ms to minimize.
[2023-03-08 09:33:15] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 1 ms to minimize.
[2023-03-08 09:33:16] [INFO ] Deduced a trap composed of 4 places in 116 ms of which 0 ms to minimize.
[2023-03-08 09:33:16] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 1 ms to minimize.
[2023-03-08 09:33:16] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 1 ms to minimize.
[2023-03-08 09:33:16] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 1 ms to minimize.
[2023-03-08 09:33:16] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 0 ms to minimize.
[2023-03-08 09:33:16] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 1 ms to minimize.
[2023-03-08 09:33:16] [INFO ] Deduced a trap composed of 4 places in 168 ms of which 1 ms to minimize.
[2023-03-08 09:33:16] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 1 ms to minimize.
[2023-03-08 09:33:17] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 2 ms to minimize.
[2023-03-08 09:33:17] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 0 ms to minimize.
[2023-03-08 09:33:17] [INFO ] Trap strengthening procedure interrupted after too many repetitions 2439 ms
[2023-03-08 09:33:17] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2440 ms
[2023-03-08 09:33:17] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 0 ms to minimize.
[2023-03-08 09:33:17] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 0 ms to minimize.
[2023-03-08 09:33:17] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 0 ms to minimize.
[2023-03-08 09:33:17] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 1 ms to minimize.
[2023-03-08 09:33:17] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2023-03-08 09:33:17] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2023-03-08 09:33:17] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2023-03-08 09:33:17] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2023-03-08 09:33:17] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2023-03-08 09:33:17] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2023-03-08 09:33:17] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2023-03-08 09:33:17] [INFO ] Trap strengthening procedure interrupted after too many repetitions 793 ms
[2023-03-08 09:33:17] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 793 ms
[2023-03-08 09:33:18] [INFO ] After 3554ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 115 ms.
[2023-03-08 09:33:18] [INFO ] After 4198ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 11 ms.
Support contains 9 out of 207 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 2600/2600 transitions.
Applied a total of 0 rules in 187 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 189 ms. Remains : 207/207 places, 2600/2600 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 265 ms. (steps per millisecond=37 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :2
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
Running SMT prover for 5 properties.
[2023-03-08 09:33:18] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-08 09:33:18] [INFO ] Invariant cache hit.
[2023-03-08 09:33:18] [INFO ] [Real]Absence check using 100 positive place invariants in 24 ms returned sat
[2023-03-08 09:33:18] [INFO ] [Real]Absence check using 100 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-08 09:33:19] [INFO ] After 305ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-08 09:33:19] [INFO ] [Nat]Absence check using 100 positive place invariants in 20 ms returned sat
[2023-03-08 09:33:19] [INFO ] [Nat]Absence check using 100 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-08 09:33:19] [INFO ] After 141ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-08 09:33:19] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-08 09:33:19] [INFO ] After 82ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-08 09:33:19] [INFO ] Deduced a trap composed of 4 places in 130 ms of which 1 ms to minimize.
[2023-03-08 09:33:19] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 1 ms to minimize.
[2023-03-08 09:33:19] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 0 ms to minimize.
[2023-03-08 09:33:20] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 1 ms to minimize.
[2023-03-08 09:33:20] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 5 ms to minimize.
[2023-03-08 09:33:20] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 1 ms to minimize.
[2023-03-08 09:33:20] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 0 ms to minimize.
[2023-03-08 09:33:20] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 1 ms to minimize.
[2023-03-08 09:33:20] [INFO ] Deduced a trap composed of 4 places in 142 ms of which 1 ms to minimize.
[2023-03-08 09:33:20] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 0 ms to minimize.
[2023-03-08 09:33:20] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 1 ms to minimize.
[2023-03-08 09:33:20] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1380 ms
[2023-03-08 09:33:20] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1380 ms
[2023-03-08 09:33:21] [INFO ] Deduced a trap composed of 4 places in 118 ms of which 1 ms to minimize.
[2023-03-08 09:33:21] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 1 ms to minimize.
[2023-03-08 09:33:21] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 0 ms to minimize.
[2023-03-08 09:33:21] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2023-03-08 09:33:21] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2023-03-08 09:33:21] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 0 ms to minimize.
[2023-03-08 09:33:21] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 0 ms to minimize.
[2023-03-08 09:33:21] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 0 ms to minimize.
[2023-03-08 09:33:21] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2023-03-08 09:33:21] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2023-03-08 09:33:21] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 0 ms to minimize.
[2023-03-08 09:33:21] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1025 ms
[2023-03-08 09:33:21] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1025 ms
[2023-03-08 09:33:21] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2023-03-08 09:33:22] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2023-03-08 09:33:22] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2023-03-08 09:33:22] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
[2023-03-08 09:33:22] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2023-03-08 09:33:22] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2023-03-08 09:33:22] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2023-03-08 09:33:22] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2023-03-08 09:33:22] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2023-03-08 09:33:22] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2023-03-08 09:33:22] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2023-03-08 09:33:22] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2023-03-08 09:33:22] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2023-03-08 09:33:22] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2023-03-08 09:33:22] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 2 ms to minimize.
[2023-03-08 09:33:22] [INFO ] Trap strengthening procedure interrupted after too many repetitions 831 ms
[2023-03-08 09:33:22] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 833 ms
[2023-03-08 09:33:22] [INFO ] After 3401ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 63 ms.
[2023-03-08 09:33:22] [INFO ] After 3771ms 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 3 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 137 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 137 ms. Remains : 207/207 places, 2600/2600 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 512 ms. (steps per millisecond=19 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 138006 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :{}
Probabilistic random walk after 138006 steps, saw 115129 distinct states, run finished after 3003 ms. (steps per millisecond=45 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-08 09:33:26] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-08 09:33:26] [INFO ] Invariant cache hit.
[2023-03-08 09:33:26] [INFO ] [Real]Absence check using 100 positive place invariants in 23 ms returned sat
[2023-03-08 09:33:26] [INFO ] [Real]Absence check using 100 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-08 09:33:27] [INFO ] After 308ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-08 09:33:27] [INFO ] [Nat]Absence check using 100 positive place invariants in 27 ms returned sat
[2023-03-08 09:33:27] [INFO ] [Nat]Absence check using 100 positive and 7 generalized place invariants in 4 ms returned sat
[2023-03-08 09:33:27] [INFO ] After 184ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-08 09:33:27] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-08 09:33:27] [INFO ] After 111ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-08 09:33:27] [INFO ] Deduced a trap composed of 4 places in 164 ms of which 0 ms to minimize.
[2023-03-08 09:33:27] [INFO ] Deduced a trap composed of 4 places in 150 ms of which 1 ms to minimize.
[2023-03-08 09:33:28] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 0 ms to minimize.
[2023-03-08 09:33:28] [INFO ] Deduced a trap composed of 4 places in 148 ms of which 1 ms to minimize.
[2023-03-08 09:33:28] [INFO ] Deduced a trap composed of 4 places in 150 ms of which 0 ms to minimize.
[2023-03-08 09:33:28] [INFO ] Deduced a trap composed of 4 places in 142 ms of which 1 ms to minimize.
[2023-03-08 09:33:28] [INFO ] Deduced a trap composed of 4 places in 142 ms of which 1 ms to minimize.
[2023-03-08 09:33:28] [INFO ] Deduced a trap composed of 4 places in 130 ms of which 1 ms to minimize.
[2023-03-08 09:33:28] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 1 ms to minimize.
[2023-03-08 09:33:29] [INFO ] Deduced a trap composed of 4 places in 136 ms of which 1 ms to minimize.
[2023-03-08 09:33:29] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 0 ms to minimize.
[2023-03-08 09:33:29] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1600 ms
[2023-03-08 09:33:29] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1600 ms
[2023-03-08 09:33:29] [INFO ] Deduced a trap composed of 4 places in 120 ms of which 0 ms to minimize.
[2023-03-08 09:33:29] [INFO ] Deduced a trap composed of 4 places in 116 ms of which 1 ms to minimize.
[2023-03-08 09:33:29] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 1 ms to minimize.
[2023-03-08 09:33:29] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 1 ms to minimize.
[2023-03-08 09:33:29] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 0 ms to minimize.
[2023-03-08 09:33:29] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 0 ms to minimize.
[2023-03-08 09:33:29] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2023-03-08 09:33:29] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2023-03-08 09:33:30] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 1 ms to minimize.
[2023-03-08 09:33:30] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 1 ms to minimize.
[2023-03-08 09:33:30] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2023-03-08 09:33:30] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1078 ms
[2023-03-08 09:33:30] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1079 ms
[2023-03-08 09:33:30] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2023-03-08 09:33:30] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2023-03-08 09:33:30] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2023-03-08 09:33:30] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 1 ms to minimize.
[2023-03-08 09:33:30] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2023-03-08 09:33:30] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2023-03-08 09:33:30] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2023-03-08 09:33:30] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2023-03-08 09:33:30] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2023-03-08 09:33:30] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2023-03-08 09:33:30] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2023-03-08 09:33:30] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2023-03-08 09:33:31] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2023-03-08 09:33:31] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2023-03-08 09:33:31] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2023-03-08 09:33:31] [INFO ] Trap strengthening procedure interrupted after too many repetitions 894 ms
[2023-03-08 09:33:31] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 895 ms
[2023-03-08 09:33:31] [INFO ] After 3768ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 61 ms.
[2023-03-08 09:33:31] [INFO ] After 4207ms 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 94 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 94 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 80 ms. Remains 207 /207 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2023-03-08 09:33:31] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-08 09:33:31] [INFO ] Invariant cache hit.
[2023-03-08 09:33:32] [INFO ] Implicit Places using invariants in 673 ms returned [104, 107, 155, 169]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 679 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 203/207 places, 2600/2600 transitions.
Applied a total of 0 rules in 77 ms. Remains 203 /203 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 837 ms. Remains : 203/207 places, 2600/2600 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 280 ms. (steps per millisecond=35 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 155499 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :{}
Probabilistic random walk after 155499 steps, saw 129325 distinct states, run finished after 3002 ms. (steps per millisecond=51 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-08 09:33:35] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 203 cols
[2023-03-08 09:33:35] [INFO ] Computed 103 place invariants in 5 ms
[2023-03-08 09:33:35] [INFO ] [Real]Absence check using 100 positive place invariants in 23 ms returned sat
[2023-03-08 09:33:35] [INFO ] [Real]Absence check using 100 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-08 09:33:35] [INFO ] After 333ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-08 09:33:36] [INFO ] [Nat]Absence check using 100 positive place invariants in 24 ms returned sat
[2023-03-08 09:33:36] [INFO ] [Nat]Absence check using 100 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-08 09:33:36] [INFO ] After 146ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-08 09:33:36] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-08 09:33:36] [INFO ] After 82ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-08 09:33:36] [INFO ] Deduced a trap composed of 4 places in 194 ms of which 0 ms to minimize.
[2023-03-08 09:33:36] [INFO ] Deduced a trap composed of 4 places in 189 ms of which 0 ms to minimize.
[2023-03-08 09:33:36] [INFO ] Deduced a trap composed of 4 places in 139 ms of which 1 ms to minimize.
[2023-03-08 09:33:37] [INFO ] Deduced a trap composed of 4 places in 223 ms of which 1 ms to minimize.
[2023-03-08 09:33:37] [INFO ] Deduced a trap composed of 4 places in 204 ms of which 1 ms to minimize.
[2023-03-08 09:33:37] [INFO ] Deduced a trap composed of 4 places in 120 ms of which 1 ms to minimize.
[2023-03-08 09:33:37] [INFO ] Deduced a trap composed of 4 places in 154 ms of which 1 ms to minimize.
[2023-03-08 09:33:37] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 1 ms to minimize.
[2023-03-08 09:33:37] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 1 ms to minimize.
[2023-03-08 09:33:38] [INFO ] Deduced a trap composed of 4 places in 139 ms of which 0 ms to minimize.
[2023-03-08 09:33:38] [INFO ] Deduced a trap composed of 4 places in 132 ms of which 1 ms to minimize.
[2023-03-08 09:33:38] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1897 ms
[2023-03-08 09:33:38] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1897 ms
[2023-03-08 09:33:38] [INFO ] After 2079ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 65 ms.
[2023-03-08 09:33:38] [INFO ] After 2446ms 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 203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 2600/2600 transitions.
Applied a total of 0 rules in 89 ms. Remains 203 /203 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 203/203 places, 2600/2600 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 2600/2600 transitions.
Applied a total of 0 rules in 94 ms. Remains 203 /203 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2023-03-08 09:33:38] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-08 09:33:38] [INFO ] Invariant cache hit.
[2023-03-08 09:33:39] [INFO ] Implicit Places using invariants in 699 ms returned []
[2023-03-08 09:33:39] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-08 09:33:39] [INFO ] Invariant cache hit.
[2023-03-08 09:33:39] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-08 09:33:40] [INFO ] Implicit Places using invariants and state equation in 848 ms returned []
Implicit Place search using SMT with State Equation took 1550 ms to find 0 implicit places.
[2023-03-08 09:33:40] [INFO ] Redundant transitions in 203 ms returned []
[2023-03-08 09:33:40] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-08 09:33:40] [INFO ] Invariant cache hit.
[2023-03-08 09:33:41] [INFO ] Dead Transitions using invariants and state equation in 1448 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3303 ms. Remains : 203/203 places, 2600/2600 transitions.
Graph (complete) has 315 edges and 203 vertex of which 31 are kept as prefixes of interest. Removing 172 places using SCC suffix rule.1 ms
Discarding 172 places :
Also discarding 2236 output transitions
Drop transitions removed 2236 transitions
Ensure Unique test removed 3 places
Ensure Unique test removed 336 transitions
Reduce isomorphic transitions removed 336 transitions.
Iterating post reduction 0 with 339 rules applied. Total rules applied 340 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 352 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 356 place count 20 transition count 20
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 359 place count 20 transition count 17
Ensure Unique test removed 3 places
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 368 place count 14 transition count 14
Applied a total of 368 rules in 26 ms. Remains 14 /203 variables (removed 189) and now considering 14/2600 (removed 2586) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 14 rows 14 cols
[2023-03-08 09:33:41] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-08 09:33:41] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2023-03-08 09:33:41] [INFO ] After 15ms SMT Verify possible using state equation in real domain returned unsat :0 sat :5
[2023-03-08 09:33:41] [INFO ] After 32ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-08 09:33:41] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-08 09:33:41] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-08 09:33:41] [INFO ] After 20ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-08 09:33:41] [INFO ] After 37ms 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-08 09:33:41] [INFO ] After 86ms 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 317 ms. Remains 207 /207 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2023-03-08 09:33:42] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 207 cols
[2023-03-08 09:33:42] [INFO ] Computed 107 place invariants in 4 ms
[2023-03-08 09:33:43] [INFO ] Implicit Places using invariants in 693 ms returned [104, 107, 134, 155, 166, 169, 188]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 697 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 96 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 1111 ms. Remains : 200/207 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 202 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 1956 reset in 1672 ms.
Stack based approach found an accepted trace after 22 steps with 0 reset with depth 23 and stack size 23 in 2 ms.
FORMULA Dekker-PT-050-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-050-LTLCardinality-01 finished in 3080 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 20 ms. Remains 207 /207 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2023-03-08 09:33:45] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-08 09:33:45] [INFO ] Invariant cache hit.
[2023-03-08 09:33:46] [INFO ] Implicit Places using invariants in 742 ms returned [104, 107, 134, 155, 166, 169]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 745 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 785 ms. Remains : 201/207 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 305 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 25065 reset in 1472 ms.
Stack based approach found an accepted trace after 740 steps with 206 reset with depth 4 and stack size 4 in 24 ms.
FORMULA Dekker-PT-050-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-050-LTLCardinality-04 finished in 2618 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 32 ms. Remains 207 /207 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2023-03-08 09:33:47] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-08 09:33:47] [INFO ] Invariant cache hit.
[2023-03-08 09:33:48] [INFO ] Implicit Places using invariants in 818 ms returned [104, 107, 134, 155, 166, 169, 188]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 823 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 200/207 places, 2600/2600 transitions.
Applied a total of 0 rules in 32 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 888 ms. Remains : 200/207 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 260 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 940 reset in 1647 ms.
Stack based approach found an accepted trace after 139 steps with 0 reset with depth 140 and stack size 136 in 2 ms.
FORMULA Dekker-PT-050-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-050-LTLCardinality-05 finished in 2829 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 17 ms. Remains 207 /207 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2023-03-08 09:33:50] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-08 09:33:50] [INFO ] Invariant cache hit.
[2023-03-08 09:33:51] [INFO ] Implicit Places using invariants in 722 ms returned [104, 107, 134, 155, 166, 188]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 735 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 771 ms. Remains : 201/207 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 317 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 137 steps with 0 reset in 2 ms.
FORMULA Dekker-PT-050-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-050-LTLCardinality-06 finished in 1115 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 17 ms. Remains 207 /207 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2023-03-08 09:33:51] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-08 09:33:51] [INFO ] Invariant cache hit.
[2023-03-08 09:33:52] [INFO ] Implicit Places using invariants in 847 ms returned [104, 134, 166, 169, 188]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 850 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 891 ms. Remains : 202/207 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 91 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Dekker-PT-050-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s153 0) (EQ s106 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 54 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 1005 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 95 ms. Remains 207 /207 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2023-03-08 09:33:52] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-08 09:33:52] [INFO ] Invariant cache hit.
[2023-03-08 09:33:53] [INFO ] Implicit Places using invariants in 714 ms returned [104, 107, 155, 166, 169, 188]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 718 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 98 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 913 ms. Remains : 201/207 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 161 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 1668 reset in 1648 ms.
Stack based approach found an accepted trace after 11 steps with 1 reset with depth 6 and stack size 6 in 1 ms.
FORMULA Dekker-PT-050-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-050-LTLCardinality-08 finished in 2744 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 91 ms. Remains 207 /207 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2023-03-08 09:33:55] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-08 09:33:55] [INFO ] Invariant cache hit.
[2023-03-08 09:33:56] [INFO ] Implicit Places using invariants in 735 ms returned [107, 134, 155, 166, 169, 188]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 739 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 924 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 950 reset in 1406 ms.
Stack based approach found an accepted trace after 13 steps with 0 reset with depth 14 and stack size 14 in 1 ms.
FORMULA Dekker-PT-050-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-050-LTLCardinality-09 finished in 2429 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 90 ms. Remains 207 /207 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2023-03-08 09:33:58] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-08 09:33:58] [INFO ] Invariant cache hit.
[2023-03-08 09:33:58] [INFO ] Implicit Places using invariants in 714 ms returned [104, 107, 134, 155, 169, 188]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 717 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 90 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 898 ms. Remains : 201/207 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 110 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 1457 ms.
Product exploration explored 100000 steps with 0 reset in 1650 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 359 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 107 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 377 ms. (steps per millisecond=26 ) properties (out of 4) seen :1
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 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 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-08 09:34:03] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 201 cols
[2023-03-08 09:34:03] [INFO ] Computed 101 place invariants in 1 ms
[2023-03-08 09:34:03] [INFO ] [Real]Absence check using 100 positive place invariants in 24 ms returned sat
[2023-03-08 09:34:03] [INFO ] [Real]Absence check using 100 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 09:34:03] [INFO ] After 140ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-08 09:34:03] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-08 09:34:03] [INFO ] After 36ms SMT Verify possible using 50 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 09:34:03] [INFO ] After 306ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 09:34:03] [INFO ] [Nat]Absence check using 100 positive place invariants in 25 ms returned sat
[2023-03-08 09:34:03] [INFO ] [Nat]Absence check using 100 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 09:34:03] [INFO ] After 136ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 09:34:03] [INFO ] After 65ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-08 09:34:03] [INFO ] Deduced a trap composed of 4 places in 142 ms of which 0 ms to minimize.
[2023-03-08 09:34:04] [INFO ] Deduced a trap composed of 4 places in 140 ms of which 1 ms to minimize.
[2023-03-08 09:34:04] [INFO ] Deduced a trap composed of 4 places in 136 ms of which 1 ms to minimize.
[2023-03-08 09:34:04] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 1 ms to minimize.
[2023-03-08 09:34:04] [INFO ] Deduced a trap composed of 4 places in 125 ms of which 1 ms to minimize.
[2023-03-08 09:34:04] [INFO ] Deduced a trap composed of 4 places in 116 ms of which 0 ms to minimize.
[2023-03-08 09:34:04] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 1 ms to minimize.
[2023-03-08 09:34:04] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 1 ms to minimize.
[2023-03-08 09:34:05] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 0 ms to minimize.
[2023-03-08 09:34:05] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 1 ms to minimize.
[2023-03-08 09:34:05] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 1 ms to minimize.
[2023-03-08 09:34:05] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1432 ms
[2023-03-08 09:34:05] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1432 ms
[2023-03-08 09:34:05] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 1 ms to minimize.
[2023-03-08 09:34:05] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 0 ms to minimize.
[2023-03-08 09:34:05] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 0 ms to minimize.
[2023-03-08 09:34:05] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 1 ms to minimize.
[2023-03-08 09:34:05] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 1 ms to minimize.
[2023-03-08 09:34:05] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 0 ms to minimize.
[2023-03-08 09:34:05] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2023-03-08 09:34:06] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2023-03-08 09:34:06] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2023-03-08 09:34:06] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2023-03-08 09:34:06] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2023-03-08 09:34:06] [INFO ] Trap strengthening procedure interrupted after too many repetitions 931 ms
[2023-03-08 09:34:06] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 931 ms
[2023-03-08 09:34:06] [INFO ] After 2492ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 87 ms.
[2023-03-08 09:34:06] [INFO ] After 2830ms 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 70 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 70 ms. Remains : 201/201 places, 2600/2600 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 220 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 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 231948 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :{}
Probabilistic random walk after 231948 steps, saw 192150 distinct states, run finished after 3001 ms. (steps per millisecond=77 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-08 09:34:09] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-08 09:34:09] [INFO ] Invariant cache hit.
[2023-03-08 09:34:09] [INFO ] [Real]Absence check using 100 positive place invariants in 22 ms returned sat
[2023-03-08 09:34:09] [INFO ] [Real]Absence check using 100 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-08 09:34:09] [INFO ] After 236ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 09:34:10] [INFO ] [Nat]Absence check using 100 positive place invariants in 22 ms returned sat
[2023-03-08 09:34:10] [INFO ] [Nat]Absence check using 100 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-08 09:34:10] [INFO ] After 126ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 09:34:10] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-08 09:34:10] [INFO ] After 63ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-08 09:34:10] [INFO ] Deduced a trap composed of 4 places in 162 ms of which 0 ms to minimize.
[2023-03-08 09:34:10] [INFO ] Deduced a trap composed of 4 places in 131 ms of which 1 ms to minimize.
[2023-03-08 09:34:10] [INFO ] Deduced a trap composed of 4 places in 142 ms of which 0 ms to minimize.
[2023-03-08 09:34:10] [INFO ] Deduced a trap composed of 4 places in 140 ms of which 1 ms to minimize.
[2023-03-08 09:34:11] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 1 ms to minimize.
[2023-03-08 09:34:11] [INFO ] Deduced a trap composed of 4 places in 120 ms of which 1 ms to minimize.
[2023-03-08 09:34:11] [INFO ] Deduced a trap composed of 4 places in 116 ms of which 0 ms to minimize.
[2023-03-08 09:34:11] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 1 ms to minimize.
[2023-03-08 09:34:11] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 0 ms to minimize.
[2023-03-08 09:34:11] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 1 ms to minimize.
[2023-03-08 09:34:11] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 1 ms to minimize.
[2023-03-08 09:34:11] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1496 ms
[2023-03-08 09:34:11] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1496 ms
[2023-03-08 09:34:11] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 1 ms to minimize.
[2023-03-08 09:34:12] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 0 ms to minimize.
[2023-03-08 09:34:12] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 1 ms to minimize.
[2023-03-08 09:34:12] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 0 ms to minimize.
[2023-03-08 09:34:12] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
[2023-03-08 09:34:12] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 1 ms to minimize.
[2023-03-08 09:34:12] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 0 ms to minimize.
[2023-03-08 09:34:12] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2023-03-08 09:34:12] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2023-03-08 09:34:12] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 0 ms to minimize.
[2023-03-08 09:34:12] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2023-03-08 09:34:12] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1008 ms
[2023-03-08 09:34:12] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1008 ms
[2023-03-08 09:34:12] [INFO ] After 2619ms 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-08 09:34:12] [INFO ] After 2935ms 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 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 72 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-08 09:34:13] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-08 09:34:13] [INFO ] Invariant cache hit.
[2023-03-08 09:34:13] [INFO ] Implicit Places using invariants in 582 ms returned []
[2023-03-08 09:34:13] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-08 09:34:13] [INFO ] Invariant cache hit.
[2023-03-08 09:34:13] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-08 09:34:14] [INFO ] Implicit Places using invariants and state equation in 726 ms returned []
Implicit Place search using SMT with State Equation took 1310 ms to find 0 implicit places.
[2023-03-08 09:34:14] [INFO ] Redundant transitions in 243 ms returned []
[2023-03-08 09:34:14] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-08 09:34:14] [INFO ] Invariant cache hit.
[2023-03-08 09:34:16] [INFO ] Dead Transitions using invariants and state equation in 2243 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3878 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.2 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 16 ms. Remains 10 /201 variables (removed 191) and now considering 10/2600 (removed 2590) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 10 rows 10 cols
[2023-03-08 09:34:16] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-08 09:34:16] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-08 09:34:16] [INFO ] After 18ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3
[2023-03-08 09:34:16] [INFO ] After 32ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-08 09:34:16] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:1
[2023-03-08 09:34:16] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-08 09:34:16] [INFO ] After 16ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 09:34:16] [INFO ] After 31ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-08 09:34:17] [INFO ] After 80ms 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 457 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 111 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-08 09:34:17] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 201 cols
[2023-03-08 09:34:17] [INFO ] Computed 101 place invariants in 1 ms
[2023-03-08 09:34:18] [INFO ] Implicit Places using invariants in 758 ms returned []
[2023-03-08 09:34:18] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-08 09:34:18] [INFO ] Invariant cache hit.
[2023-03-08 09:34:18] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-08 09:34:19] [INFO ] Implicit Places using invariants and state equation in 1162 ms returned []
Implicit Place search using SMT with State Equation took 1924 ms to find 0 implicit places.
[2023-03-08 09:34:19] [INFO ] Redundant transitions in 134 ms returned []
[2023-03-08 09:34:19] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-08 09:34:19] [INFO ] Invariant cache hit.
[2023-03-08 09:34:22] [INFO ] Dead Transitions using invariants and state equation in 2486 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4649 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 419 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 150 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 358 ms. (steps per millisecond=27 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) 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 3) seen :0
Running SMT prover for 3 properties.
[2023-03-08 09:34:23] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-08 09:34:23] [INFO ] Invariant cache hit.
[2023-03-08 09:34:23] [INFO ] [Real]Absence check using 100 positive place invariants in 36 ms returned sat
[2023-03-08 09:34:23] [INFO ] [Real]Absence check using 100 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 09:34:23] [INFO ] After 382ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 09:34:23] [INFO ] [Nat]Absence check using 100 positive place invariants in 36 ms returned sat
[2023-03-08 09:34:23] [INFO ] [Nat]Absence check using 100 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-08 09:34:24] [INFO ] After 199ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 09:34:24] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-08 09:34:24] [INFO ] After 105ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-08 09:34:24] [INFO ] Deduced a trap composed of 4 places in 204 ms of which 1 ms to minimize.
[2023-03-08 09:34:24] [INFO ] Deduced a trap composed of 4 places in 185 ms of which 1 ms to minimize.
[2023-03-08 09:34:24] [INFO ] Deduced a trap composed of 4 places in 172 ms of which 0 ms to minimize.
[2023-03-08 09:34:25] [INFO ] Deduced a trap composed of 4 places in 173 ms of which 0 ms to minimize.
[2023-03-08 09:34:25] [INFO ] Deduced a trap composed of 4 places in 166 ms of which 1 ms to minimize.
[2023-03-08 09:34:25] [INFO ] Deduced a trap composed of 4 places in 166 ms of which 1 ms to minimize.
[2023-03-08 09:34:25] [INFO ] Deduced a trap composed of 4 places in 190 ms of which 2 ms to minimize.
[2023-03-08 09:34:25] [INFO ] Deduced a trap composed of 4 places in 168 ms of which 0 ms to minimize.
[2023-03-08 09:34:26] [INFO ] Deduced a trap composed of 4 places in 170 ms of which 1 ms to minimize.
[2023-03-08 09:34:26] [INFO ] Deduced a trap composed of 4 places in 162 ms of which 1 ms to minimize.
[2023-03-08 09:34:26] [INFO ] Deduced a trap composed of 4 places in 148 ms of which 1 ms to minimize.
[2023-03-08 09:34:26] [INFO ] Trap strengthening procedure interrupted after too many repetitions 2072 ms
[2023-03-08 09:34:26] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2073 ms
[2023-03-08 09:34:26] [INFO ] Deduced a trap composed of 4 places in 154 ms of which 1 ms to minimize.
[2023-03-08 09:34:26] [INFO ] Deduced a trap composed of 4 places in 145 ms of which 1 ms to minimize.
[2023-03-08 09:34:26] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 0 ms to minimize.
[2023-03-08 09:34:27] [INFO ] Deduced a trap composed of 4 places in 119 ms of which 1 ms to minimize.
[2023-03-08 09:34:27] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 1 ms to minimize.
[2023-03-08 09:34:27] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 0 ms to minimize.
[2023-03-08 09:34:27] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 1 ms to minimize.
[2023-03-08 09:34:27] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 1 ms to minimize.
[2023-03-08 09:34:27] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 1 ms to minimize.
[2023-03-08 09:34:27] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 0 ms to minimize.
[2023-03-08 09:34:27] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 1 ms to minimize.
[2023-03-08 09:34:27] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1396 ms
[2023-03-08 09:34:27] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1400 ms
[2023-03-08 09:34:27] [INFO ] After 3659ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 68 ms.
[2023-03-08 09:34:27] [INFO ] After 4119ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 201 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 201/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 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 74 ms. Remains : 201/201 places, 2600/2600 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 402 ms. (steps per millisecond=24 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 217464 steps, run timeout after 3001 ms. (steps per millisecond=72 ) properties seen :{}
Probabilistic random walk after 217464 steps, saw 179952 distinct states, run finished after 3001 ms. (steps per millisecond=72 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-08 09:34:31] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-08 09:34:31] [INFO ] Invariant cache hit.
[2023-03-08 09:34:31] [INFO ] [Real]Absence check using 100 positive place invariants in 22 ms returned sat
[2023-03-08 09:34:31] [INFO ] [Real]Absence check using 100 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 09:34:31] [INFO ] After 244ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 09:34:31] [INFO ] [Nat]Absence check using 100 positive place invariants in 36 ms returned sat
[2023-03-08 09:34:31] [INFO ] [Nat]Absence check using 100 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 09:34:32] [INFO ] After 191ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 09:34:32] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-08 09:34:32] [INFO ] After 95ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-08 09:34:32] [INFO ] Deduced a trap composed of 4 places in 204 ms of which 1 ms to minimize.
[2023-03-08 09:34:32] [INFO ] Deduced a trap composed of 4 places in 217 ms of which 1 ms to minimize.
[2023-03-08 09:34:32] [INFO ] Deduced a trap composed of 4 places in 214 ms of which 1 ms to minimize.
[2023-03-08 09:34:33] [INFO ] Deduced a trap composed of 4 places in 209 ms of which 1 ms to minimize.
[2023-03-08 09:34:33] [INFO ] Deduced a trap composed of 4 places in 202 ms of which 1 ms to minimize.
[2023-03-08 09:34:33] [INFO ] Deduced a trap composed of 4 places in 196 ms of which 0 ms to minimize.
[2023-03-08 09:34:33] [INFO ] Deduced a trap composed of 4 places in 188 ms of which 0 ms to minimize.
[2023-03-08 09:34:34] [INFO ] Deduced a trap composed of 4 places in 179 ms of which 0 ms to minimize.
[2023-03-08 09:34:34] [INFO ] Deduced a trap composed of 4 places in 180 ms of which 1 ms to minimize.
[2023-03-08 09:34:34] [INFO ] Deduced a trap composed of 4 places in 173 ms of which 1 ms to minimize.
[2023-03-08 09:34:34] [INFO ] Deduced a trap composed of 4 places in 171 ms of which 1 ms to minimize.
[2023-03-08 09:34:34] [INFO ] Trap strengthening procedure interrupted after too many repetitions 2308 ms
[2023-03-08 09:34:34] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2309 ms
[2023-03-08 09:34:34] [INFO ] Deduced a trap composed of 4 places in 162 ms of which 1 ms to minimize.
[2023-03-08 09:34:35] [INFO ] Deduced a trap composed of 4 places in 156 ms of which 1 ms to minimize.
[2023-03-08 09:34:35] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 1 ms to minimize.
[2023-03-08 09:34:35] [INFO ] Deduced a trap composed of 4 places in 139 ms of which 1 ms to minimize.
[2023-03-08 09:34:35] [INFO ] Deduced a trap composed of 4 places in 135 ms of which 1 ms to minimize.
[2023-03-08 09:34:35] [INFO ] Deduced a trap composed of 4 places in 122 ms of which 1 ms to minimize.
[2023-03-08 09:34:35] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 0 ms to minimize.
[2023-03-08 09:34:35] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 1 ms to minimize.
[2023-03-08 09:34:36] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 1 ms to minimize.
[2023-03-08 09:34:36] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 1 ms to minimize.
[2023-03-08 09:34:36] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 1 ms to minimize.
[2023-03-08 09:34:36] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1575 ms
[2023-03-08 09:34:36] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1576 ms
[2023-03-08 09:34:36] [INFO ] After 4061ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 69 ms.
[2023-03-08 09:34:36] [INFO ] After 4502ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 201 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 201/201 places, 2600/2600 transitions.
Applied a total of 0 rules in 112 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 114 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 115 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2023-03-08 09:34:36] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-08 09:34:36] [INFO ] Invariant cache hit.
[2023-03-08 09:34:37] [INFO ] Implicit Places using invariants in 880 ms returned []
[2023-03-08 09:34:37] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-08 09:34:37] [INFO ] Invariant cache hit.
[2023-03-08 09:34:37] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-08 09:34:38] [INFO ] Implicit Places using invariants and state equation in 1183 ms returned []
Implicit Place search using SMT with State Equation took 2065 ms to find 0 implicit places.
[2023-03-08 09:34:38] [INFO ] Redundant transitions in 139 ms returned []
[2023-03-08 09:34:38] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-08 09:34:38] [INFO ] Invariant cache hit.
[2023-03-08 09:34:41] [INFO ] Dead Transitions using invariants and state equation in 2595 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4924 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 14 ms. Remains 10 /201 variables (removed 191) and now considering 10/2600 (removed 2590) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 10 rows 10 cols
[2023-03-08 09:34:41] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-08 09:34:41] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-08 09:34:41] [INFO ] After 11ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3
[2023-03-08 09:34:41] [INFO ] After 21ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-08 09:34:41] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:1
[2023-03-08 09:34:41] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-08 09:34:41] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 09:34:41] [INFO ] After 21ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-08 09:34:41] [INFO ] After 57ms 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 416 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 162 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 1768 ms.
Product exploration explored 100000 steps with 0 reset in 1758 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 97 ms. Remains 201 /201 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2023-03-08 09:34:46] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 201 cols
[2023-03-08 09:34:46] [INFO ] Computed 101 place invariants in 5 ms
[2023-03-08 09:34:46] [INFO ] Implicit Places using invariants in 809 ms returned []
[2023-03-08 09:34:46] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-08 09:34:46] [INFO ] Invariant cache hit.
[2023-03-08 09:34:47] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-08 09:34:48] [INFO ] Implicit Places using invariants and state equation in 1245 ms returned []
Implicit Place search using SMT with State Equation took 2056 ms to find 0 implicit places.
[2023-03-08 09:34:48] [INFO ] Redundant transitions in 136 ms returned []
[2023-03-08 09:34:48] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-08 09:34:48] [INFO ] Invariant cache hit.
[2023-03-08 09:34:50] [INFO ] Dead Transitions using invariants and state equation in 2374 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4672 ms. Remains : 201/201 places, 2600/2600 transitions.
Treatment of property Dekker-PT-050-LTLCardinality-11 finished in 53052 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 26 ms. Remains 207 /207 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2023-03-08 09:34:51] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 207 cols
[2023-03-08 09:34:51] [INFO ] Computed 107 place invariants in 5 ms
[2023-03-08 09:34:51] [INFO ] Implicit Places using invariants in 712 ms returned [104, 107, 134, 155, 166, 169, 188]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 718 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 200/207 places, 2600/2600 transitions.
Applied a total of 0 rules in 28 ms. Remains 200 /200 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 773 ms. Remains : 200/207 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 281 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 1795 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 0 ms.
FORMULA Dekker-PT-050-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-050-LTLCardinality-13 finished in 2891 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 16 ms. Remains 207 /207 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2023-03-08 09:34:54] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2023-03-08 09:34:54] [INFO ] Invariant cache hit.
[2023-03-08 09:34:54] [INFO ] Implicit Places using invariants in 919 ms returned [104, 107, 134, 155, 166, 169, 188]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 924 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 30 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 971 ms. Remains : 200/207 places, 2600/2600 transitions.
Stuttering acceptance computed with spot in 168 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 1624 ms.
Product exploration explored 100000 steps with 0 reset in 1432 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 107 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 4350 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-08 09:34:58] [INFO ] Flatten gal took : 163 ms
[2023-03-08 09:34:58] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-08 09:34:58] [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 111585 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT Dekker-PT-050
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/373
LTLCardinality

BK_STOP 1678268170336

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/373/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/373/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/373/LTLCardinality.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:436
lola: rewrite Frontend/Parser/formula_rewrite.k:521
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: LAUNCH task # 1 (type EXCL) for 0 Dekker-PT-050-LTLCardinality-11
lola: time limit : 3600 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Dekker-PT-050-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3600 3/32 Dekker-PT-050-LTLCardinality-11 356478 m, 71295 m/sec, 1746731 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Dekker-PT-050-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3600 5/32 Dekker-PT-050-LTLCardinality-11 704250 m, 69554 m/sec, 3524272 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Dekker-PT-050-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3600 8/32 Dekker-PT-050-LTLCardinality-11 1081644 m, 75478 m/sec, 5447060 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Dekker-PT-050-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/3600 10/32 Dekker-PT-050-LTLCardinality-11 1439602 m, 71591 m/sec, 7442188 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Dekker-PT-050-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/3600 12/32 Dekker-PT-050-LTLCardinality-11 1807562 m, 73592 m/sec, 9406729 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Dekker-PT-050-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/3600 15/32 Dekker-PT-050-LTLCardinality-11 2192566 m, 77000 m/sec, 11353893 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Dekker-PT-050-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/3600 17/32 Dekker-PT-050-LTLCardinality-11 2548522 m, 71191 m/sec, 13361459 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Dekker-PT-050-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 40/3600 19/32 Dekker-PT-050-LTLCardinality-11 2897598 m, 69815 m/sec, 15349279 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Dekker-PT-050-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 45/3600 22/32 Dekker-PT-050-LTLCardinality-11 3256512 m, 71782 m/sec, 17303915 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Dekker-PT-050-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 50/3600 24/32 Dekker-PT-050-LTLCardinality-11 3609314 m, 70560 m/sec, 19291658 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Dekker-PT-050-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 55/3600 26/32 Dekker-PT-050-LTLCardinality-11 3979945 m, 74126 m/sec, 21239170 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Dekker-PT-050-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 60/3600 29/32 Dekker-PT-050-LTLCardinality-11 4357811 m, 75573 m/sec, 23172740 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Dekker-PT-050-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 65/3600 31/32 Dekker-PT-050-LTLCardinality-11 4716063 m, 71650 m/sec, 25170245 t fired, .

Time elapsed: 65 secs. Pages in use: 31
# running tasks: 1 of 4 Visible: 1
lola: CANCELED task # 1 (type EXCL) for Dekker-PT-050-LTLCardinality-11 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Dekker-PT-050-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0

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

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

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Dekker-PT-050-LTLCardinality-11: LTL unknown AGGR


Time elapsed: 70 secs. Pages in use: 32

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is 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 r135-smll-167819413300027"
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 ;