Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 8.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 15:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 12 15:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 15:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Apr 12 15:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.3M May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Anderson-PT-10-LTLCardinality-00
FORMULA_NAME Anderson-PT-10-LTLCardinality-01
FORMULA_NAME Anderson-PT-10-LTLCardinality-02
FORMULA_NAME Anderson-PT-10-LTLCardinality-03
FORMULA_NAME Anderson-PT-10-LTLCardinality-04
FORMULA_NAME Anderson-PT-10-LTLCardinality-05
FORMULA_NAME Anderson-PT-10-LTLCardinality-06
FORMULA_NAME Anderson-PT-10-LTLCardinality-07
FORMULA_NAME Anderson-PT-10-LTLCardinality-08
FORMULA_NAME Anderson-PT-10-LTLCardinality-09
FORMULA_NAME Anderson-PT-10-LTLCardinality-10
FORMULA_NAME Anderson-PT-10-LTLCardinality-11
FORMULA_NAME Anderson-PT-10-LTLCardinality-12
FORMULA_NAME Anderson-PT-10-LTLCardinality-13
FORMULA_NAME Anderson-PT-10-LTLCardinality-14
FORMULA_NAME Anderson-PT-10-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717259085410

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 16:24:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 16:24:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 16:24:47] [INFO ] Load time of PNML (sax parser for PT used): 318 ms
[2024-06-01 16:24:47] [INFO ] Transformed 621 places.
[2024-06-01 16:24:47] [INFO ] Transformed 2480 transitions.
[2024-06-01 16:24:47] [INFO ] Found NUPN structural information;
[2024-06-01 16:24:47] [INFO ] Parsed PT model containing 621 places and 2480 transitions and 9560 arcs in 507 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA Anderson-PT-10-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-10-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-10-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-10-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-10-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-10-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-10-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-10-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 621 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 621/621 places, 2480/2480 transitions.
Discarding 170 places :
Symmetric choice reduction at 0 with 170 rule applications. Total rules 170 place count 451 transition count 726
Iterating global reduction 0 with 170 rules applied. Total rules applied 340 place count 451 transition count 726
Applied a total of 340 rules in 150 ms. Remains 451 /621 variables (removed 170) and now considering 726/2480 (removed 1754) transitions.
// Phase 1: matrix 726 rows 451 cols
[2024-06-01 16:24:48] [INFO ] Computed 23 invariants in 68 ms
[2024-06-01 16:24:49] [INFO ] Implicit Places using invariants in 1129 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1176 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 450/621 places, 726/2480 transitions.
Applied a total of 0 rules in 12 ms. Remains 450 /450 variables (removed 0) and now considering 726/726 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1367 ms. Remains : 450/621 places, 726/2480 transitions.
Support contains 27 out of 450 places after structural reductions.
[2024-06-01 16:24:49] [INFO ] Flatten gal took : 128 ms
[2024-06-01 16:24:49] [INFO ] Flatten gal took : 76 ms
[2024-06-01 16:24:49] [INFO ] Input system was already deterministic with 726 transitions.
RANDOM walk for 40000 steps (8 resets) in 2672 ms. (14 steps per ms) remains 4/17 properties
BEST_FIRST walk for 40003 steps (8 resets) in 291 ms. (136 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 305 ms. (130 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (8 resets) in 150 ms. (264 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 84 ms. (470 steps per ms) remains 1/4 properties
// Phase 1: matrix 726 rows 450 cols
[2024-06-01 16:24:51] [INFO ] Computed 22 invariants in 15 ms
[2024-06-01 16:24:51] [INFO ] State equation strengthened by 90 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 420/422 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/422 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/440 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/440 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/450 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/450 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 726/1176 variables, 450/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1176 variables, 90/562 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1176 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1176 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1176/1176 variables, and 562 constraints, problems are : Problem set: 0 solved, 1 unsolved in 691 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 450/450 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 420/422 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/422 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/440 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/440 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/450 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/450 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 726/1176 variables, 450/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1176 variables, 90/562 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1176 variables, 1/563 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1176 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1176 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1176/1176 variables, and 563 constraints, problems are : Problem set: 0 solved, 1 unsolved in 827 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 450/450 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1583ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 18 ms.
Support contains 2 out of 450 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 450/450 places, 726/726 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 450 transition count 626
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 200 place count 350 transition count 626
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 88 Pre rules applied. Total rules applied 200 place count 350 transition count 538
Deduced a syphon composed of 88 places in 1 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 2 with 176 rules applied. Total rules applied 376 place count 262 transition count 538
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 384 place count 254 transition count 494
Iterating global reduction 2 with 8 rules applied. Total rules applied 392 place count 254 transition count 494
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 396 place count 252 transition count 492
Applied a total of 396 rules in 96 ms. Remains 252 /450 variables (removed 198) and now considering 492/726 (removed 234) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 252/450 places, 492/726 transitions.
RANDOM walk for 40000 steps (8 resets) in 226 ms. (176 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 134 ms. (296 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 957545 steps, run timeout after 3001 ms. (steps per millisecond=319 ) properties seen :0 out of 1
Probabilistic random walk after 957545 steps, saw 684772 distinct states, run finished after 3007 ms. (steps per millisecond=318 ) properties seen :0
// Phase 1: matrix 492 rows 252 cols
[2024-06-01 16:24:55] [INFO ] Computed 22 invariants in 6 ms
[2024-06-01 16:24:55] [INFO ] State equation strengthened by 90 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 222/224 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/224 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/232 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 19/251 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/252 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/252 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 492/744 variables, 252/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/744 variables, 90/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/744 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/744 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 744/744 variables, and 364 constraints, problems are : Problem set: 0 solved, 1 unsolved in 326 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 252/252 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 222/224 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/224 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/232 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 19/251 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/252 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/252 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 492/744 variables, 252/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/744 variables, 90/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/744 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/744 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/744 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 744/744 variables, and 365 constraints, problems are : Problem set: 0 solved, 1 unsolved in 490 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 252/252 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 836ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 10 ms.
Support contains 2 out of 252 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 252/252 places, 492/492 transitions.
Applied a total of 0 rules in 20 ms. Remains 252 /252 variables (removed 0) and now considering 492/492 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 252/252 places, 492/492 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 252/252 places, 492/492 transitions.
Applied a total of 0 rules in 21 ms. Remains 252 /252 variables (removed 0) and now considering 492/492 (removed 0) transitions.
[2024-06-01 16:24:56] [INFO ] Invariant cache hit.
[2024-06-01 16:24:57] [INFO ] Implicit Places using invariants in 374 ms returned []
[2024-06-01 16:24:57] [INFO ] Invariant cache hit.
[2024-06-01 16:24:57] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-06-01 16:24:58] [INFO ] Implicit Places using invariants and state equation in 925 ms returned []
Implicit Place search using SMT with State Equation took 1306 ms to find 0 implicit places.
[2024-06-01 16:24:58] [INFO ] Redundant transitions in 31 ms returned []
Running 482 sub problems to find dead transitions.
[2024-06-01 16:24:58] [INFO ] Invariant cache hit.
[2024-06-01 16:24:58] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/251 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-06-01 16:25:04] [INFO ] Deduced a trap composed of 106 places in 204 ms of which 27 ms to minimize.
[2024-06-01 16:25:04] [INFO ] Deduced a trap composed of 83 places in 205 ms of which 4 ms to minimize.
[2024-06-01 16:25:04] [INFO ] Deduced a trap composed of 94 places in 224 ms of which 3 ms to minimize.
[2024-06-01 16:25:05] [INFO ] Deduced a trap composed of 79 places in 325 ms of which 4 ms to minimize.
[2024-06-01 16:25:05] [INFO ] Deduced a trap composed of 105 places in 200 ms of which 4 ms to minimize.
[2024-06-01 16:25:05] [INFO ] Deduced a trap composed of 72 places in 228 ms of which 14 ms to minimize.
[2024-06-01 16:25:05] [INFO ] Deduced a trap composed of 73 places in 170 ms of which 3 ms to minimize.
[2024-06-01 16:25:06] [INFO ] Deduced a trap composed of 111 places in 193 ms of which 3 ms to minimize.
[2024-06-01 16:25:06] [INFO ] Deduced a trap composed of 105 places in 205 ms of which 3 ms to minimize.
[2024-06-01 16:25:06] [INFO ] Deduced a trap composed of 65 places in 210 ms of which 3 ms to minimize.
[2024-06-01 16:25:06] [INFO ] Deduced a trap composed of 91 places in 208 ms of which 4 ms to minimize.
[2024-06-01 16:25:07] [INFO ] Deduced a trap composed of 80 places in 291 ms of which 3 ms to minimize.
[2024-06-01 16:25:07] [INFO ] Deduced a trap composed of 71 places in 307 ms of which 4 ms to minimize.
[2024-06-01 16:25:07] [INFO ] Deduced a trap composed of 118 places in 344 ms of which 5 ms to minimize.
[2024-06-01 16:25:08] [INFO ] Deduced a trap composed of 76 places in 232 ms of which 3 ms to minimize.
[2024-06-01 16:25:08] [INFO ] Deduced a trap composed of 66 places in 213 ms of which 3 ms to minimize.
[2024-06-01 16:25:08] [INFO ] Deduced a trap composed of 95 places in 219 ms of which 3 ms to minimize.
[2024-06-01 16:25:08] [INFO ] Deduced a trap composed of 76 places in 217 ms of which 4 ms to minimize.
[2024-06-01 16:25:08] [INFO ] Deduced a trap composed of 65 places in 210 ms of which 3 ms to minimize.
[2024-06-01 16:25:09] [INFO ] Deduced a trap composed of 78 places in 215 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/251 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-06-01 16:25:11] [INFO ] Deduced a trap composed of 88 places in 176 ms of which 3 ms to minimize.
[2024-06-01 16:25:11] [INFO ] Deduced a trap composed of 72 places in 201 ms of which 3 ms to minimize.
[2024-06-01 16:25:11] [INFO ] Deduced a trap composed of 78 places in 201 ms of which 3 ms to minimize.
[2024-06-01 16:25:12] [INFO ] Deduced a trap composed of 74 places in 192 ms of which 3 ms to minimize.
[2024-06-01 16:25:12] [INFO ] Deduced a trap composed of 69 places in 201 ms of which 3 ms to minimize.
[2024-06-01 16:25:12] [INFO ] Deduced a trap composed of 101 places in 204 ms of which 4 ms to minimize.
[2024-06-01 16:25:12] [INFO ] Deduced a trap composed of 77 places in 216 ms of which 3 ms to minimize.
[2024-06-01 16:25:12] [INFO ] Deduced a trap composed of 111 places in 212 ms of which 3 ms to minimize.
[2024-06-01 16:25:13] [INFO ] Deduced a trap composed of 93 places in 217 ms of which 3 ms to minimize.
[2024-06-01 16:25:13] [INFO ] Deduced a trap composed of 90 places in 200 ms of which 2 ms to minimize.
[2024-06-01 16:25:13] [INFO ] Deduced a trap composed of 98 places in 201 ms of which 3 ms to minimize.
[2024-06-01 16:25:13] [INFO ] Deduced a trap composed of 90 places in 209 ms of which 3 ms to minimize.
[2024-06-01 16:25:13] [INFO ] Deduced a trap composed of 87 places in 207 ms of which 2 ms to minimize.
[2024-06-01 16:25:14] [INFO ] Deduced a trap composed of 109 places in 199 ms of which 3 ms to minimize.
[2024-06-01 16:25:14] [INFO ] Deduced a trap composed of 87 places in 210 ms of which 6 ms to minimize.
[2024-06-01 16:25:14] [INFO ] Deduced a trap composed of 81 places in 203 ms of which 3 ms to minimize.
[2024-06-01 16:25:14] [INFO ] Deduced a trap composed of 84 places in 204 ms of which 3 ms to minimize.
[2024-06-01 16:25:15] [INFO ] Deduced a trap composed of 82 places in 207 ms of which 2 ms to minimize.
[2024-06-01 16:25:15] [INFO ] Deduced a trap composed of 105 places in 207 ms of which 3 ms to minimize.
[2024-06-01 16:25:15] [INFO ] Deduced a trap composed of 87 places in 210 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/251 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 5 (OVERLAPS) 1/252 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-06-01 16:25:23] [INFO ] Deduced a trap composed of 109 places in 267 ms of which 4 ms to minimize.
[2024-06-01 16:25:23] [INFO ] Deduced a trap composed of 95 places in 281 ms of which 4 ms to minimize.
[2024-06-01 16:25:24] [INFO ] Deduced a trap composed of 89 places in 265 ms of which 4 ms to minimize.
[2024-06-01 16:25:24] [INFO ] Deduced a trap composed of 76 places in 247 ms of which 3 ms to minimize.
[2024-06-01 16:25:24] [INFO ] Deduced a trap composed of 109 places in 222 ms of which 3 ms to minimize.
[2024-06-01 16:25:24] [INFO ] Deduced a trap composed of 74 places in 212 ms of which 3 ms to minimize.
[2024-06-01 16:25:25] [INFO ] Deduced a trap composed of 85 places in 216 ms of which 4 ms to minimize.
[2024-06-01 16:25:25] [INFO ] Deduced a trap composed of 126 places in 217 ms of which 4 ms to minimize.
[2024-06-01 16:25:25] [INFO ] Deduced a trap composed of 90 places in 311 ms of which 4 ms to minimize.
[2024-06-01 16:25:25] [INFO ] Deduced a trap composed of 87 places in 257 ms of which 3 ms to minimize.
[2024-06-01 16:25:26] [INFO ] Deduced a trap composed of 126 places in 212 ms of which 4 ms to minimize.
[2024-06-01 16:25:26] [INFO ] Deduced a trap composed of 98 places in 205 ms of which 3 ms to minimize.
[2024-06-01 16:25:26] [INFO ] Deduced a trap composed of 119 places in 199 ms of which 3 ms to minimize.
[2024-06-01 16:25:26] [INFO ] Deduced a trap composed of 95 places in 194 ms of which 2 ms to minimize.
[2024-06-01 16:25:27] [INFO ] Deduced a trap composed of 115 places in 202 ms of which 3 ms to minimize.
[2024-06-01 16:25:27] [INFO ] Deduced a trap composed of 109 places in 220 ms of which 6 ms to minimize.
[2024-06-01 16:25:27] [INFO ] Deduced a trap composed of 110 places in 216 ms of which 3 ms to minimize.
[2024-06-01 16:25:27] [INFO ] Deduced a trap composed of 96 places in 205 ms of which 3 ms to minimize.
[2024-06-01 16:25:27] [INFO ] Deduced a trap composed of 93 places in 216 ms of which 2 ms to minimize.
[2024-06-01 16:25:28] [INFO ] Deduced a trap composed of 106 places in 197 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/252 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 482 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 252/744 variables, and 82 constraints, problems are : Problem set: 0 solved, 482 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/252 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 482/482 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 482 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/251 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/251 variables, 58/79 constraints. Problems are: Problem set: 0 solved, 482 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 251/744 variables, and 79 constraints, problems are : Problem set: 0 solved, 482 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 9/10 constraints, State Equation: 0/252 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 0/482 constraints, Known Traps: 58/60 constraints]
After SMT, in 60740ms problems are : Problem set: 0 solved, 482 unsolved
Search for dead transitions found 0 dead transitions in 60755ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62134 ms. Remains : 252/252 places, 492/492 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 100 Pre rules applied. Total rules applied 0 place count 252 transition count 392
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 0 with 200 rules applied. Total rules applied 200 place count 152 transition count 392
Applied a total of 200 rules in 45 ms. Remains 152 /252 variables (removed 100) and now considering 392/492 (removed 100) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 392 rows 152 cols
[2024-06-01 16:25:58] [INFO ] Computed 22 invariants in 5 ms
[2024-06-01 16:25:59] [INFO ] After 116ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 16:25:59] [INFO ] [Nat]Absence check using 12 positive place invariants in 10 ms returned sat
[2024-06-01 16:25:59] [INFO ] [Nat]Absence check using 12 positive and 10 generalized place invariants in 21 ms returned sat
[2024-06-01 16:25:59] [INFO ] After 254ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 16:25:59] [INFO ] After 284ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 16:25:59] [INFO ] After 471ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 665 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X((p1&&G((F(p2)&&F(G(p3)))))))))'
Support contains 7 out of 450 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 450/450 places, 726/726 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 442 transition count 682
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 442 transition count 682
Applied a total of 16 rules in 33 ms. Remains 442 /450 variables (removed 8) and now considering 682/726 (removed 44) transitions.
// Phase 1: matrix 682 rows 442 cols
[2024-06-01 16:26:00] [INFO ] Computed 22 invariants in 6 ms
[2024-06-01 16:26:00] [INFO ] Implicit Places using invariants in 473 ms returned []
[2024-06-01 16:26:00] [INFO ] Invariant cache hit.
[2024-06-01 16:26:00] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-06-01 16:26:03] [INFO ] Implicit Places using invariants and state equation in 3085 ms returned []
Implicit Place search using SMT with State Equation took 3566 ms to find 0 implicit places.
Running 672 sub problems to find dead transitions.
[2024-06-01 16:26:03] [INFO ] Invariant cache hit.
[2024-06-01 16:26:03] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/441 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 672 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/441 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 672 unsolved
[2024-06-01 16:26:13] [INFO ] Deduced a trap composed of 235 places in 362 ms of which 5 ms to minimize.
[2024-06-01 16:26:13] [INFO ] Deduced a trap composed of 129 places in 357 ms of which 4 ms to minimize.
[2024-06-01 16:26:14] [INFO ] Deduced a trap composed of 163 places in 383 ms of which 5 ms to minimize.
[2024-06-01 16:26:14] [INFO ] Deduced a trap composed of 145 places in 367 ms of which 5 ms to minimize.
[2024-06-01 16:26:15] [INFO ] Deduced a trap composed of 149 places in 374 ms of which 4 ms to minimize.
[2024-06-01 16:26:15] [INFO ] Deduced a trap composed of 160 places in 364 ms of which 5 ms to minimize.
[2024-06-01 16:26:15] [INFO ] Deduced a trap composed of 128 places in 346 ms of which 5 ms to minimize.
[2024-06-01 16:26:16] [INFO ] Deduced a trap composed of 235 places in 363 ms of which 5 ms to minimize.
[2024-06-01 16:26:16] [INFO ] Deduced a trap composed of 188 places in 367 ms of which 5 ms to minimize.
[2024-06-01 16:26:17] [INFO ] Deduced a trap composed of 202 places in 389 ms of which 5 ms to minimize.
[2024-06-01 16:26:17] [INFO ] Deduced a trap composed of 156 places in 305 ms of which 4 ms to minimize.
[2024-06-01 16:26:17] [INFO ] Deduced a trap composed of 129 places in 351 ms of which 4 ms to minimize.
[2024-06-01 16:26:18] [INFO ] Deduced a trap composed of 230 places in 366 ms of which 4 ms to minimize.
[2024-06-01 16:26:18] [INFO ] Deduced a trap composed of 167 places in 398 ms of which 5 ms to minimize.
[2024-06-01 16:26:19] [INFO ] Deduced a trap composed of 149 places in 380 ms of which 4 ms to minimize.
[2024-06-01 16:26:19] [INFO ] Deduced a trap composed of 142 places in 319 ms of which 4 ms to minimize.
[2024-06-01 16:26:19] [INFO ] Deduced a trap composed of 152 places in 365 ms of which 4 ms to minimize.
[2024-06-01 16:26:20] [INFO ] Deduced a trap composed of 170 places in 381 ms of which 5 ms to minimize.
[2024-06-01 16:26:20] [INFO ] Deduced a trap composed of 177 places in 347 ms of which 4 ms to minimize.
[2024-06-01 16:26:21] [INFO ] Deduced a trap composed of 174 places in 393 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/441 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 672 unsolved
[2024-06-01 16:26:28] [INFO ] Deduced a trap composed of 128 places in 399 ms of which 4 ms to minimize.
[2024-06-01 16:26:29] [INFO ] Deduced a trap composed of 120 places in 375 ms of which 5 ms to minimize.
[2024-06-01 16:26:29] [INFO ] Deduced a trap composed of 104 places in 402 ms of which 7 ms to minimize.
[2024-06-01 16:26:29] [INFO ] Deduced a trap composed of 107 places in 471 ms of which 4 ms to minimize.
[2024-06-01 16:26:30] [INFO ] Deduced a trap composed of 297 places in 401 ms of which 4 ms to minimize.
[2024-06-01 16:26:30] [INFO ] Deduced a trap composed of 120 places in 379 ms of which 4 ms to minimize.
[2024-06-01 16:26:31] [INFO ] Deduced a trap composed of 68 places in 372 ms of which 4 ms to minimize.
[2024-06-01 16:26:32] [INFO ] Deduced a trap composed of 279 places in 414 ms of which 4 ms to minimize.
[2024-06-01 16:26:32] [INFO ] Deduced a trap composed of 135 places in 394 ms of which 5 ms to minimize.
[2024-06-01 16:26:32] [INFO ] Deduced a trap composed of 222 places in 395 ms of which 7 ms to minimize.
[2024-06-01 16:26:33] [INFO ] Deduced a trap composed of 117 places in 471 ms of which 4 ms to minimize.
[2024-06-01 16:26:33] [INFO ] Deduced a trap composed of 250 places in 371 ms of which 4 ms to minimize.
[2024-06-01 16:26:34] [INFO ] Deduced a trap composed of 96 places in 387 ms of which 5 ms to minimize.
SMT process timed out in 30633ms, After SMT, problems are : Problem set: 0 solved, 672 unsolved
Search for dead transitions found 0 dead transitions in 30645ms
Starting structural reductions in LTL mode, iteration 1 : 442/450 places, 682/726 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34248 ms. Remains : 442/450 places, 682/726 transitions.
Stuttering acceptance computed with spot in 426 ms :[(OR (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (OR (NOT p1) (NOT p2) (NOT p3)), (NOT p2), (NOT p3), (OR (NOT p2) (NOT p3))]
Running random walk in product with property : Anderson-PT-10-LTLCardinality-00
Product exploration explored 100000 steps with 17 reset in 402 ms.
Stack based approach found an accepted trace after 72 steps with 0 reset with depth 73 and stack size 73 in 1 ms.
FORMULA Anderson-PT-10-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-10-LTLCardinality-00 finished in 35281 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0 U p1))))'
Support contains 4 out of 450 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 450/450 places, 726/726 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 443 transition count 701
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 443 transition count 701
Applied a total of 14 rules in 60 ms. Remains 443 /450 variables (removed 7) and now considering 701/726 (removed 25) transitions.
// Phase 1: matrix 701 rows 443 cols
[2024-06-01 16:26:35] [INFO ] Computed 22 invariants in 7 ms
[2024-06-01 16:26:35] [INFO ] Implicit Places using invariants in 573 ms returned []
[2024-06-01 16:26:35] [INFO ] Invariant cache hit.
[2024-06-01 16:26:36] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-06-01 16:26:38] [INFO ] Implicit Places using invariants and state equation in 2744 ms returned []
Implicit Place search using SMT with State Equation took 3328 ms to find 0 implicit places.
Running 691 sub problems to find dead transitions.
[2024-06-01 16:26:38] [INFO ] Invariant cache hit.
[2024-06-01 16:26:38] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/443 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/443 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 691 unsolved
[2024-06-01 16:26:48] [INFO ] Deduced a trap composed of 143 places in 377 ms of which 4 ms to minimize.
[2024-06-01 16:26:49] [INFO ] Deduced a trap composed of 182 places in 396 ms of which 5 ms to minimize.
[2024-06-01 16:26:49] [INFO ] Deduced a trap composed of 246 places in 386 ms of which 4 ms to minimize.
[2024-06-01 16:26:50] [INFO ] Deduced a trap composed of 120 places in 384 ms of which 4 ms to minimize.
[2024-06-01 16:26:50] [INFO ] Deduced a trap composed of 148 places in 376 ms of which 4 ms to minimize.
[2024-06-01 16:26:51] [INFO ] Deduced a trap composed of 138 places in 383 ms of which 5 ms to minimize.
[2024-06-01 16:26:51] [INFO ] Deduced a trap composed of 69 places in 374 ms of which 4 ms to minimize.
[2024-06-01 16:26:52] [INFO ] Deduced a trap composed of 184 places in 379 ms of which 5 ms to minimize.
[2024-06-01 16:26:52] [INFO ] Deduced a trap composed of 111 places in 345 ms of which 5 ms to minimize.
[2024-06-01 16:26:52] [INFO ] Deduced a trap composed of 131 places in 388 ms of which 6 ms to minimize.
[2024-06-01 16:26:53] [INFO ] Deduced a trap composed of 114 places in 495 ms of which 4 ms to minimize.
[2024-06-01 16:26:53] [INFO ] Deduced a trap composed of 176 places in 388 ms of which 5 ms to minimize.
[2024-06-01 16:26:54] [INFO ] Deduced a trap composed of 140 places in 377 ms of which 5 ms to minimize.
[2024-06-01 16:26:54] [INFO ] Deduced a trap composed of 155 places in 442 ms of which 6 ms to minimize.
[2024-06-01 16:26:55] [INFO ] Deduced a trap composed of 235 places in 460 ms of which 5 ms to minimize.
[2024-06-01 16:26:55] [INFO ] Deduced a trap composed of 151 places in 392 ms of which 5 ms to minimize.
[2024-06-01 16:26:55] [INFO ] Deduced a trap composed of 177 places in 405 ms of which 7 ms to minimize.
[2024-06-01 16:26:56] [INFO ] Deduced a trap composed of 132 places in 478 ms of which 4 ms to minimize.
[2024-06-01 16:26:56] [INFO ] Deduced a trap composed of 215 places in 381 ms of which 4 ms to minimize.
[2024-06-01 16:26:57] [INFO ] Deduced a trap composed of 248 places in 388 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/443 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 691 unsolved
[2024-06-01 16:27:01] [INFO ] Deduced a trap composed of 145 places in 402 ms of which 5 ms to minimize.
[2024-06-01 16:27:01] [INFO ] Deduced a trap composed of 197 places in 408 ms of which 4 ms to minimize.
[2024-06-01 16:27:02] [INFO ] Deduced a trap composed of 182 places in 427 ms of which 6 ms to minimize.
[2024-06-01 16:27:02] [INFO ] Deduced a trap composed of 91 places in 460 ms of which 4 ms to minimize.
[2024-06-01 16:27:02] [INFO ] Deduced a trap composed of 167 places in 401 ms of which 7 ms to minimize.
[2024-06-01 16:27:03] [INFO ] Deduced a trap composed of 132 places in 487 ms of which 4 ms to minimize.
[2024-06-01 16:27:03] [INFO ] Deduced a trap composed of 112 places in 378 ms of which 4 ms to minimize.
[2024-06-01 16:27:04] [INFO ] Deduced a trap composed of 116 places in 384 ms of which 4 ms to minimize.
[2024-06-01 16:27:04] [INFO ] Deduced a trap composed of 238 places in 394 ms of which 5 ms to minimize.
[2024-06-01 16:27:05] [INFO ] Deduced a trap composed of 170 places in 460 ms of which 6 ms to minimize.
[2024-06-01 16:27:05] [INFO ] Deduced a trap composed of 196 places in 405 ms of which 4 ms to minimize.
[2024-06-01 16:27:05] [INFO ] Deduced a trap composed of 109 places in 381 ms of which 4 ms to minimize.
[2024-06-01 16:27:06] [INFO ] Deduced a trap composed of 171 places in 392 ms of which 5 ms to minimize.
[2024-06-01 16:27:06] [INFO ] Deduced a trap composed of 170 places in 291 ms of which 4 ms to minimize.
[2024-06-01 16:27:07] [INFO ] Deduced a trap composed of 66 places in 388 ms of which 5 ms to minimize.
[2024-06-01 16:27:07] [INFO ] Deduced a trap composed of 149 places in 391 ms of which 6 ms to minimize.
[2024-06-01 16:27:07] [INFO ] Deduced a trap composed of 238 places in 486 ms of which 5 ms to minimize.
[2024-06-01 16:27:08] [INFO ] Deduced a trap composed of 128 places in 404 ms of which 5 ms to minimize.
[2024-06-01 16:27:08] [INFO ] Deduced a trap composed of 153 places in 495 ms of which 6 ms to minimize.
[2024-06-01 16:27:09] [INFO ] Deduced a trap composed of 193 places in 371 ms of which 4 ms to minimize.
SMT process timed out in 30741ms, After SMT, problems are : Problem set: 0 solved, 691 unsolved
Search for dead transitions found 0 dead transitions in 30749ms
Starting structural reductions in LTL mode, iteration 1 : 443/450 places, 701/726 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34140 ms. Remains : 443/450 places, 701/726 transitions.
Stuttering acceptance computed with spot in 195 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : Anderson-PT-10-LTLCardinality-03
Product exploration explored 100000 steps with 0 reset in 310 ms.
Product exploration explored 100000 steps with 0 reset in 425 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR p1 p0)), (X p0), (X p1), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR p1 p0))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 127 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 158 ms :[(NOT p1), true, (NOT p1)]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40000 steps (8 resets) in 415 ms. (96 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40001 steps (8 resets) in 301 ms. (132 steps per ms) remains 3/3 properties
BEST_FIRST walk for 32694 steps (6 resets) in 194 ms. (167 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR p1 p0)), (X p0), (X p1), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR p1 p0))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1))), (F (NOT (OR p0 p1)))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p0 p1)))
Knowledge based reduction with 11 factoid took 244 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-10-LTLCardinality-03 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-10-LTLCardinality-03 finished in 36017 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&X(p0)) U (p1&&(G(p2) U G(p3)))))'
Support contains 6 out of 450 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 450/450 places, 726/726 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 450 transition count 626
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 200 place count 350 transition count 626
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 85 Pre rules applied. Total rules applied 200 place count 350 transition count 541
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 2 with 170 rules applied. Total rules applied 370 place count 265 transition count 541
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 376 place count 259 transition count 499
Iterating global reduction 2 with 6 rules applied. Total rules applied 382 place count 259 transition count 499
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 390 place count 255 transition count 495
Applied a total of 390 rules in 45 ms. Remains 255 /450 variables (removed 195) and now considering 495/726 (removed 231) transitions.
// Phase 1: matrix 495 rows 255 cols
[2024-06-01 16:27:11] [INFO ] Computed 22 invariants in 5 ms
[2024-06-01 16:27:11] [INFO ] Implicit Places using invariants in 455 ms returned []
[2024-06-01 16:27:11] [INFO ] Invariant cache hit.
[2024-06-01 16:27:11] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-06-01 16:27:12] [INFO ] Implicit Places using invariants and state equation in 1076 ms returned []
Implicit Place search using SMT with State Equation took 1533 ms to find 0 implicit places.
[2024-06-01 16:27:12] [INFO ] Redundant transitions in 4 ms returned []
Running 485 sub problems to find dead transitions.
[2024-06-01 16:27:12] [INFO ] Invariant cache hit.
[2024-06-01 16:27:12] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 485 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/254 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 485 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/254 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 485 unsolved
At refinement iteration 3 (OVERLAPS) 1/255 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 485 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 485 unsolved
[2024-06-01 16:27:27] [INFO ] Deduced a trap composed of 99 places in 327 ms of which 4 ms to minimize.
[2024-06-01 16:27:27] [INFO ] Deduced a trap composed of 91 places in 323 ms of which 5 ms to minimize.
[2024-06-01 16:27:28] [INFO ] Deduced a trap composed of 96 places in 342 ms of which 5 ms to minimize.
[2024-06-01 16:27:28] [INFO ] Deduced a trap composed of 81 places in 331 ms of which 4 ms to minimize.
[2024-06-01 16:27:28] [INFO ] Deduced a trap composed of 82 places in 321 ms of which 4 ms to minimize.
[2024-06-01 16:27:29] [INFO ] Deduced a trap composed of 90 places in 331 ms of which 4 ms to minimize.
[2024-06-01 16:27:29] [INFO ] Deduced a trap composed of 82 places in 320 ms of which 5 ms to minimize.
[2024-06-01 16:27:30] [INFO ] Deduced a trap composed of 102 places in 337 ms of which 5 ms to minimize.
[2024-06-01 16:27:30] [INFO ] Deduced a trap composed of 101 places in 330 ms of which 4 ms to minimize.
[2024-06-01 16:27:30] [INFO ] Deduced a trap composed of 113 places in 320 ms of which 4 ms to minimize.
[2024-06-01 16:27:31] [INFO ] Deduced a trap composed of 89 places in 333 ms of which 5 ms to minimize.
[2024-06-01 16:27:31] [INFO ] Deduced a trap composed of 121 places in 363 ms of which 4 ms to minimize.
[2024-06-01 16:27:31] [INFO ] Deduced a trap composed of 76 places in 327 ms of which 5 ms to minimize.
[2024-06-01 16:27:32] [INFO ] Deduced a trap composed of 117 places in 320 ms of which 4 ms to minimize.
[2024-06-01 16:27:32] [INFO ] Deduced a trap composed of 117 places in 293 ms of which 4 ms to minimize.
[2024-06-01 16:27:32] [INFO ] Deduced a trap composed of 81 places in 318 ms of which 5 ms to minimize.
[2024-06-01 16:27:33] [INFO ] Deduced a trap composed of 82 places in 309 ms of which 5 ms to minimize.
[2024-06-01 16:27:33] [INFO ] Deduced a trap composed of 100 places in 330 ms of which 4 ms to minimize.
[2024-06-01 16:27:34] [INFO ] Deduced a trap composed of 79 places in 330 ms of which 4 ms to minimize.
[2024-06-01 16:27:34] [INFO ] Deduced a trap composed of 102 places in 313 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 485 unsolved
[2024-06-01 16:27:38] [INFO ] Deduced a trap composed of 110 places in 320 ms of which 4 ms to minimize.
[2024-06-01 16:27:39] [INFO ] Deduced a trap composed of 125 places in 312 ms of which 5 ms to minimize.
[2024-06-01 16:27:39] [INFO ] Deduced a trap composed of 104 places in 292 ms of which 5 ms to minimize.
[2024-06-01 16:27:39] [INFO ] Deduced a trap composed of 102 places in 337 ms of which 4 ms to minimize.
[2024-06-01 16:27:40] [INFO ] Deduced a trap composed of 99 places in 327 ms of which 5 ms to minimize.
[2024-06-01 16:27:40] [INFO ] Deduced a trap composed of 87 places in 329 ms of which 4 ms to minimize.
[2024-06-01 16:27:40] [INFO ] Deduced a trap composed of 77 places in 325 ms of which 4 ms to minimize.
[2024-06-01 16:27:41] [INFO ] Deduced a trap composed of 74 places in 320 ms of which 4 ms to minimize.
[2024-06-01 16:27:41] [INFO ] Deduced a trap composed of 110 places in 340 ms of which 4 ms to minimize.
[2024-06-01 16:27:41] [INFO ] Deduced a trap composed of 87 places in 318 ms of which 4 ms to minimize.
[2024-06-01 16:27:42] [INFO ] Deduced a trap composed of 107 places in 305 ms of which 4 ms to minimize.
[2024-06-01 16:27:42] [INFO ] Deduced a trap composed of 110 places in 234 ms of which 3 ms to minimize.
[2024-06-01 16:27:42] [INFO ] Deduced a trap composed of 78 places in 188 ms of which 3 ms to minimize.
[2024-06-01 16:27:42] [INFO ] Deduced a trap composed of 61 places in 196 ms of which 3 ms to minimize.
[2024-06-01 16:27:43] [INFO ] Deduced a trap composed of 131 places in 191 ms of which 3 ms to minimize.
[2024-06-01 16:27:43] [INFO ] Deduced a trap composed of 119 places in 187 ms of which 3 ms to minimize.
SMT process timed out in 30545ms, After SMT, problems are : Problem set: 0 solved, 485 unsolved
Search for dead transitions found 0 dead transitions in 30552ms
Starting structural reductions in SI_LTL mode, iteration 1 : 255/450 places, 495/726 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 32142 ms. Remains : 255/450 places, 495/726 transitions.
Stuttering acceptance computed with spot in 475 ms :[(OR (NOT p1) (NOT p3)), true, (OR (AND (NOT p0) p1 p3) (AND (NOT p0) p1 p2)), (NOT p2), (NOT p3), (NOT p3), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p3), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : Anderson-PT-10-LTLCardinality-05
Product exploration explored 100000 steps with 0 reset in 182 ms.
Product exploration explored 100000 steps with 0 reset in 223 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) p3 (NOT p2)), (X (NOT p2)), (X p3), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p3) p2 p0))), (X (NOT (OR (AND (NOT p1) p0) (AND (NOT p3) (NOT p2) p0)))), (X (OR (AND p1 p3 (NOT p0)) (AND p1 p2 (NOT p0)))), (X (AND p3 (NOT p0))), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p3) (NOT p2) (NOT p0))))), (X (NOT (AND (NOT p3) p2))), (X (NOT (AND p3 p2 p0))), (X (AND p3 (NOT p2))), (X (NOT (AND p1 p3 (NOT p2) p0))), (X (NOT (AND p3 p2))), (X (NOT (OR (AND (NOT p1) p3 p0) (AND p3 (NOT p2) p0)))), (X (NOT (OR (AND (NOT p1) (NOT p2) p0) (AND (NOT p3) (NOT p2) p0)))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0)))), (X (AND p1 p3 (NOT p2) (NOT p0))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (NOT (AND p1 p3 p2 (NOT p0)))), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND p1 p3 p2 p0))), (X (NOT (AND p1 (NOT p3) p2 (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p2) p0))), (X (NOT (OR (AND (NOT p1) (NOT p3) p0) (AND (NOT p3) (NOT p2) p0)))), (X (NOT (OR (AND (NOT p1) p2 p0) (AND (NOT p3) p2 p0)))), (X (NOT (AND (NOT p3) p2 (NOT p0)))), (X (NOT (AND p3 (NOT p2) p0))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p1 (NOT p3) p2 p0))), (X (AND p3 (NOT p2) (NOT p0))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p3) p2 p0)))), (X (X (NOT (OR (AND (NOT p1) p0) (AND (NOT p3) (NOT p2) p0))))), (X (X (AND p3 (NOT p0)))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND p3 p2 p0)))), (X (X (AND p3 (NOT p2)))), (X (X (NOT (AND p1 p3 (NOT p2) p0)))), (X (X (NOT (AND p3 p2)))), (X (X (NOT (OR (AND (NOT p1) p3 p0) (AND p3 (NOT p2) p0))))), (X (X (NOT (OR (AND (NOT p1) (NOT p2) p0) (AND (NOT p3) (NOT p2) p0))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0))))), (X (X (NOT (AND p3 p2 (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT (AND p1 p3 p2 (NOT p0))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND p1 p3 p2 p0)))), (X (X (NOT (AND p1 (NOT p3) p2 (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2) p0)))), (X (X (NOT (OR (AND (NOT p1) (NOT p3) p0) (AND (NOT p3) (NOT p2) p0))))), (X (X (NOT (OR (AND (NOT p1) p2 p0) (AND (NOT p3) p2 p0))))), (X (X (NOT (AND (NOT p3) p2 (NOT p0))))), (X (X (NOT (AND p3 (NOT p2) p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 (NOT p3) p2 p0)))), (X (X (AND p3 (NOT p2) (NOT p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (OR (AND p1 p3 (NOT p0)) (AND p1 p2 (NOT p0))))), (X (X (NOT (OR (AND p1 p3 (NOT p0)) (AND p1 p2 (NOT p0)))))), (X (X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p3) (NOT p2) (NOT p0))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p3) (NOT p2) (NOT p0)))))), (X (X (AND p1 p3 (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 p3 (NOT p2) (NOT p0))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 64 factoid took 365 ms. Reduced automaton from 11 states, 60 edges and 4 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[true, (NOT p3)]
RANDOM walk for 40000 steps (8 resets) in 111 ms. (357 steps per ms) remains 1/1 properties
BEST_FIRST walk for 7304 steps (1 resets) in 14 ms. (486 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 (NOT p0) p3 (NOT p2)), (X (NOT p2)), (X p3), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p3) p2 p0))), (X (NOT (OR (AND (NOT p1) p0) (AND (NOT p3) (NOT p2) p0)))), (X (OR (AND p1 p3 (NOT p0)) (AND p1 p2 (NOT p0)))), (X (AND p3 (NOT p0))), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p3) (NOT p2) (NOT p0))))), (X (NOT (AND (NOT p3) p2))), (X (NOT (AND p3 p2 p0))), (X (AND p3 (NOT p2))), (X (NOT (AND p1 p3 (NOT p2) p0))), (X (NOT (AND p3 p2))), (X (NOT (OR (AND (NOT p1) p3 p0) (AND p3 (NOT p2) p0)))), (X (NOT (OR (AND (NOT p1) (NOT p2) p0) (AND (NOT p3) (NOT p2) p0)))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0)))), (X (AND p1 p3 (NOT p2) (NOT p0))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (NOT (AND p1 p3 p2 (NOT p0)))), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND p1 p3 p2 p0))), (X (NOT (AND p1 (NOT p3) p2 (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p2) p0))), (X (NOT (OR (AND (NOT p1) (NOT p3) p0) (AND (NOT p3) (NOT p2) p0)))), (X (NOT (OR (AND (NOT p1) p2 p0) (AND (NOT p3) p2 p0)))), (X (NOT (AND (NOT p3) p2 (NOT p0)))), (X (NOT (AND p3 (NOT p2) p0))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p1 (NOT p3) p2 p0))), (X (AND p3 (NOT p2) (NOT p0))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p3) p2 p0)))), (X (X (NOT (OR (AND (NOT p1) p0) (AND (NOT p3) (NOT p2) p0))))), (X (X (AND p3 (NOT p0)))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND p3 p2 p0)))), (X (X (AND p3 (NOT p2)))), (X (X (NOT (AND p1 p3 (NOT p2) p0)))), (X (X (NOT (AND p3 p2)))), (X (X (NOT (OR (AND (NOT p1) p3 p0) (AND p3 (NOT p2) p0))))), (X (X (NOT (OR (AND (NOT p1) (NOT p2) p0) (AND (NOT p3) (NOT p2) p0))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0))))), (X (X (NOT (AND p3 p2 (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT (AND p1 p3 p2 (NOT p0))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND p1 p3 p2 p0)))), (X (X (NOT (AND p1 (NOT p3) p2 (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2) p0)))), (X (X (NOT (OR (AND (NOT p1) (NOT p3) p0) (AND (NOT p3) (NOT p2) p0))))), (X (X (NOT (OR (AND (NOT p1) p2 p0) (AND (NOT p3) p2 p0))))), (X (X (NOT (AND (NOT p3) p2 (NOT p0))))), (X (X (NOT (AND p3 (NOT p2) p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 (NOT p3) p2 p0)))), (X (X (AND p3 (NOT p2) (NOT p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (OR (AND p1 p3 (NOT p0)) (AND p1 p2 (NOT p0))))), (X (X (NOT (OR (AND p1 p3 (NOT p0)) (AND p1 p2 (NOT p0)))))), (X (X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p3) (NOT p2) (NOT p0))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p3) (NOT p2) (NOT p0)))))), (X (X (AND p1 p3 (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 p3 (NOT p2) (NOT p0))))), (X (X p1)), (X (X (NOT p1))), (F (NOT p3))]
Property proved to be false thanks to negative knowledge :(F (NOT p3))
Knowledge based reduction with 64 factoid took 387 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-10-LTLCardinality-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-10-LTLCardinality-05 finished in 33924 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 450 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 450/450 places, 726/726 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 442 transition count 700
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 442 transition count 700
Applied a total of 16 rules in 21 ms. Remains 442 /450 variables (removed 8) and now considering 700/726 (removed 26) transitions.
// Phase 1: matrix 700 rows 442 cols
[2024-06-01 16:27:45] [INFO ] Computed 22 invariants in 7 ms
[2024-06-01 16:27:45] [INFO ] Implicit Places using invariants in 536 ms returned []
[2024-06-01 16:27:45] [INFO ] Invariant cache hit.
[2024-06-01 16:27:46] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-06-01 16:27:49] [INFO ] Implicit Places using invariants and state equation in 3448 ms returned []
Implicit Place search using SMT with State Equation took 3993 ms to find 0 implicit places.
Running 690 sub problems to find dead transitions.
[2024-06-01 16:27:49] [INFO ] Invariant cache hit.
[2024-06-01 16:27:49] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 11/22 constraints. Problems are: Problem set: 0 solved, 690 unsolved
[2024-06-01 16:28:04] [INFO ] Deduced a trap composed of 111 places in 570 ms of which 7 ms to minimize.
[2024-06-01 16:28:04] [INFO ] Deduced a trap composed of 182 places in 557 ms of which 7 ms to minimize.
[2024-06-01 16:28:06] [INFO ] Deduced a trap composed of 61 places in 554 ms of which 7 ms to minimize.
[2024-06-01 16:28:06] [INFO ] Deduced a trap composed of 178 places in 576 ms of which 7 ms to minimize.
[2024-06-01 16:28:07] [INFO ] Deduced a trap composed of 198 places in 576 ms of which 7 ms to minimize.
[2024-06-01 16:28:08] [INFO ] Deduced a trap composed of 178 places in 561 ms of which 7 ms to minimize.
[2024-06-01 16:28:08] [INFO ] Deduced a trap composed of 270 places in 503 ms of which 7 ms to minimize.
[2024-06-01 16:28:09] [INFO ] Deduced a trap composed of 213 places in 457 ms of which 6 ms to minimize.
[2024-06-01 16:28:09] [INFO ] Deduced a trap composed of 267 places in 462 ms of which 6 ms to minimize.
[2024-06-01 16:28:10] [INFO ] Deduced a trap composed of 263 places in 521 ms of which 7 ms to minimize.
[2024-06-01 16:28:10] [INFO ] Deduced a trap composed of 263 places in 418 ms of which 6 ms to minimize.
[2024-06-01 16:28:11] [INFO ] Deduced a trap composed of 263 places in 433 ms of which 5 ms to minimize.
[2024-06-01 16:28:11] [INFO ] Deduced a trap composed of 236 places in 423 ms of which 4 ms to minimize.
[2024-06-01 16:28:12] [INFO ] Deduced a trap composed of 268 places in 436 ms of which 6 ms to minimize.
[2024-06-01 16:28:12] [INFO ] Deduced a trap composed of 250 places in 487 ms of which 6 ms to minimize.
[2024-06-01 16:28:13] [INFO ] Deduced a trap composed of 217 places in 481 ms of which 6 ms to minimize.
[2024-06-01 16:28:13] [INFO ] Deduced a trap composed of 169 places in 482 ms of which 7 ms to minimize.
[2024-06-01 16:28:14] [INFO ] Deduced a trap composed of 161 places in 567 ms of which 7 ms to minimize.
[2024-06-01 16:28:14] [INFO ] Deduced a trap composed of 233 places in 590 ms of which 7 ms to minimize.
[2024-06-01 16:28:15] [INFO ] Deduced a trap composed of 167 places in 556 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/442 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 690 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 442/1142 variables, and 42 constraints, problems are : Problem set: 0 solved, 690 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/442 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 690/690 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 690 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 11/22 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/442 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 690 unsolved
[2024-06-01 16:28:31] [INFO ] Deduced a trap composed of 92 places in 512 ms of which 7 ms to minimize.
[2024-06-01 16:28:32] [INFO ] Deduced a trap composed of 188 places in 553 ms of which 6 ms to minimize.
[2024-06-01 16:28:33] [INFO ] Deduced a trap composed of 148 places in 585 ms of which 7 ms to minimize.
[2024-06-01 16:28:34] [INFO ] Deduced a trap composed of 259 places in 530 ms of which 7 ms to minimize.
[2024-06-01 16:28:34] [INFO ] Deduced a trap composed of 290 places in 561 ms of which 7 ms to minimize.
[2024-06-01 16:28:35] [INFO ] Deduced a trap composed of 260 places in 542 ms of which 6 ms to minimize.
[2024-06-01 16:28:35] [INFO ] Deduced a trap composed of 224 places in 551 ms of which 7 ms to minimize.
[2024-06-01 16:28:36] [INFO ] Deduced a trap composed of 64 places in 575 ms of which 7 ms to minimize.
[2024-06-01 16:28:38] [INFO ] Deduced a trap composed of 250 places in 532 ms of which 7 ms to minimize.
[2024-06-01 16:28:38] [INFO ] Deduced a trap composed of 260 places in 473 ms of which 7 ms to minimize.
[2024-06-01 16:28:39] [INFO ] Deduced a trap composed of 163 places in 534 ms of which 7 ms to minimize.
[2024-06-01 16:28:40] [INFO ] Deduced a trap composed of 231 places in 537 ms of which 8 ms to minimize.
[2024-06-01 16:28:40] [INFO ] Deduced a trap composed of 215 places in 553 ms of which 6 ms to minimize.
[2024-06-01 16:28:41] [INFO ] Deduced a trap composed of 111 places in 565 ms of which 7 ms to minimize.
[2024-06-01 16:28:41] [INFO ] Deduced a trap composed of 298 places in 573 ms of which 7 ms to minimize.
[2024-06-01 16:28:42] [INFO ] Deduced a trap composed of 124 places in 562 ms of which 6 ms to minimize.
[2024-06-01 16:28:42] [INFO ] Deduced a trap composed of 179 places in 536 ms of which 4 ms to minimize.
[2024-06-01 16:28:43] [INFO ] Deduced a trap composed of 109 places in 364 ms of which 4 ms to minimize.
[2024-06-01 16:28:43] [INFO ] Deduced a trap composed of 278 places in 475 ms of which 7 ms to minimize.
[2024-06-01 16:28:44] [INFO ] Deduced a trap composed of 181 places in 549 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/442 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 690 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 442/1142 variables, and 62 constraints, problems are : Problem set: 0 solved, 690 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/442 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 0/690 constraints, Known Traps: 40/40 constraints]
After SMT, in 60558ms problems are : Problem set: 0 solved, 690 unsolved
Search for dead transitions found 0 dead transitions in 60571ms
Starting structural reductions in LTL mode, iteration 1 : 442/450 places, 700/726 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64588 ms. Remains : 442/450 places, 700/726 transitions.
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-10-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Anderson-PT-10-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-10-LTLCardinality-06 finished in 64729 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))||(X(p1)&&G(!p0))))'
Support contains 4 out of 450 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 450/450 places, 726/726 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 440 transition count 680
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 440 transition count 680
Applied a total of 20 rules in 18 ms. Remains 440 /450 variables (removed 10) and now considering 680/726 (removed 46) transitions.
// Phase 1: matrix 680 rows 440 cols
[2024-06-01 16:28:49] [INFO ] Computed 22 invariants in 7 ms
[2024-06-01 16:28:50] [INFO ] Implicit Places using invariants in 517 ms returned []
[2024-06-01 16:28:50] [INFO ] Invariant cache hit.
[2024-06-01 16:28:50] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-06-01 16:28:53] [INFO ] Implicit Places using invariants and state equation in 3185 ms returned []
Implicit Place search using SMT with State Equation took 3704 ms to find 0 implicit places.
Running 670 sub problems to find dead transitions.
[2024-06-01 16:28:53] [INFO ] Invariant cache hit.
[2024-06-01 16:28:53] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/439 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/439 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 670 unsolved
[2024-06-01 16:29:08] [INFO ] Deduced a trap composed of 195 places in 466 ms of which 6 ms to minimize.
[2024-06-01 16:29:08] [INFO ] Deduced a trap composed of 202 places in 428 ms of which 6 ms to minimize.
[2024-06-01 16:29:09] [INFO ] Deduced a trap composed of 168 places in 426 ms of which 6 ms to minimize.
[2024-06-01 16:29:09] [INFO ] Deduced a trap composed of 178 places in 438 ms of which 6 ms to minimize.
[2024-06-01 16:29:10] [INFO ] Deduced a trap composed of 140 places in 433 ms of which 6 ms to minimize.
[2024-06-01 16:29:10] [INFO ] Deduced a trap composed of 205 places in 415 ms of which 5 ms to minimize.
[2024-06-01 16:29:11] [INFO ] Deduced a trap composed of 157 places in 443 ms of which 6 ms to minimize.
[2024-06-01 16:29:11] [INFO ] Deduced a trap composed of 141 places in 461 ms of which 5 ms to minimize.
[2024-06-01 16:29:12] [INFO ] Deduced a trap composed of 262 places in 461 ms of which 6 ms to minimize.
[2024-06-01 16:29:12] [INFO ] Deduced a trap composed of 200 places in 407 ms of which 6 ms to minimize.
[2024-06-01 16:29:13] [INFO ] Deduced a trap composed of 259 places in 489 ms of which 7 ms to minimize.
[2024-06-01 16:29:13] [INFO ] Deduced a trap composed of 174 places in 556 ms of which 7 ms to minimize.
[2024-06-01 16:29:14] [INFO ] Deduced a trap composed of 203 places in 560 ms of which 7 ms to minimize.
[2024-06-01 16:29:14] [INFO ] Deduced a trap composed of 166 places in 544 ms of which 7 ms to minimize.
[2024-06-01 16:29:15] [INFO ] Deduced a trap composed of 197 places in 564 ms of which 7 ms to minimize.
[2024-06-01 16:29:16] [INFO ] Deduced a trap composed of 210 places in 575 ms of which 7 ms to minimize.
[2024-06-01 16:29:16] [INFO ] Deduced a trap composed of 144 places in 542 ms of which 7 ms to minimize.
[2024-06-01 16:29:17] [INFO ] Deduced a trap composed of 237 places in 548 ms of which 7 ms to minimize.
[2024-06-01 16:29:17] [INFO ] Deduced a trap composed of 125 places in 562 ms of which 8 ms to minimize.
[2024-06-01 16:29:18] [INFO ] Deduced a trap composed of 165 places in 539 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/439 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 670 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 439/1120 variables, and 41 constraints, problems are : Problem set: 0 solved, 670 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 9/10 constraints, State Equation: 0/440 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 670/670 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 670 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/439 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/439 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/439 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 670 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 439/1120 variables, and 41 constraints, problems are : Problem set: 0 solved, 670 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 9/10 constraints, State Equation: 0/440 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 0/670 constraints, Known Traps: 20/20 constraints]
After SMT, in 60518ms problems are : Problem set: 0 solved, 670 unsolved
Search for dead transitions found 0 dead transitions in 60528ms
Starting structural reductions in LTL mode, iteration 1 : 440/450 places, 680/726 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64254 ms. Remains : 440/450 places, 680/726 transitions.
Stuttering acceptance computed with spot in 160 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), p0]
Running random walk in product with property : Anderson-PT-10-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 4196 steps with 0 reset in 12 ms.
FORMULA Anderson-PT-10-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-10-LTLCardinality-07 finished in 64447 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 450 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 450/450 places, 726/726 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 440 transition count 680
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 440 transition count 680
Applied a total of 20 rules in 17 ms. Remains 440 /450 variables (removed 10) and now considering 680/726 (removed 46) transitions.
[2024-06-01 16:29:54] [INFO ] Invariant cache hit.
[2024-06-01 16:29:54] [INFO ] Implicit Places using invariants in 580 ms returned []
[2024-06-01 16:29:54] [INFO ] Invariant cache hit.
[2024-06-01 16:29:55] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-06-01 16:29:58] [INFO ] Implicit Places using invariants and state equation in 3370 ms returned []
Implicit Place search using SMT with State Equation took 3953 ms to find 0 implicit places.
Running 670 sub problems to find dead transitions.
[2024-06-01 16:29:58] [INFO ] Invariant cache hit.
[2024-06-01 16:29:58] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/439 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/439 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 670 unsolved
[2024-06-01 16:30:13] [INFO ] Deduced a trap composed of 195 places in 465 ms of which 7 ms to minimize.
[2024-06-01 16:30:14] [INFO ] Deduced a trap composed of 202 places in 453 ms of which 7 ms to minimize.
[2024-06-01 16:30:14] [INFO ] Deduced a trap composed of 168 places in 428 ms of which 7 ms to minimize.
[2024-06-01 16:30:15] [INFO ] Deduced a trap composed of 178 places in 456 ms of which 7 ms to minimize.
[2024-06-01 16:30:15] [INFO ] Deduced a trap composed of 140 places in 447 ms of which 7 ms to minimize.
[2024-06-01 16:30:16] [INFO ] Deduced a trap composed of 205 places in 594 ms of which 7 ms to minimize.
[2024-06-01 16:30:17] [INFO ] Deduced a trap composed of 157 places in 451 ms of which 6 ms to minimize.
[2024-06-01 16:30:17] [INFO ] Deduced a trap composed of 141 places in 524 ms of which 7 ms to minimize.
[2024-06-01 16:30:18] [INFO ] Deduced a trap composed of 262 places in 513 ms of which 7 ms to minimize.
[2024-06-01 16:30:18] [INFO ] Deduced a trap composed of 200 places in 475 ms of which 6 ms to minimize.
[2024-06-01 16:30:19] [INFO ] Deduced a trap composed of 259 places in 516 ms of which 7 ms to minimize.
[2024-06-01 16:30:19] [INFO ] Deduced a trap composed of 174 places in 471 ms of which 7 ms to minimize.
[2024-06-01 16:30:20] [INFO ] Deduced a trap composed of 203 places in 559 ms of which 7 ms to minimize.
[2024-06-01 16:30:20] [INFO ] Deduced a trap composed of 166 places in 497 ms of which 7 ms to minimize.
[2024-06-01 16:30:21] [INFO ] Deduced a trap composed of 197 places in 542 ms of which 7 ms to minimize.
[2024-06-01 16:30:21] [INFO ] Deduced a trap composed of 210 places in 474 ms of which 7 ms to minimize.
[2024-06-01 16:30:22] [INFO ] Deduced a trap composed of 144 places in 548 ms of which 7 ms to minimize.
[2024-06-01 16:30:22] [INFO ] Deduced a trap composed of 237 places in 469 ms of which 7 ms to minimize.
[2024-06-01 16:30:23] [INFO ] Deduced a trap composed of 125 places in 530 ms of which 7 ms to minimize.
[2024-06-01 16:30:23] [INFO ] Deduced a trap composed of 165 places in 503 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/439 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 670 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 439/1120 variables, and 41 constraints, problems are : Problem set: 0 solved, 670 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 9/10 constraints, State Equation: 0/440 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 670/670 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 670 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/439 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/439 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/439 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 670 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 439/1120 variables, and 41 constraints, problems are : Problem set: 0 solved, 670 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 9/10 constraints, State Equation: 0/440 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 0/670 constraints, Known Traps: 20/20 constraints]
After SMT, in 60631ms problems are : Problem set: 0 solved, 670 unsolved
Search for dead transitions found 0 dead transitions in 60642ms
Starting structural reductions in LTL mode, iteration 1 : 440/450 places, 680/726 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64617 ms. Remains : 440/450 places, 680/726 transitions.
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-10-LTLCardinality-08
Product exploration explored 100000 steps with 26 reset in 232 ms.
Stack based approach found an accepted trace after 129 steps with 0 reset with depth 130 and stack size 130 in 1 ms.
FORMULA Anderson-PT-10-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-10-LTLCardinality-08 finished in 65022 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 1 out of 450 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 450/450 places, 726/726 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 440 transition count 680
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 440 transition count 680
Applied a total of 20 rules in 18 ms. Remains 440 /450 variables (removed 10) and now considering 680/726 (removed 46) transitions.
[2024-06-01 16:30:59] [INFO ] Invariant cache hit.
[2024-06-01 16:30:59] [INFO ] Implicit Places using invariants in 636 ms returned []
[2024-06-01 16:30:59] [INFO ] Invariant cache hit.
[2024-06-01 16:31:00] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-06-01 16:31:03] [INFO ] Implicit Places using invariants and state equation in 3337 ms returned []
Implicit Place search using SMT with State Equation took 3979 ms to find 0 implicit places.
Running 670 sub problems to find dead transitions.
[2024-06-01 16:31:03] [INFO ] Invariant cache hit.
[2024-06-01 16:31:03] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/439 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/439 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 670 unsolved
[2024-06-01 16:31:17] [INFO ] Deduced a trap composed of 195 places in 530 ms of which 8 ms to minimize.
[2024-06-01 16:31:18] [INFO ] Deduced a trap composed of 202 places in 553 ms of which 7 ms to minimize.
[2024-06-01 16:31:18] [INFO ] Deduced a trap composed of 168 places in 521 ms of which 7 ms to minimize.
[2024-06-01 16:31:19] [INFO ] Deduced a trap composed of 178 places in 523 ms of which 7 ms to minimize.
[2024-06-01 16:31:19] [INFO ] Deduced a trap composed of 140 places in 457 ms of which 7 ms to minimize.
[2024-06-01 16:31:20] [INFO ] Deduced a trap composed of 205 places in 532 ms of which 4 ms to minimize.
[2024-06-01 16:31:21] [INFO ] Deduced a trap composed of 157 places in 539 ms of which 7 ms to minimize.
[2024-06-01 16:31:21] [INFO ] Deduced a trap composed of 141 places in 507 ms of which 7 ms to minimize.
[2024-06-01 16:31:22] [INFO ] Deduced a trap composed of 262 places in 529 ms of which 7 ms to minimize.
[2024-06-01 16:31:22] [INFO ] Deduced a trap composed of 200 places in 472 ms of which 7 ms to minimize.
[2024-06-01 16:31:23] [INFO ] Deduced a trap composed of 259 places in 548 ms of which 7 ms to minimize.
[2024-06-01 16:31:23] [INFO ] Deduced a trap composed of 174 places in 547 ms of which 7 ms to minimize.
[2024-06-01 16:31:24] [INFO ] Deduced a trap composed of 203 places in 561 ms of which 7 ms to minimize.
[2024-06-01 16:31:24] [INFO ] Deduced a trap composed of 166 places in 443 ms of which 4 ms to minimize.
[2024-06-01 16:31:25] [INFO ] Deduced a trap composed of 197 places in 549 ms of which 7 ms to minimize.
[2024-06-01 16:31:25] [INFO ] Deduced a trap composed of 210 places in 552 ms of which 7 ms to minimize.
[2024-06-01 16:31:26] [INFO ] Deduced a trap composed of 144 places in 516 ms of which 5 ms to minimize.
[2024-06-01 16:31:27] [INFO ] Deduced a trap composed of 237 places in 534 ms of which 7 ms to minimize.
[2024-06-01 16:31:27] [INFO ] Deduced a trap composed of 125 places in 502 ms of which 6 ms to minimize.
[2024-06-01 16:31:28] [INFO ] Deduced a trap composed of 165 places in 443 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/439 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 670 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 439/1120 variables, and 41 constraints, problems are : Problem set: 0 solved, 670 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 9/10 constraints, State Equation: 0/440 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 670/670 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 670 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/439 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/439 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/439 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 670 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 439/1120 variables, and 41 constraints, problems are : Problem set: 0 solved, 670 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 9/10 constraints, State Equation: 0/440 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 0/670 constraints, Known Traps: 20/20 constraints]
After SMT, in 60630ms problems are : Problem set: 0 solved, 670 unsolved
Search for dead transitions found 0 dead transitions in 60644ms
Starting structural reductions in LTL mode, iteration 1 : 440/450 places, 680/726 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64644 ms. Remains : 440/450 places, 680/726 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : Anderson-PT-10-LTLCardinality-11
Product exploration explored 100000 steps with 50000 reset in 414 ms.
Product exploration explored 100000 steps with 50000 reset in 430 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 41 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-10-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-10-LTLCardinality-11 finished in 65642 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(F((p0&&F(p1)))))))'
Support contains 3 out of 450 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 450/450 places, 726/726 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 440 transition count 680
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 440 transition count 680
Applied a total of 20 rules in 17 ms. Remains 440 /450 variables (removed 10) and now considering 680/726 (removed 46) transitions.
[2024-06-01 16:32:04] [INFO ] Invariant cache hit.
[2024-06-01 16:32:05] [INFO ] Implicit Places using invariants in 563 ms returned []
[2024-06-01 16:32:05] [INFO ] Invariant cache hit.
[2024-06-01 16:32:05] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-06-01 16:32:08] [INFO ] Implicit Places using invariants and state equation in 3161 ms returned []
Implicit Place search using SMT with State Equation took 3727 ms to find 0 implicit places.
Running 670 sub problems to find dead transitions.
[2024-06-01 16:32:08] [INFO ] Invariant cache hit.
[2024-06-01 16:32:08] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/439 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/439 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 670 unsolved
[2024-06-01 16:32:24] [INFO ] Deduced a trap composed of 195 places in 526 ms of which 8 ms to minimize.
[2024-06-01 16:32:24] [INFO ] Deduced a trap composed of 202 places in 553 ms of which 7 ms to minimize.
[2024-06-01 16:32:25] [INFO ] Deduced a trap composed of 168 places in 530 ms of which 7 ms to minimize.
[2024-06-01 16:32:25] [INFO ] Deduced a trap composed of 178 places in 527 ms of which 7 ms to minimize.
[2024-06-01 16:32:26] [INFO ] Deduced a trap composed of 140 places in 530 ms of which 7 ms to minimize.
[2024-06-01 16:32:26] [INFO ] Deduced a trap composed of 205 places in 523 ms of which 7 ms to minimize.
[2024-06-01 16:32:27] [INFO ] Deduced a trap composed of 157 places in 535 ms of which 7 ms to minimize.
[2024-06-01 16:32:28] [INFO ] Deduced a trap composed of 141 places in 563 ms of which 7 ms to minimize.
[2024-06-01 16:32:28] [INFO ] Deduced a trap composed of 262 places in 528 ms of which 7 ms to minimize.
[2024-06-01 16:32:29] [INFO ] Deduced a trap composed of 200 places in 541 ms of which 7 ms to minimize.
[2024-06-01 16:32:29] [INFO ] Deduced a trap composed of 259 places in 525 ms of which 7 ms to minimize.
[2024-06-01 16:32:30] [INFO ] Deduced a trap composed of 174 places in 539 ms of which 7 ms to minimize.
[2024-06-01 16:32:30] [INFO ] Deduced a trap composed of 203 places in 533 ms of which 7 ms to minimize.
[2024-06-01 16:32:31] [INFO ] Deduced a trap composed of 166 places in 545 ms of which 7 ms to minimize.
[2024-06-01 16:32:32] [INFO ] Deduced a trap composed of 197 places in 564 ms of which 7 ms to minimize.
[2024-06-01 16:32:32] [INFO ] Deduced a trap composed of 210 places in 558 ms of which 7 ms to minimize.
[2024-06-01 16:32:33] [INFO ] Deduced a trap composed of 144 places in 550 ms of which 7 ms to minimize.
[2024-06-01 16:32:33] [INFO ] Deduced a trap composed of 237 places in 548 ms of which 7 ms to minimize.
[2024-06-01 16:32:34] [INFO ] Deduced a trap composed of 125 places in 533 ms of which 7 ms to minimize.
[2024-06-01 16:32:34] [INFO ] Deduced a trap composed of 165 places in 568 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/439 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 670 unsolved
(s148 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 (/ 9.0 5.0))
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 (/ 2.0 5.0))
(s53 (/ 3.0 5.0))
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 (/ 2.0 5.0))
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 (/ 4.0 5.0))
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 439/1120 variables, and 41 constraints, problems are : Problem set: 0 solved, 670 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 9/10 constraints, State Equation: 0/440 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 670/670 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 670 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/439 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/439 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 670 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/439 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 670 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 439/1120 variables, and 41 constraints, problems are : Problem set: 0 solved, 670 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 9/10 constraints, State Equation: 0/440 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 0/670 constraints, Known Traps: 20/20 constraints]
After SMT, in 60473ms problems are : Problem set: 0 solved, 670 unsolved
Search for dead transitions found 0 dead transitions in 60491ms
Starting structural reductions in LTL mode, iteration 1 : 440/450 places, 680/726 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64248 ms. Remains : 440/450 places, 680/726 transitions.
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Anderson-PT-10-LTLCardinality-15
Product exploration explored 100000 steps with 28 reset in 232 ms.
Stack based approach found an accepted trace after 87 steps with 0 reset with depth 88 and stack size 88 in 1 ms.
FORMULA Anderson-PT-10-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-10-LTLCardinality-15 finished in 64652 ms.
All properties solved by simple procedures.
Total runtime 502398 ms.
ITS solved all properties within timeout

BK_STOP 1717259589613

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML

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="Anderson-PT-10"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is Anderson-PT-10, 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 r464-smll-171620118400363"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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