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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 7.8K Feb 26 15:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K Feb 26 15:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 15:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 15:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 15:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Feb 26 15:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Feb 26 15:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Feb 26 15:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:50 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 43K 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 DES-PT-10a-LTLCardinality-00
FORMULA_NAME DES-PT-10a-LTLCardinality-01
FORMULA_NAME DES-PT-10a-LTLCardinality-02
FORMULA_NAME DES-PT-10a-LTLCardinality-03
FORMULA_NAME DES-PT-10a-LTLCardinality-04
FORMULA_NAME DES-PT-10a-LTLCardinality-05
FORMULA_NAME DES-PT-10a-LTLCardinality-06
FORMULA_NAME DES-PT-10a-LTLCardinality-07
FORMULA_NAME DES-PT-10a-LTLCardinality-08
FORMULA_NAME DES-PT-10a-LTLCardinality-09
FORMULA_NAME DES-PT-10a-LTLCardinality-10
FORMULA_NAME DES-PT-10a-LTLCardinality-11
FORMULA_NAME DES-PT-10a-LTLCardinality-12
FORMULA_NAME DES-PT-10a-LTLCardinality-13
FORMULA_NAME DES-PT-10a-LTLCardinality-14
FORMULA_NAME DES-PT-10a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678264470783

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-10a
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-08 08:34:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-08 08:34:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 08:34:32] [INFO ] Load time of PNML (sax parser for PT used): 43 ms
[2023-03-08 08:34:32] [INFO ] Transformed 155 places.
[2023-03-08 08:34:32] [INFO ] Transformed 112 transitions.
[2023-03-08 08:34:32] [INFO ] Found NUPN structural information;
[2023-03-08 08:34:32] [INFO ] Parsed PT model containing 155 places and 112 transitions and 552 arcs in 105 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 7 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
FORMULA DES-PT-10a-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10a-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA DES-PT-10a-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10a-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 98/98 transitions.
Applied a total of 0 rules in 22 ms. Remains 155 /155 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 155 cols
[2023-03-08 08:34:32] [INFO ] Computed 59 place invariants in 20 ms
[2023-03-08 08:34:32] [INFO ] Implicit Places using invariants in 280 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 304 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 154/155 places, 98/98 transitions.
Applied a total of 0 rules in 7 ms. Remains 154 /154 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 334 ms. Remains : 154/155 places, 98/98 transitions.
Support contains 29 out of 154 places after structural reductions.
[2023-03-08 08:34:32] [INFO ] Flatten gal took : 35 ms
[2023-03-08 08:34:32] [INFO ] Flatten gal took : 15 ms
[2023-03-08 08:34:33] [INFO ] Input system was already deterministic with 98 transitions.
Incomplete random walk after 10000 steps, including 222 resets, run finished after 285 ms. (steps per millisecond=35 ) properties (out of 17) seen :14
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 47 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 98 rows 154 cols
[2023-03-08 08:34:33] [INFO ] Computed 58 place invariants in 7 ms
[2023-03-08 08:34:33] [INFO ] [Real]Absence check using 33 positive place invariants in 5 ms returned sat
[2023-03-08 08:34:33] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 6 ms returned sat
[2023-03-08 08:34:33] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 08:34:33] [INFO ] [Nat]Absence check using 33 positive place invariants in 5 ms returned sat
[2023-03-08 08:34:33] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 105 ms returned sat
[2023-03-08 08:34:33] [INFO ] After 138ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 08:34:33] [INFO ] After 189ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 66 ms.
[2023-03-08 08:34:33] [INFO ] After 430ms 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 39 ms.
Support contains 6 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 98/98 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 154 transition count 96
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 153 transition count 95
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 153 transition count 95
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 8 place count 153 transition count 95
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 152 transition count 94
Applied a total of 9 rules in 39 ms. Remains 152 /154 variables (removed 2) and now considering 94/98 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 152/154 places, 94/98 transitions.
Incomplete random walk after 10000 steps, including 136 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 94 rows 152 cols
[2023-03-08 08:34:34] [INFO ] Computed 60 place invariants in 8 ms
[2023-03-08 08:34:34] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 08:34:34] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 9 ms returned sat
[2023-03-08 08:34:34] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 08:34:34] [INFO ] [Nat]Absence check using 36 positive place invariants in 13 ms returned sat
[2023-03-08 08:34:34] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 36 ms returned sat
[2023-03-08 08:34:34] [INFO ] After 84ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 08:34:34] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 08:34:34] [INFO ] After 18ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-08 08:34:34] [INFO ] After 42ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-08 08:34:34] [INFO ] After 285ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 17 ms.
Support contains 4 out of 152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 94/94 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 152 transition count 94
Applied a total of 1 rules in 10 ms. Remains 152 /152 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 152/152 places, 94/94 transitions.
Incomplete random walk after 10000 steps, including 136 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1109230 steps, run timeout after 3001 ms. (steps per millisecond=369 ) properties seen :{}
Probabilistic random walk after 1109230 steps, saw 155142 distinct states, run finished after 3002 ms. (steps per millisecond=369 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 94 rows 152 cols
[2023-03-08 08:34:37] [INFO ] Computed 60 place invariants in 7 ms
[2023-03-08 08:34:37] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 08:34:37] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 7 ms returned sat
[2023-03-08 08:34:37] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 08:34:37] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 08:34:37] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 23 ms returned sat
[2023-03-08 08:34:38] [INFO ] After 141ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 08:34:38] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 08:34:38] [INFO ] After 25ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-08 08:34:38] [INFO ] After 49ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-08 08:34:38] [INFO ] After 319ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 18 ms.
Support contains 4 out of 152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 94/94 transitions.
Applied a total of 0 rules in 6 ms. Remains 152 /152 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 152/152 places, 94/94 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 94/94 transitions.
Applied a total of 0 rules in 5 ms. Remains 152 /152 variables (removed 0) and now considering 94/94 (removed 0) transitions.
[2023-03-08 08:34:38] [INFO ] Invariant cache hit.
[2023-03-08 08:34:38] [INFO ] Implicit Places using invariants in 151 ms returned []
[2023-03-08 08:34:38] [INFO ] Invariant cache hit.
[2023-03-08 08:34:38] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 08:34:38] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
[2023-03-08 08:34:38] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 08:34:38] [INFO ] Invariant cache hit.
[2023-03-08 08:34:38] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 426 ms. Remains : 152/152 places, 94/94 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 152 transition count 94
Applied a total of 1 rules in 8 ms. Remains 152 /152 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 94 rows 152 cols
[2023-03-08 08:34:38] [INFO ] Computed 60 place invariants in 2 ms
[2023-03-08 08:34:38] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 08:34:38] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 6 ms returned sat
[2023-03-08 08:34:38] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 08:34:38] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 08:34:38] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 24 ms returned sat
[2023-03-08 08:34:38] [INFO ] After 78ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 08:34:38] [INFO ] After 102ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-08 08:34:39] [INFO ] After 238ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
FORMULA DES-PT-10a-LTLCardinality-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 57 stabilizing places and 52 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' '!(X(X(X(F(p0)))))'
Support contains 2 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 153 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 153 transition count 97
Applied a total of 2 rules in 3 ms. Remains 153 /154 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 153 cols
[2023-03-08 08:34:39] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-08 08:34:39] [INFO ] Implicit Places using invariants in 94 ms returned []
[2023-03-08 08:34:39] [INFO ] Invariant cache hit.
[2023-03-08 08:34:39] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
[2023-03-08 08:34:39] [INFO ] Invariant cache hit.
[2023-03-08 08:34:39] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 153/154 places, 97/98 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 314 ms. Remains : 153/154 places, 97/98 transitions.
Stuttering acceptance computed with spot in 253 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-10a-LTLCardinality-01 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:(AND (EQ s7 0) (EQ s54 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][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 348 ms.
Product exploration explored 100000 steps with 25000 reset in 260 ms.
Computed a total of 56 stabilizing places and 51 stable transitions
Computed a total of 56 stabilizing places and 51 stable transitions
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 91 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 109 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2023-03-08 08:34:41] [INFO ] Invariant cache hit.
[2023-03-08 08:34:41] [INFO ] [Real]Absence check using 33 positive place invariants in 5 ms returned sat
[2023-03-08 08:34:41] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 14 ms returned sat
[2023-03-08 08:34:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 08:34:41] [INFO ] [Real]Absence check using state equation in 443 ms returned sat
[2023-03-08 08:34:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 08:34:41] [INFO ] [Nat]Absence check using 33 positive place invariants in 7 ms returned sat
[2023-03-08 08:34:41] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 57 ms returned sat
[2023-03-08 08:34:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 08:34:42] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2023-03-08 08:34:42] [INFO ] Computed and/alt/rep : 89/267/89 causal constraints (skipped 7 transitions) in 9 ms.
[2023-03-08 08:34:42] [INFO ] Added : 0 causal constraints over 0 iterations in 40 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 3 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-08 08:34:42] [INFO ] Invariant cache hit.
[2023-03-08 08:34:42] [INFO ] Implicit Places using invariants in 106 ms returned []
[2023-03-08 08:34:42] [INFO ] Invariant cache hit.
[2023-03-08 08:34:42] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
[2023-03-08 08:34:42] [INFO ] Invariant cache hit.
[2023-03-08 08:34:42] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 338 ms. Remains : 153/153 places, 97/97 transitions.
Computed a total of 56 stabilizing places and 51 stable transitions
Computed a total of 56 stabilizing places and 51 stable transitions
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 77 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 104 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2023-03-08 08:34:43] [INFO ] Invariant cache hit.
[2023-03-08 08:34:43] [INFO ] [Real]Absence check using 33 positive place invariants in 5 ms returned sat
[2023-03-08 08:34:43] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 14 ms returned sat
[2023-03-08 08:34:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 08:34:43] [INFO ] [Real]Absence check using state equation in 450 ms returned sat
[2023-03-08 08:34:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 08:34:43] [INFO ] [Nat]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-08 08:34:43] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 56 ms returned sat
[2023-03-08 08:34:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 08:34:43] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2023-03-08 08:34:43] [INFO ] Computed and/alt/rep : 89/267/89 causal constraints (skipped 7 transitions) in 8 ms.
[2023-03-08 08:34:44] [INFO ] Added : 0 causal constraints over 0 iterations in 24 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 218 ms.
Product exploration explored 100000 steps with 25000 reset in 244 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 15 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-08 08:34:45] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-08 08:34:45] [INFO ] Invariant cache hit.
[2023-03-08 08:34:45] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 107 ms. Remains : 153/153 places, 97/97 transitions.
Built C files in :
/tmp/ltsmin6956194934789987607
[2023-03-08 08:34:45] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6956194934789987607
Running compilation step : cd /tmp/ltsmin6956194934789987607;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 293 ms.
Running link step : cd /tmp/ltsmin6956194934789987607;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin6956194934789987607;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9215592998359592609.hoa' '--buchi-type=spotba'
LTSmin run took 206 ms.
FORMULA DES-PT-10a-LTLCardinality-01 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-10a-LTLCardinality-01 finished in 6308 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)&&F(G(p1)))))'
Support contains 3 out of 154 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 154/154 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 153 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 153 transition count 97
Applied a total of 2 rules in 14 ms. Remains 153 /154 variables (removed 1) and now considering 97/98 (removed 1) transitions.
[2023-03-08 08:34:45] [INFO ] Invariant cache hit.
[2023-03-08 08:34:45] [INFO ] Implicit Places using invariants in 103 ms returned []
[2023-03-08 08:34:45] [INFO ] Invariant cache hit.
[2023-03-08 08:34:45] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
[2023-03-08 08:34:45] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 08:34:45] [INFO ] Invariant cache hit.
[2023-03-08 08:34:45] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 153/154 places, 97/98 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 319 ms. Remains : 153/154 places, 97/98 transitions.
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DES-PT-10a-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s123 1), p1:(AND (EQ s131 1) (EQ s142 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 137 steps with 1 reset in 3 ms.
FORMULA DES-PT-10a-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10a-LTLCardinality-02 finished in 459 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 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 153 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 153 transition count 97
Applied a total of 2 rules in 13 ms. Remains 153 /154 variables (removed 1) and now considering 97/98 (removed 1) transitions.
[2023-03-08 08:34:46] [INFO ] Invariant cache hit.
[2023-03-08 08:34:46] [INFO ] Implicit Places using invariants in 96 ms returned []
[2023-03-08 08:34:46] [INFO ] Invariant cache hit.
[2023-03-08 08:34:46] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
[2023-03-08 08:34:46] [INFO ] Invariant cache hit.
[2023-03-08 08:34:46] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 153/154 places, 97/98 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 314 ms. Remains : 153/154 places, 97/98 transitions.
Stuttering acceptance computed with spot in 96 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-10a-LTLCardinality-04 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:(AND (NEQ s49 0) (NEQ s150 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 1 steps with 0 reset in 0 ms.
FORMULA DES-PT-10a-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10a-LTLCardinality-04 finished in 432 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((!p1 U X(p2)))))'
Support contains 4 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 98/98 transitions.
Applied a total of 0 rules in 3 ms. Remains 154 /154 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 154 cols
[2023-03-08 08:34:46] [INFO ] Computed 58 place invariants in 1 ms
[2023-03-08 08:34:46] [INFO ] Implicit Places using invariants in 112 ms returned []
[2023-03-08 08:34:46] [INFO ] Invariant cache hit.
[2023-03-08 08:34:46] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
[2023-03-08 08:34:46] [INFO ] Invariant cache hit.
[2023-03-08 08:34:46] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 385 ms. Remains : 154/154 places, 98/98 transitions.
Stuttering acceptance computed with spot in 203 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2), (NOT p2), (NOT p2), true]
Running random walk in product with property : DES-PT-10a-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 5}], [{ cond=p1, acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s82 0) (EQ s111 1)), p1:(OR (EQ s111 0) (EQ s82 1)), p2:(AND (OR (EQ s117 0) (EQ s147 1)) (OR (EQ s111 0) (EQ s82 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]]
Stuttering criterion allowed to conclude after 34 steps with 0 reset in 0 ms.
FORMULA DES-PT-10a-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10a-LTLCardinality-05 finished in 608 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 1 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 153 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 153 transition count 97
Applied a total of 2 rules in 7 ms. Remains 153 /154 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 153 cols
[2023-03-08 08:34:47] [INFO ] Computed 58 place invariants in 6 ms
[2023-03-08 08:34:47] [INFO ] Implicit Places using invariants in 95 ms returned []
[2023-03-08 08:34:47] [INFO ] Invariant cache hit.
[2023-03-08 08:34:47] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
[2023-03-08 08:34:47] [INFO ] Invariant cache hit.
[2023-03-08 08:34:47] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 153/154 places, 97/98 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 308 ms. Remains : 153/154 places, 97/98 transitions.
Stuttering acceptance computed with spot in 173 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-10a-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(NEQ s92 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, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 92 steps with 1 reset in 0 ms.
FORMULA DES-PT-10a-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10a-LTLCardinality-06 finished in 495 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 153 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 153 transition count 97
Applied a total of 2 rules in 3 ms. Remains 153 /154 variables (removed 1) and now considering 97/98 (removed 1) transitions.
[2023-03-08 08:34:47] [INFO ] Invariant cache hit.
[2023-03-08 08:34:47] [INFO ] Implicit Places using invariants in 92 ms returned []
[2023-03-08 08:34:47] [INFO ] Invariant cache hit.
[2023-03-08 08:34:47] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
[2023-03-08 08:34:47] [INFO ] Invariant cache hit.
[2023-03-08 08:34:47] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 153/154 places, 97/98 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 297 ms. Remains : 153/154 places, 97/98 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-10a-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s136 0) (EQ s17 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 295 ms.
Product exploration explored 100000 steps with 50000 reset in 300 ms.
Computed a total of 56 stabilizing places and 51 stable transitions
Computed a total of 56 stabilizing places and 51 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 62 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-10a-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-10a-LTLCardinality-08 finished in 1058 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 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 153 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 153 transition count 97
Applied a total of 2 rules in 4 ms. Remains 153 /154 variables (removed 1) and now considering 97/98 (removed 1) transitions.
[2023-03-08 08:34:48] [INFO ] Invariant cache hit.
[2023-03-08 08:34:48] [INFO ] Implicit Places using invariants in 87 ms returned []
[2023-03-08 08:34:48] [INFO ] Invariant cache hit.
[2023-03-08 08:34:48] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
[2023-03-08 08:34:48] [INFO ] Invariant cache hit.
[2023-03-08 08:34:49] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 153/154 places, 97/98 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 280 ms. Remains : 153/154 places, 97/98 transitions.
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-10a-LTLCardinality-09 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 s78 0) (EQ s3 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 18 steps with 0 reset in 1 ms.
FORMULA DES-PT-10a-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10a-LTLCardinality-09 finished in 371 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(!p1 U X(!p2))))))'
Support contains 6 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 153 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 153 transition count 97
Applied a total of 2 rules in 5 ms. Remains 153 /154 variables (removed 1) and now considering 97/98 (removed 1) transitions.
[2023-03-08 08:34:49] [INFO ] Invariant cache hit.
[2023-03-08 08:34:49] [INFO ] Implicit Places using invariants in 84 ms returned []
[2023-03-08 08:34:49] [INFO ] Invariant cache hit.
[2023-03-08 08:34:49] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
[2023-03-08 08:34:49] [INFO ] Invariant cache hit.
[2023-03-08 08:34:49] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 153/154 places, 97/98 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 293 ms. Remains : 153/154 places, 97/98 transitions.
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p0) p2), p2, p2]
Running random walk in product with property : DES-PT-10a-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=0 dest: 2}], [{ cond=(AND (NOT p1) p2), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p2), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 p2), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=2 dest: 1}, { cond=(AND p0 p1 p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s112 0) (EQ s151 1)), p1:(OR (EQ s33 0) (EQ s20 1)), p2:(OR (EQ s105 0) (EQ s80 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33419 reset in 290 ms.
Product exploration explored 100000 steps with 33323 reset in 324 ms.
Computed a total of 56 stabilizing places and 51 stable transitions
Computed a total of 56 stabilizing places and 51 stable transitions
Detected a total of 56/153 stabilizing places and 51/97 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p1 p2))), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT (AND p0 (NOT p1) p2))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1) p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 20 factoid took 890 ms. Reduced automaton from 3 states, 10 edges and 3 AP (stutter sensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p0) p2), p2, p2]
Incomplete random walk after 10000 steps, including 218 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 8) seen :5
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-08 08:34:51] [INFO ] Invariant cache hit.
[2023-03-08 08:34:51] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 08:34:51] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 08:34:51] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 35 ms returned sat
[2023-03-08 08:34:51] [INFO ] After 93ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 08:34:51] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2023-03-08 08:34:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2023-03-08 08:34:51] [INFO ] After 215ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 66 ms.
[2023-03-08 08:34:51] [INFO ] After 379ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 45 ms.
Support contains 6 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 97/97 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 153 transition count 95
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 8 place count 153 transition count 95
Applied a total of 8 rules in 9 ms. Remains 153 /153 variables (removed 0) and now considering 95/97 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 153/153 places, 95/97 transitions.
Incomplete random walk after 10000 steps, including 133 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1109505 steps, run timeout after 3001 ms. (steps per millisecond=369 ) properties seen :{}
Probabilistic random walk after 1109505 steps, saw 155182 distinct states, run finished after 3001 ms. (steps per millisecond=369 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 95 rows 153 cols
[2023-03-08 08:34:55] [INFO ] Computed 60 place invariants in 4 ms
[2023-03-08 08:34:55] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 08:34:55] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 08:34:55] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 41 ms returned sat
[2023-03-08 08:34:55] [INFO ] After 119ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 08:34:55] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 08:34:55] [INFO ] After 71ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-08 08:34:55] [INFO ] After 139ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 74 ms.
[2023-03-08 08:34:55] [INFO ] After 432ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 47 ms.
Support contains 6 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 95/95 transitions.
Applied a total of 0 rules in 4 ms. Remains 153 /153 variables (removed 0) and now considering 95/95 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 153/153 places, 95/95 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 95/95 transitions.
Applied a total of 0 rules in 5 ms. Remains 153 /153 variables (removed 0) and now considering 95/95 (removed 0) transitions.
[2023-03-08 08:34:55] [INFO ] Invariant cache hit.
[2023-03-08 08:34:55] [INFO ] Implicit Places using invariants in 91 ms returned []
[2023-03-08 08:34:55] [INFO ] Invariant cache hit.
[2023-03-08 08:34:56] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 08:34:56] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
[2023-03-08 08:34:56] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 08:34:56] [INFO ] Invariant cache hit.
[2023-03-08 08:34:56] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 342 ms. Remains : 153/153 places, 95/95 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 153 transition count 95
Applied a total of 1 rules in 8 ms. Remains 153 /153 variables (removed 0) and now considering 95/95 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 95 rows 153 cols
[2023-03-08 08:34:56] [INFO ] Computed 60 place invariants in 2 ms
[2023-03-08 08:34:56] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 08:34:56] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 08:34:56] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 40 ms returned sat
[2023-03-08 08:34:56] [INFO ] After 106ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 08:34:56] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2023-03-08 08:34:56] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
[2023-03-08 08:34:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 98 ms
[2023-03-08 08:34:56] [INFO ] After 277ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 45 ms.
[2023-03-08 08:34:56] [INFO ] After 415ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p0 p1 p2), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p1 p2))), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT (AND p0 (NOT p1) p2))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1) p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p1 p2))), (F (AND p0 p1 (NOT p2))), (F (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))), (F (NOT (OR (NOT p0) (AND p1 p2)))), (F (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))]
Knowledge based reduction with 20 factoid took 831 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) p2), p2, p2]
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) p2), p2, p2]
// Phase 1: matrix 97 rows 153 cols
[2023-03-08 08:34:57] [INFO ] Computed 58 place invariants in 1 ms
[2023-03-08 08:34:57] [INFO ] [Real]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-08 08:34:57] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 16 ms returned sat
[2023-03-08 08:34:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 08:34:57] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2023-03-08 08:34:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 08:34:58] [INFO ] [Nat]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-08 08:34:58] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 58 ms returned sat
[2023-03-08 08:34:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 08:34:58] [INFO ] [Nat]Absence check using state equation in 104 ms returned sat
[2023-03-08 08:34:58] [INFO ] Computed and/alt/rep : 89/267/89 causal constraints (skipped 7 transitions) in 6 ms.
[2023-03-08 08:34:58] [INFO ] Added : 75 causal constraints over 15 iterations in 211 ms. Result :sat
Could not prove EG p2
Support contains 6 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 6 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-08 08:34:58] [INFO ] Invariant cache hit.
[2023-03-08 08:34:58] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-08 08:34:58] [INFO ] Invariant cache hit.
[2023-03-08 08:34:58] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
[2023-03-08 08:34:58] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 08:34:58] [INFO ] Invariant cache hit.
[2023-03-08 08:34:58] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 317 ms. Remains : 153/153 places, 97/97 transitions.
Computed a total of 56 stabilizing places and 51 stable transitions
Computed a total of 56 stabilizing places and 51 stable transitions
Detected a total of 56/153 stabilizing places and 51/97 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND p1 p2))), (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (OR (NOT p0) (AND p1 p2)))), (X (AND p0 p1 (NOT p2))), (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (OR (NOT p0) (AND p1 p2))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 782 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p0) p2), p2, p2]
Incomplete random walk after 10000 steps, including 220 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 8) seen :5
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-08 08:34:59] [INFO ] Invariant cache hit.
[2023-03-08 08:34:59] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 08:34:59] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 08:34:59] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 35 ms returned sat
[2023-03-08 08:35:00] [INFO ] After 97ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 08:35:00] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 0 ms to minimize.
[2023-03-08 08:35:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2023-03-08 08:35:00] [INFO ] After 249ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 74 ms.
[2023-03-08 08:35:00] [INFO ] After 409ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 28 ms.
Support contains 6 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 97/97 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 153 transition count 95
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 8 place count 153 transition count 95
Applied a total of 8 rules in 9 ms. Remains 153 /153 variables (removed 0) and now considering 95/97 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 153/153 places, 95/97 transitions.
Incomplete random walk after 10000 steps, including 134 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 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 26 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 18 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1251985 steps, run timeout after 3001 ms. (steps per millisecond=417 ) properties seen :{}
Probabilistic random walk after 1251985 steps, saw 175021 distinct states, run finished after 3001 ms. (steps per millisecond=417 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 95 rows 153 cols
[2023-03-08 08:35:03] [INFO ] Computed 60 place invariants in 6 ms
[2023-03-08 08:35:03] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 08:35:03] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 08:35:03] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 41 ms returned sat
[2023-03-08 08:35:03] [INFO ] After 109ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 08:35:03] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 08:35:03] [INFO ] After 75ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-08 08:35:03] [INFO ] After 138ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 79 ms.
[2023-03-08 08:35:03] [INFO ] After 422ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 32 ms.
Support contains 6 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 95/95 transitions.
Applied a total of 0 rules in 4 ms. Remains 153 /153 variables (removed 0) and now considering 95/95 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 153/153 places, 95/95 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 95/95 transitions.
Applied a total of 0 rules in 3 ms. Remains 153 /153 variables (removed 0) and now considering 95/95 (removed 0) transitions.
[2023-03-08 08:35:04] [INFO ] Invariant cache hit.
[2023-03-08 08:35:04] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-08 08:35:04] [INFO ] Invariant cache hit.
[2023-03-08 08:35:04] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 08:35:04] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
[2023-03-08 08:35:04] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 08:35:04] [INFO ] Invariant cache hit.
[2023-03-08 08:35:04] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 320 ms. Remains : 153/153 places, 95/95 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 153 transition count 95
Applied a total of 1 rules in 6 ms. Remains 153 /153 variables (removed 0) and now considering 95/95 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 95 rows 153 cols
[2023-03-08 08:35:04] [INFO ] Computed 60 place invariants in 1 ms
[2023-03-08 08:35:04] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 08:35:04] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 08:35:04] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 42 ms returned sat
[2023-03-08 08:35:04] [INFO ] After 106ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 08:35:04] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2023-03-08 08:35:04] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
[2023-03-08 08:35:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 117 ms
[2023-03-08 08:35:04] [INFO ] After 310ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-03-08 08:35:04] [INFO ] After 454ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND p1 p2))), (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (OR (NOT p0) (AND p1 p2)))), (X (AND p0 p1 (NOT p2))), (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (OR (NOT p0) (AND p1 p2))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p1 p2))), (F (AND p0 p1 (NOT p2))), (F (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))), (F (NOT (OR (NOT p0) (AND p1 p2)))), (F (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))]
Knowledge based reduction with 18 factoid took 902 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) p2), p2, p2]
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p0) p2), p2, p2]
// Phase 1: matrix 97 rows 153 cols
[2023-03-08 08:35:06] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-08 08:35:06] [INFO ] [Real]Absence check using 33 positive place invariants in 5 ms returned sat
[2023-03-08 08:35:06] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 15 ms returned sat
[2023-03-08 08:35:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 08:35:06] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2023-03-08 08:35:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 08:35:06] [INFO ] [Nat]Absence check using 33 positive place invariants in 7 ms returned sat
[2023-03-08 08:35:06] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 60 ms returned sat
[2023-03-08 08:35:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 08:35:06] [INFO ] [Nat]Absence check using state equation in 107 ms returned sat
[2023-03-08 08:35:06] [INFO ] Computed and/alt/rep : 89/267/89 causal constraints (skipped 7 transitions) in 7 ms.
[2023-03-08 08:35:06] [INFO ] Added : 75 causal constraints over 15 iterations in 200 ms. Result :sat
Could not prove EG p2
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p0) p2), p2, p2]
Product exploration explored 100000 steps with 24953 reset in 297 ms.
Product exploration explored 100000 steps with 24979 reset in 300 ms.
Built C files in :
/tmp/ltsmin7401072728900743818
[2023-03-08 08:35:07] [INFO ] Computing symmetric may disable matrix : 97 transitions.
[2023-03-08 08:35:07] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 08:35:07] [INFO ] Computing symmetric may enable matrix : 97 transitions.
[2023-03-08 08:35:07] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 08:35:07] [INFO ] Computing Do-Not-Accords matrix : 97 transitions.
[2023-03-08 08:35:07] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 08:35:07] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7401072728900743818
Running compilation step : cd /tmp/ltsmin7401072728900743818;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 223 ms.
Running link step : cd /tmp/ltsmin7401072728900743818;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin7401072728900743818;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13335942025553075816.hoa' '--buchi-type=spotba'
LTSmin run took 549 ms.
FORMULA DES-PT-10a-LTLCardinality-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-10a-LTLCardinality-11 finished in 19185 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 154 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 154/154 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 153 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 153 transition count 97
Applied a total of 2 rules in 11 ms. Remains 153 /154 variables (removed 1) and now considering 97/98 (removed 1) transitions.
[2023-03-08 08:35:08] [INFO ] Invariant cache hit.
[2023-03-08 08:35:08] [INFO ] Implicit Places using invariants in 91 ms returned []
[2023-03-08 08:35:08] [INFO ] Invariant cache hit.
[2023-03-08 08:35:08] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
[2023-03-08 08:35:08] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 08:35:08] [INFO ] Invariant cache hit.
[2023-03-08 08:35:08] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 153/154 places, 97/98 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 315 ms. Remains : 153/154 places, 97/98 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-10a-LTLCardinality-13 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 s31 0) (EQ s96 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 2231 reset in 192 ms.
Product exploration explored 100000 steps with 2217 reset in 215 ms.
Computed a total of 56 stabilizing places and 51 stable transitions
Computed a total of 56 stabilizing places and 51 stable transitions
Knowledge obtained : [p0, (X (NOT p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 100 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X (NOT p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 117 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Support contains 2 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 9 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-08 08:35:09] [INFO ] Invariant cache hit.
[2023-03-08 08:35:09] [INFO ] Implicit Places using invariants in 87 ms returned []
[2023-03-08 08:35:09] [INFO ] Invariant cache hit.
[2023-03-08 08:35:09] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
[2023-03-08 08:35:09] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-08 08:35:09] [INFO ] Invariant cache hit.
[2023-03-08 08:35:09] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 310 ms. Remains : 153/153 places, 97/97 transitions.
Computed a total of 56 stabilizing places and 51 stable transitions
Computed a total of 56 stabilizing places and 51 stable transitions
Knowledge obtained : [p0, (X (NOT p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 104 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [p0, (X (NOT p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 155 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2251 reset in 193 ms.
Product exploration explored 100000 steps with 2210 reset in 213 ms.
Built C files in :
/tmp/ltsmin15651915658983207588
[2023-03-08 08:35:10] [INFO ] Computing symmetric may disable matrix : 97 transitions.
[2023-03-08 08:35:10] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 08:35:10] [INFO ] Computing symmetric may enable matrix : 97 transitions.
[2023-03-08 08:35:10] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 08:35:10] [INFO ] Computing Do-Not-Accords matrix : 97 transitions.
[2023-03-08 08:35:10] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 08:35:10] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15651915658983207588
Running compilation step : cd /tmp/ltsmin15651915658983207588;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 225 ms.
Running link step : cd /tmp/ltsmin15651915658983207588;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin15651915658983207588;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16846526149978394001.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 4 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-08 08:35:25] [INFO ] Invariant cache hit.
[2023-03-08 08:35:25] [INFO ] Implicit Places using invariants in 102 ms returned []
[2023-03-08 08:35:25] [INFO ] Invariant cache hit.
[2023-03-08 08:35:26] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
[2023-03-08 08:35:26] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 08:35:26] [INFO ] Invariant cache hit.
[2023-03-08 08:35:26] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 330 ms. Remains : 153/153 places, 97/97 transitions.
Built C files in :
/tmp/ltsmin9168864219384352392
[2023-03-08 08:35:26] [INFO ] Computing symmetric may disable matrix : 97 transitions.
[2023-03-08 08:35:26] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 08:35:26] [INFO ] Computing symmetric may enable matrix : 97 transitions.
[2023-03-08 08:35:26] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 08:35:26] [INFO ] Computing Do-Not-Accords matrix : 97 transitions.
[2023-03-08 08:35:26] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 08:35:26] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9168864219384352392
Running compilation step : cd /tmp/ltsmin9168864219384352392;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 228 ms.
Running link step : cd /tmp/ltsmin9168864219384352392;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin9168864219384352392;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2365279967416378661.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-08 08:35:41] [INFO ] Flatten gal took : 11 ms
[2023-03-08 08:35:41] [INFO ] Flatten gal took : 10 ms
[2023-03-08 08:35:41] [INFO ] Time to serialize gal into /tmp/LTL4650200308359778509.gal : 3 ms
[2023-03-08 08:35:41] [INFO ] Time to serialize properties into /tmp/LTL7073364571821179985.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4650200308359778509.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11051389504277693658.hoa' '-atoms' '/tmp/LTL7073364571821179985.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL7073364571821179985.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11051389504277693658.hoa
Detected timeout of ITS tools.
[2023-03-08 08:35:56] [INFO ] Flatten gal took : 8 ms
[2023-03-08 08:35:56] [INFO ] Flatten gal took : 9 ms
[2023-03-08 08:35:56] [INFO ] Time to serialize gal into /tmp/LTL16659100833197729122.gal : 2 ms
[2023-03-08 08:35:56] [INFO ] Time to serialize properties into /tmp/LTL3038511755215824063.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16659100833197729122.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3038511755215824063.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("((p31==0)||(p97==1))"))))
Formula 0 simplified : GF!"((p31==0)||(p97==1))"
Detected timeout of ITS tools.
[2023-03-08 08:36:11] [INFO ] Flatten gal took : 12 ms
[2023-03-08 08:36:11] [INFO ] Applying decomposition
[2023-03-08 08:36:11] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph5795925842630491097.txt' '-o' '/tmp/graph5795925842630491097.bin' '-w' '/tmp/graph5795925842630491097.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph5795925842630491097.bin' '-l' '-1' '-v' '-w' '/tmp/graph5795925842630491097.weights' '-q' '0' '-e' '0.001'
[2023-03-08 08:36:11] [INFO ] Decomposing Gal with order
[2023-03-08 08:36:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 08:36:11] [INFO ] Removed a total of 14 redundant transitions.
[2023-03-08 08:36:11] [INFO ] Flatten gal took : 38 ms
[2023-03-08 08:36:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 6 ms.
[2023-03-08 08:36:11] [INFO ] Time to serialize gal into /tmp/LTL10987906994237469197.gal : 3 ms
[2023-03-08 08:36:11] [INFO ] Time to serialize properties into /tmp/LTL16848357147600203272.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10987906994237469197.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16848357147600203272.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F(G("((i2.u2.p31==0)||(i9.u24.p97==1))"))))
Formula 0 simplified : GF!"((i2.u2.p31==0)||(i9.u24.p97==1))"
Reverse transition relation is NOT exact ! Due to transitions t1, t57, t58, u13.t11, u47.t5, u47.t21, i0.t91, i0.u0.t10, i0.u6.t96, i0.u12.t50, i1.t95, i1....390
Computing Next relation with stutter on 184834 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14614789563491099533
[2023-03-08 08:36:26] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14614789563491099533
Running compilation step : cd /tmp/ltsmin14614789563491099533;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 206 ms.
Running link step : cd /tmp/ltsmin14614789563491099533;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin14614789563491099533;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-10a-LTLCardinality-13 finished in 93568 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 154 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 154/154 places, 98/98 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 152 transition count 96
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 152 transition count 96
Applied a total of 2 rules in 8 ms. Remains 152 /154 variables (removed 2) and now considering 96/98 (removed 2) transitions.
// Phase 1: matrix 96 rows 152 cols
[2023-03-08 08:36:41] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-08 08:36:41] [INFO ] Implicit Places using invariants in 102 ms returned []
[2023-03-08 08:36:41] [INFO ] Invariant cache hit.
[2023-03-08 08:36:42] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
[2023-03-08 08:36:42] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 08:36:42] [INFO ] Invariant cache hit.
[2023-03-08 08:36:42] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 152/154 places, 96/98 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 342 ms. Remains : 152/154 places, 96/98 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-10a-LTLCardinality-14 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:(OR (EQ s5 0) (EQ s31 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 2281 reset in 176 ms.
Product exploration explored 100000 steps with 2280 reset in 199 ms.
Computed a total of 55 stabilizing places and 50 stable transitions
Computed a total of 55 stabilizing places and 50 stable transitions
Detected a total of 55/152 stabilizing places and 50/96 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 146 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 232 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2068757 steps, run timeout after 3001 ms. (steps per millisecond=689 ) properties seen :{}
Probabilistic random walk after 2068757 steps, saw 279373 distinct states, run finished after 3001 ms. (steps per millisecond=689 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 08:36:45] [INFO ] Invariant cache hit.
[2023-03-08 08:36:45] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 08:36:46] [INFO ] [Nat]Absence check using 32 positive place invariants in 3 ms returned sat
[2023-03-08 08:36:46] [INFO ] [Nat]Absence check using 32 positive and 26 generalized place invariants in 17 ms returned sat
[2023-03-08 08:36:46] [INFO ] After 76ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 08:36:46] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2023-03-08 08:36:46] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2023-03-08 08:36:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 86 ms
[2023-03-08 08:36:46] [INFO ] After 169ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-08 08:36:46] [INFO ] After 229ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 96/96 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 152 transition count 94
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 152 transition count 94
Applied a total of 3 rules in 7 ms. Remains 152 /152 variables (removed 0) and now considering 94/96 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 152/152 places, 94/96 transitions.
Incomplete random walk after 10000 steps, including 169 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 31 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1920045 steps, run timeout after 3001 ms. (steps per millisecond=639 ) properties seen :{}
Probabilistic random walk after 1920045 steps, saw 264402 distinct states, run finished after 3001 ms. (steps per millisecond=639 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 152 cols
[2023-03-08 08:36:49] [INFO ] Computed 60 place invariants in 5 ms
[2023-03-08 08:36:49] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 08:36:49] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 08:36:49] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 24 ms returned sat
[2023-03-08 08:36:49] [INFO ] After 73ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 08:36:49] [INFO ] After 84ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-08 08:36:49] [INFO ] After 176ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 440 steps, including 3 resets, run visited all 1 properties in 3 ms. (steps per millisecond=146 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 148 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 152 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 152/152 places, 96/96 transitions.
Applied a total of 0 rules in 8 ms. Remains 152 /152 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 152 cols
[2023-03-08 08:36:49] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-08 08:36:49] [INFO ] Implicit Places using invariants in 93 ms returned []
[2023-03-08 08:36:49] [INFO ] Invariant cache hit.
[2023-03-08 08:36:49] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
[2023-03-08 08:36:49] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 08:36:49] [INFO ] Invariant cache hit.
[2023-03-08 08:36:50] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 310 ms. Remains : 152/152 places, 96/96 transitions.
Computed a total of 55 stabilizing places and 50 stable transitions
Computed a total of 55 stabilizing places and 50 stable transitions
Detected a total of 55/152 stabilizing places and 50/96 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 119 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 227 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1958417 steps, run timeout after 3001 ms. (steps per millisecond=652 ) properties seen :{}
Probabilistic random walk after 1958417 steps, saw 265940 distinct states, run finished after 3001 ms. (steps per millisecond=652 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 08:36:53] [INFO ] Invariant cache hit.
[2023-03-08 08:36:53] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 08:36:53] [INFO ] [Nat]Absence check using 32 positive place invariants in 3 ms returned sat
[2023-03-08 08:36:53] [INFO ] [Nat]Absence check using 32 positive and 26 generalized place invariants in 17 ms returned sat
[2023-03-08 08:36:53] [INFO ] After 77ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 08:36:53] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2023-03-08 08:36:53] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
[2023-03-08 08:36:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 97 ms
[2023-03-08 08:36:53] [INFO ] After 180ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-08 08:36:53] [INFO ] After 250ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 96/96 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 152 transition count 94
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 152 transition count 94
Applied a total of 3 rules in 6 ms. Remains 152 /152 variables (removed 0) and now considering 94/96 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 152/152 places, 94/96 transitions.
Incomplete random walk after 10000 steps, including 166 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2001373 steps, run timeout after 3001 ms. (steps per millisecond=666 ) properties seen :{}
Probabilistic random walk after 2001373 steps, saw 273449 distinct states, run finished after 3001 ms. (steps per millisecond=666 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 152 cols
[2023-03-08 08:36:56] [INFO ] Computed 60 place invariants in 2 ms
[2023-03-08 08:36:56] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 08:36:56] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 08:36:56] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 24 ms returned sat
[2023-03-08 08:36:56] [INFO ] After 74ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 08:36:56] [INFO ] After 86ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-08 08:36:56] [INFO ] After 187ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 463 steps, including 3 resets, run visited all 1 properties in 3 ms. (steps per millisecond=154 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 170 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2276 reset in 179 ms.
Product exploration explored 100000 steps with 2287 reset in 199 ms.
Built C files in :
/tmp/ltsmin2316699037599444103
[2023-03-08 08:36:57] [INFO ] Computing symmetric may disable matrix : 96 transitions.
[2023-03-08 08:36:57] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 08:36:57] [INFO ] Computing symmetric may enable matrix : 96 transitions.
[2023-03-08 08:36:57] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 08:36:57] [INFO ] Computing Do-Not-Accords matrix : 96 transitions.
[2023-03-08 08:36:57] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 08:36:57] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2316699037599444103
Running compilation step : cd /tmp/ltsmin2316699037599444103;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 237 ms.
Running link step : cd /tmp/ltsmin2316699037599444103;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin2316699037599444103;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8799594465614731864.hoa' '--buchi-type=spotba'
LTSmin run took 156 ms.
FORMULA DES-PT-10a-LTLCardinality-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-10a-LTLCardinality-14 finished in 16262 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(p0)))'
Support contains 2 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 153 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 153 transition count 97
Applied a total of 2 rules in 4 ms. Remains 153 /154 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 153 cols
[2023-03-08 08:36:58] [INFO ] Computed 58 place invariants in 1 ms
[2023-03-08 08:36:58] [INFO ] Implicit Places using invariants in 88 ms returned []
[2023-03-08 08:36:58] [INFO ] Invariant cache hit.
[2023-03-08 08:36:58] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
[2023-03-08 08:36:58] [INFO ] Invariant cache hit.
[2023-03-08 08:36:58] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 153/154 places, 97/98 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 306 ms. Remains : 153/154 places, 97/98 transitions.
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : DES-PT-10a-LTLCardinality-15 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}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=3, aps=[p0:(OR (EQ s26 0) (EQ s70 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, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 227 ms.
Product exploration explored 100000 steps with 33333 reset in 252 ms.
Computed a total of 56 stabilizing places and 51 stable transitions
Computed a total of 56 stabilizing places and 51 stable transitions
Detected a total of 56/153 stabilizing places and 51/97 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 3 factoid took 58 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-10a-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-10a-LTLCardinality-15 finished in 993 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2023-03-08 08:36:59] [INFO ] Flatten gal took : 13 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12311141219090769500
[2023-03-08 08:36:59] [INFO ] Computing symmetric may disable matrix : 98 transitions.
[2023-03-08 08:36:59] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 08:36:59] [INFO ] Computing symmetric may enable matrix : 98 transitions.
[2023-03-08 08:36:59] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 08:36:59] [INFO ] Applying decomposition
[2023-03-08 08:36:59] [INFO ] Computing Do-Not-Accords matrix : 98 transitions.
[2023-03-08 08:36:59] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 08:36:59] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12311141219090769500
Running compilation step : cd /tmp/ltsmin12311141219090769500;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-08 08:36:59] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph10664553625048769336.txt' '-o' '/tmp/graph10664553625048769336.bin' '-w' '/tmp/graph10664553625048769336.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph10664553625048769336.bin' '-l' '-1' '-v' '-w' '/tmp/graph10664553625048769336.weights' '-q' '0' '-e' '0.001'
[2023-03-08 08:36:59] [INFO ] Decomposing Gal with order
[2023-03-08 08:36:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 08:36:59] [INFO ] Removed a total of 11 redundant transitions.
[2023-03-08 08:36:59] [INFO ] Flatten gal took : 12 ms
[2023-03-08 08:36:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 2 ms.
[2023-03-08 08:36:59] [INFO ] Time to serialize gal into /tmp/LTLCardinality13154092678754934275.gal : 3 ms
[2023-03-08 08:36:59] [INFO ] Time to serialize properties into /tmp/LTLCardinality7621156813769682713.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality13154092678754934275.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality7621156813769682713.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(G("((i2.u2.p31==0)||(i7.u24.p97==1))"))))
Formula 0 simplified : GF!"((i2.u2.p31==0)||(i7.u24.p97==1))"
Compilation finished in 268 ms.
Running link step : cd /tmp/ltsmin12311141219090769500;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin12311141219090769500;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t1, t57, t58, t91, u12.t50, u13.t11, u46.t5, u46.t21, i0.u0.t10, i0.u6.t96, i1.t95, i1.t89, i...384
Computing Next relation with stutter on 202398 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
17470 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,174.727,1952972,1,0,5.84917e+06,12070,1730,4.14678e+06,1298,65889,3054626
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DES-PT-10a-LTLCardinality-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 575031 ms.

BK_STOP 1678265048367

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is DES-PT-10a, 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 r101-tall-167814475300411"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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