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.r602-tall-171774424600196.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 itstools
Input is BlocksWorld-PT-05, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r602-tall-171774424600196
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 14M
-rw-r--r-- 1 mcc users 190K Jun 7 06:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 859K Jun 7 06:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 174K Jun 7 06:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 959K Jun 7 06:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 18K Jun 7 06:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Jun 7 06:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 153K Jun 7 06:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 637K Jun 7 06:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 7 06:26 NewModel
-rw-r--r-- 1 mcc users 502K Jun 7 06:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 2.4M Jun 7 06:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.1M Jun 7 06:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 5.6M Jun 7 06:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 25K Jun 7 06:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 62K Jun 7 06:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jun 7 06:26 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 7 06:26 instance
-rw-r--r-- 1 mcc users 6 Jun 7 06:26 iscolored
-rw-r--r-- 1 mcc users 783K Jun 7 06:26 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 BlocksWorld-PT-05-LTLFireability-00
FORMULA_NAME BlocksWorld-PT-05-LTLFireability-01
FORMULA_NAME BlocksWorld-PT-05-LTLFireability-02
FORMULA_NAME BlocksWorld-PT-05-LTLFireability-03
FORMULA_NAME BlocksWorld-PT-05-LTLFireability-04
FORMULA_NAME BlocksWorld-PT-05-LTLFireability-05
FORMULA_NAME BlocksWorld-PT-05-LTLFireability-06
FORMULA_NAME BlocksWorld-PT-05-LTLFireability-07
FORMULA_NAME BlocksWorld-PT-05-LTLFireability-08
FORMULA_NAME BlocksWorld-PT-05-LTLFireability-09
FORMULA_NAME BlocksWorld-PT-05-LTLFireability-10
FORMULA_NAME BlocksWorld-PT-05-LTLFireability-11
FORMULA_NAME BlocksWorld-PT-05-LTLFireability-12
FORMULA_NAME BlocksWorld-PT-05-LTLFireability-13
FORMULA_NAME BlocksWorld-PT-05-LTLFireability-14
FORMULA_NAME BlocksWorld-PT-05-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717753306095

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BlocksWorld-PT-05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-06-07 09:41:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-07 09:41:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-07 09:41:47] [INFO ] Load time of PNML (sax parser for PT used): 158 ms
[2024-06-07 09:41:47] [INFO ] Transformed 869 places.
[2024-06-07 09:41:47] [INFO ] Transformed 1625 transitions.
[2024-06-07 09:41:47] [INFO ] Found NUPN structural information;
[2024-06-07 09:41:47] [INFO ] Completing missing partition info from NUPN : creating a component with [pred_on_table_0, pred_arm_empty_0, pred_on_table_1, pred_on_table_2, pred_on_table_3, pred_on_table_4, pred_on_table_5, pred_on_table_6, pred_on_table_7, pred_on_table_8, pred_on_table_9, pred_on_table_10, pred_on_table_11, pred_on_table_12, pred_on_table_13, pred_on_table_14, pred_on_table_15, pred_on_table_16, pred_on_table_17, pred_on_table_18, pred_on_table_19, pred_on_table_20, pred_on_table_21, pred_on_table_22, pred_on_table_23, pred_on_table_24, pred_on_table_25, pred_on_table_26, pred_on_table_27]
[2024-06-07 09:41:47] [INFO ] Parsed PT model containing 869 places and 1625 transitions and 8110 arcs in 276 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 41 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA BlocksWorld-PT-05-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-05-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 869 out of 869 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 869/869 places, 1625/1625 transitions.
Applied a total of 0 rules in 29 ms. Remains 869 /869 variables (removed 0) and now considering 1625/1625 (removed 0) transitions.
// Phase 1: matrix 1625 rows 869 cols
[2024-06-07 09:41:48] [INFO ] Computed 57 invariants in 36 ms
[2024-06-07 09:41:48] [INFO ] Implicit Places using invariants in 291 ms returned []
[2024-06-07 09:41:48] [INFO ] Invariant cache hit.
[2024-06-07 09:41:49] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-07 09:41:49] [INFO ] Implicit Places using invariants and state equation in 731 ms returned []
Implicit Place search using SMT with State Equation took 1052 ms to find 0 implicit places.
Running 1619 sub problems to find dead transitions.
[2024-06-07 09:41:49] [INFO ] Invariant cache hit.
[2024-06-07 09:41:49] [INFO ] State equation strengthened by 45 read => feed constraints.
Problem TDEAD1 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD723 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD922 is UNSAT
Problem TDEAD974 is UNSAT
Problem TDEAD1072 is UNSAT
Problem TDEAD1162 is UNSAT
Problem TDEAD1204 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1318 is UNSAT
Problem TDEAD1352 is UNSAT
Problem TDEAD1384 is UNSAT
Problem TDEAD1414 is UNSAT
Problem TDEAD1442 is UNSAT
Problem TDEAD1468 is UNSAT
Problem TDEAD1492 is UNSAT
Problem TDEAD1514 is UNSAT
Problem TDEAD1534 is UNSAT
Problem TDEAD1552 is UNSAT
Problem TDEAD1582 is UNSAT
Problem TDEAD1594 is UNSAT
Problem TDEAD1612 is UNSAT
Problem TDEAD1618 is UNSAT
Problem TDEAD1622 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/863 variables, 46/46 constraints. Problems are: Problem set: 46 solved, 1573 unsolved
[2024-06-07 09:42:20] [INFO ] Deduced a trap composed of 56 places in 162 ms of which 24 ms to minimize.
[2024-06-07 09:42:20] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
[2024-06-07 09:42:21] [INFO ] Deduced a trap composed of 144 places in 166 ms of which 3 ms to minimize.
[2024-06-07 09:42:21] [INFO ] Deduced a trap composed of 125 places in 117 ms of which 2 ms to minimize.
[2024-06-07 09:42:21] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 863/2494 variables, and 51 constraints, problems are : Problem set: 46 solved, 1573 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 46/57 constraints, State Equation: 0/869 constraints, ReadFeed: 0/45 constraints, PredecessorRefiner: 1596/813 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 46 solved, 1573 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/840 variables, 6/6 constraints. Problems are: Problem set: 46 solved, 1573 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/840 variables, 5/11 constraints. Problems are: Problem set: 46 solved, 1573 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/840 variables, 0/11 constraints. Problems are: Problem set: 46 solved, 1573 unsolved
Problem TDEAD172 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1118 is UNSAT
Problem TDEAD1282 is UNSAT
Problem TDEAD1568 is UNSAT
Problem TDEAD1604 is UNSAT
At refinement iteration 3 (OVERLAPS) 29/869 variables, 51/62 constraints. Problems are: Problem set: 56 solved, 1563 unsolved
[2024-06-07 09:42:53] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 3 ms to minimize.
[2024-06-07 09:42:54] [INFO ] Deduced a trap composed of 56 places in 102 ms of which 4 ms to minimize.
[2024-06-07 09:42:54] [INFO ] Deduced a trap composed of 104 places in 94 ms of which 2 ms to minimize.
[2024-06-07 09:42:55] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 1 ms to minimize.
[2024-06-07 09:42:55] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 869/2494 variables, and 67 constraints, problems are : Problem set: 56 solved, 1563 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 0/869 constraints, ReadFeed: 0/45 constraints, PredecessorRefiner: 783/813 constraints, Known Traps: 10/10 constraints]
After SMT, in 70904ms problems are : Problem set: 56 solved, 1563 unsolved
Search for dead transitions found 56 dead transitions in 70947ms
Found 56 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 56 transitions
Dead transitions reduction (with SMT) removed 56 transitions
Starting structural reductions in LTL mode, iteration 1 : 869/869 places, 1569/1625 transitions.
Deduced a syphon composed of 28 places in 2 ms
Applied a total of 0 rules in 12 ms. Remains 869 /869 variables (removed 0) and now considering 1569/1569 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 72071 ms. Remains : 869/869 places, 1569/1625 transitions.
Deduced a syphon composed of 28 places in 2 ms
Reduce places removed 28 places and 0 transitions.
Support contains 841 out of 841 places after structural reductions.
[2024-06-07 09:43:00] [INFO ] Flatten gal took : 250 ms
[2024-06-07 09:43:01] [INFO ] Flatten gal took : 209 ms
[2024-06-07 09:43:02] [INFO ] Input system was already deterministic with 1569 transitions.
Reduction of identical properties reduced properties to check from 24 to 20
RANDOM walk for 40000 steps (8 resets) in 4998 ms. (8 steps per ms) remains 5/20 properties
BEST_FIRST walk for 40004 steps (8 resets) in 861 ms. (46 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 3470 ms. (11 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 6052 ms. (6 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 409 ms. (97 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 490 ms. (81 steps per ms) remains 5/5 properties
// Phase 1: matrix 1569 rows 841 cols
[2024-06-07 09:43:07] [INFO ] Computed 57 invariants in 8 ms
[2024-06-07 09:43:07] [INFO ] State equation strengthened by 1 read => feed constraints.
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp13 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/813 variables, 29/29 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/813 variables, 0/29 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 28/841 variables, 28/57 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/841 variables, 0/57 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1568/2409 variables, 841/898 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2409 variables, 0/898 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 1/2410 variables, 1/899 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2410 variables, 0/899 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/2410 variables, 0/899 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2410/2410 variables, and 899 constraints, problems are : Problem set: 2 solved, 3 unsolved in 1300 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 841/841 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 4/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/813 variables, 29/29 constraints. Problems are: Problem set: 2 solved, 3 unsolved
[2024-06-07 09:43:11] [INFO ] Deduced a trap composed of 56 places in 170 ms of which 3 ms to minimize.
[2024-06-07 09:43:11] [INFO ] Deduced a trap composed of 125 places in 182 ms of which 3 ms to minimize.
[2024-06-07 09:43:12] [INFO ] Deduced a trap composed of 125 places in 385 ms of which 5 ms to minimize.
[2024-06-07 09:43:12] [INFO ] Deduced a trap composed of 81 places in 116 ms of which 2 ms to minimize.
[2024-06-07 09:43:12] [INFO ] Deduced a trap composed of 125 places in 184 ms of which 3 ms to minimize.
[2024-06-07 09:43:12] [INFO ] Deduced a trap composed of 125 places in 183 ms of which 3 ms to minimize.
[2024-06-07 09:43:13] [INFO ] Deduced a trap composed of 161 places in 277 ms of which 4 ms to minimize.
[2024-06-07 09:43:13] [INFO ] Deduced a trap composed of 104 places in 248 ms of which 4 ms to minimize.
[2024-06-07 09:43:13] [INFO ] Deduced a trap composed of 56 places in 309 ms of which 5 ms to minimize.
[2024-06-07 09:43:14] [INFO ] Deduced a trap composed of 200 places in 429 ms of which 5 ms to minimize.
[2024-06-07 09:43:14] [INFO ] Deduced a trap composed of 216 places in 380 ms of which 5 ms to minimize.
[2024-06-07 09:43:15] [INFO ] Deduced a trap composed of 125 places in 405 ms of which 4 ms to minimize.
[2024-06-07 09:43:15] [INFO ] Deduced a trap composed of 144 places in 366 ms of which 4 ms to minimize.
[2024-06-07 09:43:16] [INFO ] Deduced a trap composed of 189 places in 379 ms of which 4 ms to minimize.
[2024-06-07 09:43:16] [INFO ] Deduced a trap composed of 221 places in 431 ms of which 5 ms to minimize.
SMT process timed out in 9375ms, After SMT, problems are : Problem set: 2 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 813 out of 841 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 841/841 places, 1569/1569 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 841 transition count 1568
Applied a total of 1 rules in 247 ms. Remains 841 /841 variables (removed 0) and now considering 1568/1569 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 248 ms. Remains : 841/841 places, 1568/1569 transitions.
RANDOM walk for 40000 steps (8 resets) in 2250 ms. (17 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 380 ms. (104 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 5543 ms. (7 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 407 ms. (98 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 241987 steps, run timeout after 6001 ms. (steps per millisecond=40 ) properties seen :0 out of 3
Probabilistic random walk after 241987 steps, saw 207728 distinct states, run finished after 6004 ms. (steps per millisecond=40 ) properties seen :0
// Phase 1: matrix 1568 rows 841 cols
[2024-06-07 09:43:25] [INFO ] Computed 57 invariants in 13 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/813 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/813 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 28/841 variables, 28/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/841 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1568/2409 variables, 841/898 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2409 variables, 0/898 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/2409 variables, 0/898 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2409/2409 variables, and 898 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1080 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 841/841 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/813 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-07 09:43:28] [INFO ] Deduced a trap composed of 56 places in 161 ms of which 3 ms to minimize.
[2024-06-07 09:43:29] [INFO ] Deduced a trap composed of 125 places in 215 ms of which 3 ms to minimize.
[2024-06-07 09:43:29] [INFO ] Deduced a trap composed of 125 places in 392 ms of which 4 ms to minimize.
[2024-06-07 09:43:29] [INFO ] Deduced a trap composed of 81 places in 117 ms of which 2 ms to minimize.
[2024-06-07 09:43:29] [INFO ] Deduced a trap composed of 125 places in 181 ms of which 3 ms to minimize.
[2024-06-07 09:43:30] [INFO ] Deduced a trap composed of 125 places in 191 ms of which 3 ms to minimize.
[2024-06-07 09:43:30] [INFO ] Deduced a trap composed of 161 places in 280 ms of which 4 ms to minimize.
[2024-06-07 09:43:30] [INFO ] Deduced a trap composed of 104 places in 248 ms of which 4 ms to minimize.
[2024-06-07 09:43:31] [INFO ] Deduced a trap composed of 56 places in 284 ms of which 5 ms to minimize.
[2024-06-07 09:43:31] [INFO ] Deduced a trap composed of 200 places in 390 ms of which 11 ms to minimize.
[2024-06-07 09:43:31] [INFO ] Deduced a trap composed of 216 places in 370 ms of which 5 ms to minimize.
[2024-06-07 09:43:32] [INFO ] Deduced a trap composed of 125 places in 387 ms of which 4 ms to minimize.
[2024-06-07 09:43:32] [INFO ] Deduced a trap composed of 144 places in 360 ms of which 5 ms to minimize.
[2024-06-07 09:43:33] [INFO ] Deduced a trap composed of 189 places in 406 ms of which 5 ms to minimize.
[2024-06-07 09:43:33] [INFO ] Deduced a trap composed of 221 places in 433 ms of which 5 ms to minimize.
[2024-06-07 09:43:34] [INFO ] Deduced a trap composed of 161 places in 447 ms of which 5 ms to minimize.
[2024-06-07 09:43:34] [INFO ] Deduced a trap composed of 200 places in 446 ms of which 5 ms to minimize.
[2024-06-07 09:43:35] [INFO ] Deduced a trap composed of 209 places in 460 ms of which 5 ms to minimize.
[2024-06-07 09:43:35] [INFO ] Deduced a trap composed of 176 places in 442 ms of which 5 ms to minimize.
[2024-06-07 09:43:36] [INFO ] Deduced a trap composed of 200 places in 440 ms of which 6 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/813 variables, 20/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-07 09:43:36] [INFO ] Deduced a trap composed of 125 places in 523 ms of which 5 ms to minimize.
[2024-06-07 09:43:37] [INFO ] Deduced a trap composed of 161 places in 457 ms of which 5 ms to minimize.
[2024-06-07 09:43:37] [INFO ] Deduced a trap composed of 56 places in 448 ms of which 5 ms to minimize.
[2024-06-07 09:43:38] [INFO ] Deduced a trap composed of 144 places in 401 ms of which 5 ms to minimize.
[2024-06-07 09:43:38] [INFO ] Deduced a trap composed of 176 places in 401 ms of which 5 ms to minimize.
[2024-06-07 09:43:39] [INFO ] Deduced a trap composed of 104 places in 417 ms of which 6 ms to minimize.
[2024-06-07 09:43:39] [INFO ] Deduced a trap composed of 56 places in 452 ms of which 4 ms to minimize.
[2024-06-07 09:43:40] [INFO ] Deduced a trap composed of 125 places in 458 ms of which 5 ms to minimize.
[2024-06-07 09:43:40] [INFO ] Deduced a trap composed of 104 places in 400 ms of which 5 ms to minimize.
[2024-06-07 09:43:40] [INFO ] Deduced a trap composed of 225 places in 399 ms of which 5 ms to minimize.
[2024-06-07 09:43:41] [INFO ] Deduced a trap composed of 176 places in 395 ms of which 4 ms to minimize.
[2024-06-07 09:43:41] [INFO ] Deduced a trap composed of 200 places in 417 ms of which 10 ms to minimize.
[2024-06-07 09:43:42] [INFO ] Deduced a trap composed of 104 places in 428 ms of which 5 ms to minimize.
[2024-06-07 09:43:42] [INFO ] Deduced a trap composed of 81 places in 436 ms of which 5 ms to minimize.
[2024-06-07 09:43:43] [INFO ] Deduced a trap composed of 209 places in 353 ms of which 5 ms to minimize.
[2024-06-07 09:43:43] [INFO ] Deduced a trap composed of 209 places in 351 ms of which 4 ms to minimize.
[2024-06-07 09:43:44] [INFO ] Deduced a trap composed of 225 places in 432 ms of which 5 ms to minimize.
[2024-06-07 09:43:44] [INFO ] Deduced a trap composed of 216 places in 305 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/813 variables, 18/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-07 09:43:45] [INFO ] Deduced a trap composed of 189 places in 433 ms of which 5 ms to minimize.
[2024-06-07 09:43:45] [INFO ] Deduced a trap composed of 200 places in 434 ms of which 5 ms to minimize.
[2024-06-07 09:43:45] [INFO ] Deduced a trap composed of 216 places in 438 ms of which 5 ms to minimize.
[2024-06-07 09:43:46] [INFO ] Deduced a trap composed of 221 places in 430 ms of which 5 ms to minimize.
[2024-06-07 09:43:46] [INFO ] Deduced a trap composed of 189 places in 437 ms of which 5 ms to minimize.
[2024-06-07 09:43:47] [INFO ] Deduced a trap composed of 81 places in 440 ms of which 5 ms to minimize.
[2024-06-07 09:43:47] [INFO ] Deduced a trap composed of 216 places in 430 ms of which 5 ms to minimize.
[2024-06-07 09:43:48] [INFO ] Deduced a trap composed of 81 places in 435 ms of which 4 ms to minimize.
[2024-06-07 09:43:48] [INFO ] Deduced a trap composed of 161 places in 431 ms of which 5 ms to minimize.
[2024-06-07 09:43:49] [INFO ] Deduced a trap composed of 144 places in 443 ms of which 5 ms to minimize.
[2024-06-07 09:43:49] [INFO ] Deduced a trap composed of 104 places in 399 ms of which 5 ms to minimize.
[2024-06-07 09:43:50] [INFO ] Deduced a trap composed of 125 places in 403 ms of which 5 ms to minimize.
[2024-06-07 09:43:50] [INFO ] Deduced a trap composed of 209 places in 400 ms of which 5 ms to minimize.
[2024-06-07 09:43:51] [INFO ] Deduced a trap composed of 200 places in 408 ms of which 5 ms to minimize.
[2024-06-07 09:43:51] [INFO ] Deduced a trap composed of 224 places in 403 ms of which 5 ms to minimize.
[2024-06-07 09:43:52] [INFO ] Deduced a trap composed of 209 places in 403 ms of which 4 ms to minimize.
[2024-06-07 09:43:52] [INFO ] Deduced a trap composed of 144 places in 400 ms of which 5 ms to minimize.
[2024-06-07 09:43:52] [INFO ] Deduced a trap composed of 176 places in 398 ms of which 5 ms to minimize.
[2024-06-07 09:43:53] [INFO ] Deduced a trap composed of 189 places in 408 ms of which 6 ms to minimize.
[2024-06-07 09:43:53] [INFO ] Deduced a trap composed of 176 places in 409 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/813 variables, 20/87 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-07 09:43:54] [INFO ] Deduced a trap composed of 189 places in 400 ms of which 5 ms to minimize.
[2024-06-07 09:43:54] [INFO ] Deduced a trap composed of 176 places in 407 ms of which 5 ms to minimize.
[2024-06-07 09:43:55] [INFO ] Deduced a trap composed of 144 places in 398 ms of which 5 ms to minimize.
[2024-06-07 09:43:55] [INFO ] Deduced a trap composed of 161 places in 404 ms of which 4 ms to minimize.
[2024-06-07 09:43:56] [INFO ] Deduced a trap composed of 224 places in 400 ms of which 5 ms to minimize.
[2024-06-07 09:43:56] [INFO ] Deduced a trap composed of 125 places in 408 ms of which 4 ms to minimize.
[2024-06-07 09:43:57] [INFO ] Deduced a trap composed of 161 places in 405 ms of which 4 ms to minimize.
[2024-06-07 09:43:57] [INFO ] Deduced a trap composed of 176 places in 412 ms of which 5 ms to minimize.
[2024-06-07 09:43:58] [INFO ] Deduced a trap composed of 189 places in 405 ms of which 5 ms to minimize.
[2024-06-07 09:43:58] [INFO ] Deduced a trap composed of 224 places in 400 ms of which 4 ms to minimize.
[2024-06-07 09:43:59] [INFO ] Deduced a trap composed of 144 places in 410 ms of which 5 ms to minimize.
[2024-06-07 09:43:59] [INFO ] Deduced a trap composed of 189 places in 397 ms of which 5 ms to minimize.
[2024-06-07 09:43:59] [INFO ] Deduced a trap composed of 144 places in 417 ms of which 5 ms to minimize.
[2024-06-07 09:44:00] [INFO ] Deduced a trap composed of 104 places in 401 ms of which 5 ms to minimize.
[2024-06-07 09:44:00] [INFO ] Deduced a trap composed of 209 places in 388 ms of which 5 ms to minimize.
[2024-06-07 09:44:01] [INFO ] Deduced a trap composed of 125 places in 399 ms of which 5 ms to minimize.
[2024-06-07 09:44:01] [INFO ] Deduced a trap composed of 216 places in 398 ms of which 5 ms to minimize.
[2024-06-07 09:44:02] [INFO ] Deduced a trap composed of 221 places in 405 ms of which 5 ms to minimize.
[2024-06-07 09:44:02] [INFO ] Deduced a trap composed of 125 places in 408 ms of which 4 ms to minimize.
[2024-06-07 09:44:03] [INFO ] Deduced a trap composed of 144 places in 435 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/813 variables, 20/107 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-07 09:44:03] [INFO ] Deduced a trap composed of 224 places in 385 ms of which 5 ms to minimize.
[2024-06-07 09:44:04] [INFO ] Deduced a trap composed of 144 places in 406 ms of which 4 ms to minimize.
[2024-06-07 09:44:04] [INFO ] Deduced a trap composed of 125 places in 394 ms of which 4 ms to minimize.
[2024-06-07 09:44:05] [INFO ] Deduced a trap composed of 81 places in 401 ms of which 5 ms to minimize.
[2024-06-07 09:44:05] [INFO ] Deduced a trap composed of 161 places in 410 ms of which 5 ms to minimize.
[2024-06-07 09:44:06] [INFO ] Deduced a trap composed of 56 places in 397 ms of which 5 ms to minimize.
[2024-06-07 09:44:06] [INFO ] Deduced a trap composed of 224 places in 384 ms of which 5 ms to minimize.
[2024-06-07 09:44:07] [INFO ] Deduced a trap composed of 189 places in 382 ms of which 5 ms to minimize.
[2024-06-07 09:44:07] [INFO ] Deduced a trap composed of 144 places in 389 ms of which 5 ms to minimize.
[2024-06-07 09:44:07] [INFO ] Deduced a trap composed of 176 places in 405 ms of which 4 ms to minimize.
[2024-06-07 09:44:08] [INFO ] Deduced a trap composed of 125 places in 392 ms of which 5 ms to minimize.
[2024-06-07 09:44:08] [INFO ] Deduced a trap composed of 176 places in 385 ms of which 5 ms to minimize.
[2024-06-07 09:44:09] [INFO ] Deduced a trap composed of 56 places in 395 ms of which 5 ms to minimize.
[2024-06-07 09:44:09] [INFO ] Deduced a trap composed of 144 places in 403 ms of which 5 ms to minimize.
[2024-06-07 09:44:10] [INFO ] Deduced a trap composed of 216 places in 401 ms of which 5 ms to minimize.
[2024-06-07 09:44:10] [INFO ] Deduced a trap composed of 56 places in 388 ms of which 5 ms to minimize.
[2024-06-07 09:44:11] [INFO ] Deduced a trap composed of 125 places in 393 ms of which 4 ms to minimize.
[2024-06-07 09:44:11] [INFO ] Deduced a trap composed of 209 places in 433 ms of which 5 ms to minimize.
[2024-06-07 09:44:12] [INFO ] Deduced a trap composed of 200 places in 427 ms of which 5 ms to minimize.
[2024-06-07 09:44:12] [INFO ] Deduced a trap composed of 56 places in 419 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/813 variables, 20/127 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-07 09:44:13] [INFO ] Deduced a trap composed of 200 places in 393 ms of which 5 ms to minimize.
[2024-06-07 09:44:13] [INFO ] Deduced a trap composed of 161 places in 401 ms of which 5 ms to minimize.
SMT process timed out in 48603ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 813 out of 841 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 841/841 places, 1568/1568 transitions.
Applied a total of 0 rules in 90 ms. Remains 841 /841 variables (removed 0) and now considering 1568/1568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 841/841 places, 1568/1568 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 841/841 places, 1568/1568 transitions.
Applied a total of 0 rules in 130 ms. Remains 841 /841 variables (removed 0) and now considering 1568/1568 (removed 0) transitions.
[2024-06-07 09:44:13] [INFO ] Invariant cache hit.
[2024-06-07 09:44:14] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-06-07 09:44:14] [INFO ] Invariant cache hit.
[2024-06-07 09:44:14] [INFO ] Implicit Places using invariants and state equation in 574 ms returned []
Implicit Place search using SMT with State Equation took 725 ms to find 0 implicit places.
[2024-06-07 09:44:14] [INFO ] Redundant transitions in 116 ms returned []
Running 1562 sub problems to find dead transitions.
[2024-06-07 09:44:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/835 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1562 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 835/2409 variables, and 46 constraints, problems are : Problem set: 0 solved, 1562 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 46/57 constraints, State Equation: 0/841 constraints, PredecessorRefiner: 1562/784 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1562 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/835 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1562 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/835 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1562 unsolved
At refinement iteration 2 (OVERLAPS) 6/841 variables, 11/57 constraints. Problems are: Problem set: 0 solved, 1562 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 841/2409 variables, and 57 constraints, problems are : Problem set: 0 solved, 1562 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 0/841 constraints, PredecessorRefiner: 778/784 constraints, Known Traps: 0/0 constraints]
After SMT, in 70987ms problems are : Problem set: 0 solved, 1562 unsolved
Search for dead transitions found 0 dead transitions in 71001ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71979 ms. Remains : 841/841 places, 1568/1568 transitions.
FORMULA BlocksWorld-PT-05-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
FORMULA BlocksWorld-PT-05-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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' '!(X(F((G(p1)||p0))))'
Support contains 785 out of 841 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 841/841 places, 1569/1569 transitions.
Applied a total of 0 rules in 8 ms. Remains 841 /841 variables (removed 0) and now considering 1569/1569 (removed 0) transitions.
// Phase 1: matrix 1569 rows 841 cols
[2024-06-07 09:45:26] [INFO ] Computed 57 invariants in 8 ms
[2024-06-07 09:45:26] [INFO ] Implicit Places using invariants in 275 ms returned []
[2024-06-07 09:45:26] [INFO ] Invariant cache hit.
[2024-06-07 09:45:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 09:45:27] [INFO ] Implicit Places using invariants and state equation in 590 ms returned []
Implicit Place search using SMT with State Equation took 867 ms to find 0 implicit places.
Running 1563 sub problems to find dead transitions.
[2024-06-07 09:45:27] [INFO ] Invariant cache hit.
[2024-06-07 09:45:27] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/835 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
[2024-06-07 09:45:56] [INFO ] Deduced a trap composed of 144 places in 148 ms of which 2 ms to minimize.
[2024-06-07 09:45:56] [INFO ] Deduced a trap composed of 125 places in 104 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 835/2410 variables, and 48 constraints, problems are : Problem set: 0 solved, 1563 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 46/57 constraints, State Equation: 0/841 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1563/785 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1563 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/835 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/835 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
[2024-06-07 09:46:09] [INFO ] Deduced a trap composed of 125 places in 121 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/835 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
[2024-06-07 09:46:33] [INFO ] Deduced a trap composed of 104 places in 126 ms of which 2 ms to minimize.
[2024-06-07 09:46:33] [INFO ] Deduced a trap composed of 81 places in 70 ms of which 1 ms to minimize.
[2024-06-07 09:46:33] [INFO ] Deduced a trap composed of 104 places in 107 ms of which 2 ms to minimize.
[2024-06-07 09:46:33] [INFO ] Deduced a trap composed of 104 places in 106 ms of which 2 ms to minimize.
[2024-06-07 09:46:33] [INFO ] Deduced a trap composed of 81 places in 73 ms of which 2 ms to minimize.
[2024-06-07 09:46:33] [INFO ] Deduced a trap composed of 56 places in 56 ms of which 1 ms to minimize.
[2024-06-07 09:46:34] [INFO ] Deduced a trap composed of 81 places in 104 ms of which 2 ms to minimize.
[2024-06-07 09:46:34] [INFO ] Deduced a trap composed of 56 places in 60 ms of which 1 ms to minimize.
[2024-06-07 09:46:34] [INFO ] Deduced a trap composed of 81 places in 101 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 835/2410 variables, and 58 constraints, problems are : Problem set: 0 solved, 1563 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 46/57 constraints, State Equation: 0/841 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 778/785 constraints, Known Traps: 12/12 constraints]
After SMT, in 70821ms problems are : Problem set: 0 solved, 1563 unsolved
Search for dead transitions found 0 dead transitions in 70834ms
Finished structural reductions in LTL mode , in 1 iterations and 71712 ms. Remains : 841/841 places, 1569/1569 transitions.
Stuttering acceptance computed with spot in 200 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BlocksWorld-PT-05-LTLFireability-00
Product exploration explored 100000 steps with 33333 reset in 4960 ms.
Product exploration explored 100000 steps with 33333 reset in 4846 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 p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 19 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BlocksWorld-PT-05-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BlocksWorld-PT-05-LTLFireability-00 finished in 81840 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 57 out of 841 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 841/841 places, 1569/1569 transitions.
Applied a total of 0 rules in 71 ms. Remains 841 /841 variables (removed 0) and now considering 1569/1569 (removed 0) transitions.
[2024-06-07 09:46:48] [INFO ] Invariant cache hit.
[2024-06-07 09:46:48] [INFO ] Implicit Places using invariants in 363 ms returned []
[2024-06-07 09:46:48] [INFO ] Invariant cache hit.
[2024-06-07 09:46:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 09:46:49] [INFO ] Implicit Places using invariants and state equation in 1061 ms returned []
Implicit Place search using SMT with State Equation took 1426 ms to find 0 implicit places.
Running 1563 sub problems to find dead transitions.
[2024-06-07 09:46:49] [INFO ] Invariant cache hit.
[2024-06-07 09:46:49] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/835 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
[2024-06-07 09:47:19] [INFO ] Deduced a trap composed of 144 places in 136 ms of which 2 ms to minimize.
[2024-06-07 09:47:19] [INFO ] Deduced a trap composed of 125 places in 101 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 1.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 1.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.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 1.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 1.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 1.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 1.0)
(s106 0.0)
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 1.0)
(s116 0.0)
(s117 1.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 1.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 1.0)
(s133 0.0)
(s134 0.0)
(s135 1.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.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 1.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 1.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 1.0)
(s225 1.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 1.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s241 0.0)
(s242 0.0)
(s243 1.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 timeout
0.0)
(s256 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 835/2410 variables, and 48 constraints, problems are : Problem set: 0 solved, 1563 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 46/57 constraints, State Equation: 0/841 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1563/785 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1563 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/835 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/835 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
[2024-06-07 09:47:31] [INFO ] Deduced a trap composed of 125 places in 115 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/835 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
[2024-06-07 09:47:52] [INFO ] Deduced a trap composed of 104 places in 120 ms of which 2 ms to minimize.
[2024-06-07 09:47:52] [INFO ] Deduced a trap composed of 81 places in 63 ms of which 1 ms to minimize.
[2024-06-07 09:47:52] [INFO ] Deduced a trap composed of 104 places in 96 ms of which 3 ms to minimize.
[2024-06-07 09:47:52] [INFO ] Deduced a trap composed of 104 places in 104 ms of which 1 ms to minimize.
[2024-06-07 09:47:53] [INFO ] Deduced a trap composed of 81 places in 68 ms of which 1 ms to minimize.
[2024-06-07 09:47:53] [INFO ] Deduced a trap composed of 56 places in 56 ms of which 0 ms to minimize.
[2024-06-07 09:47:53] [INFO ] Deduced a trap composed of 81 places in 102 ms of which 2 ms to minimize.
[2024-06-07 09:47:53] [INFO ] Deduced a trap composed of 56 places in 59 ms of which 1 ms to minimize.
[2024-06-07 09:47:53] [INFO ] Deduced a trap composed of 81 places in 98 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 835/2410 variables, and 58 constraints, problems are : Problem set: 0 solved, 1563 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 46/57 constraints, State Equation: 0/841 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 778/785 constraints, Known Traps: 12/12 constraints]
After SMT, in 70860ms problems are : Problem set: 0 solved, 1563 unsolved
Search for dead transitions found 0 dead transitions in 70876ms
Finished structural reductions in LTL mode , in 1 iterations and 72377 ms. Remains : 841/841 places, 1569/1569 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BlocksWorld-PT-05-LTLFireability-01
Product exploration explored 100000 steps with 18355 reset in 1923 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 5 in 0 ms.
FORMULA BlocksWorld-PT-05-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property BlocksWorld-PT-05-LTLFireability-01 finished in 74434 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(p1)&&G(!p2)))))'
Support contains 108 out of 841 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 841/841 places, 1569/1569 transitions.
Applied a total of 0 rules in 19 ms. Remains 841 /841 variables (removed 0) and now considering 1569/1569 (removed 0) transitions.
[2024-06-07 09:48:02] [INFO ] Invariant cache hit.
[2024-06-07 09:48:02] [INFO ] Implicit Places using invariants in 361 ms returned []
[2024-06-07 09:48:02] [INFO ] Invariant cache hit.
[2024-06-07 09:48:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 09:48:03] [INFO ] Implicit Places using invariants and state equation in 968 ms returned []
Implicit Place search using SMT with State Equation took 1339 ms to find 0 implicit places.
Running 1563 sub problems to find dead transitions.
[2024-06-07 09:48:03] [INFO ] Invariant cache hit.
[2024-06-07 09:48:03] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/835 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
[2024-06-07 09:48:33] [INFO ] Deduced a trap composed of 144 places in 135 ms of which 2 ms to minimize.
[2024-06-07 09:48:33] [INFO ] Deduced a trap composed of 125 places in 98 ms of which 2 ms to minimize.
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 835/2410 variables, and 48 constraints, problems are : Problem set: 0 solved, 1563 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 46/57 constraints, State Equation: 0/841 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1563/785 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1563 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/835 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/835 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
[2024-06-07 09:48:45] [INFO ] Deduced a trap composed of 125 places in 122 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/835 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
[2024-06-07 09:49:07] [INFO ] Deduced a trap composed of 104 places in 119 ms of which 2 ms to minimize.
[2024-06-07 09:49:07] [INFO ] Deduced a trap composed of 81 places in 74 ms of which 1 ms to minimize.
[2024-06-07 09:49:07] [INFO ] Deduced a trap composed of 104 places in 109 ms of which 2 ms to minimize.
[2024-06-07 09:49:07] [INFO ] Deduced a trap composed of 104 places in 110 ms of which 2 ms to minimize.
[2024-06-07 09:49:08] [INFO ] Deduced a trap composed of 81 places in 78 ms of which 2 ms to minimize.
[2024-06-07 09:49:08] [INFO ] Deduced a trap composed of 56 places in 59 ms of which 1 ms to minimize.
[2024-06-07 09:49:08] [INFO ] Deduced a trap composed of 81 places in 106 ms of which 2 ms to minimize.
[2024-06-07 09:49:08] [INFO ] Deduced a trap composed of 56 places in 59 ms of which 1 ms to minimize.
[2024-06-07 09:49:08] [INFO ] Deduced a trap composed of 81 places in 113 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 1)
(s3 0)
(s4 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 1)
(s14 0)
(s15 0)
(s16 0)
(s17 1)
(s18 0)
(s19 1)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 1)
(s30 0)
(s31 1)
(s32 0)
(s33 0)
(s34 1)
(s35 1)
(s36 0)
(s37 1)
(s38 0)
(s39 0)
(s40 1)
(s41 0)
(s42 0)
(s43 1)
(s44 1)
(s45 0)
(s46 0)
(s47 1)
(s48 0)
(s49 0)
(s50 1)
(s51 0)
(s52 0)
(s53 1)
(s54 0)
(s55 0)
(s56 1)
(s57 0)
(s58 0)
(s59 1)
(s60 0)
(s61 0)
(s62 1)
(s63 0)
(s64 1)
(s65 1)
(s66 0)
(s67 0)
(s68 1)
(s69 0)
(s70 0)
(s71 1)
(s72 0)
(s73 1)
(s74 1)
(s75 0)
(s76 0)
(s77 1)
(s78 0)
(s79 0)
(s80 1)
(s81 0)
(s82 0)
(s83 1)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 1)
(s89 0)
(s90 1)
(s91 0)
(s92 0)
(s93 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 1)
(s106 0)
(s107 0)
(s108 1)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 1)
(s116 0)
(s117 1)
(s118 0)
(s119 0)
(s120 0)
(s121 1)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 1)
(s133 0)
(s134 0)
(s135 1)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 1)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 1)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 1)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 1)
(s225 1)
(s226 0)
(s227 0)
(s228 0)
(s229 1)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s241 0)
(s242 0)
(s243 1)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 1)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 1)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 1)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s333 0)
(s334 1)
(s335 0)
(s336 0)
(s337 1)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 1)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 1)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 0)
(s482 0)
(s483 1)
(s484 0)
(s485 0)
(s486 1)
(s487 0)
(s488 0)
(s489 0)
(s490 0)
(s491 0)
(s492 0)
(s493 0)
(s494 0)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 0)
(s500 0)
(s501 0)
(s502 0)
(s503 0)
(s504 0)
(s505 0)
(s506 0)
(s507 0)
(s508 0)
(s509 0)
(s510 0)
(s511 0)
(s512 0)
(s513 0)
(s514 0)
(s515 0)
(s516 0)
(s517 0)
(s518 0)
(s519 0)
(s520 0)
(s521 0)
(s522 0)
(s523 0)
(s524 0)
(s525 0)
(s526 0)
(s527 0)
(s528 0)
(s529 0)
(s530 0)
(s531 0)
(s532 0)
(s533 0)
(s534 0)
(s535 0)
(s536 0)
(s537 0)
(s538 0)
(s539 0)
(s540 0)
(s541 0)
(s542 0)
(s543 0)
(s544 0)
(s545 0)
(s546 0)
(s547 0)
(s548 0)
(s549 0)
(s550 0)
(s551 0)
(s552 0)
(s553 0)
(s554 0)
(s555 0)
(s556 0)
(s557 0)
(s558 0)
(s559 0)
(s560 0)
(s561 0)
(s562 0)
(s563 0)
(s564 0)
(s565 0)
(s566 0)
(s567 0)
(s568 0)
(s569 0)
(s570 0)
(s571 0)
(s572 0)
(s573 0)
(s574 0)
(s575 0)
(s576 0)
(s577 0)
(s578 0)
(s579 0)
(s580 0)
(s581 0)
(s582 0)
(s583 0)
(s584 0)
(s585 0)
(s586 0)
(s587 0)
(s588 0)
(s589 0)
(s590 0)
(s591 0)
(s592 0)
(s593 0)
(s594 0)
(s595 0)
(s596 0)
(s597 0)
(s598 0)
(s599 0)
(s600 0)
(s601 0)
(s602 0)
(s603 0)
(s604 0)
(s605 0)
(s606 0)
(s607 0)
(s608 0)
(s609 0)
(s610 0)
(s611 0)
(s612 0)
(s613 0)
(s614 0)
(s615 0)
(s616 0)
(s617 0)
(s618 0)
(s619 0)
(s620 0)
(s621 0)
(s622 0)
(s623 0)
(s624 0)
(s625 0)
(s626 0)
(s627 0)
(s628 0)
(s629 0)
(s630 0)
(s631 0)
(s632 0)
(s633 0)
(s634 0)
(s635 0)
(s636 0)
(s637 0)
(s638 0)
(s639 0)
(s640 0)
(s641 0)
(s642 0)
(s643 0)
(s644 0)
(s645 0)
(s646 0)
(s647 0)
(s648 0)
(s649 0)
(s650 0)
(s651 0)
(s652 0)
(s653 0)
(s654 0)
(s655 0)
(s656 0)
(s657 0)
(s658 0)
(s659 0)
(s660 0)
(s661 0)
(s662 0)
(s663 0)
(s664 0)
(s665 0)
(s666 0)
(s667 0)
(s668 0)
(s669 0)
(s670 0)
(s671 0)
(s672 0)
(s673 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 835/2410 variables, and 58 constraints, problems are : Problem set: 0 solved, 1563 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 46/57 constraints, State Equation: 0/841 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 778/785 constraints, Known Traps: 12/12 constraints]
After SMT, in 70450ms problems are : Problem set: 0 solved, 1563 unsolved
Search for dead transitions found 0 dead transitions in 70466ms
Finished structural reductions in LTL mode , in 1 iterations and 71833 ms. Remains : 841/841 places, 1569/1569 transitions.
Stuttering acceptance computed with spot in 176 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), p2, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (NOT p1) p2)]
Running random walk in product with property : BlocksWorld-PT-05-LTLFireability-02
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BlocksWorld-PT-05-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BlocksWorld-PT-05-LTLFireability-02 finished in 72037 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' '!(G((F(p0)&&(!p0||F(p1)))))'
Support contains 85 out of 841 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 841/841 places, 1569/1569 transitions.
Applied a total of 0 rules in 149 ms. Remains 841 /841 variables (removed 0) and now considering 1569/1569 (removed 0) transitions.
[2024-06-07 09:49:14] [INFO ] Invariant cache hit.
[2024-06-07 09:49:15] [INFO ] Implicit Places using invariants in 429 ms returned []
[2024-06-07 09:49:15] [INFO ] Invariant cache hit.
[2024-06-07 09:49:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 09:49:16] [INFO ] Implicit Places using invariants and state equation in 1050 ms returned []
Implicit Place search using SMT with State Equation took 1495 ms to find 0 implicit places.
[2024-06-07 09:49:16] [INFO ] Redundant transitions in 82 ms returned []
Running 1563 sub problems to find dead transitions.
[2024-06-07 09:49:16] [INFO ] Invariant cache hit.
[2024-06-07 09:49:16] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/835 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
[2024-06-07 09:49:46] [INFO ] Deduced a trap composed of 144 places in 141 ms of which 2 ms to minimize.
[2024-06-07 09:49:47] [INFO ] Deduced a trap composed of 125 places in 102 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 835/2410 variables, and 48 constraints, problems are : Problem set: 0 solved, 1563 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 46/57 constraints, State Equation: 0/841 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1563/785 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1563 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/835 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/835 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
[2024-06-07 09:49:58] [INFO ] Deduced a trap composed of 125 places in 119 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/835 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
[2024-06-07 09:50:20] [INFO ] Deduced a trap composed of 104 places in 119 ms of which 2 ms to minimize.
[2024-06-07 09:50:20] [INFO ] Deduced a trap composed of 81 places in 63 ms of which 1 ms to minimize.
[2024-06-07 09:50:21] [INFO ] Deduced a trap composed of 104 places in 101 ms of which 2 ms to minimize.
[2024-06-07 09:50:21] [INFO ] Deduced a trap composed of 104 places in 98 ms of which 2 ms to minimize.
[2024-06-07 09:50:21] [INFO ] Deduced a trap composed of 81 places in 60 ms of which 1 ms to minimize.
[2024-06-07 09:50:21] [INFO ] Deduced a trap composed of 56 places in 54 ms of which 1 ms to minimize.
[2024-06-07 09:50:21] [INFO ] Deduced a trap composed of 81 places in 91 ms of which 1 ms to minimize.
[2024-06-07 09:50:21] [INFO ] Deduced a trap composed of 56 places in 49 ms of which 1 ms to minimize.
[2024-06-07 09:50:21] [INFO ] Deduced a trap composed of 81 places in 91 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 835/2410 variables, and 58 constraints, problems are : Problem set: 0 solved, 1563 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 46/57 constraints, State Equation: 0/841 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 778/785 constraints, Known Traps: 12/12 constraints]
After SMT, in 71465ms problems are : Problem set: 0 solved, 1563 unsolved
Search for dead transitions found 0 dead transitions in 71479ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 73214 ms. Remains : 841/841 places, 1569/1569 transitions.
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BlocksWorld-PT-05-LTLFireability-03
Product exploration explored 100000 steps with 12600 reset in 2113 ms.
Stack based approach found an accepted trace after 25 steps with 4 reset with depth 4 and stack size 4 in 1 ms.
FORMULA BlocksWorld-PT-05-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property BlocksWorld-PT-05-LTLFireability-03 finished in 75472 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((G(p1)||p0))&&F(p2))))'
Support contains 813 out of 841 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 841/841 places, 1569/1569 transitions.
Applied a total of 0 rules in 6 ms. Remains 841 /841 variables (removed 0) and now considering 1569/1569 (removed 0) transitions.
[2024-06-07 09:50:29] [INFO ] Invariant cache hit.
[2024-06-07 09:50:30] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-06-07 09:50:30] [INFO ] Invariant cache hit.
[2024-06-07 09:50:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 09:50:30] [INFO ] Implicit Places using invariants and state equation in 600 ms returned []
Implicit Place search using SMT with State Equation took 749 ms to find 0 implicit places.
Running 1563 sub problems to find dead transitions.
[2024-06-07 09:50:30] [INFO ] Invariant cache hit.
[2024-06-07 09:50:30] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/835 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
[2024-06-07 09:51:01] [INFO ] Deduced a trap composed of 144 places in 145 ms of which 2 ms to minimize.
[2024-06-07 09:51:01] [INFO ] Deduced a trap composed of 125 places in 102 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 1.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 1.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 1.0)
(s44 1.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 1.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 0.0)
(s71 1.0)
(s72 0.0)
(s73 1.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 1.0)
(s78 0.0)
(s79 0.0)
(s80 1.0)
(s81 0.0)
(s82 0.0)
(s83 1.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 1.0)
(s106 0.0)
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 1.0)
(s116 0.0)
(s117 1.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 1.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 1.0)
(s133 0.0)
(s134 0.0)
(s135 1.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.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 1.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 1.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 1.0)
(s225 1.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 1.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s241 0.0)
(s242 0.0)
(s243 1.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 1.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 1.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 1.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s333 0.0)
(s334 1.0)
(s335 0.0)
(s336 0.0)
(s337 1.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 1.0)
(s349 0.0)
(s350 0.0)
(s351 1.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 1.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 1.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 1.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 835/2410 variables, and 48 constraints, problems are : Problem set: 0 solved, 1563 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 46/57 constraints, State Equation: 0/841 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1563/785 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1563 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/835 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/835 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
[2024-06-07 09:51:13] [INFO ] Deduced a trap composed of 125 places in 132 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/835 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
[2024-06-07 09:51:38] [INFO ] Deduced a trap composed of 104 places in 136 ms of which 2 ms to minimize.
[2024-06-07 09:51:38] [INFO ] Deduced a trap composed of 81 places in 83 ms of which 1 ms to minimize.
[2024-06-07 09:51:38] [INFO ] Deduced a trap composed of 104 places in 111 ms of which 2 ms to minimize.
[2024-06-07 09:51:38] [INFO ] Deduced a trap composed of 104 places in 112 ms of which 2 ms to minimize.
[2024-06-07 09:51:39] [INFO ] Deduced a trap composed of 81 places in 73 ms of which 1 ms to minimize.
[2024-06-07 09:51:39] [INFO ] Deduced a trap composed of 56 places in 60 ms of which 1 ms to minimize.
[2024-06-07 09:51:39] [INFO ] Deduced a trap composed of 81 places in 101 ms of which 2 ms to minimize.
[2024-06-07 09:51:39] [INFO ] Deduced a trap composed of 56 places in 66 ms of which 1 ms to minimize.
[2024-06-07 09:51:39] [INFO ] Deduced a trap composed of 81 places in 109 ms of which 2 ms to minimize.
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 Int declared 835/2410 variables, and 58 constraints, problems are : Problem set: 0 solved, 1563 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 46/57 constraints, State Equation: 0/841 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 778/785 constraints, Known Traps: 12/12 constraints]
After SMT, in 71652ms problems are : Problem set: 0 solved, 1563 unsolved
Search for dead transitions found 0 dead transitions in 71673ms
Finished structural reductions in LTL mode , in 1 iterations and 72435 ms. Remains : 841/841 places, 1569/1569 transitions.
Stuttering acceptance computed with spot in 253 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0)), (OR (NOT p2) (AND (NOT p0) (NOT p1))), true, (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : BlocksWorld-PT-05-LTLFireability-05
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 2 ms.
FORMULA BlocksWorld-PT-05-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BlocksWorld-PT-05-LTLFireability-05 finished in 72729 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) U !p1)&&X(((!G(!p1) U !p0)||G(p1)))))'
Support contains 79 out of 841 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 841/841 places, 1569/1569 transitions.
Applied a total of 0 rules in 24 ms. Remains 841 /841 variables (removed 0) and now considering 1569/1569 (removed 0) transitions.
[2024-06-07 09:51:42] [INFO ] Invariant cache hit.
[2024-06-07 09:51:43] [INFO ] Implicit Places using invariants in 453 ms returned []
[2024-06-07 09:51:43] [INFO ] Invariant cache hit.
[2024-06-07 09:51:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 09:51:44] [INFO ] Implicit Places using invariants and state equation in 1141 ms returned []
Implicit Place search using SMT with State Equation took 1595 ms to find 0 implicit places.
Running 1563 sub problems to find dead transitions.
[2024-06-07 09:51:44] [INFO ] Invariant cache hit.
[2024-06-07 09:51:44] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/835 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
[2024-06-07 09:52:15] [INFO ] Deduced a trap composed of 144 places in 138 ms of which 3 ms to minimize.
[2024-06-07 09:52:15] [INFO ] Deduced a trap composed of 125 places in 102 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 835/2410 variables, and 48 constraints, problems are : Problem set: 0 solved, 1563 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 46/57 constraints, State Equation: 0/841 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1563/785 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1563 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/835 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/835 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
[2024-06-07 09:52:26] [INFO ] Deduced a trap composed of 125 places in 124 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/835 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
[2024-06-07 09:52:49] [INFO ] Deduced a trap composed of 104 places in 118 ms of which 2 ms to minimize.
[2024-06-07 09:52:49] [INFO ] Deduced a trap composed of 81 places in 80 ms of which 1 ms to minimize.
[2024-06-07 09:52:50] [INFO ] Deduced a trap composed of 104 places in 116 ms of which 2 ms to minimize.
[2024-06-07 09:52:50] [INFO ] Deduced a trap composed of 104 places in 109 ms of which 2 ms to minimize.
[2024-06-07 09:52:50] [INFO ] Deduced a trap composed of 81 places in 75 ms of which 2 ms to minimize.
[2024-06-07 09:52:50] [INFO ] Deduced a trap composed of 56 places in 56 ms of which 1 ms to minimize.
[2024-06-07 09:52:50] [INFO ] Deduced a trap composed of 81 places in 95 ms of which 2 ms to minimize.
[2024-06-07 09:52:50] [INFO ] Deduced a trap composed of 56 places in 51 ms of which 1 ms to minimize.
[2024-06-07 09:52:50] [INFO ] Deduced a trap composed of 81 places in 93 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 835/2410 variables, and 58 constraints, problems are : Problem set: 0 solved, 1563 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 46/57 constraints, State Equation: 0/841 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 778/785 constraints, Known Traps: 12/12 constraints]
After SMT, in 71202ms problems are : Problem set: 0 solved, 1563 unsolved
Search for dead transitions found 0 dead transitions in 71219ms
Finished structural reductions in LTL mode , in 1 iterations and 72843 ms. Remains : 841/841 places, 1569/1569 transitions.
Stuttering acceptance computed with spot in 240 ms :[(OR p0 p1), (AND (NOT p1) p0), (OR p1 p0), (NOT p1), p0, true]
Running random walk in product with property : BlocksWorld-PT-05-LTLFireability-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BlocksWorld-PT-05-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BlocksWorld-PT-05-LTLFireability-06 finished in 73120 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((F(!p1)&&p0)))))'
Support contains 57 out of 841 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 841/841 places, 1569/1569 transitions.
Applied a total of 0 rules in 23 ms. Remains 841 /841 variables (removed 0) and now considering 1569/1569 (removed 0) transitions.
[2024-06-07 09:52:55] [INFO ] Invariant cache hit.
[2024-06-07 09:52:56] [INFO ] Implicit Places using invariants in 402 ms returned []
[2024-06-07 09:52:56] [INFO ] Invariant cache hit.
[2024-06-07 09:52:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 09:52:57] [INFO ] Implicit Places using invariants and state equation in 1030 ms returned []
Implicit Place search using SMT with State Equation took 1434 ms to find 0 implicit places.
Running 1563 sub problems to find dead transitions.
[2024-06-07 09:52:57] [INFO ] Invariant cache hit.
[2024-06-07 09:52:57] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/835 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
[2024-06-07 09:53:27] [INFO ] Deduced a trap composed of 144 places in 147 ms of which 2 ms to minimize.
[2024-06-07 09:53:28] [INFO ] Deduced a trap composed of 125 places in 106 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 835/2410 variables, and 48 constraints, problems are : Problem set: 0 solved, 1563 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 46/57 constraints, State Equation: 0/841 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1563/785 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1563 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/835 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/835 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
[2024-06-07 09:53:39] [INFO ] Deduced a trap composed of 125 places in 120 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/835 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
[2024-06-07 09:54:00] [INFO ] Deduced a trap composed of 104 places in 121 ms of which 2 ms to minimize.
[2024-06-07 09:54:01] [INFO ] Deduced a trap composed of 81 places in 75 ms of which 1 ms to minimize.
[2024-06-07 09:54:01] [INFO ] Deduced a trap composed of 104 places in 101 ms of which 2 ms to minimize.
[2024-06-07 09:54:01] [INFO ] Deduced a trap composed of 104 places in 100 ms of which 1 ms to minimize.
[2024-06-07 09:54:01] [INFO ] Deduced a trap composed of 81 places in 73 ms of which 1 ms to minimize.
[2024-06-07 09:54:01] [INFO ] Deduced a trap composed of 56 places in 55 ms of which 1 ms to minimize.
[2024-06-07 09:54:01] [INFO ] Deduced a trap composed of 81 places in 96 ms of which 2 ms to minimize.
[2024-06-07 09:54:01] [INFO ] Deduced a trap composed of 56 places in 57 ms of which 1 ms to minimize.
[2024-06-07 09:54:02] [INFO ] Deduced a trap composed of 81 places in 104 ms of which 2 ms to minimize.
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 Int declared 835/2410 variables, and 58 constraints, problems are : Problem set: 0 solved, 1563 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 46/57 constraints, State Equation: 0/841 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 778/785 constraints, Known Traps: 12/12 constraints]
After SMT, in 70830ms problems are : Problem set: 0 solved, 1563 unsolved
Search for dead transitions found 0 dead transitions in 70845ms
Finished structural reductions in LTL mode , in 1 iterations and 72306 ms. Remains : 841/841 places, 1569/1569 transitions.
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), true, p1]
Running random walk in product with property : BlocksWorld-PT-05-LTLFireability-07
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BlocksWorld-PT-05-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BlocksWorld-PT-05-LTLFireability-07 finished in 72524 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((G(p0) U (!p1||G(!p0)))))))'
Support contains 24 out of 841 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 841/841 places, 1569/1569 transitions.
Applied a total of 0 rules in 19 ms. Remains 841 /841 variables (removed 0) and now considering 1569/1569 (removed 0) transitions.
[2024-06-07 09:54:08] [INFO ] Invariant cache hit.
[2024-06-07 09:54:08] [INFO ] Implicit Places using invariants in 488 ms returned []
[2024-06-07 09:54:08] [INFO ] Invariant cache hit.
[2024-06-07 09:54:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 09:54:10] [INFO ] Implicit Places using invariants and state equation in 1194 ms returned []
Implicit Place search using SMT with State Equation took 1684 ms to find 0 implicit places.
Running 1563 sub problems to find dead transitions.
[2024-06-07 09:54:10] [INFO ] Invariant cache hit.
[2024-06-07 09:54:10] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/835 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
[2024-06-07 09:54:40] [INFO ] Deduced a trap composed of 144 places in 147 ms of which 3 ms to minimize.
[2024-06-07 09:54:40] [INFO ] Deduced a trap composed of 125 places in 115 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 835/2410 variables, and 48 constraints, problems are : Problem set: 0 solved, 1563 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 46/57 constraints, State Equation: 0/841 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1563/785 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1563 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/835 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/835 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
[2024-06-07 09:54:51] [INFO ] Deduced a trap composed of 125 places in 122 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/835 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
[2024-06-07 09:55:14] [INFO ] Deduced a trap composed of 104 places in 131 ms of which 2 ms to minimize.
[2024-06-07 09:55:14] [INFO ] Deduced a trap composed of 81 places in 76 ms of which 1 ms to minimize.
[2024-06-07 09:55:14] [INFO ] Deduced a trap composed of 104 places in 113 ms of which 2 ms to minimize.
[2024-06-07 09:55:15] [INFO ] Deduced a trap composed of 104 places in 109 ms of which 2 ms to minimize.
[2024-06-07 09:55:15] [INFO ] Deduced a trap composed of 81 places in 74 ms of which 1 ms to minimize.
[2024-06-07 09:55:15] [INFO ] Deduced a trap composed of 56 places in 65 ms of which 1 ms to minimize.
[2024-06-07 09:55:15] [INFO ] Deduced a trap composed of 81 places in 107 ms of which 2 ms to minimize.
[2024-06-07 09:55:15] [INFO ] Deduced a trap composed of 56 places in 59 ms of which 1 ms to minimize.
[2024-06-07 09:55:15] [INFO ] Deduced a trap composed of 81 places in 112 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 1)
(s3 0)
(s4 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 1)
(s14 0)
(s15 0)
(s16 0)
(s17 1)
(s18 0)
(s19 1)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 1)
(s29 1)
(s30 0)
(s31 1)
(s32 0)
(s33 0)
(s34 1)
(s35 0)
(s36 0)
(s37 0)
(s38 1)
(s39 0)
(s40 0)
(s41 1)
(s42 0)
(s43 0)
(s44 1)
(s45 0)
(s46 0)
(s47 1)
(s48 0)
(s49 0)
(s50 1)
(s51 0)
(s52 0)
(s53 1)
(s54 0)
(s55 0)
(s56 1)
(s57 0)
(s58 0)
(s59 1)
(s60 0)
(s61 0)
(s62 1)
(s63 0)
(s64 1)
(s65 1)
(s66 0)
(s67 0)
(s68 1)
(s69 0)
(s70 0)
(s71 1)
(s72 0)
(s73 1)
(s74 1)
(s75 0)
(s76 0)
(s77 1)
(s78 0)
(s79 0)
(s80 1)
(s81 0)
(s82 0)
(s83 1)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 1)
(s89 0)
(s90 1)
(s91 0)
(s92 0)
(s93 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 1)
(s106 0)
(s107 0)
(s108 1)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 1)
(s116 0)
(s117 1)
(s118 0)
(s119 0)
(s120 0)
(s121 1)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 1)
(s133 0)
(s134 0)
(s135 1)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 1)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 1)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 1)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 1)
(s225 1)
(s226 0)
(s227 0)
(s228 0)
(s229 1)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s241 0)
(s242 0)
(s243 1)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 1)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 1)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 1)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 0)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 0)
(s353 1)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 1)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 1)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 1)
(s468 0)
(s470 0)
(s471 0)
(s472 0)
(s473 1)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 0)
(s482 0)
(s483 1)
(s484 0)
(s485 0)
(s486 1)
(s487 0)
(s488 0)
(s489 0)
(s490 0)
(s491 0)
(s492 0)
(s493 0)
(s494 0)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 0)
(s500 0)
(s501 0)
(s502 timeout
0)
(s503 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 835/2410 variables, and 58 constraints, problems are : Problem set: 0 solved, 1563 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 46/57 constraints, State Equation: 0/841 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 778/785 constraints, Known Traps: 12/12 constraints]
After SMT, in 70579ms problems are : Problem set: 0 solved, 1563 unsolved
Search for dead transitions found 0 dead transitions in 70592ms
Finished structural reductions in LTL mode , in 1 iterations and 72300 ms. Remains : 841/841 places, 1569/1569 transitions.
Stuttering acceptance computed with spot in 293 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0), (NOT p0), p0, (AND p0 p1), true]
Running random walk in product with property : BlocksWorld-PT-05-LTLFireability-10
Entered a terminal (fully accepting) state of product in 33 steps with 0 reset in 2 ms.
FORMULA BlocksWorld-PT-05-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BlocksWorld-PT-05-LTLFireability-10 finished in 72621 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 U G(p1))))'
Support contains 7 out of 841 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 841/841 places, 1569/1569 transitions.
Applied a total of 0 rules in 19 ms. Remains 841 /841 variables (removed 0) and now considering 1569/1569 (removed 0) transitions.
[2024-06-07 09:55:20] [INFO ] Invariant cache hit.
[2024-06-07 09:55:21] [INFO ] Implicit Places using invariants in 440 ms returned []
[2024-06-07 09:55:21] [INFO ] Invariant cache hit.
[2024-06-07 09:55:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 09:55:22] [INFO ] Implicit Places using invariants and state equation in 1193 ms returned []
Implicit Place search using SMT with State Equation took 1634 ms to find 0 implicit places.
Running 1563 sub problems to find dead transitions.
[2024-06-07 09:55:22] [INFO ] Invariant cache hit.
[2024-06-07 09:55:22] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/835 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
[2024-06-07 09:55:55] [INFO ] Deduced a trap composed of 144 places in 144 ms of which 3 ms to minimize.
[2024-06-07 09:55:55] [INFO ] Deduced a trap composed of 125 places in 111 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 1.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 1.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 1.0)
(s44 1.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 1.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 0.0)
(s67 1.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 1.0)
(s72 0.0)
(s73 1.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 1.0)
(s78 0.0)
(s79 0.0)
(s80 1.0)
(s81 0.0)
(s82 0.0)
(s83 1.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 1.0)
(s106 0.0)
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 1.0)
(s116 0.0)
(s117 1.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 1.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 1.0)
(s133 0.0)
(s134 0.0)
(s135 1.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.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 1.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 1.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 1.0)
(s225 1.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 1.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s241 0.0)
(s242 0.0)
(s243 1.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 1.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 1.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 1.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s333 0.0)
(s334 1.0)
(s335 0.0)
(s336 0.0)
(s337 1.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 1.0)
(s349 0.0)
(s350 0.0)
(s351 1.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 1.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 1.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 1.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 0.0)
(s475 1.0)
(s476 1.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 1.0)
(s484 0.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 1.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)timeout

(s509 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 835/2410 variables, and 48 constraints, problems are : Problem set: 0 solved, 1563 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 46/57 constraints, State Equation: 0/841 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1563/785 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1563 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/835 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/835 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
[2024-06-07 09:56:06] [INFO ] Deduced a trap composed of 125 places in 130 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/835 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
[2024-06-07 09:56:29] [INFO ] Deduced a trap composed of 104 places in 122 ms of which 2 ms to minimize.
[2024-06-07 09:56:29] [INFO ] Deduced a trap composed of 81 places in 77 ms of which 1 ms to minimize.
[2024-06-07 09:56:29] [INFO ] Deduced a trap composed of 104 places in 100 ms of which 2 ms to minimize.
[2024-06-07 09:56:29] [INFO ] Deduced a trap composed of 104 places in 101 ms of which 2 ms to minimize.
[2024-06-07 09:56:29] [INFO ] Deduced a trap composed of 81 places in 73 ms of which 1 ms to minimize.
[2024-06-07 09:56:30] [INFO ] Deduced a trap composed of 56 places in 53 ms of which 1 ms to minimize.
[2024-06-07 09:56:30] [INFO ] Deduced a trap composed of 81 places in 100 ms of which 2 ms to minimize.
[2024-06-07 09:56:30] [INFO ] Deduced a trap composed of 56 places in 57 ms of which 1 ms to minimize.
[2024-06-07 09:56:30] [INFO ] Deduced a trap composed of 81 places in 111 ms of which 2 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 835/2410 variables, and 58 constraints, problems are : Problem set: 0 solved, 1563 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 46/57 constraints, State Equation: 0/841 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 778/785 constraints, Known Traps: 12/12 constraints]
After SMT, in 72384ms problems are : Problem set: 0 solved, 1563 unsolved
Search for dead transitions found 0 dead transitions in 72399ms
Finished structural reductions in LTL mode , in 1 iterations and 74062 ms. Remains : 841/841 places, 1569/1569 transitions.
Stuttering acceptance computed with spot in 145 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : BlocksWorld-PT-05-LTLFireability-12
Entered a terminal (fully accepting) state of product in 321 steps with 0 reset in 10 ms.
FORMULA BlocksWorld-PT-05-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BlocksWorld-PT-05-LTLFireability-12 finished in 74245 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((X((p0&&G(p1)))||(p1&&G(p0)))))))'
Support contains 5 out of 841 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 841/841 places, 1569/1569 transitions.
Applied a total of 0 rules in 15 ms. Remains 841 /841 variables (removed 0) and now considering 1569/1569 (removed 0) transitions.
[2024-06-07 09:56:35] [INFO ] Invariant cache hit.
[2024-06-07 09:56:35] [INFO ] Implicit Places using invariants in 475 ms returned []
[2024-06-07 09:56:35] [INFO ] Invariant cache hit.
[2024-06-07 09:56:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 09:56:36] [INFO ] Implicit Places using invariants and state equation in 1180 ms returned []
Implicit Place search using SMT with State Equation took 1659 ms to find 0 implicit places.
Running 1563 sub problems to find dead transitions.
[2024-06-07 09:56:36] [INFO ] Invariant cache hit.
[2024-06-07 09:56:36] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/835 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
[2024-06-07 09:57:07] [INFO ] Deduced a trap composed of 144 places in 145 ms of which 3 ms to minimize.
[2024-06-07 09:57:07] [INFO ] Deduced a trap composed of 125 places in 115 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 835/2410 variables, and 48 constraints, problems are : Problem set: 0 solved, 1563 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 46/57 constraints, State Equation: 0/841 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1563/785 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1563 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/835 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/835 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
[2024-06-07 09:57:19] [INFO ] Deduced a trap composed of 125 places in 118 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/835 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
[2024-06-07 09:57:41] [INFO ] Deduced a trap composed of 104 places in 127 ms of which 2 ms to minimize.
[2024-06-07 09:57:41] [INFO ] Deduced a trap composed of 81 places in 76 ms of which 2 ms to minimize.
[2024-06-07 09:57:41] [INFO ] Deduced a trap composed of 104 places in 103 ms of which 2 ms to minimize.
[2024-06-07 09:57:41] [INFO ] Deduced a trap composed of 104 places in 94 ms of which 2 ms to minimize.
[2024-06-07 09:57:41] [INFO ] Deduced a trap composed of 81 places in 62 ms of which 1 ms to minimize.
[2024-06-07 09:57:41] [INFO ] Deduced a trap composed of 56 places in 58 ms of which 1 ms to minimize.
[2024-06-07 09:57:42] [INFO ] Deduced a trap composed of 81 places in 101 ms of which 1 ms to minimize.
[2024-06-07 09:57:42] [INFO ] Deduced a trap composed of 56 places in 52 ms of which 0 ms to minimize.
[2024-06-07 09:57:42] [INFO ] Deduced a trap composed of 81 places in 97 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 835/2410 variables, and 58 constraints, problems are : Problem set: 0 solved, 1563 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 46/57 constraints, State Equation: 0/841 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 778/785 constraints, Known Traps: 12/12 constraints]
After SMT, in 70984ms problems are : Problem set: 0 solved, 1563 unsolved
Search for dead transitions found 0 dead transitions in 70999ms
Finished structural reductions in LTL mode , in 1 iterations and 72683 ms. Remains : 841/841 places, 1569/1569 transitions.
Stuttering acceptance computed with spot in 290 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : BlocksWorld-PT-05-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 1984 ms.
Product exploration explored 100000 steps with 0 reset in 2185 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 (X (AND p1 p0))), (X (X (NOT (OR (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 83 ms. Reduced automaton from 7 states, 16 edges and 2 AP (stutter sensitive) to 7 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 269 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 40000 steps (8 resets) in 1323 ms. (30 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 266 ms. (149 steps per ms) remains 1/1 properties
[2024-06-07 09:57:53] [INFO ] Invariant cache hit.
[2024-06-07 09:57:53] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Real declared 191/2410 variables, and 7 constraints, problems are : Problem set: 1 solved, 0 unsolved in 43 ms.
Refiners :[Positive P Invariants (semi-flows): 7/57 constraints, State Equation: 0/841 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 73ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (X (AND p1 p0))), (X (X (NOT (OR (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F (NOT p0)), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT (AND p0 p1))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 6 factoid took 267 ms. Reduced automaton from 7 states, 15 edges and 2 AP (stutter sensitive) to 7 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 255 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 249 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 5 out of 841 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 841/841 places, 1569/1569 transitions.
Applied a total of 0 rules in 19 ms. Remains 841 /841 variables (removed 0) and now considering 1569/1569 (removed 0) transitions.
[2024-06-07 09:57:54] [INFO ] Invariant cache hit.
[2024-06-07 09:57:54] [INFO ] Implicit Places using invariants in 436 ms returned []
[2024-06-07 09:57:54] [INFO ] Invariant cache hit.
[2024-06-07 09:57:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 09:57:55] [INFO ] Implicit Places using invariants and state equation in 1174 ms returned []
Implicit Place search using SMT with State Equation took 1614 ms to find 0 implicit places.
Running 1563 sub problems to find dead transitions.
[2024-06-07 09:57:55] [INFO ] Invariant cache hit.
[2024-06-07 09:57:55] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/835 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
[2024-06-07 09:58:26] [INFO ] Deduced a trap composed of 144 places in 142 ms of which 3 ms to minimize.
[2024-06-07 09:58:26] [INFO ] Deduced a trap composed of 125 places in 113 ms of which 1 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 835/2410 variables, and 48 constraints, problems are : Problem set: 0 solved, 1563 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 46/57 constraints, State Equation: 0/841 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1563/785 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1563 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/835 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/835 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
[2024-06-07 09:58:37] [INFO ] Deduced a trap composed of 125 places in 120 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/835 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
[2024-06-07 09:58:59] [INFO ] Deduced a trap composed of 104 places in 124 ms of which 3 ms to minimize.
[2024-06-07 09:58:59] [INFO ] Deduced a trap composed of 81 places in 69 ms of which 1 ms to minimize.
[2024-06-07 09:59:00] [INFO ] Deduced a trap composed of 104 places in 104 ms of which 2 ms to minimize.
[2024-06-07 09:59:00] [INFO ] Deduced a trap composed of 104 places in 107 ms of which 2 ms to minimize.
[2024-06-07 09:59:00] [INFO ] Deduced a trap composed of 81 places in 76 ms of which 1 ms to minimize.
[2024-06-07 09:59:00] [INFO ] Deduced a trap composed of 56 places in 58 ms of which 0 ms to minimize.
[2024-06-07 09:59:00] [INFO ] Deduced a trap composed of 81 places in 101 ms of which 2 ms to minimize.
[2024-06-07 09:59:00] [INFO ] Deduced a trap composed of 56 places in 62 ms of which 1 ms to minimize.
[2024-06-07 09:59:00] [INFO ] Deduced a trap composed of 81 places in 108 ms of which 2 ms to minimize.
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 Int declared 835/2410 variables, and 58 constraints, problems are : Problem set: 0 solved, 1563 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 46/57 constraints, State Equation: 0/841 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 778/785 constraints, Known Traps: 12/12 constraints]
After SMT, in 70854ms problems are : Problem set: 0 solved, 1563 unsolved
Search for dead transitions found 0 dead transitions in 70868ms
Finished structural reductions in LTL mode , in 1 iterations and 72505 ms. Remains : 841/841 places, 1569/1569 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 124 ms. Reduced automaton from 7 states, 14 edges and 2 AP (stutter sensitive) to 7 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 346 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 9566 steps (1 resets) in 246 ms. (38 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT p0)), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 1 factoid took 199 ms. Reduced automaton from 7 states, 14 edges and 2 AP (stutter sensitive) to 7 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 295 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 296 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 296 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 1927 ms.
Product exploration explored 100000 steps with 0 reset in 2008 ms.
Applying partial POR strategy [false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 306 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 5 out of 841 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 841/841 places, 1569/1569 transitions.
Applied a total of 0 rules in 161 ms. Remains 841 /841 variables (removed 0) and now considering 1569/1569 (removed 0) transitions.
[2024-06-07 09:59:12] [INFO ] Redundant transitions in 31 ms returned []
Running 1563 sub problems to find dead transitions.
[2024-06-07 09:59:12] [INFO ] Invariant cache hit.
[2024-06-07 09:59:12] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/835 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
[2024-06-07 09:59:43] [INFO ] Deduced a trap composed of 144 places in 153 ms of which 2 ms to minimize.
[2024-06-07 09:59:43] [INFO ] Deduced a trap composed of 125 places in 101 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 835/2410 variables, and 48 constraints, problems are : Problem set: 0 solved, 1563 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 46/57 constraints, State Equation: 0/841 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1563/785 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1563 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/835 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/835 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
[2024-06-07 09:59:54] [INFO ] Deduced a trap composed of 125 places in 121 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/835 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
[2024-06-07 10:00:15] [INFO ] Deduced a trap composed of 104 places in 117 ms of which 2 ms to minimize.
[2024-06-07 10:00:16] [INFO ] Deduced a trap composed of 81 places in 69 ms of which 1 ms to minimize.
[2024-06-07 10:00:16] [INFO ] Deduced a trap composed of 104 places in 104 ms of which 2 ms to minimize.
[2024-06-07 10:00:16] [INFO ] Deduced a trap composed of 104 places in 142 ms of which 1 ms to minimize.
[2024-06-07 10:00:16] [INFO ] Deduced a trap composed of 81 places in 69 ms of which 1 ms to minimize.
[2024-06-07 10:00:16] [INFO ] Deduced a trap composed of 56 places in 58 ms of which 1 ms to minimize.
[2024-06-07 10:00:16] [INFO ] Deduced a trap composed of 81 places in 98 ms of which 2 ms to minimize.
[2024-06-07 10:00:16] [INFO ] Deduced a trap composed of 56 places in 59 ms of which 1 ms to minimize.
[2024-06-07 10:00:17] [INFO ] Deduced a trap composed of 81 places in 96 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 835/2410 variables, and 58 constraints, problems are : Problem set: 0 solved, 1563 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 46/57 constraints, State Equation: 0/841 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 778/785 constraints, Known Traps: 12/12 constraints]
After SMT, in 70651ms problems are : Problem set: 0 solved, 1563 unsolved
Search for dead transitions found 0 dead transitions in 70668ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 70875 ms. Remains : 841/841 places, 1569/1569 transitions.
Built C files in :
/tmp/ltsmin11853147723944962496
[2024-06-07 10:00:23] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11853147723944962496
Running compilation step : cd /tmp/ltsmin11853147723944962496;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11853147723944962496;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11853147723944962496;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 5 out of 841 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 841/841 places, 1569/1569 transitions.
Applied a total of 0 rules in 23 ms. Remains 841 /841 variables (removed 0) and now considering 1569/1569 (removed 0) transitions.
[2024-06-07 10:00:26] [INFO ] Invariant cache hit.
[2024-06-07 10:00:27] [INFO ] Implicit Places using invariants in 461 ms returned []
[2024-06-07 10:00:27] [INFO ] Invariant cache hit.
[2024-06-07 10:00:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 10:00:28] [INFO ] Implicit Places using invariants and state equation in 1144 ms returned []
Implicit Place search using SMT with State Equation took 1607 ms to find 0 implicit places.
Running 1563 sub problems to find dead transitions.
[2024-06-07 10:00:28] [INFO ] Invariant cache hit.
[2024-06-07 10:00:28] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/835 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
[2024-06-07 10:00:58] [INFO ] Deduced a trap composed of 144 places in 137 ms of which 2 ms to minimize.
[2024-06-07 10:00:58] [INFO ] Deduced a trap composed of 125 places in 103 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 1.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 1.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.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 1.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 1.0)
(s74 1.0)
(s75 0.0)
(s76 1.0)
(s77 1.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 1.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 1.0)
(s106 0.0)
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 1.0)
(s116 0.0)
(s117 1.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 1.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 1.0)
(s133 0.0)
(s134 0.0)
(s135 1.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.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 1.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 1.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 1.0)
(s225 1.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 1.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s241 0.0)
(s242 0.0)
(s243 1.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 1.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 1.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 1.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s333 0.0)
(s334 1.0)
(s335 0.0)
(s336 0.0)
(s337 1.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 1.0)
(s349 0.0)
(s350 0.0)
(s351 1.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 1.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 1.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 1.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 1.0)
(s468 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 1.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 1.0)
(s484 0.0)
(s485 0.0)
(s486 1.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 1.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 1.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 1.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 1.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 1.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 1.0)timeout

(s636 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 835/2410 variables, and 48 constraints, problems are : Problem set: 0 solved, 1563 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 46/57 constraints, State Equation: 0/841 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1563/785 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1563 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/835 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/835 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
[2024-06-07 10:01:10] [INFO ] Deduced a trap composed of 125 places in 120 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/835 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
[2024-06-07 10:01:31] [INFO ] Deduced a trap composed of 104 places in 120 ms of which 2 ms to minimize.
[2024-06-07 10:01:31] [INFO ] Deduced a trap composed of 81 places in 69 ms of which 1 ms to minimize.
[2024-06-07 10:01:31] [INFO ] Deduced a trap composed of 104 places in 100 ms of which 1 ms to minimize.
[2024-06-07 10:01:31] [INFO ] Deduced a trap composed of 104 places in 105 ms of which 2 ms to minimize.
[2024-06-07 10:01:32] [INFO ] Deduced a trap composed of 81 places in 69 ms of which 1 ms to minimize.
[2024-06-07 10:01:32] [INFO ] Deduced a trap composed of 56 places in 52 ms of which 0 ms to minimize.
[2024-06-07 10:01:32] [INFO ] Deduced a trap composed of 81 places in 95 ms of which 2 ms to minimize.
[2024-06-07 10:01:32] [INFO ] Deduced a trap composed of 56 places in 55 ms of which 0 ms to minimize.
[2024-06-07 10:01:32] [INFO ] Deduced a trap composed of 81 places in 97 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 835/2410 variables, and 58 constraints, problems are : Problem set: 0 solved, 1563 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 46/57 constraints, State Equation: 0/841 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 778/785 constraints, Known Traps: 12/12 constraints]
After SMT, in 70654ms problems are : Problem set: 0 solved, 1563 unsolved
Search for dead transitions found 0 dead transitions in 70669ms
Finished structural reductions in LTL mode , in 1 iterations and 72304 ms. Remains : 841/841 places, 1569/1569 transitions.
Built C files in :
/tmp/ltsmin5228426110189172883
[2024-06-07 10:01:39] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5228426110189172883
Running compilation step : cd /tmp/ltsmin5228426110189172883;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5228426110189172883;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5228426110189172883;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-06-07 10:01:42] [INFO ] Flatten gal took : 74 ms
[2024-06-07 10:01:42] [INFO ] Flatten gal took : 73 ms
[2024-06-07 10:01:42] [INFO ] Time to serialize gal into /tmp/LTL8924547552929223813.gal : 23 ms
[2024-06-07 10:01:42] [INFO ] Time to serialize properties into /tmp/LTL3599469624930880723.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8924547552929223813.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1732875172252674032.hoa' '-atoms' '/tmp/LTL3599469624930880723.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL3599469624930880723.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1732875172252674032.hoa
Detected timeout of ITS tools.
[2024-06-07 10:01:57] [INFO ] Flatten gal took : 71 ms
[2024-06-07 10:01:57] [INFO ] Flatten gal took : 67 ms
[2024-06-07 10:01:57] [INFO ] Time to serialize gal into /tmp/LTL17066522980541007149.gal : 12 ms
[2024-06-07 10:01:57] [INFO ] Time to serialize properties into /tmp/LTL6404641671344733194.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17066522980541007149.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6404641671344733194.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(F((X(("(((pred_arm_empty_0<1)||(pred_clear_16<1))||(pred_on_380<1))")&&(G("((pred_holding_4<1)||(pred_clear_11<1))"))))||((G("(...268
Formula 0 simplified : XXG(X(!"(((pred_arm_empty_0<1)||(pred_clear_16<1))||(pred_on_380<1))" | F!"((pred_holding_4<1)||(pred_clear_11<1))") & (!"((pred_hol...254
Detected timeout of ITS tools.
[2024-06-07 10:02:12] [INFO ] Flatten gal took : 61 ms
[2024-06-07 10:02:12] [INFO ] Applying decomposition
[2024-06-07 10:02:12] [INFO ] Flatten gal took : 64 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2412318281000751408.txt' '-o' '/tmp/graph2412318281000751408.bin' '-w' '/tmp/graph2412318281000751408.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2412318281000751408.bin' '-l' '-1' '-v' '-w' '/tmp/graph2412318281000751408.weights' '-q' '0' '-e' '0.001'
[2024-06-07 10:02:13] [INFO ] Decomposing Gal with order
[2024-06-07 10:02:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-07 10:02:13] [INFO ] Removed a total of 2856 redundant transitions.
[2024-06-07 10:02:13] [INFO ] Flatten gal took : 346 ms
[2024-06-07 10:02:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 40 ms.
[2024-06-07 10:02:13] [INFO ] Time to serialize gal into /tmp/LTL5597261573127828830.gal : 22 ms
[2024-06-07 10:02:13] [INFO ] Time to serialize properties into /tmp/LTL7462672490416697781.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5597261573127828830.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7462672490416697781.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X(F((X(("(((i19.u21.pred_arm_empty_0<1)||(u16.pred_clear_16<1))||(u13.pred_on_380<1))")&&(G("((u4.pred_holding_4<1)||(u11.pred_cl...314
Formula 0 simplified : XXG(X(!"(((i19.u21.pred_arm_empty_0<1)||(u16.pred_clear_16<1))||(u13.pred_on_380<1))" | F!"((u4.pred_holding_4<1)||(u11.pred_clear_1...300
Detected timeout of ITS tools.
Treatment of property BlocksWorld-PT-05-LTLFireability-13 finished in 353702 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(p1)) U G((F(p2) U p3))))'
Support contains 31 out of 841 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 841/841 places, 1569/1569 transitions.
Applied a total of 0 rules in 19 ms. Remains 841 /841 variables (removed 0) and now considering 1569/1569 (removed 0) transitions.
[2024-06-07 10:02:28] [INFO ] Invariant cache hit.
[2024-06-07 10:02:29] [INFO ] Implicit Places using invariants in 439 ms returned []
[2024-06-07 10:02:29] [INFO ] Invariant cache hit.
[2024-06-07 10:02:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 10:02:30] [INFO ] Implicit Places using invariants and state equation in 1151 ms returned []
Implicit Place search using SMT with State Equation took 1591 ms to find 0 implicit places.
Running 1563 sub problems to find dead transitions.
[2024-06-07 10:02:30] [INFO ] Invariant cache hit.
[2024-06-07 10:02:30] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/835 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
[2024-06-07 10:03:03] [INFO ] Deduced a trap composed of 144 places in 153 ms of which 8 ms to minimize.
[2024-06-07 10:03:03] [INFO ] Deduced a trap composed of 125 places in 110 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 835/2410 variables, and 48 constraints, problems are : Problem set: 0 solved, 1563 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 46/57 constraints, State Equation: 0/841 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1563/785 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1563 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/835 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/835 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
[2024-06-07 10:03:14] [INFO ] Deduced a trap composed of 125 places in 126 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/835 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
[2024-06-07 10:03:35] [INFO ] Deduced a trap composed of 104 places in 122 ms of which 2 ms to minimize.
[2024-06-07 10:03:36] [INFO ] Deduced a trap composed of 81 places in 76 ms of which 1 ms to minimize.
[2024-06-07 10:03:36] [INFO ] Deduced a trap composed of 104 places in 105 ms of which 2 ms to minimize.
[2024-06-07 10:03:36] [INFO ] Deduced a trap composed of 104 places in 104 ms of which 2 ms to minimize.
[2024-06-07 10:03:36] [INFO ] Deduced a trap composed of 81 places in 65 ms of which 1 ms to minimize.
[2024-06-07 10:03:36] [INFO ] Deduced a trap composed of 56 places in 53 ms of which 1 ms to minimize.
[2024-06-07 10:03:36] [INFO ] Deduced a trap composed of 81 places in 96 ms of which 2 ms to minimize.
[2024-06-07 10:03:36] [INFO ] Deduced a trap composed of 56 places in 51 ms of which 1 ms to minimize.
[2024-06-07 10:03:37] [INFO ] Deduced a trap composed of 81 places in 99 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 835/2410 variables, and 58 constraints, problems are : Problem set: 0 solved, 1563 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 46/57 constraints, State Equation: 0/841 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 778/785 constraints, Known Traps: 12/12 constraints]
After SMT, in 72564ms problems are : Problem set: 0 solved, 1563 unsolved
Search for dead transitions found 0 dead transitions in 72581ms
Finished structural reductions in LTL mode , in 1 iterations and 74196 ms. Remains : 841/841 places, 1569/1569 transitions.
Stuttering acceptance computed with spot in 527 ms :[(NOT p3), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p3)), (NOT p2), (AND (NOT p2) (NOT p3) (NOT p1)), (NOT p3), (NOT p3), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : BlocksWorld-PT-05-LTLFireability-14
Product exploration explored 100000 steps with 153 reset in 1906 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 0 ms.
FORMULA BlocksWorld-PT-05-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property BlocksWorld-PT-05-LTLFireability-14 finished in 76660 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(X((F(!p0) U X(p1))))))'
Support contains 24 out of 841 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 841/841 places, 1569/1569 transitions.
Applied a total of 0 rules in 20 ms. Remains 841 /841 variables (removed 0) and now considering 1569/1569 (removed 0) transitions.
[2024-06-07 10:03:45] [INFO ] Invariant cache hit.
[2024-06-07 10:03:46] [INFO ] Implicit Places using invariants in 462 ms returned []
[2024-06-07 10:03:46] [INFO ] Invariant cache hit.
[2024-06-07 10:03:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 10:03:47] [INFO ] Implicit Places using invariants and state equation in 1251 ms returned []
Implicit Place search using SMT with State Equation took 1715 ms to find 0 implicit places.
Running 1563 sub problems to find dead transitions.
[2024-06-07 10:03:47] [INFO ] Invariant cache hit.
[2024-06-07 10:03:47] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/835 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
[2024-06-07 10:04:18] [INFO ] Deduced a trap composed of 144 places in 143 ms of which 2 ms to minimize.
[2024-06-07 10:04:18] [INFO ] Deduced a trap composed of 125 places in 103 ms of which 2 ms to minimize.
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 835/2410 variables, and 48 constraints, problems are : Problem set: 0 solved, 1563 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 46/57 constraints, State Equation: 0/841 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1563/785 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1563 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/835 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/835 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
[2024-06-07 10:04:29] [INFO ] Deduced a trap composed of 125 places in 128 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/835 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
[2024-06-07 10:04:50] [INFO ] Deduced a trap composed of 104 places in 121 ms of which 2 ms to minimize.
[2024-06-07 10:04:51] [INFO ] Deduced a trap composed of 81 places in 73 ms of which 1 ms to minimize.
[2024-06-07 10:04:51] [INFO ] Deduced a trap composed of 104 places in 104 ms of which 2 ms to minimize.
[2024-06-07 10:04:51] [INFO ] Deduced a trap composed of 104 places in 102 ms of which 3 ms to minimize.
[2024-06-07 10:04:51] [INFO ] Deduced a trap composed of 81 places in 71 ms of which 1 ms to minimize.
[2024-06-07 10:04:51] [INFO ] Deduced a trap composed of 56 places in 48 ms of which 1 ms to minimize.
[2024-06-07 10:04:51] [INFO ] Deduced a trap composed of 81 places in 93 ms of which 1 ms to minimize.
[2024-06-07 10:04:51] [INFO ] Deduced a trap composed of 56 places in 59 ms of which 1 ms to minimize.
[2024-06-07 10:04:51] [INFO ] Deduced a trap composed of 81 places in 104 ms of which 2 ms to minimize.
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 Int declared 835/2410 variables, and 58 constraints, problems are : Problem set: 0 solved, 1563 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 46/57 constraints, State Equation: 0/841 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 778/785 constraints, Known Traps: 12/12 constraints]
After SMT, in 70728ms problems are : Problem set: 0 solved, 1563 unsolved
Search for dead transitions found 0 dead transitions in 70742ms
Finished structural reductions in LTL mode , in 1 iterations and 72481 ms. Remains : 841/841 places, 1569/1569 transitions.
Stuttering acceptance computed with spot in 275 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND p0 (NOT p1)), p0]
Running random walk in product with property : BlocksWorld-PT-05-LTLFireability-15
Product exploration explored 100000 steps with 20000 reset in 1850 ms.
Product exploration explored 100000 steps with 20000 reset in 1855 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 96 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 258 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND p0 (NOT p1)), p0]
RANDOM walk for 40000 steps (8 resets) in 988 ms. (40 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 180 ms. (221 steps per ms) remains 1/1 properties
[2024-06-07 10:05:02] [INFO ] Invariant cache hit.
[2024-06-07 10:05:02] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 782/805 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/805 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/841 variables, 11/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/841 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1568/2409 variables, 841/898 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2409 variables, 0/898 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/2410 variables, 1/899 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2410 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/2410 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2410/2410 variables, and 899 constraints, problems are : Problem set: 0 solved, 1 unsolved in 644 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 841/841 constraints, ReadFeed: 1/1 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/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 782/805 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/805 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/841 variables, 11/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/841 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1568/2409 variables, 841/898 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2409 variables, 1/899 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2409 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/2410 variables, 1/900 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2410 variables, 0/900 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/2410 variables, 0/900 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2410/2410 variables, and 900 constraints, problems are : Problem set: 0 solved, 1 unsolved in 641 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 841/841 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1293ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 95 ms.
Support contains 23 out of 841 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 841/841 places, 1569/1569 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 841 transition count 1568
Applied a total of 1 rules in 2084 ms. Remains 841 /841 variables (removed 0) and now considering 1568/1569 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2084 ms. Remains : 841/841 places, 1568/1569 transitions.
RANDOM walk for 40000 steps (8 resets) in 898 ms. (44 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 563204 steps, run timeout after 3001 ms. (steps per millisecond=187 ) properties seen :0 out of 1
Probabilistic random walk after 563204 steps, saw 481916 distinct states, run finished after 3001 ms. (steps per millisecond=187 ) properties seen :0
// Phase 1: matrix 1568 rows 841 cols
[2024-06-07 10:05:09] [INFO ] Computed 57 invariants in 14 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 782/805 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/805 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/841 variables, 11/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/841 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1568/2409 variables, 841/898 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2409 variables, 0/898 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/2409 variables, 0/898 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2409/2409 variables, and 898 constraints, problems are : Problem set: 0 solved, 1 unsolved in 580 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 841/841 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/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 782/805 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/805 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/841 variables, 11/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/841 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1568/2409 variables, 841/898 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2409 variables, 1/899 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2409 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/2409 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2409/2409 variables, and 899 constraints, problems are : Problem set: 0 solved, 1 unsolved in 613 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 841/841 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1222ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 91 ms.
Support contains 23 out of 841 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 841/841 places, 1568/1568 transitions.
Applied a total of 0 rules in 1510 ms. Remains 841 /841 variables (removed 0) and now considering 1568/1568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1510 ms. Remains : 841/841 places, 1568/1568 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 841/841 places, 1568/1568 transitions.
Applied a total of 0 rules in 1504 ms. Remains 841 /841 variables (removed 0) and now considering 1568/1568 (removed 0) transitions.
[2024-06-07 10:05:13] [INFO ] Invariant cache hit.
[2024-06-07 10:05:14] [INFO ] Implicit Places using invariants in 519 ms returned []
[2024-06-07 10:05:14] [INFO ] Invariant cache hit.
[2024-06-07 10:05:15] [INFO ] Implicit Places using invariants and state equation in 1211 ms returned []
Implicit Place search using SMT with State Equation took 1731 ms to find 0 implicit places.
[2024-06-07 10:05:15] [INFO ] Redundant transitions in 24 ms returned []
Running 1562 sub problems to find dead transitions.
[2024-06-07 10:05:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/835 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1562 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 835/2409 variables, and 46 constraints, problems are : Problem set: 0 solved, 1562 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 46/57 constraints, State Equation: 0/841 constraints, PredecessorRefiner: 1562/784 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1562 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/835 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1562 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/835 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1562 unsolved
At refinement iteration 2 (OVERLAPS) 6/841 variables, 11/57 constraints. Problems are: Problem set: 0 solved, 1562 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 841/2409 variables, and 57 constraints, problems are : Problem set: 0 solved, 1562 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 0/841 constraints, PredecessorRefiner: 778/784 constraints, Known Traps: 0/0 constraints]
After SMT, in 70750ms problems are : Problem set: 0 solved, 1562 unsolved
Search for dead transitions found 0 dead transitions in 70763ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74032 ms. Remains : 841/841 places, 1568/1568 transitions.
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 1 factoid took 137 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 261 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND p0 (NOT p1)), p0]
Stuttering acceptance computed with spot in 295 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND p0 (NOT p1)), p0]
Support contains 24 out of 841 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 841/841 places, 1569/1569 transitions.
Applied a total of 0 rules in 18 ms. Remains 841 /841 variables (removed 0) and now considering 1569/1569 (removed 0) transitions.
// Phase 1: matrix 1569 rows 841 cols
[2024-06-07 10:06:27] [INFO ] Computed 57 invariants in 15 ms
[2024-06-07 10:06:27] [INFO ] Implicit Places using invariants in 491 ms returned []
[2024-06-07 10:06:27] [INFO ] Invariant cache hit.
[2024-06-07 10:06:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 10:06:28] [INFO ] Implicit Places using invariants and state equation in 1164 ms returned []
Implicit Place search using SMT with State Equation took 1658 ms to find 0 implicit places.
Running 1563 sub problems to find dead transitions.
[2024-06-07 10:06:28] [INFO ] Invariant cache hit.
[2024-06-07 10:06:28] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/835 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
[2024-06-07 10:06:58] [INFO ] Deduced a trap composed of 144 places in 139 ms of which 2 ms to minimize.
[2024-06-07 10:06:58] [INFO ] Deduced a trap composed of 125 places in 109 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 835/2410 variables, and 48 constraints, problems are : Problem set: 0 solved, 1563 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 46/57 constraints, State Equation: 0/841 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1563/785 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1563 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/835 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/835 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
[2024-06-07 10:07:10] [INFO ] Deduced a trap composed of 125 places in 115 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/835 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
[2024-06-07 10:07:31] [INFO ] Deduced a trap composed of 104 places in 125 ms of which 2 ms to minimize.
[2024-06-07 10:07:32] [INFO ] Deduced a trap composed of 81 places in 73 ms of which 1 ms to minimize.
[2024-06-07 10:07:32] [INFO ] Deduced a trap composed of 104 places in 105 ms of which 2 ms to minimize.
[2024-06-07 10:07:32] [INFO ] Deduced a trap composed of 104 places in 100 ms of which 1 ms to minimize.
[2024-06-07 10:07:32] [INFO ] Deduced a trap composed of 81 places in 71 ms of which 1 ms to minimize.
[2024-06-07 10:07:32] [INFO ] Deduced a trap composed of 56 places in 59 ms of which 1 ms to minimize.
[2024-06-07 10:07:32] [INFO ] Deduced a trap composed of 81 places in 100 ms of which 2 ms to minimize.
[2024-06-07 10:07:32] [INFO ] Deduced a trap composed of 56 places in 66 ms of which 1 ms to minimize.
[2024-06-07 10:07:32] [INFO ] Deduced a trap composed of 81 places in 92 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 1)
(s3 0)
(s4 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 1)
(s14 0)
(s15 0)
(s16 0)
(s17 1)
(s18 0)
(s19 1)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 1)
(s30 0)
(s31 1)
(s32 0)
(s33 0)
(s34 0)
(s35 1)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 1)
(s44 1)
(s45 0)
(s46 1)
(s47 0)
(s48 0)
(s49 0)
(s50 1)
(s51 0)
(s52 0)
(s53 1)
(s54 0)
(s55 0)
(s56 1)
(s57 0)
(s58 0)
(s59 1)
(s60 0)
(s61 0)
(s62 1)
(s63 0)
(s64 1)
(s65 1)
(s66 0)
(s67 0)
(s68 1)
(s69 0)
(s70 0)
(s71 1)
(s72 0)
(s73 1)
(s74 1)
(s75 0)
(s76 0)
(s77 1)
(s78 0)
(s79 0)
(s80 1)
(s81 0)
(s82 0)
(s83 1)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 1)
(s89 0)
(s90 1)
(s91 0)
(s92 0)
(s93 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 1)
(s106 0)
(s107 0)
(s108 1)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 1)
(s116 0)
(s117 1)
(s118 0)
(s119 0)
(s120 0)
(s121 1)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 1)
(s133 0)
(s134 0)
(s135 1)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 1)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 1)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 1)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 1)
(s225 1)
(s226 0)
(s227 0)
(s228 0)
(s229 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 835/2410 variables, and 58 constraints, problems are : Problem set: 0 solved, 1563 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 46/57 constraints, State Equation: 0/841 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 778/785 constraints, Known Traps: 12/12 constraints]
After SMT, in 70425ms problems are : Problem set: 0 solved, 1563 unsolved
Search for dead transitions found 0 dead transitions in 70439ms
Finished structural reductions in LTL mode , in 1 iterations and 72119 ms. Remains : 841/841 places, 1569/1569 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 81 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 269 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND p0 (NOT p1)), p0]
RANDOM walk for 40000 steps (8 resets) in 1008 ms. (39 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 205 ms. (194 steps per ms) remains 1/1 properties
[2024-06-07 10:07:39] [INFO ] Invariant cache hit.
[2024-06-07 10:07:39] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 782/805 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/805 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/841 variables, 11/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/841 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1568/2409 variables, 841/898 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2409 variables, 0/898 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/2410 variables, 1/899 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2410 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/2410 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2410/2410 variables, and 899 constraints, problems are : Problem set: 0 solved, 1 unsolved in 624 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 841/841 constraints, ReadFeed: 1/1 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/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 782/805 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/805 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/841 variables, 11/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/841 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1568/2409 variables, 841/898 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2409 variables, 1/899 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2409 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/2410 variables, 1/900 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2410 variables, 0/900 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/2410 variables, 0/900 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2410/2410 variables, and 900 constraints, problems are : Problem set: 0 solved, 1 unsolved in 631 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 841/841 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1264ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 93 ms.
Support contains 23 out of 841 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 841/841 places, 1569/1569 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 841 transition count 1568
Applied a total of 1 rules in 1966 ms. Remains 841 /841 variables (removed 0) and now considering 1568/1569 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1967 ms. Remains : 841/841 places, 1568/1569 transitions.
RANDOM walk for 40000 steps (8 resets) in 1006 ms. (39 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 197 ms. (202 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 573522 steps, run timeout after 3001 ms. (steps per millisecond=191 ) properties seen :0 out of 1
Probabilistic random walk after 573522 steps, saw 490630 distinct states, run finished after 3002 ms. (steps per millisecond=191 ) properties seen :0
// Phase 1: matrix 1568 rows 841 cols
[2024-06-07 10:07:46] [INFO ] Computed 57 invariants in 5 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 782/805 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/805 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/841 variables, 11/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/841 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1568/2409 variables, 841/898 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2409 variables, 0/898 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/2409 variables, 0/898 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2409/2409 variables, and 898 constraints, problems are : Problem set: 0 solved, 1 unsolved in 528 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 841/841 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/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 782/805 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/805 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/841 variables, 11/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/841 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1568/2409 variables, 841/898 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2409 variables, 1/899 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2409 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/2409 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2409/2409 variables, and 899 constraints, problems are : Problem set: 0 solved, 1 unsolved in 564 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 841/841 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1108ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 92 ms.
Support contains 23 out of 841 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 841/841 places, 1568/1568 transitions.
Applied a total of 0 rules in 1486 ms. Remains 841 /841 variables (removed 0) and now considering 1568/1568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1486 ms. Remains : 841/841 places, 1568/1568 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 841/841 places, 1568/1568 transitions.
Applied a total of 0 rules in 1491 ms. Remains 841 /841 variables (removed 0) and now considering 1568/1568 (removed 0) transitions.
[2024-06-07 10:07:50] [INFO ] Invariant cache hit.
[2024-06-07 10:07:51] [INFO ] Implicit Places using invariants in 481 ms returned []
[2024-06-07 10:07:51] [INFO ] Invariant cache hit.
[2024-06-07 10:07:52] [INFO ] Implicit Places using invariants and state equation in 1135 ms returned []
Implicit Place search using SMT with State Equation took 1618 ms to find 0 implicit places.
[2024-06-07 10:07:52] [INFO ] Redundant transitions in 25 ms returned []
Running 1562 sub problems to find dead transitions.
[2024-06-07 10:07:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/835 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1562 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 835/2409 variables, and 46 constraints, problems are : Problem set: 0 solved, 1562 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 46/57 constraints, State Equation: 0/841 constraints, PredecessorRefiner: 1562/784 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1562 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/835 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1562 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/835 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1562 unsolved
At refinement iteration 2 (OVERLAPS) 6/841 variables, 11/57 constraints. Problems are: Problem set: 0 solved, 1562 unsolved
(s278 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 1)
(s2 1)
(s3 0)
(s4 1)
(s5 1)
(s6 0)
(s7 1)
(s8 1)
(s9 0)
(s10 1)
(s11 1)
(s12 0)
(s13 1)
(s14 1)
(s15 0)
(s16 1)
(s17 1)
(s18 0)
(s19 1)
(s20 1)
(s21 0)
(s22 1)
(s23 1)
(s24 0)
(s25 1)
(s26 1)
(s27 0)
(s28 1)
(s29 1)
(s30 0)
(s31 1)
(s32 1)
(s33 0)
(s34 1)
(s35 1)
(s36 0)
(s37 1)
(s38 1)
(s39 0)
(s40 1)
(s41 1)
(s42 0)
(s43 0)
(s44 1)
(s45 0)
(s46 1)
(s47 1)
(s48 0)
(s49 1)
(s50 1)
(s51 0)
(s52 1)
(s53 0)
(s54 0)
(s55 1)
(s56 0)
(s57 0)
(s58 1)
(s59 0)
(s60 0)
(s61 1)
(s62 1)
(s63 0)
(s64 1)
(s65 1)
(s66 0)
(s67 1)
(s68 1)
(s69 0)
(s70 1)
(s71 1)
(s72 0)
(s73 1)
(s74 1)
(s75 0)
(s76 1)
(s77 1)
(s78 0)
(s79 0)
(s80 1)
(s81 0)
(s82 0)
(s83 1)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 841/2409 variables, and 57 constraints, problems are : Problem set: 0 solved, 1562 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 0/841 constraints, PredecessorRefiner: 778/784 constraints, Known Traps: 0/0 constraints]
After SMT, in 70463ms problems are : Problem set: 0 solved, 1562 unsolved
Search for dead transitions found 0 dead transitions in 70476ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73624 ms. Remains : 841/841 places, 1568/1568 transitions.
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 1 factoid took 149 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 288 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND p0 (NOT p1)), p0]
Stuttering acceptance computed with spot in 274 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND p0 (NOT p1)), p0]
Stuttering acceptance computed with spot in 280 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND p0 (NOT p1)), p0]
Product exploration explored 100000 steps with 20000 reset in 1854 ms.
Product exploration explored 100000 steps with 20000 reset in 1865 ms.
Applying partial POR strategy [false, false, false, false, false, true, true]
Stuttering acceptance computed with spot in 265 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND p0 (NOT p1)), p0]
Support contains 24 out of 841 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 841/841 places, 1569/1569 transitions.
Applied a total of 0 rules in 77 ms. Remains 841 /841 variables (removed 0) and now considering 1569/1569 (removed 0) transitions.
[2024-06-07 10:09:08] [INFO ] Redundant transitions in 26 ms returned []
Running 1563 sub problems to find dead transitions.
// Phase 1: matrix 1569 rows 841 cols
[2024-06-07 10:09:08] [INFO ] Computed 57 invariants in 12 ms
[2024-06-07 10:09:08] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/835 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 1.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 1.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.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 1.0)
(s65 1.0)
(s66 0.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 1.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 1.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 1.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 1.0)
(s106 0.0)
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 1.0)
(s116 0.0)
(s117 1.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 1.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 1.0)
(s133 0.0)
(s134 0.0)
(s135 1.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.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 835/2410 variables, and 46 constraints, problems are : Problem set: 0 solved, 1563 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 46/57 constraints, State Equation: 0/841 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1563/785 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1563 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/835 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/835 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
At refinement iteration 2 (OVERLAPS) 6/841 variables, 11/57 constraints. Problems are: Problem set: 0 solved, 1563 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 Int declared 841/2410 variables, and 57 constraints, problems are : Problem set: 0 solved, 1563 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 0/841 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 778/785 constraints, Known Traps: 0/0 constraints]
After SMT, in 70425ms problems are : Problem set: 0 solved, 1563 unsolved
Search for dead transitions found 0 dead transitions in 70439ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 70549 ms. Remains : 841/841 places, 1569/1569 transitions.
Built C files in :
/tmp/ltsmin11404532681729149560
[2024-06-07 10:10:18] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11404532681729149560
Running compilation step : cd /tmp/ltsmin11404532681729149560;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11404532681729149560;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11404532681729149560;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 24 out of 841 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 841/841 places, 1569/1569 transitions.
Applied a total of 0 rules in 15 ms. Remains 841 /841 variables (removed 0) and now considering 1569/1569 (removed 0) transitions.
[2024-06-07 10:10:21] [INFO ] Invariant cache hit.
[2024-06-07 10:10:22] [INFO ] Implicit Places using invariants in 509 ms returned []
[2024-06-07 10:10:22] [INFO ] Invariant cache hit.
[2024-06-07 10:10:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 10:10:23] [INFO ] Implicit Places using invariants and state equation in 1249 ms returned []
Implicit Place search using SMT with State Equation took 1759 ms to find 0 implicit places.
Running 1563 sub problems to find dead transitions.
[2024-06-07 10:10:23] [INFO ] Invariant cache hit.
[2024-06-07 10:10:23] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/835 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
[2024-06-07 10:10:54] [INFO ] Deduced a trap composed of 144 places in 161 ms of which 3 ms to minimize.
[2024-06-07 10:10:54] [INFO ] Deduced a trap composed of 125 places in 109 ms of which 2 ms to minimize.
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 835/2410 variables, and 48 constraints, problems are : Problem set: 0 solved, 1563 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 46/57 constraints, State Equation: 0/841 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1563/785 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1563 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/835 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/835 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
[2024-06-07 10:11:05] [INFO ] Deduced a trap composed of 125 places in 125 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/835 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
[2024-06-07 10:11:26] [INFO ] Deduced a trap composed of 104 places in 124 ms of which 2 ms to minimize.
[2024-06-07 10:11:26] [INFO ] Deduced a trap composed of 81 places in 72 ms of which 2 ms to minimize.
[2024-06-07 10:11:26] [INFO ] Deduced a trap composed of 104 places in 95 ms of which 2 ms to minimize.
[2024-06-07 10:11:27] [INFO ] Deduced a trap composed of 104 places in 98 ms of which 1 ms to minimize.
[2024-06-07 10:11:27] [INFO ] Deduced a trap composed of 81 places in 68 ms of which 1 ms to minimize.
[2024-06-07 10:11:27] [INFO ] Deduced a trap composed of 56 places in 62 ms of which 1 ms to minimize.
[2024-06-07 10:11:27] [INFO ] Deduced a trap composed of 81 places in 100 ms of which 2 ms to minimize.
[2024-06-07 10:11:27] [INFO ] Deduced a trap composed of 56 places in 62 ms of which 1 ms to minimize.
[2024-06-07 10:11:27] [INFO ] Deduced a trap composed of 81 places in 105 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 1)
(s3 0)
(s4 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 1)
(s14 0)
(s15 0)
(s16 0)
(s17 1)
(s18 0)
(s19 1)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 1)
(s30 0)
(s31 1)
(s32 0)
(s33 0)
(s34 0)
(s35 1)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 1)
(s44 1)
(s45 0)
(s46 1)
(s47 0)
(s48 0)
(s49 0)
(s50 1)
(s51 0)
(s52 0)
(s53 1)
(s54 0)
(s55 0)
(s56 1)
(s57 0)
(s58 0)
(s59 1)
(s60 0)
(s61 0)
(s62 1)
(s63 0)
(s64 1)
(s65 1)
(s66 0)
(s67 0)
(s68 1)
(s69 0)
(s70 0)
(s71 1)
(s72 0)
(s73 1)
(s74 1)
(s75 0)
(s76 0)
(s77 1)
(s78 0)
(s79 0)
(s80 1)
(s81 0)
(s82 0)
(s83 1)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 1)
(s89 0)
(s90 1)
(s91 0)
(s92 0)
(s93 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 1)
(s106 0)
(s107 0)
(s108 1)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 1)
(s116 0)
(s117 1)
(s118 0)
(s119 0)
(s120 0)
(s121 1)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 1)
(s133 0)
(s134 0)
(s135 1)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 1)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 1)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 1)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 1)
(s225 1)
(s226 0)
(s227 0)
(s228 0)
(s229 1)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s241 0)
(s242 0)
(s243 1)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 1)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 timeout
0)
(s278 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 835/2410 variables, and 58 constraints, problems are : Problem set: 0 solved, 1563 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 46/57 constraints, State Equation: 0/841 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 778/785 constraints, Known Traps: 12/12 constraints]
After SMT, in 70414ms problems are : Problem set: 0 solved, 1563 unsolved
Search for dead transitions found 0 dead transitions in 70429ms
Finished structural reductions in LTL mode , in 1 iterations and 72207 ms. Remains : 841/841 places, 1569/1569 transitions.
Built C files in :
/tmp/ltsmin6936698298548569230
[2024-06-07 10:11:33] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6936698298548569230
Running compilation step : cd /tmp/ltsmin6936698298548569230;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6936698298548569230;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6936698298548569230;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-06-07 10:11:37] [INFO ] Flatten gal took : 59 ms
[2024-06-07 10:11:37] [INFO ] Flatten gal took : 60 ms
[2024-06-07 10:11:37] [INFO ] Time to serialize gal into /tmp/LTL10519598994902694377.gal : 10 ms
[2024-06-07 10:11:37] [INFO ] Time to serialize properties into /tmp/LTL13695602583765514853.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10519598994902694377.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5787734524515158554.hoa' '-atoms' '/tmp/LTL13695602583765514853.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL13695602583765514853.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5787734524515158554.hoa
Detected timeout of ITS tools.
[2024-06-07 10:11:52] [INFO ] Flatten gal took : 60 ms
[2024-06-07 10:11:52] [INFO ] Flatten gal took : 60 ms
[2024-06-07 10:11:52] [INFO ] Time to serialize gal into /tmp/LTL8565064667265649164.gal : 10 ms
[2024-06-07 10:11:52] [INFO ] Time to serialize properties into /tmp/LTL13209890168557453907.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8565064667265649164.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13209890168557453907.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(X((F(!("((((((pred_on_756<1)||(pred_on_281<1))||((pred_on_478<1)||(pred_on_255<1)))||(((pred_on_732<1)||(pred_on_537<1))||((pre...502
Formula 0 simplified : XXX(G"((((((pred_on_756<1)||(pred_on_281<1))||((pred_on_478<1)||(pred_on_255<1)))||(((pred_on_732<1)||(pred_on_537<1))||((pred_on_68...487
Detected timeout of ITS tools.
[2024-06-07 10:12:07] [INFO ] Flatten gal took : 57 ms
[2024-06-07 10:12:07] [INFO ] Applying decomposition
[2024-06-07 10:12:07] [INFO ] Flatten gal took : 58 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14922726996975158791.txt' '-o' '/tmp/graph14922726996975158791.bin' '-w' '/tmp/graph14922726996975158791.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14922726996975158791.bin' '-l' '-1' '-v' '-w' '/tmp/graph14922726996975158791.weights' '-q' '0' '-e' '0.001'
[2024-06-07 10:12:07] [INFO ] Decomposing Gal with order
[2024-06-07 10:12:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-07 10:12:07] [INFO ] Removed a total of 2856 redundant transitions.
[2024-06-07 10:12:08] [INFO ] Flatten gal took : 172 ms
[2024-06-07 10:12:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 52 labels/synchronizations in 30 ms.
[2024-06-07 10:12:08] [INFO ] Time to serialize gal into /tmp/LTL13722491795428946544.gal : 17 ms
[2024-06-07 10:12:08] [INFO ] Time to serialize properties into /tmp/LTL11288554585146862409.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13722491795428946544.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11288554585146862409.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(X(X((F(!("((((((u27.pred_on_756<1)||(u10.pred_on_281<1))||((u17.pred_on_478<1)||(u3.pred_on_255<1)))||(((i0.u4.pred_on_732<1)||(u...596
Formula 0 simplified : XXX(G"((((((u27.pred_on_756<1)||(u10.pred_on_281<1))||((u17.pred_on_478<1)||(u3.pred_on_255<1)))||(((i0.u4.pred_on_732<1)||(u19.pred...581
Detected timeout of ITS tools.
Treatment of property BlocksWorld-PT-05-LTLFireability-15 finished in 517622 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((X((p0&&G(p1)))||(p1&&G(p0)))))))'
Found a Shortening insensitive property : BlocksWorld-PT-05-LTLFireability-13
Stuttering acceptance computed with spot in 404 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 5 out of 841 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 841/841 places, 1569/1569 transitions.
Applied a total of 0 rules in 47 ms. Remains 841 /841 variables (removed 0) and now considering 1569/1569 (removed 0) transitions.
[2024-06-07 10:12:23] [INFO ] Invariant cache hit.
[2024-06-07 10:12:24] [INFO ] Implicit Places using invariants in 444 ms returned []
[2024-06-07 10:12:24] [INFO ] Invariant cache hit.
[2024-06-07 10:12:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 10:12:25] [INFO ] Implicit Places using invariants and state equation in 1167 ms returned []
Implicit Place search using SMT with State Equation took 1613 ms to find 0 implicit places.
Running 1563 sub problems to find dead transitions.
[2024-06-07 10:12:25] [INFO ] Invariant cache hit.
[2024-06-07 10:12:25] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/835 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
[2024-06-07 10:12:55] [INFO ] Deduced a trap composed of 144 places in 127 ms of which 3 ms to minimize.
[2024-06-07 10:12:55] [INFO ] Deduced a trap composed of 125 places in 97 ms of which 2 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 835/2410 variables, and 48 constraints, problems are : Problem set: 0 solved, 1563 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 46/57 constraints, State Equation: 0/841 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1563/785 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1563 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/835 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/835 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
[2024-06-07 10:13:07] [INFO ] Deduced a trap composed of 125 places in 127 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/835 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
[2024-06-07 10:13:29] [INFO ] Deduced a trap composed of 104 places in 121 ms of which 2 ms to minimize.
[2024-06-07 10:13:29] [INFO ] Deduced a trap composed of 81 places in 78 ms of which 2 ms to minimize.
[2024-06-07 10:13:29] [INFO ] Deduced a trap composed of 104 places in 111 ms of which 2 ms to minimize.
[2024-06-07 10:13:30] [INFO ] Deduced a trap composed of 104 places in 100 ms of which 1 ms to minimize.
[2024-06-07 10:13:30] [INFO ] Deduced a trap composed of 81 places in 77 ms of which 2 ms to minimize.
[2024-06-07 10:13:30] [INFO ] Deduced a trap composed of 56 places in 53 ms of which 1 ms to minimize.
[2024-06-07 10:13:30] [INFO ] Deduced a trap composed of 81 places in 93 ms of which 2 ms to minimize.
[2024-06-07 10:13:30] [INFO ] Deduced a trap composed of 56 places in 52 ms of which 1 ms to minimize.
[2024-06-07 10:13:30] [INFO ] Deduced a trap composed of 81 places in 108 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 835/2410 variables, and 58 constraints, problems are : Problem set: 0 solved, 1563 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 46/57 constraints, State Equation: 0/841 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 778/785 constraints, Known Traps: 12/12 constraints]
After SMT, in 70581ms problems are : Problem set: 0 solved, 1563 unsolved
Search for dead transitions found 0 dead transitions in 70597ms
Finished structural reductions in LI_LTL mode , in 1 iterations and 72261 ms. Remains : 841/841 places, 1569/1569 transitions.
Running random walk in product with property : BlocksWorld-PT-05-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 1941 ms.
Product exploration explored 100000 steps with 0 reset in 1970 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 (X (AND p1 p0))), (X (X (NOT (OR (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 105 ms. Reduced automaton from 7 states, 16 edges and 2 AP (stutter sensitive) to 7 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 302 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 40000 steps (8 resets) in 837 ms. (47 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 136 ms. (292 steps per ms) remains 1/1 properties
[2024-06-07 10:13:40] [INFO ] Invariant cache hit.
[2024-06-07 10:13:40] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Real declared 191/2410 variables, and 7 constraints, problems are : Problem set: 1 solved, 0 unsolved in 38 ms.
Refiners :[Positive P Invariants (semi-flows): 7/57 constraints, State Equation: 0/841 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 57ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (X (AND p1 p0))), (X (X (NOT (OR (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F (NOT p0)), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT (AND p0 p1))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 6 factoid took 307 ms. Reduced automaton from 7 states, 15 edges and 2 AP (stutter sensitive) to 7 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 307 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 379 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 5 out of 841 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 841/841 places, 1569/1569 transitions.
Applied a total of 0 rules in 20 ms. Remains 841 /841 variables (removed 0) and now considering 1569/1569 (removed 0) transitions.
[2024-06-07 10:13:41] [INFO ] Invariant cache hit.
[2024-06-07 10:13:42] [INFO ] Implicit Places using invariants in 480 ms returned []
[2024-06-07 10:13:42] [INFO ] Invariant cache hit.
[2024-06-07 10:13:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 10:13:43] [INFO ] Implicit Places using invariants and state equation in 1143 ms returned []
Implicit Place search using SMT with State Equation took 1623 ms to find 0 implicit places.
Running 1563 sub problems to find dead transitions.
[2024-06-07 10:13:43] [INFO ] Invariant cache hit.
[2024-06-07 10:13:43] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/835 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
[2024-06-07 10:14:14] [INFO ] Deduced a trap composed of 144 places in 135 ms of which 3 ms to minimize.
[2024-06-07 10:14:15] [INFO ] Deduced a trap composed of 125 places in 99 ms of which 2 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 835/2410 variables, and 48 constraints, problems are : Problem set: 0 solved, 1563 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 46/57 constraints, State Equation: 0/841 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1563/785 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1563 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/835 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/835 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
[2024-06-07 10:14:26] [INFO ] Deduced a trap composed of 125 places in 125 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/835 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
[2024-06-07 10:14:48] [INFO ] Deduced a trap composed of 104 places in 127 ms of which 2 ms to minimize.
[2024-06-07 10:14:48] [INFO ] Deduced a trap composed of 81 places in 68 ms of which 1 ms to minimize.
[2024-06-07 10:14:49] [INFO ] Deduced a trap composed of 104 places in 106 ms of which 2 ms to minimize.
[2024-06-07 10:14:49] [INFO ] Deduced a trap composed of 104 places in 102 ms of which 2 ms to minimize.
[2024-06-07 10:14:49] [INFO ] Deduced a trap composed of 81 places in 69 ms of which 1 ms to minimize.
[2024-06-07 10:14:49] [INFO ] Deduced a trap composed of 56 places in 53 ms of which 1 ms to minimize.
[2024-06-07 10:14:49] [INFO ] Deduced a trap composed of 81 places in 109 ms of which 1 ms to minimize.
[2024-06-07 10:14:49] [INFO ] Deduced a trap composed of 56 places in 55 ms of which 1 ms to minimize.
[2024-06-07 10:14:49] [INFO ] Deduced a trap composed of 81 places in 105 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 835/2410 variables, and 58 constraints, problems are : Problem set: 0 solved, 1563 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 46/57 constraints, State Equation: 0/841 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 778/785 constraints, Known Traps: 12/12 constraints]
After SMT, in 71853ms problems are : Problem set: 0 solved, 1563 unsolved
Search for dead transitions found 0 dead transitions in 71868ms
Finished structural reductions in LTL mode , in 1 iterations and 73515 ms. Remains : 841/841 places, 1569/1569 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 121 ms. Reduced automaton from 7 states, 14 edges and 2 AP (stutter sensitive) to 7 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 374 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 13125 steps (2 resets) in 352 ms. (37 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT p0)), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 1 factoid took 283 ms. Reduced automaton from 7 states, 14 edges and 2 AP (stutter sensitive) to 7 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 302 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 284 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 392 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 1963 ms.
Product exploration explored 100000 steps with 0 reset in 2084 ms.
Applying partial POR strategy [false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 310 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 5 out of 841 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 841/841 places, 1569/1569 transitions.
Applied a total of 0 rules in 85 ms. Remains 841 /841 variables (removed 0) and now considering 1569/1569 (removed 0) transitions.
[2024-06-07 10:15:01] [INFO ] Redundant transitions in 20 ms returned []
Running 1563 sub problems to find dead transitions.
[2024-06-07 10:15:01] [INFO ] Invariant cache hit.
[2024-06-07 10:15:01] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/835 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
[2024-06-07 10:15:34] [INFO ] Deduced a trap composed of 144 places in 147 ms of which 2 ms to minimize.
[2024-06-07 10:15:34] [INFO ] Deduced a trap composed of 125 places in 107 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 835/2410 variables, and 48 constraints, problems are : Problem set: 0 solved, 1563 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 46/57 constraints, State Equation: 0/841 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1563/785 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1563 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/835 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/835 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
[2024-06-07 10:15:46] [INFO ] Deduced a trap composed of 125 places in 125 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/835 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
[2024-06-07 10:16:08] [INFO ] Deduced a trap composed of 104 places in 132 ms of which 2 ms to minimize.
[2024-06-07 10:16:08] [INFO ] Deduced a trap composed of 81 places in 72 ms of which 1 ms to minimize.
[2024-06-07 10:16:08] [INFO ] Deduced a trap composed of 104 places in 108 ms of which 1 ms to minimize.
[2024-06-07 10:16:08] [INFO ] Deduced a trap composed of 104 places in 106 ms of which 2 ms to minimize.
[2024-06-07 10:16:08] [INFO ] Deduced a trap composed of 81 places in 73 ms of which 1 ms to minimize.
[2024-06-07 10:16:09] [INFO ] Deduced a trap composed of 56 places in 59 ms of which 1 ms to minimize.
[2024-06-07 10:16:09] [INFO ] Deduced a trap composed of 81 places in 105 ms of which 2 ms to minimize.
[2024-06-07 10:16:09] [INFO ] Deduced a trap composed of 56 places in 63 ms of which 1 ms to minimize.
[2024-06-07 10:16:09] [INFO ] Deduced a trap composed of 81 places in 105 ms of which 2 ms to minimize.
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 Int declared 835/2410 variables, and 58 constraints, problems are : Problem set: 0 solved, 1563 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 46/57 constraints, State Equation: 0/841 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 778/785 constraints, Known Traps: 12/12 constraints]
After SMT, in 72877ms problems are : Problem set: 0 solved, 1563 unsolved
Search for dead transitions found 0 dead transitions in 72894ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 73051 ms. Remains : 841/841 places, 1569/1569 transitions.
Built C files in :
/tmp/ltsmin15157010696496706949
[2024-06-07 10:16:14] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15157010696496706949
Running compilation step : cd /tmp/ltsmin15157010696496706949;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15157010696496706949;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15157010696496706949;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 5 out of 841 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 841/841 places, 1569/1569 transitions.
Applied a total of 0 rules in 15 ms. Remains 841 /841 variables (removed 0) and now considering 1569/1569 (removed 0) transitions.
[2024-06-07 10:16:17] [INFO ] Invariant cache hit.
[2024-06-07 10:16:18] [INFO ] Implicit Places using invariants in 473 ms returned []
[2024-06-07 10:16:18] [INFO ] Invariant cache hit.
[2024-06-07 10:16:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-07 10:16:19] [INFO ] Implicit Places using invariants and state equation in 1194 ms returned []
Implicit Place search using SMT with State Equation took 1672 ms to find 0 implicit places.
Running 1563 sub problems to find dead transitions.
[2024-06-07 10:16:19] [INFO ] Invariant cache hit.
[2024-06-07 10:16:19] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/835 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
[2024-06-07 10:16:51] [INFO ] Deduced a trap composed of 144 places in 147 ms of which 3 ms to minimize.
[2024-06-07 10:16:51] [INFO ] Deduced a trap composed of 125 places in 109 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 835/2410 variables, and 48 constraints, problems are : Problem set: 0 solved, 1563 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 46/57 constraints, State Equation: 0/841 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1563/785 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1563 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/835 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/835 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
[2024-06-07 10:17:03] [INFO ] Deduced a trap composed of 125 places in 123 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/835 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1563 unsolved
[2024-06-07 10:17:26] [INFO ] Deduced a trap composed of 104 places in 127 ms of which 2 ms to minimize.
[2024-06-07 10:17:26] [INFO ] Deduced a trap composed of 81 places in 82 ms of which 1 ms to minimize.
[2024-06-07 10:17:26] [INFO ] Deduced a trap composed of 104 places in 108 ms of which 2 ms to minimize.
[2024-06-07 10:17:26] [INFO ] Deduced a trap composed of 104 places in 109 ms of which 2 ms to minimize.
[2024-06-07 10:17:26] [INFO ] Deduced a trap composed of 81 places in 74 ms of which 1 ms to minimize.
[2024-06-07 10:17:26] [INFO ] Deduced a trap composed of 56 places in 59 ms of which 3 ms to minimize.
[2024-06-07 10:17:27] [INFO ] Deduced a trap composed of 81 places in 104 ms of which 2 ms to minimize.
[2024-06-07 10:17:27] [INFO ] Deduced a trap composed of 56 places in 59 ms of which 1 ms to minimize.
[2024-06-07 10:17:27] [INFO ] Deduced a trap composed of 81 places in 106 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 835/2410 variables, and 58 constraints, problems are : Problem set: 0 solved, 1563 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 46/57 constraints, State Equation: 0/841 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 778/785 constraints, Known Traps: 12/12 constraints]
After SMT, in 72196ms problems are : Problem set: 0 solved, 1563 unsolved
Search for dead transitions found 0 dead transitions in 72211ms
Finished structural reductions in LTL mode , in 1 iterations and 73907 ms. Remains : 841/841 places, 1569/1569 transitions.
Built C files in :
/tmp/ltsmin4224104539475318863
[2024-06-07 10:17:31] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4224104539475318863
Running compilation step : cd /tmp/ltsmin4224104539475318863;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4224104539475318863;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4224104539475318863;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-06-07 10:17:34] [INFO ] Flatten gal took : 67 ms
[2024-06-07 10:17:34] [INFO ] Flatten gal took : 52 ms
[2024-06-07 10:17:34] [INFO ] Time to serialize gal into /tmp/LTL17569775007077411765.gal : 9 ms
[2024-06-07 10:17:34] [INFO ] Time to serialize properties into /tmp/LTL3933208703891766470.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17569775007077411765.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11891210701679027784.hoa' '-atoms' '/tmp/LTL3933208703891766470.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL3933208703891766470.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11891210701679027784.hoa
Detected timeout of ITS tools.
[2024-06-07 10:17:50] [INFO ] Flatten gal took : 50 ms
[2024-06-07 10:17:50] [INFO ] Flatten gal took : 52 ms
[2024-06-07 10:17:50] [INFO ] Time to serialize gal into /tmp/LTL2493432661139437281.gal : 11 ms
[2024-06-07 10:17:50] [INFO ] Time to serialize properties into /tmp/LTL5155909639355836985.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2493432661139437281.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5155909639355836985.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(F((X(("(((pred_arm_empty_0<1)||(pred_clear_16<1))||(pred_on_380<1))")&&(G("((pred_holding_4<1)||(pred_clear_11<1))"))))||((G("(...268
Formula 0 simplified : XXG(X(!"(((pred_arm_empty_0<1)||(pred_clear_16<1))||(pred_on_380<1))" | F!"((pred_holding_4<1)||(pred_clear_11<1))") & (!"((pred_hol...254
Detected timeout of ITS tools.
[2024-06-07 10:18:05] [INFO ] Flatten gal took : 50 ms
[2024-06-07 10:18:05] [INFO ] Applying decomposition
[2024-06-07 10:18:05] [INFO ] Flatten gal took : 51 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16396316957991514696.txt' '-o' '/tmp/graph16396316957991514696.bin' '-w' '/tmp/graph16396316957991514696.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16396316957991514696.bin' '-l' '-1' '-v' '-w' '/tmp/graph16396316957991514696.weights' '-q' '0' '-e' '0.001'
[2024-06-07 10:18:05] [INFO ] Decomposing Gal with order
[2024-06-07 10:18:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-07 10:18:05] [INFO ] Removed a total of 2856 redundant transitions.
[2024-06-07 10:18:05] [INFO ] Flatten gal took : 149 ms
[2024-06-07 10:18:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2024-06-07 10:18:05] [INFO ] Time to serialize gal into /tmp/LTL17730660617984630565.gal : 14 ms
[2024-06-07 10:18:05] [INFO ] Time to serialize properties into /tmp/LTL12956312284541640814.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17730660617984630565.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12956312284541640814.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(X(F((X(("(((i19.u20.pred_arm_empty_0<1)||(u16.pred_clear_16<1))||(u13.pred_on_380<1))")&&(G("((u4.pred_holding_4<1)||(u11.pred_cl...314
Formula 0 simplified : XXG(X(!"(((i19.u20.pred_arm_empty_0<1)||(u16.pred_clear_16<1))||(u13.pred_on_380<1))" | F!"((u4.pred_holding_4<1)||(u11.pred_clear_1...300
Detected timeout of ITS tools.
Treatment of property BlocksWorld-PT-05-LTLFireability-13 finished in 357590 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(X((F(!p0) U X(p1))))))'
[2024-06-07 10:18:20] [INFO ] Flatten gal took : 47 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3057773816189232197
[2024-06-07 10:18:20] [INFO ] Too many transitions (1569) to apply POR reductions. Disabling POR matrices.
[2024-06-07 10:18:20] [INFO ] Applying decomposition
[2024-06-07 10:18:20] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3057773816189232197
Running compilation step : cd /tmp/ltsmin3057773816189232197;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-06-07 10:18:21] [INFO ] Flatten gal took : 50 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5287936350172082009.txt' '-o' '/tmp/graph5287936350172082009.bin' '-w' '/tmp/graph5287936350172082009.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5287936350172082009.bin' '-l' '-1' '-v' '-w' '/tmp/graph5287936350172082009.weights' '-q' '0' '-e' '0.001'
[2024-06-07 10:18:21] [INFO ] Decomposing Gal with order
[2024-06-07 10:18:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-07 10:18:21] [INFO ] Removed a total of 2856 redundant transitions.
[2024-06-07 10:18:21] [INFO ] Flatten gal took : 136 ms
[2024-06-07 10:18:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 47 ms.
[2024-06-07 10:18:21] [INFO ] Time to serialize gal into /tmp/LTLFireability9353128262499527911.gal : 13 ms
[2024-06-07 10:18:21] [INFO ] Time to serialize properties into /tmp/LTLFireability10432813981953072174.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability9353128262499527911.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10432813981953072174.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !((X(X(F((X(("(((i21.u23.pred_arm_empty_0<1)||(u16.pred_clear_16<1))||(u13.pred_on_380<1))")&&(G("((u4.pred_holding_4<1)||(u11.pred_cl...314
Formula 0 simplified : XXG(X(!"(((i21.u23.pred_arm_empty_0<1)||(u16.pred_clear_16<1))||(u13.pred_on_380<1))" | F!"((u4.pred_holding_4<1)||(u11.pred_clear_1...300
Compilation finished in 4267 ms.
Running link step : cd /tmp/ltsmin3057773816189232197;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin3057773816189232197;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(<>((X(((LTLAPp0==true)&&[]((LTLAPp1==true))))||((LTLAPp1==true)&&[]((LTLAPp0==true)))))))' '--buchi-type=spotba'
LTSmin run took 68135 ms.
FORMULA BlocksWorld-PT-05-LTLFireability-13 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin3057773816189232197;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X((<>(!(LTLAPp2==true)) U X((LTLAPp3==true))))))' '--buchi-type=spotba'
LTSmin run took 701 ms.
FORMULA BlocksWorld-PT-05-LTLFireability-15 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 2266926 ms.

BK_STOP 1717755574234

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is BlocksWorld-PT-05, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r602-tall-171774424600196"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BlocksWorld-PT-05.tgz
mv BlocksWorld-PT-05 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;