Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r153-tall-171631151000062.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is Dekker-PT-020, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r153-tall-171631151000062
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 804K
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 22 14:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 11 20:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 175K Apr 11 20:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 11 20:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 97K Apr 11 20:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 247K May 18 16:42 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-020-LTLCardinality-00
FORMULA_NAME Dekker-PT-020-LTLCardinality-01
FORMULA_NAME Dekker-PT-020-LTLCardinality-02
FORMULA_NAME Dekker-PT-020-LTLCardinality-03
FORMULA_NAME Dekker-PT-020-LTLCardinality-04
FORMULA_NAME Dekker-PT-020-LTLCardinality-05
FORMULA_NAME Dekker-PT-020-LTLCardinality-06
FORMULA_NAME Dekker-PT-020-LTLCardinality-07
FORMULA_NAME Dekker-PT-020-LTLCardinality-08
FORMULA_NAME Dekker-PT-020-LTLCardinality-09
FORMULA_NAME Dekker-PT-020-LTLCardinality-10
FORMULA_NAME Dekker-PT-020-LTLCardinality-11
FORMULA_NAME Dekker-PT-020-LTLCardinality-12
FORMULA_NAME Dekker-PT-020-LTLCardinality-13
FORMULA_NAME Dekker-PT-020-LTLCardinality-14
FORMULA_NAME Dekker-PT-020-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716414121803

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=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Dekker-PT-020
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-22 21:42:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 21:42:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 21:42:03] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2024-05-22 21:42:03] [INFO ] Transformed 100 places.
[2024-05-22 21:42:03] [INFO ] Transformed 440 transitions.
[2024-05-22 21:42:03] [INFO ] Found NUPN structural information;
[2024-05-22 21:42:03] [INFO ] Parsed PT model containing 100 places and 440 transitions and 3240 arcs in 137 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Dekker-PT-020-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-020-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-020-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-020-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 440/440 transitions.
Applied a total of 0 rules in 18 ms. Remains 100 /100 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2024-05-22 21:42:03] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 100 cols
[2024-05-22 21:42:03] [INFO ] Computed 60 invariants in 14 ms
[2024-05-22 21:42:03] [INFO ] Implicit Places using invariants in 289 ms returned [40, 46, 52, 55, 58, 61, 64, 70, 76, 79, 85, 94]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 316 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 88/100 places, 440/440 transitions.
Applied a total of 0 rules in 16 ms. Remains 88 /88 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 350 ms. Remains : 88/100 places, 440/440 transitions.
Support contains 36 out of 88 places after structural reductions.
[2024-05-22 21:42:04] [INFO ] Flatten gal took : 72 ms
[2024-05-22 21:42:04] [INFO ] Flatten gal took : 40 ms
[2024-05-22 21:42:04] [INFO ] Input system was already deterministic with 440 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 259 ms. (steps per millisecond=38 ) properties (out of 25) seen :20
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2024-05-22 21:42:04] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 88 cols
[2024-05-22 21:42:04] [INFO ] Computed 48 invariants in 6 ms
[2024-05-22 21:42:04] [INFO ] [Real]Absence check using 40 positive place invariants in 5 ms returned sat
[2024-05-22 21:42:04] [INFO ] [Real]Absence check using 40 positive and 8 generalized place invariants in 1 ms returned sat
[2024-05-22 21:42:04] [INFO ] After 46ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:2
[2024-05-22 21:42:04] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-22 21:42:04] [INFO ] After 54ms SMT Verify possible using 20 Read/Feed constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-22 21:42:04] [INFO ] After 208ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-22 21:42:05] [INFO ] [Nat]Absence check using 40 positive place invariants in 106 ms returned sat
[2024-05-22 21:42:05] [INFO ] [Nat]Absence check using 40 positive and 8 generalized place invariants in 2 ms returned sat
[2024-05-22 21:42:05] [INFO ] After 72ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-22 21:42:05] [INFO ] After 25ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-22 21:42:05] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 4 ms to minimize.
[2024-05-22 21:42:05] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-22 21:42:05] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-05-22 21:42:05] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-05-22 21:42:05] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 0 ms to minimize.
[2024-05-22 21:42:05] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-22 21:42:05] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-22 21:42:05] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-22 21:42:05] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-22 21:42:05] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-22 21:42:05] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
[2024-05-22 21:42:05] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-22 21:42:05] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-22 21:42:05] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-22 21:42:05] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-22 21:42:05] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2024-05-22 21:42:05] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 0 ms to minimize.
[2024-05-22 21:42:06] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-22 21:42:06] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-22 21:42:06] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-22 21:42:06] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-05-22 21:42:06] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-22 21:42:06] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-05-22 21:42:06] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
[2024-05-22 21:42:06] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-22 21:42:06] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-22 21:42:06] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-22 21:42:06] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-22 21:42:06] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2024-05-22 21:42:06] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-22 21:42:06] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 1037 ms
[2024-05-22 21:42:06] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-22 21:42:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2024-05-22 21:42:06] [INFO ] After 1130ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 23 ms.
[2024-05-22 21:42:06] [INFO ] After 1442ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 8 out of 88 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 440/440 transitions.
Applied a total of 0 rules in 28 ms. Remains 88 /88 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 88/88 places, 440/440 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 179 ms. (steps per millisecond=55 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 285747 steps, run timeout after 3001 ms. (steps per millisecond=95 ) properties seen :{}
Probabilistic random walk after 285747 steps, saw 156804 distinct states, run finished after 3009 ms. (steps per millisecond=94 ) properties seen :0
Running SMT prover for 5 properties.
[2024-05-22 21:42:09] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
[2024-05-22 21:42:09] [INFO ] Invariant cache hit.
[2024-05-22 21:42:09] [INFO ] [Real]Absence check using 40 positive place invariants in 4 ms returned sat
[2024-05-22 21:42:09] [INFO ] [Real]Absence check using 40 positive and 8 generalized place invariants in 1 ms returned sat
[2024-05-22 21:42:09] [INFO ] After 46ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:2
[2024-05-22 21:42:09] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-22 21:42:09] [INFO ] After 19ms SMT Verify possible using 20 Read/Feed constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-22 21:42:09] [INFO ] After 143ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-22 21:42:09] [INFO ] [Nat]Absence check using 40 positive place invariants in 8 ms returned sat
[2024-05-22 21:42:09] [INFO ] [Nat]Absence check using 40 positive and 8 generalized place invariants in 2 ms returned sat
[2024-05-22 21:42:09] [INFO ] After 37ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-22 21:42:10] [INFO ] After 24ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-22 21:42:10] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2024-05-22 21:42:10] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
[2024-05-22 21:42:10] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 4 ms to minimize.
[2024-05-22 21:42:10] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 0 ms to minimize.
[2024-05-22 21:42:10] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-22 21:42:10] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-22 21:42:10] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
[2024-05-22 21:42:10] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-22 21:42:10] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-22 21:42:10] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-22 21:42:10] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-22 21:42:10] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-22 21:42:10] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-22 21:42:10] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-22 21:42:10] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-05-22 21:42:10] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-22 21:42:10] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-22 21:42:10] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
[2024-05-22 21:42:10] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-22 21:42:10] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2024-05-22 21:42:10] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-22 21:42:10] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 2 ms to minimize.
[2024-05-22 21:42:10] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2024-05-22 21:42:10] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 5 ms to minimize.
[2024-05-22 21:42:10] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 865 ms
[2024-05-22 21:42:10] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-22 21:42:10] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-22 21:42:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 64 ms
[2024-05-22 21:42:10] [INFO ] After 993ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 24 ms.
[2024-05-22 21:42:11] [INFO ] After 1118ms 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 1 ms.
Support contains 8 out of 88 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 440/440 transitions.
Applied a total of 0 rules in 25 ms. Remains 88 /88 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 88/88 places, 440/440 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 440/440 transitions.
Applied a total of 0 rules in 14 ms. Remains 88 /88 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2024-05-22 21:42:11] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
[2024-05-22 21:42:11] [INFO ] Invariant cache hit.
[2024-05-22 21:42:11] [INFO ] Implicit Places using invariants in 124 ms returned [42, 47, 60, 65, 72, 77, 80]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 126 ms to find 7 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 81/88 places, 440/440 transitions.
Applied a total of 0 rules in 13 ms. Remains 81 /81 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 153 ms. Remains : 81/88 places, 440/440 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 5) seen :2
Running SMT prover for 3 properties.
[2024-05-22 21:42:11] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 81 cols
[2024-05-22 21:42:11] [INFO ] Computed 41 invariants in 0 ms
[2024-05-22 21:42:11] [INFO ] [Real]Absence check using 40 positive place invariants in 4 ms returned sat
[2024-05-22 21:42:11] [INFO ] [Real]Absence check using 40 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-22 21:42:11] [INFO ] After 38ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:1
[2024-05-22 21:42:11] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-22 21:42:11] [INFO ] After 13ms SMT Verify possible using 20 Read/Feed constraints in real domain returned unsat :0 sat :1 real:2
[2024-05-22 21:42:11] [INFO ] After 22ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-22 21:42:11] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-22 21:42:11] [INFO ] [Nat]Absence check using 40 positive place invariants in 5 ms returned sat
[2024-05-22 21:42:11] [INFO ] [Nat]Absence check using 40 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 21:42:11] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-22 21:42:11] [INFO ] After 14ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-22 21:42:11] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-05-22 21:42:11] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-22 21:42:11] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-22 21:42:11] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-22 21:42:11] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-22 21:42:11] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-22 21:42:11] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 2 ms to minimize.
[2024-05-22 21:42:11] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-22 21:42:11] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 2 ms to minimize.
[2024-05-22 21:42:11] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 4 ms to minimize.
[2024-05-22 21:42:11] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-22 21:42:11] [INFO ] Trap strengthening procedure interrupted after too many repetitions 359 ms
[2024-05-22 21:42:11] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 359 ms
[2024-05-22 21:42:12] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-22 21:42:12] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-22 21:42:12] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-22 21:42:12] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-22 21:42:12] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-22 21:42:12] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-22 21:42:12] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-22 21:42:12] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 177 ms
[2024-05-22 21:42:12] [INFO ] After 570ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 16 ms.
[2024-05-22 21:42:12] [INFO ] After 659ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 1 ms.
Support contains 6 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 440/440 transitions.
Applied a total of 0 rules in 13 ms. Remains 81 /81 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 81/81 places, 440/440 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-22 21:42:12] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
[2024-05-22 21:42:12] [INFO ] Invariant cache hit.
[2024-05-22 21:42:12] [INFO ] [Real]Absence check using 40 positive place invariants in 4 ms returned sat
[2024-05-22 21:42:12] [INFO ] [Real]Absence check using 40 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-22 21:42:12] [INFO ] After 24ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2024-05-22 21:42:12] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-22 21:42:12] [INFO ] After 8ms SMT Verify possible using 20 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 21:42:12] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 21:42:12] [INFO ] [Nat]Absence check using 40 positive place invariants in 4 ms returned sat
[2024-05-22 21:42:12] [INFO ] [Nat]Absence check using 40 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 21:42:12] [INFO ] After 23ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 21:42:12] [INFO ] After 9ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-22 21:42:12] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-05-22 21:42:12] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-22 21:42:12] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-22 21:42:12] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-22 21:42:12] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-22 21:42:12] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-22 21:42:12] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-22 21:42:12] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-22 21:42:12] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-22 21:42:12] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-22 21:42:12] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-22 21:42:12] [INFO ] Trap strengthening procedure interrupted after too many repetitions 336 ms
[2024-05-22 21:42:12] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 336 ms
[2024-05-22 21:42:12] [INFO ] After 359ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 11 ms.
[2024-05-22 21:42:12] [INFO ] After 432ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 440/440 transitions.
Applied a total of 0 rules in 13 ms. Remains 81 /81 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 81/81 places, 440/440 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 638253 steps, run timeout after 3001 ms. (steps per millisecond=212 ) properties seen :{}
Probabilistic random walk after 638253 steps, saw 334403 distinct states, run finished after 3001 ms. (steps per millisecond=212 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-22 21:42:15] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
[2024-05-22 21:42:15] [INFO ] Invariant cache hit.
[2024-05-22 21:42:16] [INFO ] [Real]Absence check using 40 positive place invariants in 4 ms returned sat
[2024-05-22 21:42:16] [INFO ] [Real]Absence check using 40 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-22 21:42:16] [INFO ] After 24ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2024-05-22 21:42:16] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-22 21:42:16] [INFO ] After 6ms SMT Verify possible using 20 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 21:42:16] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 21:42:16] [INFO ] [Nat]Absence check using 40 positive place invariants in 5 ms returned sat
[2024-05-22 21:42:16] [INFO ] [Nat]Absence check using 40 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 21:42:16] [INFO ] After 37ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 21:42:16] [INFO ] After 10ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-22 21:42:16] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-22 21:42:16] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-22 21:42:16] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-22 21:42:16] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-22 21:42:16] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-22 21:42:16] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-22 21:42:16] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-22 21:42:16] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-22 21:42:16] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-22 21:42:16] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-22 21:42:16] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-22 21:42:16] [INFO ] Trap strengthening procedure interrupted after too many repetitions 303 ms
[2024-05-22 21:42:16] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 303 ms
[2024-05-22 21:42:16] [INFO ] After 323ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 8 ms.
[2024-05-22 21:42:16] [INFO ] After 408ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 440/440 transitions.
Applied a total of 0 rules in 8 ms. Remains 81 /81 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 81/81 places, 440/440 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 440/440 transitions.
Applied a total of 0 rules in 7 ms. Remains 81 /81 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2024-05-22 21:42:16] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
[2024-05-22 21:42:16] [INFO ] Invariant cache hit.
[2024-05-22 21:42:16] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-22 21:42:16] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
[2024-05-22 21:42:16] [INFO ] Invariant cache hit.
[2024-05-22 21:42:16] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-22 21:42:16] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
[2024-05-22 21:42:16] [INFO ] Redundant transitions in 32 ms returned []
[2024-05-22 21:42:16] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
[2024-05-22 21:42:16] [INFO ] Invariant cache hit.
[2024-05-22 21:42:16] [INFO ] Dead Transitions using invariants and state equation in 165 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 439 ms. Remains : 81/81 places, 440/440 transitions.
Graph (complete) has 125 edges and 81 vertex of which 17 are kept as prefixes of interest. Removing 64 places using SCC suffix rule.1 ms
Discarding 64 places :
Also discarding 352 output transitions
Drop transitions removed 352 transitions
Ensure Unique test removed 1 places
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 0 with 73 rules applied. Total rules applied 74 place count 16 transition count 16
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 80 place count 12 transition count 14
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 82 place count 12 transition count 12
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 84 place count 12 transition count 10
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 90 place count 8 transition count 8
Applied a total of 90 rules in 7 ms. Remains 8 /81 variables (removed 73) and now considering 8/440 (removed 432) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 8 rows 8 cols
[2024-05-22 21:42:16] [INFO ] Computed 4 invariants in 1 ms
[2024-05-22 21:42:16] [INFO ] [Real]Absence check using 4 positive place invariants in 0 ms returned sat
[2024-05-22 21:42:16] [INFO ] After 5ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-05-22 21:42:16] [INFO ] After 8ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 2 ms.
[2024-05-22 21:42:16] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
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.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 440/440 transitions.
Applied a total of 0 rules in 14 ms. Remains 88 /88 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2024-05-22 21:42:17] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 88 cols
[2024-05-22 21:42:17] [INFO ] Computed 48 invariants in 1 ms
[2024-05-22 21:42:17] [INFO ] Implicit Places using invariants in 117 ms returned [42, 47, 60, 65, 72, 77, 80, 85]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 118 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 80/88 places, 440/440 transitions.
Applied a total of 0 rules in 13 ms. Remains 80 /80 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 145 ms. Remains : 80/88 places, 440/440 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 159 ms :[(NOT p0)]
Running random walk in product with property : Dekker-PT-020-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s52 0) (EQ s54 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 534 ms.
Stack based approach found an accepted trace after 129 steps with 0 reset with depth 130 and stack size 126 in 1 ms.
FORMULA Dekker-PT-020-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-020-LTLCardinality-01 finished in 917 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 440/440 transitions.
Applied a total of 0 rules in 2 ms. Remains 88 /88 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2024-05-22 21:42:18] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
[2024-05-22 21:42:18] [INFO ] Invariant cache hit.
[2024-05-22 21:42:18] [INFO ] Implicit Places using invariants in 120 ms returned [42, 60, 65, 72, 77, 85]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 122 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 82/88 places, 440/440 transitions.
Applied a total of 0 rules in 1 ms. Remains 82 /82 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 125 ms. Remains : 82/88 places, 440/440 transitions.
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Dekker-PT-020-LTLCardinality-02 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 s75 0) (EQ s46 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 33 steps with 0 reset in 1 ms.
FORMULA Dekker-PT-020-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-020-LTLCardinality-02 finished in 222 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&(G(p1) U p2))))'
Support contains 4 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 440/440 transitions.
Applied a total of 0 rules in 3 ms. Remains 88 /88 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2024-05-22 21:42:18] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
[2024-05-22 21:42:18] [INFO ] Invariant cache hit.
[2024-05-22 21:42:18] [INFO ] Implicit Places using invariants in 115 ms returned [42, 47, 60, 72, 77, 80, 85]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 116 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 81/88 places, 440/440 transitions.
Applied a total of 0 rules in 1 ms. Remains 81 /81 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 123 ms. Remains : 81/88 places, 440/440 transitions.
Stuttering acceptance computed with spot in 250 ms :[(NOT p1), (OR (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p2)), true, (OR (NOT p0) (NOT p2))]
Running random walk in product with property : Dekker-PT-020-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 2}, { cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=1 dest: 3}], [{ cond=(AND p2 p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p1:(OR (EQ s43 0) (EQ s25 1)), p0:(EQ s62 1), p2:(NEQ s40 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7 steps with 3 reset in 0 ms.
FORMULA Dekker-PT-020-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-020-LTLCardinality-04 finished in 394 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U (X(X(F(p1)))||(!p2 U (p3||G(!p2))))))'
Support contains 8 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 440/440 transitions.
Applied a total of 0 rules in 2 ms. Remains 88 /88 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2024-05-22 21:42:18] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
[2024-05-22 21:42:18] [INFO ] Invariant cache hit.
[2024-05-22 21:42:18] [INFO ] Implicit Places using invariants in 115 ms returned [42, 47, 65, 72, 77, 80, 85]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 117 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 81/88 places, 440/440 transitions.
Applied a total of 0 rules in 2 ms. Remains 81 /81 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 121 ms. Remains : 81/88 places, 440/440 transitions.
Stuttering acceptance computed with spot in 253 ms :[(AND (NOT p1) p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) p3)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) p2 (NOT p3))]
Running random walk in product with property : Dekker-PT-020-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={} source=1 dest: 4}, { cond=(NOT p3), acceptance={} source=1 dest: 5}], [{ cond=(OR (AND p3 (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={} source=2 dest: 3}, { cond=(OR p3 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(NOT p1), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p3) p2 (NOT p0) (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p3:(AND (NOT (OR (EQ s42 0) (EQ s74 1))) (NOT (OR (EQ s6 0) (EQ s58 1)))), p2:(OR (EQ s6 0) (EQ s58 1)), p0:(OR (EQ s62 0) (EQ s5 1)), p1:(OR (EQ s78 0) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 39391 reset in 382 ms.
Stack based approach found an accepted trace after 15922 steps with 6288 reset with depth 4 and stack size 4 in 64 ms.
FORMULA Dekker-PT-020-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-020-LTLCardinality-06 finished in 840 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 4 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 440/440 transitions.
Applied a total of 0 rules in 3 ms. Remains 88 /88 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2024-05-22 21:42:19] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
[2024-05-22 21:42:19] [INFO ] Invariant cache hit.
[2024-05-22 21:42:19] [INFO ] Implicit Places using invariants in 114 ms returned [42, 47, 60, 65, 72, 77, 80, 85]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 116 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 80/88 places, 440/440 transitions.
Applied a total of 0 rules in 1 ms. Remains 80 /80 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 121 ms. Remains : 80/88 places, 440/440 transitions.
Stuttering acceptance computed with spot in 134 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Dekker-PT-020-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 s27 0) (EQ s42 1) (EQ s50 0) (EQ s68 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 172 steps with 0 reset in 2 ms.
FORMULA Dekker-PT-020-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-020-LTLCardinality-07 finished in 286 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0) U p1)))'
Support contains 2 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 440/440 transitions.
Applied a total of 0 rules in 2 ms. Remains 88 /88 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2024-05-22 21:42:19] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
[2024-05-22 21:42:19] [INFO ] Invariant cache hit.
[2024-05-22 21:42:20] [INFO ] Implicit Places using invariants in 116 ms returned [42, 47, 60, 65, 72, 77, 80, 85]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 117 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 80/88 places, 440/440 transitions.
Applied a total of 0 rules in 2 ms. Remains 80 /80 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 122 ms. Remains : 80/88 places, 440/440 transitions.
Stuttering acceptance computed with spot in 155 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : Dekker-PT-020-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s13 1), p0:(EQ s21 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 4766 reset in 393 ms.
Stack based approach found an accepted trace after 14 steps with 0 reset with depth 15 and stack size 15 in 0 ms.
FORMULA Dekker-PT-020-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-020-LTLCardinality-08 finished in 686 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((((p0 U !p1) U X(p2))&&X(X(p3)))))'
Support contains 5 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 440/440 transitions.
Applied a total of 0 rules in 3 ms. Remains 88 /88 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2024-05-22 21:42:20] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
[2024-05-22 21:42:20] [INFO ] Invariant cache hit.
[2024-05-22 21:42:20] [INFO ] Implicit Places using invariants in 127 ms returned [42, 47, 60, 65, 72, 80, 85]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 128 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 81/88 places, 440/440 transitions.
Applied a total of 0 rules in 2 ms. Remains 81 /81 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 133 ms. Remains : 81/88 places, 440/440 transitions.
Stuttering acceptance computed with spot in 295 ms :[(OR (NOT p3) (NOT p2)), (NOT p2), (NOT p3), (NOT p2), (AND p1 (NOT p2)), true, (NOT p3), p1]
Running random walk in product with property : Dekker-PT-020-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(OR (NOT p1) p0), acceptance={} source=0 dest: 3}, { cond=(AND p1 p0), acceptance={} source=0 dest: 4}], [{ cond=(NOT p2), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 6}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), acceptance={0} source=3 dest: 3}, { cond=(AND p1 p0 (NOT p2)), acceptance={0} source=3 dest: 4}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=4 dest: 7}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p3), acceptance={} source=6 dest: 5}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=7 dest: 5}, { cond=(AND p1 p0), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p1:(NEQ s40 1), p0:(OR (EQ s57 0) (EQ s0 1)), p2:(OR (EQ s72 0) (EQ s14 1)), p3:(EQ s40 0)], 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 8 steps with 2 reset in 0 ms.
FORMULA Dekker-PT-020-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-020-LTLCardinality-09 finished in 455 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(!p0)) U p1)))'
Support contains 4 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 440/440 transitions.
Applied a total of 0 rules in 3 ms. Remains 88 /88 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2024-05-22 21:42:21] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
[2024-05-22 21:42:21] [INFO ] Invariant cache hit.
[2024-05-22 21:42:21] [INFO ] Implicit Places using invariants in 117 ms returned [42, 47, 60, 65, 77, 80]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 118 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 82/88 places, 440/440 transitions.
Applied a total of 0 rules in 1 ms. Remains 82 /82 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 123 ms. Remains : 82/88 places, 440/440 transitions.
Stuttering acceptance computed with spot in 169 ms :[p0, (NOT p1), true, (NOT p1), (OR (NOT p1) p0)]
Running random walk in product with property : Dekker-PT-020-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=4 dest: 0}, { cond=p0, acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(OR (EQ s70 0) (EQ s79 1)), p1:(OR (EQ s26 0) (EQ s68 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Dekker-PT-020-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-020-LTLCardinality-10 finished in 308 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 440/440 transitions.
Applied a total of 0 rules in 1 ms. Remains 88 /88 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2024-05-22 21:42:21] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
[2024-05-22 21:42:21] [INFO ] Invariant cache hit.
[2024-05-22 21:42:21] [INFO ] Implicit Places using invariants in 112 ms returned [42, 47, 60, 65, 72, 77, 80, 85]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 113 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 80/88 places, 440/440 transitions.
Applied a total of 0 rules in 2 ms. Remains 80 /80 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 118 ms. Remains : 80/88 places, 440/440 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : Dekker-PT-020-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s26 0) (EQ s74 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Dekker-PT-020-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-020-LTLCardinality-11 finished in 220 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 1 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 440/440 transitions.
Applied a total of 0 rules in 1 ms. Remains 88 /88 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2024-05-22 21:42:21] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
[2024-05-22 21:42:21] [INFO ] Invariant cache hit.
[2024-05-22 21:42:21] [INFO ] Implicit Places using invariants in 115 ms returned [42, 47, 60, 65, 72, 77, 80, 85]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 117 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 80/88 places, 440/440 transitions.
Applied a total of 0 rules in 1 ms. Remains 80 /80 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 121 ms. Remains : 80/88 places, 440/440 transitions.
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Dekker-PT-020-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(EQ s57 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 24686 reset in 362 ms.
Stack based approach found an accepted trace after 1524 steps with 372 reset with depth 9 and stack size 9 in 7 ms.
FORMULA Dekker-PT-020-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-020-LTLCardinality-12 finished in 637 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(F(p0))||(F(p0)&&F(!p1))) U (p2 U p3)))'
Support contains 6 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 440/440 transitions.
Applied a total of 0 rules in 12 ms. Remains 88 /88 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2024-05-22 21:42:22] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
[2024-05-22 21:42:22] [INFO ] Invariant cache hit.
[2024-05-22 21:42:22] [INFO ] Implicit Places using invariants in 122 ms returned [47, 60, 72, 77, 80, 85]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 136 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 82/88 places, 440/440 transitions.
Applied a total of 0 rules in 10 ms. Remains 82 /82 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 158 ms. Remains : 82/88 places, 440/440 transitions.
Stuttering acceptance computed with spot in 144 ms :[(NOT p3), (NOT p0), (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Running random walk in product with property : Dekker-PT-020-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p3:(OR (EQ s63 0) (EQ s11 1)), p2:(OR (EQ s42 0) (EQ s75 1)), p0:(AND (OR (EQ s42 0) (EQ s75 1)) (OR (EQ s61 0) (EQ s3 1))), p1:(OR (EQ s61 0) (EQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 6007 reset in 429 ms.
Stack based approach found an accepted trace after 136 steps with 6 reset with depth 68 and stack size 68 in 1 ms.
FORMULA Dekker-PT-020-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-020-LTLCardinality-14 finished in 756 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(p1)))'
Support contains 3 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 440/440 transitions.
Applied a total of 0 rules in 2 ms. Remains 88 /88 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2024-05-22 21:42:22] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
[2024-05-22 21:42:22] [INFO ] Invariant cache hit.
[2024-05-22 21:42:23] [INFO ] Implicit Places using invariants in 108 ms returned [42, 47, 60, 65, 72, 77, 80, 85]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 109 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 80/88 places, 440/440 transitions.
Applied a total of 0 rules in 1 ms. Remains 80 /80 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 112 ms. Remains : 80/88 places, 440/440 transitions.
Stuttering acceptance computed with spot in 413 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : Dekker-PT-020-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s17 1) (OR (EQ s33 0) (EQ s1 1))), p1:(OR (EQ s33 0) (EQ s1 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Dekker-PT-020-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-020-LTLCardinality-15 finished in 547 ms.
All properties solved by simple procedures.
Total runtime 20157 ms.

BK_STOP 1716414147279

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Dekker-PT-020"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is Dekker-PT-020, 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 r153-tall-171631151000062"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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