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.r334-tall-171679080200365.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 SafeBus-COL-06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r334-tall-171679080200365
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 8.7K Apr 12 14:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Apr 12 14:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 12 14:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 12 14:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 14:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Apr 12 14:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 12 14:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 123K Apr 12 14:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 42K May 18 16:43 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716820744083

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SafeBus-COL-06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202405141337
[2024-05-27 14:39:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-27 14:39:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 14:39:05] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-27 14:39:05] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-27 14:39:05] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 555 ms
[2024-05-27 14:39:05] [INFO ] Detected 1 constant HL places corresponding to 6 PT places.
[2024-05-27 14:39:05] [INFO ] Imported 20 HL places and 14 HL transitions for a total of 150 PT places and 2029.0 transition bindings in 21 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2024-05-27 14:39:05] [INFO ] Built PT skeleton of HLPN with 20 places and 14 transitions 68 arcs in 3 ms.
[2024-05-27 14:39:05] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Reduce places removed 3 places and 0 transitions.
// Phase 1: matrix 14 rows 17 cols
[2024-05-27 14:39:05] [INFO ] Computed 7 invariants in 10 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[1, 0, 0, 0, 0, 0, 6, 0, 0, 1, 0, 0, 6, 0, 1, 1] Max Struct:[1, 1, 6, 6, 6, 1, 6, 3, 1, 1, 1, 6, 6, 1, 1, 1]
FORMULA SafeBus-COL-06-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SafeBus-COL-06-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SafeBus-COL-06-UpperBounds-12 6 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SafeBus-COL-06-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SafeBus-COL-06-UpperBounds-06 6 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SafeBus-COL-06-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-05-27 14:39:06] [INFO ] Invariant cache hit.
[2024-05-27 14:39:06] [INFO ] [Real]Absence check using 4 positive place invariants in 6 ms returned sat
[2024-05-27 14:39:06] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 5 ms returned sat
[2024-05-27 14:39:06] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-27 14:39:06] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-27 14:39:06] [INFO ] [Real]Added 3 Read/Feed constraints in 3 ms returned sat
[2024-05-27 14:39:06] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-27 14:39:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 14:39:06] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-27 14:39:06] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 14:39:06] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-27 14:39:06] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-27 14:39:06] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-27 14:39:06] [INFO ] Added : 8 causal constraints over 2 iterations in 14 ms. Result :sat
Minimization took 21 ms.
[2024-05-27 14:39:06] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2024-05-27 14:39:06] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-27 14:39:06] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-27 14:39:06] [INFO ] [Real]Added 3 Read/Feed constraints in 5 ms returned sat
[2024-05-27 14:39:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 14:39:06] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-27 14:39:06] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-27 14:39:06] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-05-27 14:39:06] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-27 14:39:06] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-27 14:39:06] [INFO ] Added : 6 causal constraints over 2 iterations in 15 ms. Result :sat
Minimization took 10 ms.
[2024-05-27 14:39:06] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-27 14:39:06] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 14:39:06] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-27 14:39:06] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-27 14:39:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 14:39:06] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-27 14:39:06] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 14:39:06] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-27 14:39:06] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2024-05-27 14:39:06] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-27 14:39:06] [INFO ] Added : 6 causal constraints over 2 iterations in 18 ms. Result :sat
Minimization took 9 ms.
[2024-05-27 14:39:06] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-27 14:39:06] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-27 14:39:06] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-27 14:39:06] [INFO ] [Real]Added 3 Read/Feed constraints in 0 ms returned sat
[2024-05-27 14:39:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 14:39:06] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-27 14:39:06] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-27 14:39:06] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-27 14:39:06] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-27 14:39:06] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-27 14:39:06] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Minimization took 6 ms.
[2024-05-27 14:39:06] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-27 14:39:06] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 14:39:06] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-27 14:39:06] [INFO ] [Real]Added 3 Read/Feed constraints in 0 ms returned sat
[2024-05-27 14:39:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 14:39:06] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-27 14:39:06] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-27 14:39:06] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-27 14:39:06] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-27 14:39:06] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-27 14:39:06] [INFO ] Added : 9 causal constraints over 2 iterations in 12 ms. Result :sat
Minimization took 5 ms.
[2024-05-27 14:39:06] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-27 14:39:06] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 14:39:06] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-27 14:39:06] [INFO ] [Real]Added 3 Read/Feed constraints in 3 ms returned sat
[2024-05-27 14:39:06] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-27 14:39:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 14:39:06] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-27 14:39:06] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-27 14:39:06] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-27 14:39:06] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2024-05-27 14:39:06] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-27 14:39:06] [INFO ] Added : 8 causal constraints over 2 iterations in 9 ms. Result :sat
Minimization took 6 ms.
[2024-05-27 14:39:06] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-27 14:39:06] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-27 14:39:06] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-27 14:39:06] [INFO ] [Real]Added 3 Read/Feed constraints in 0 ms returned sat
[2024-05-27 14:39:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 14:39:06] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-27 14:39:06] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 14:39:06] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-27 14:39:06] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-27 14:39:06] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-27 14:39:06] [INFO ] Added : 8 causal constraints over 2 iterations in 12 ms. Result :sat
Minimization took 6 ms.
[2024-05-27 14:39:06] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2024-05-27 14:39:07] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 5 ms returned sat
[2024-05-27 14:39:07] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-27 14:39:07] [INFO ] [Real]Added 3 Read/Feed constraints in 0 ms returned sat
[2024-05-27 14:39:07] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-27 14:39:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 14:39:07] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-27 14:39:07] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-27 14:39:07] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-27 14:39:07] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-27 14:39:07] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-27 14:39:07] [INFO ] Added : 12 causal constraints over 5 iterations in 12 ms. Result :sat
Minimization took 6 ms.
[2024-05-27 14:39:07] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-27 14:39:07] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 5 ms returned sat
[2024-05-27 14:39:07] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-27 14:39:07] [INFO ] [Real]Added 3 Read/Feed constraints in 0 ms returned sat
[2024-05-27 14:39:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 14:39:07] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-27 14:39:07] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-27 14:39:07] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-27 14:39:07] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-27 14:39:07] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-27 14:39:07] [INFO ] Added : 8 causal constraints over 2 iterations in 10 ms. Result :sat
Minimization took 7 ms.
[2024-05-27 14:39:07] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-27 14:39:07] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-27 14:39:07] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-27 14:39:07] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-27 14:39:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 14:39:07] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-27 14:39:07] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 14:39:07] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-27 14:39:07] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2024-05-27 14:39:07] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-27 14:39:07] [INFO ] Added : 8 causal constraints over 2 iterations in 22 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 6, 6, 6, 1, 3, 1, 1, 6, 1]
Domain [It(6), It(6)] of place AMC breaks symmetries in sort It
[2024-05-27 14:39:07] [INFO ] Unfolded HLPN to a Petri net with 150 places and 463 transitions 2962 arcs in 27 ms.
[2024-05-27 14:39:07] [INFO ] Unfolded 10 HLPN properties in 0 ms.
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 12 places and 12 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 6, 6, 6, 1, 3, 1, 1, 6, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 6, 6, 6, 1, 3, 1, 1, 6, 1]
[2024-05-27 14:39:07] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
// Phase 1: matrix 242 rows 138 cols
[2024-05-27 14:39:07] [INFO ] Computed 29 invariants in 11 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 6, 6, 6, 1, 3, 1, 1, 6, 1]
RANDOM walk for 10000 steps (2 resets) in 77 ms. (128 steps per ms)
FORMULA SafeBus-COL-06-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-COL-06-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-COL-06-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-COL-06-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-COL-06-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-COL-06-UpperBounds-04 6 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (8 resets) in 140 ms. (283 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5, 5, 1, 5] Max Struct:[6, 6, 3, 6]
[2024-05-27 14:39:07] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
[2024-05-27 14:39:07] [INFO ] Invariant cache hit.
[2024-05-27 14:39:07] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2024-05-27 14:39:07] [INFO ] [Real]Absence check using 13 positive and 16 generalized place invariants in 3 ms returned sat
[2024-05-27 14:39:07] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2024-05-27 14:39:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 14:39:07] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-05-27 14:39:07] [INFO ] [Nat]Absence check using 13 positive and 16 generalized place invariants in 4 ms returned sat
[2024-05-27 14:39:07] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2024-05-27 14:39:07] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-27 14:39:07] [INFO ] [Nat]Added 43 Read/Feed constraints in 41 ms returned sat
[2024-05-27 14:39:07] [INFO ] Computed and/alt/rep : 30/132/30 causal constraints (skipped 206 transitions) in 40 ms.
[2024-05-27 14:39:07] [INFO ] Added : 1 causal constraints over 1 iterations in 74 ms. Result :sat
Minimization took 94 ms.
[2024-05-27 14:39:08] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-05-27 14:39:08] [INFO ] [Real]Absence check using 13 positive and 16 generalized place invariants in 5 ms returned sat
[2024-05-27 14:39:08] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2024-05-27 14:39:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 14:39:08] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2024-05-27 14:39:08] [INFO ] [Nat]Absence check using 13 positive and 16 generalized place invariants in 4 ms returned sat
[2024-05-27 14:39:08] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2024-05-27 14:39:08] [INFO ] [Nat]Added 43 Read/Feed constraints in 64 ms returned sat
[2024-05-27 14:39:08] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 13 ms to minimize.
[2024-05-27 14:39:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 131 ms
[2024-05-27 14:39:08] [INFO ] Computed and/alt/rep : 30/132/30 causal constraints (skipped 206 transitions) in 29 ms.
[2024-05-27 14:39:08] [INFO ] Added : 1 causal constraints over 1 iterations in 77 ms. Result :sat
Minimization took 94 ms.
[2024-05-27 14:39:08] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2024-05-27 14:39:08] [INFO ] [Real]Absence check using 13 positive and 16 generalized place invariants in 4 ms returned unsat
[2024-05-27 14:39:08] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2024-05-27 14:39:08] [INFO ] [Real]Absence check using 13 positive and 16 generalized place invariants in 4 ms returned sat
[2024-05-27 14:39:08] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2024-05-27 14:39:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 14:39:08] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2024-05-27 14:39:08] [INFO ] [Nat]Absence check using 13 positive and 16 generalized place invariants in 4 ms returned sat
[2024-05-27 14:39:08] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2024-05-27 14:39:08] [INFO ] [Nat]Added 43 Read/Feed constraints in 44 ms returned sat
[2024-05-27 14:39:09] [INFO ] Deduced a trap composed of 45 places in 85 ms of which 2 ms to minimize.
[2024-05-27 14:39:09] [INFO ] Deduced a trap composed of 37 places in 85 ms of which 1 ms to minimize.
[2024-05-27 14:39:09] [INFO ] Deduced a trap composed of 45 places in 91 ms of which 1 ms to minimize.
[2024-05-27 14:39:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 300 ms
Current structural bounds on expressions (after SMT) : Max Seen:[5, 5, 1, 5] Max Struct:[6, 6, 1, 5]
FORMULA SafeBus-COL-06-UpperBounds-11 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA SafeBus-COL-06-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5, 5] Max Struct:[6, 6]
Support contains 12 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 451/451 transitions.
Applied a total of 0 rules in 54 ms. Remains 138 /138 variables (removed 0) and now considering 451/451 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 138/138 places, 451/451 transitions.
[2024-05-27 14:39:09] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
[2024-05-27 14:39:09] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[5, 5] Max Struct:[6, 6]
RANDOM walk for 1000000 steps (2 resets) in 2453 ms. (407 steps per ms)
BEST_FIRST walk for 2000002 steps (4 resets) in 1731 ms. (1154 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5, 5] Max Struct:[6, 6]
[2024-05-27 14:39:13] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
[2024-05-27 14:39:13] [INFO ] Invariant cache hit.
[2024-05-27 14:39:13] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2024-05-27 14:39:13] [INFO ] [Real]Absence check using 13 positive and 16 generalized place invariants in 4 ms returned sat
[2024-05-27 14:39:13] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2024-05-27 14:39:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 14:39:13] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2024-05-27 14:39:13] [INFO ] [Nat]Absence check using 13 positive and 16 generalized place invariants in 4 ms returned sat
[2024-05-27 14:39:13] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2024-05-27 14:39:13] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-27 14:39:13] [INFO ] [Nat]Added 43 Read/Feed constraints in 41 ms returned sat
[2024-05-27 14:39:13] [INFO ] Computed and/alt/rep : 30/132/30 causal constraints (skipped 206 transitions) in 28 ms.
[2024-05-27 14:39:13] [INFO ] Added : 1 causal constraints over 1 iterations in 71 ms. Result :sat
Minimization took 97 ms.
[2024-05-27 14:39:14] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2024-05-27 14:39:14] [INFO ] [Real]Absence check using 13 positive and 16 generalized place invariants in 3 ms returned sat
[2024-05-27 14:39:14] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2024-05-27 14:39:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 14:39:14] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2024-05-27 14:39:14] [INFO ] [Nat]Absence check using 13 positive and 16 generalized place invariants in 5 ms returned sat
[2024-05-27 14:39:14] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2024-05-27 14:39:14] [INFO ] [Nat]Added 43 Read/Feed constraints in 58 ms returned sat
[2024-05-27 14:39:14] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 1 ms to minimize.
[2024-05-27 14:39:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2024-05-27 14:39:14] [INFO ] Computed and/alt/rep : 30/132/30 causal constraints (skipped 206 transitions) in 26 ms.
[2024-05-27 14:39:14] [INFO ] Added : 1 causal constraints over 1 iterations in 57 ms. Result :sat
Minimization took 96 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5, 5] Max Struct:[6, 6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5, 5] Max Struct:[6, 6]
Support contains 12 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 451/451 transitions.
Applied a total of 0 rules in 26 ms. Remains 138 /138 variables (removed 0) and now considering 451/451 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 138/138 places, 451/451 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 451/451 transitions.
Applied a total of 0 rules in 22 ms. Remains 138 /138 variables (removed 0) and now considering 451/451 (removed 0) transitions.
[2024-05-27 14:39:14] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
[2024-05-27 14:39:14] [INFO ] Invariant cache hit.
[2024-05-27 14:39:14] [INFO ] Implicit Places using invariants in 163 ms returned [91, 92, 93, 94, 95, 96]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 167 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 132/138 places, 451/451 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -114
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 126 transition count 565
Applied a total of 12 rules in 54 ms. Remains 126 /132 variables (removed 6) and now considering 565/451 (removed -114) transitions.
[2024-05-27 14:39:14] [INFO ] Flow matrix only has 356 transitions (discarded 209 similar events)
// Phase 1: matrix 356 rows 126 cols
[2024-05-27 14:39:14] [INFO ] Computed 23 invariants in 15 ms
[2024-05-27 14:39:15] [INFO ] Implicit Places using invariants in 158 ms returned []
[2024-05-27 14:39:15] [INFO ] Flow matrix only has 356 transitions (discarded 209 similar events)
[2024-05-27 14:39:15] [INFO ] Invariant cache hit.
[2024-05-27 14:39:15] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-27 14:39:15] [INFO ] Implicit Places using invariants and state equation in 506 ms returned []
Implicit Place search using SMT with State Equation took 667 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 126/138 places, 565/451 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 912 ms. Remains : 126/138 places, 565/451 transitions.
[2024-05-27 14:39:15] [INFO ] Flow matrix only has 356 transitions (discarded 209 similar events)
[2024-05-27 14:39:15] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[5, 5] Max Struct:[6, 6]
RANDOM walk for 1000000 steps (2 resets) in 3105 ms. (321 steps per ms)
BEST_FIRST walk for 2000000 steps (4 resets) in 2015 ms. (992 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5, 5] Max Struct:[6, 6]
[2024-05-27 14:39:20] [INFO ] Flow matrix only has 356 transitions (discarded 209 similar events)
[2024-05-27 14:39:20] [INFO ] Invariant cache hit.
[2024-05-27 14:39:20] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-27 14:39:20] [INFO ] [Real]Absence check using 10 positive and 13 generalized place invariants in 3 ms returned sat
[2024-05-27 14:39:20] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2024-05-27 14:39:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 14:39:20] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-27 14:39:20] [INFO ] [Nat]Absence check using 10 positive and 13 generalized place invariants in 3 ms returned sat
[2024-05-27 14:39:20] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2024-05-27 14:39:20] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-27 14:39:21] [INFO ] [Nat]Added 43 Read/Feed constraints in 85 ms returned sat
[2024-05-27 14:39:21] [INFO ] Computed and/alt/rep : 42/102/42 causal constraints (skipped 308 transitions) in 53 ms.
[2024-05-27 14:39:21] [INFO ] Added : 6 causal constraints over 2 iterations in 119 ms. Result :sat
Minimization took 227 ms.
[2024-05-27 14:39:21] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-27 14:39:21] [INFO ] [Real]Absence check using 10 positive and 13 generalized place invariants in 3 ms returned sat
[2024-05-27 14:39:21] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2024-05-27 14:39:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 14:39:21] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-27 14:39:21] [INFO ] [Nat]Absence check using 10 positive and 13 generalized place invariants in 3 ms returned sat
[2024-05-27 14:39:21] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2024-05-27 14:39:21] [INFO ] [Nat]Added 43 Read/Feed constraints in 62 ms returned sat
[2024-05-27 14:39:21] [INFO ] Computed and/alt/rep : 42/102/42 causal constraints (skipped 308 transitions) in 30 ms.
[2024-05-27 14:39:21] [INFO ] Added : 1 causal constraints over 1 iterations in 71 ms. Result :sat
Minimization took 197 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5, 5] Max Struct:[6, 6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5, 5] Max Struct:[6, 6]
Support contains 12 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 565/565 transitions.
Applied a total of 0 rules in 28 ms. Remains 126 /126 variables (removed 0) and now considering 565/565 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 126/126 places, 565/565 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 565/565 transitions.
Applied a total of 0 rules in 32 ms. Remains 126 /126 variables (removed 0) and now considering 565/565 (removed 0) transitions.
[2024-05-27 14:39:22] [INFO ] Flow matrix only has 356 transitions (discarded 209 similar events)
[2024-05-27 14:39:22] [INFO ] Invariant cache hit.
[2024-05-27 14:39:22] [INFO ] Implicit Places using invariants in 142 ms returned []
[2024-05-27 14:39:22] [INFO ] Flow matrix only has 356 transitions (discarded 209 similar events)
[2024-05-27 14:39:22] [INFO ] Invariant cache hit.
[2024-05-27 14:39:22] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-27 14:39:22] [INFO ] Implicit Places using invariants and state equation in 520 ms returned []
Implicit Place search using SMT with State Equation took 664 ms to find 0 implicit places.
[2024-05-27 14:39:22] [INFO ] Redundant transitions in 30 ms returned []
Running 559 sub problems to find dead transitions.
[2024-05-27 14:39:23] [INFO ] Flow matrix only has 356 transitions (discarded 209 similar events)
[2024-05-27 14:39:23] [INFO ] Invariant cache hit.
[2024-05-27 14:39:23] [INFO ] State equation strengthened by 43 read => feed constraints.
Problem TDEAD31 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD211 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 10/10 constraints. Problems are: Problem set: 6 solved, 553 unsolved
Problem TDEAD38 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD246 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 13/23 constraints. Problems are: Problem set: 36 solved, 523 unsolved
[2024-05-27 14:39:26] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 1 ms to minimize.
[2024-05-27 14:39:26] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-05-27 14:39:26] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
[2024-05-27 14:39:26] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 0 ms to minimize.
[2024-05-27 14:39:27] [INFO ] Deduced a trap composed of 19 places in 102 ms of which 1 ms to minimize.
[2024-05-27 14:39:27] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 1 ms to minimize.
[2024-05-27 14:39:27] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 2 ms to minimize.
[2024-05-27 14:39:27] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 1 ms to minimize.
[2024-05-27 14:39:28] [INFO ] Deduced a trap composed of 21 places in 103 ms of which 1 ms to minimize.
[2024-05-27 14:39:28] [INFO ] Deduced a trap composed of 25 places in 105 ms of which 1 ms to minimize.
[2024-05-27 14:39:28] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 2 ms to minimize.
[2024-05-27 14:39:28] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 1 ms to minimize.
[2024-05-27 14:39:28] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 13/36 constraints. Problems are: Problem set: 36 solved, 523 unsolved
[2024-05-27 14:39:30] [INFO ] Deduced a trap composed of 33 places in 101 ms of which 1 ms to minimize.
[2024-05-27 14:39:30] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 1 ms to minimize.
[2024-05-27 14:39:30] [INFO ] Deduced a trap composed of 33 places in 104 ms of which 1 ms to minimize.
[2024-05-27 14:39:30] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 1 ms to minimize.
[2024-05-27 14:39:30] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
[2024-05-27 14:39:30] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 6/42 constraints. Problems are: Problem set: 36 solved, 523 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/42 constraints. Problems are: Problem set: 36 solved, 523 unsolved
At refinement iteration 5 (OVERLAPS) 356/482 variables, 126/168 constraints. Problems are: Problem set: 36 solved, 523 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/482 variables, 43/211 constraints. Problems are: Problem set: 36 solved, 523 unsolved
[2024-05-27 14:39:39] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/482 variables, 1/212 constraints. Problems are: Problem set: 36 solved, 523 unsolved
[2024-05-27 14:39:43] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/482 variables, 1/213 constraints. Problems are: Problem set: 36 solved, 523 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/482 variables, 0/213 constraints. Problems are: Problem set: 36 solved, 523 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 482/482 variables, and 213 constraints, problems are : Problem set: 36 solved, 523 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 559/559 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 36 solved, 523 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 10/10 constraints. Problems are: Problem set: 36 solved, 523 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 13/23 constraints. Problems are: Problem set: 36 solved, 523 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 21/44 constraints. Problems are: Problem set: 36 solved, 523 unsolved
[2024-05-27 14:39:55] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
[2024-05-27 14:39:55] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 0 ms to minimize.
[2024-05-27 14:39:55] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2024-05-27 14:39:55] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-05-27 14:39:56] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 0 ms to minimize.
[2024-05-27 14:39:56] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2024-05-27 14:39:57] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 1 ms to minimize.
[2024-05-27 14:39:57] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 1 ms to minimize.
[2024-05-27 14:39:57] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 2 ms to minimize.
[2024-05-27 14:39:57] [INFO ] Deduced a trap composed of 51 places in 92 ms of which 1 ms to minimize.
[2024-05-27 14:39:58] [INFO ] Deduced a trap composed of 37 places in 91 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 11/55 constraints. Problems are: Problem set: 36 solved, 523 unsolved
[2024-05-27 14:40:01] [INFO ] Deduced a trap composed of 60 places in 89 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 1/56 constraints. Problems are: Problem set: 36 solved, 523 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/56 constraints. Problems are: Problem set: 36 solved, 523 unsolved
At refinement iteration 6 (OVERLAPS) 356/482 variables, 126/182 constraints. Problems are: Problem set: 36 solved, 523 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/482 variables, 43/225 constraints. Problems are: Problem set: 36 solved, 523 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/482 variables, 523/748 constraints. Problems are: Problem set: 36 solved, 523 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 482/482 variables, and 748 constraints, problems are : Problem set: 36 solved, 523 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 523/559 constraints, Known Traps: 33/33 constraints]
After SMT, in 61707ms problems are : Problem set: 36 solved, 523 unsolved
Search for dead transitions found 36 dead transitions in 61728ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 126/126 places, 529/565 transitions.
Applied a total of 0 rules in 44 ms. Remains 126 /126 variables (removed 0) and now considering 529/529 (removed 0) transitions.
[2024-05-27 14:40:24] [INFO ] Redundant transitions in 3 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 62530 ms. Remains : 126/126 places, 529/565 transitions.
[2024-05-27 14:40:24] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2024-05-27 14:40:24] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[5, 5] Max Struct:[6, 6]
RANDOM walk for 1000000 steps (2 resets) in 3026 ms. (330 steps per ms)
BEST_FIRST walk for 2000002 steps (4 resets) in 1940 ms. (1030 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5, 5] Max Struct:[6, 6]
[2024-05-27 14:40:29] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2024-05-27 14:40:29] [INFO ] Invariant cache hit.
[2024-05-27 14:40:29] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-27 14:40:29] [INFO ] [Real]Absence check using 10 positive and 13 generalized place invariants in 2 ms returned sat
[2024-05-27 14:40:29] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2024-05-27 14:40:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 14:40:29] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-27 14:40:29] [INFO ] [Nat]Absence check using 10 positive and 13 generalized place invariants in 2 ms returned sat
[2024-05-27 14:40:29] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2024-05-27 14:40:29] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-27 14:40:30] [INFO ] [Nat]Added 43 Read/Feed constraints in 99 ms returned sat
[2024-05-27 14:40:30] [INFO ] Computed and/alt/rep : 42/102/42 causal constraints (skipped 308 transitions) in 31 ms.
[2024-05-27 14:40:30] [INFO ] Added : 6 causal constraints over 2 iterations in 85 ms. Result :sat
Minimization took 218 ms.
[2024-05-27 14:40:30] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-27 14:40:30] [INFO ] [Real]Absence check using 10 positive and 13 generalized place invariants in 8 ms returned sat
[2024-05-27 14:40:30] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2024-05-27 14:40:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 14:40:30] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-27 14:40:30] [INFO ] [Nat]Absence check using 10 positive and 13 generalized place invariants in 3 ms returned sat
[2024-05-27 14:40:30] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2024-05-27 14:40:30] [INFO ] [Nat]Added 43 Read/Feed constraints in 60 ms returned sat
[2024-05-27 14:40:30] [INFO ] Computed and/alt/rep : 42/102/42 causal constraints (skipped 308 transitions) in 41 ms.
[2024-05-27 14:40:30] [INFO ] Added : 2 causal constraints over 2 iterations in 94 ms. Result :sat
Minimization took 190 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5, 5] Max Struct:[6, 6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5, 5] Max Struct:[6, 6]
Support contains 12 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 529/529 transitions.
Applied a total of 0 rules in 17 ms. Remains 126 /126 variables (removed 0) and now considering 529/529 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 126/126 places, 529/529 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 529/529 transitions.
Applied a total of 0 rules in 17 ms. Remains 126 /126 variables (removed 0) and now considering 529/529 (removed 0) transitions.
[2024-05-27 14:40:31] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2024-05-27 14:40:31] [INFO ] Invariant cache hit.
[2024-05-27 14:40:31] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-05-27 14:40:31] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2024-05-27 14:40:31] [INFO ] Invariant cache hit.
[2024-05-27 14:40:31] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-27 14:40:31] [INFO ] Implicit Places using invariants and state equation in 455 ms returned []
Implicit Place search using SMT with State Equation took 596 ms to find 0 implicit places.
[2024-05-27 14:40:31] [INFO ] Redundant transitions in 8 ms returned []
Running 523 sub problems to find dead transitions.
[2024-05-27 14:40:31] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2024-05-27 14:40:31] [INFO ] Invariant cache hit.
[2024-05-27 14:40:31] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-27 14:40:34] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 1 ms to minimize.
[2024-05-27 14:40:34] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-05-27 14:40:34] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 1 ms to minimize.
[2024-05-27 14:40:34] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 0 ms to minimize.
[2024-05-27 14:40:34] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 1 ms to minimize.
[2024-05-27 14:40:35] [INFO ] Deduced a trap composed of 25 places in 136 ms of which 1 ms to minimize.
[2024-05-27 14:40:35] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-05-27 14:40:35] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 1 ms to minimize.
[2024-05-27 14:40:36] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 2 ms to minimize.
[2024-05-27 14:40:36] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 1 ms to minimize.
[2024-05-27 14:40:36] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 1 ms to minimize.
[2024-05-27 14:40:36] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 1 ms to minimize.
[2024-05-27 14:40:36] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 2 ms to minimize.
[2024-05-27 14:40:36] [INFO ] Deduced a trap composed of 26 places in 102 ms of which 1 ms to minimize.
[2024-05-27 14:40:36] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 1 ms to minimize.
[2024-05-27 14:40:36] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 1 ms to minimize.
[2024-05-27 14:40:37] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 0 ms to minimize.
[2024-05-27 14:40:37] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 4 ms to minimize.
[2024-05-27 14:40:37] [INFO ] Deduced a trap composed of 46 places in 85 ms of which 1 ms to minimize.
[2024-05-27 14:40:37] [INFO ] Deduced a trap composed of 60 places in 82 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-27 14:40:38] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 1 ms to minimize.
[2024-05-27 14:40:38] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 1 ms to minimize.
[2024-05-27 14:40:38] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 1 ms to minimize.
[2024-05-27 14:40:39] [INFO ] Deduced a trap composed of 60 places in 88 ms of which 2 ms to minimize.
[2024-05-27 14:40:39] [INFO ] Deduced a trap composed of 37 places in 86 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 5/48 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-27 14:40:42] [INFO ] Deduced a trap composed of 21 places in 100 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 6 (OVERLAPS) 356/482 variables, 126/175 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/482 variables, 43/218 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-27 14:40:51] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/482 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 523 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (INCLUDED_ONLY) 0/482 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 523 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 482/482 variables, and 219 constraints, problems are : Problem set: 0 solved, 523 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 523/523 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 523 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 27/50 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-27 14:41:05] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-27 14:41:08] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 6 (OVERLAPS) 356/482 variables, 126/178 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/482 variables, 43/221 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/482 variables, 523/744 constraints. Problems are: Problem set: 0 solved, 523 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 482/482 variables, and 744 constraints, problems are : Problem set: 0 solved, 523 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 523/523 constraints, Known Traps: 29/29 constraints]
After SMT, in 61365ms problems are : Problem set: 0 solved, 523 unsolved
Search for dead transitions found 0 dead transitions in 61372ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62005 ms. Remains : 126/126 places, 529/529 transitions.
[2024-05-27 14:41:33] [INFO ] Flatten gal took : 190 ms
[2024-05-27 14:41:33] [INFO ] Flatten gal took : 103 ms
RANDOM walk for 40000 steps (8 resets) in 1400 ms. (28 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 253 ms. (157 steps per ms) remains 4/4 properties
[2024-05-27 14:41:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6893653435204919246.gal : 32 ms
[2024-05-27 14:41:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4188052023824155152.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6893653435204919246.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4188052023824155152.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
BEST_FIRST walk for 40000 steps (8 resets) in 208 ms. (191 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 4/4 properties
Loading property file /tmp/ReachabilityCardinality4188052023824155152.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :2 after 5
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :5 after 14
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :14 after 16
BEST_FIRST walk for 40004 steps (8 resets) in 193 ms. (206 steps per ms) remains 4/4 properties
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :16 after 41
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :41 after 109
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :109 after 592
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :592 after 721
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :721 after 1147
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :1147 after 2990
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :2990 after 5439
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :5439 after 79134
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :79134 after 88208
Interrupted probabilistic random walk after 283877 steps, run timeout after 3001 ms. (steps per millisecond=94 ) properties seen :0 out of 4
Probabilistic random walk after 283877 steps, saw 128917 distinct states, run finished after 3006 ms. (steps per millisecond=94 ) properties seen :0
[2024-05-27 14:41:36] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2024-05-27 14:41:36] [INFO ] Invariant cache hit.
[2024-05-27 14:41:36] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 85/97 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1/98 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 25/123 variables, 13/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 1/124 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 355/479 variables, 124/146 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/479 variables, 42/188 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/479 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 3/482 variables, 2/190 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/482 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/482 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/482 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/482 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 482/482 variables, and 192 constraints, problems are : Problem set: 0 solved, 4 unsolved in 367 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 85/97 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-27 14:41:37] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 1 ms to minimize.
[2024-05-27 14:41:37] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 1/98 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 25/123 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 1/124 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 355/479 variables, 124/148 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/479 variables, 42/190 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem MAX1 is UNSAT
Problem MIN1 is UNSAT
At refinement iteration 12 (INCLUDED_ONLY) 0/479 variables, 4/194 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-05-27 14:41:37] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 1 ms to minimize.
[2024-05-27 14:41:37] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 1 ms to minimize.
[2024-05-27 14:41:38] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 2 ms to minimize.
[2024-05-27 14:41:38] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 1 ms to minimize.
[2024-05-27 14:41:38] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 1 ms to minimize.
[2024-05-27 14:41:38] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 1 ms to minimize.
SDD proceeding with computation,4 properties remain. new max is 32768
SDD size :88208 after 110709
[2024-05-27 14:41:38] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/479 variables, 7/201 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/479 variables, 0/201 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 3/482 variables, 2/203 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/482 variables, 1/204 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/482 variables, 1/205 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/482 variables, 0/205 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/482 variables, 0/205 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 482/482 variables, and 205 constraints, problems are : Problem set: 2 solved, 2 unsolved in 1323 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 9/9 constraints]
After SMT, in 1704ms problems are : Problem set: 2 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 96 ms.
Support contains 6 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 529/529 transitions.
Applied a total of 0 rules in 18 ms. Remains 126 /126 variables (removed 0) and now considering 529/529 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 126/126 places, 529/529 transitions.
RANDOM walk for 40000 steps (8 resets) in 341 ms. (116 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 148 ms. (268 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 197 ms. (202 steps per ms) remains 2/2 properties
SDD proceeding with computation,4 properties remain. new max is 65536
SDD size :110709 after 180549
Interrupted probabilistic random walk after 458270 steps, run timeout after 3001 ms. (steps per millisecond=152 ) properties seen :0 out of 2
Probabilistic random walk after 458270 steps, saw 202796 distinct states, run finished after 3001 ms. (steps per millisecond=152 ) properties seen :0
[2024-05-27 14:41:42] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2024-05-27 14:41:42] [INFO ] Invariant cache hit.
[2024-05-27 14:41:42] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 91/97 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-27 14:41:42] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
[2024-05-27 14:41:42] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 0 ms to minimize.
[2024-05-27 14:41:42] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 0 ms to minimize.
[2024-05-27 14:41:42] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1/98 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 25/123 variables, 13/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/124 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 355/479 variables, 124/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/479 variables, 42/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/479 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 3/482 variables, 2/194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/482 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/482 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/482 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/482 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 482/482 variables, and 196 constraints, problems are : Problem set: 0 solved, 2 unsolved in 505 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 91/97 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-27 14:41:42] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/98 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/123 variables, 13/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/124 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/124 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 355/479 variables, 124/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/479 variables, 42/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/479 variables, 2/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/479 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 3/482 variables, 2/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/482 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/482 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/482 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/482 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 482/482 variables, and 199 constraints, problems are : Problem set: 0 solved, 2 unsolved in 335 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
After SMT, in 848ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 70 ms.
Support contains 6 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 529/529 transitions.
Applied a total of 0 rules in 18 ms. Remains 126 /126 variables (removed 0) and now considering 529/529 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 126/126 places, 529/529 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 529/529 transitions.
Applied a total of 0 rules in 18 ms. Remains 126 /126 variables (removed 0) and now considering 529/529 (removed 0) transitions.
[2024-05-27 14:41:42] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2024-05-27 14:41:42] [INFO ] Invariant cache hit.
[2024-05-27 14:41:43] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-05-27 14:41:43] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2024-05-27 14:41:43] [INFO ] Invariant cache hit.
[2024-05-27 14:41:43] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-27 14:41:43] [INFO ] Implicit Places using invariants and state equation in 432 ms returned []
Implicit Place search using SMT with State Equation took 567 ms to find 0 implicit places.
[2024-05-27 14:41:43] [INFO ] Redundant transitions in 6 ms returned []
Running 523 sub problems to find dead transitions.
[2024-05-27 14:41:43] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2024-05-27 14:41:43] [INFO ] Invariant cache hit.
[2024-05-27 14:41:43] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-27 14:41:46] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 0 ms to minimize.
[2024-05-27 14:41:46] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
[2024-05-27 14:41:46] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 1 ms to minimize.
[2024-05-27 14:41:46] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2024-05-27 14:41:46] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 1 ms to minimize.
[2024-05-27 14:41:46] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 0 ms to minimize.
[2024-05-27 14:41:46] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 0 ms to minimize.
[2024-05-27 14:41:47] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 1 ms to minimize.
[2024-05-27 14:41:47] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 0 ms to minimize.
[2024-05-27 14:41:47] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 1 ms to minimize.
[2024-05-27 14:41:47] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 1 ms to minimize.
[2024-05-27 14:41:47] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 1 ms to minimize.
[2024-05-27 14:41:48] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 1 ms to minimize.
[2024-05-27 14:41:48] [INFO ] Deduced a trap composed of 26 places in 101 ms of which 1 ms to minimize.
[2024-05-27 14:41:48] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
[2024-05-27 14:41:48] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 1 ms to minimize.
[2024-05-27 14:41:48] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-05-27 14:41:48] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 1 ms to minimize.
[2024-05-27 14:41:48] [INFO ] Deduced a trap composed of 46 places in 89 ms of which 1 ms to minimize.
[2024-05-27 14:41:48] [INFO ] Deduced a trap composed of 60 places in 86 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 523 unsolved
SDD proceeding with computation,4 properties remain. new max is 131072
SDD size :180549 after 498734
[2024-05-27 14:41:49] [INFO ] Deduced a trap composed of 18 places in 215 ms of which 1 ms to minimize.
[2024-05-27 14:41:50] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 1 ms to minimize.
[2024-05-27 14:41:50] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 1 ms to minimize.
[2024-05-27 14:41:50] [INFO ] Deduced a trap composed of 60 places in 92 ms of which 1 ms to minimize.
[2024-05-27 14:41:50] [INFO ] Deduced a trap composed of 37 places in 88 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 5/48 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-27 14:41:53] [INFO ] Deduced a trap composed of 21 places in 113 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 6 (OVERLAPS) 356/482 variables, 126/175 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/482 variables, 43/218 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-27 14:42:02] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/482 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 523 unsolved
SDD proceeding with computation,4 properties remain. new max is 262144
SDD size :498734 after 1.29089e+06
At refinement iteration 9 (INCLUDED_ONLY) 0/482 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 523 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 482/482 variables, and 219 constraints, problems are : Problem set: 0 solved, 523 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 523/523 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 523 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 27/50 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-27 14:42:17] [INFO ] Deduced a trap composed of 18 places in 107 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-27 14:42:21] [INFO ] Deduced a trap composed of 18 places in 107 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 523 unsolved
Detected timeout of ITS tools.
[2024-05-27 14:42:23] [INFO ] Flatten gal took : 44 ms
[2024-05-27 14:42:23] [INFO ] Applying decomposition
[2024-05-27 14:42:23] [INFO ] Flatten gal took : 39 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/graph13137806589884019407.txt' '-o' '/tmp/graph13137806589884019407.bin' '-w' '/tmp/graph13137806589884019407.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13137806589884019407.bin' '-l' '-1' '-v' '-w' '/tmp/graph13137806589884019407.weights' '-q' '0' '-e' '0.001'
[2024-05-27 14:42:24] [INFO ] Decomposing Gal with order
[2024-05-27 14:42:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 14:42:24] [INFO ] Removed a total of 77 redundant transitions.
[2024-05-27 14:42:24] [INFO ] Flatten gal took : 87 ms
[2024-05-27 14:42:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 85 labels/synchronizations in 5 ms.
[2024-05-27 14:42:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality109508364146770851.gal : 7 ms
[2024-05-27 14:42:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7743851683024757075.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality109508364146770851.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7743851683024757075.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
Loading property file /tmp/ReachabilityCardinality7743851683024757075.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 11
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :11 after 12
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :12 after 14
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :14 after 16
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :16 after 19
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :19 after 25
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :25 after 53
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :53 after 171
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :171 after 1299
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1299 after 2061
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2061 after 16347
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 523 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :16347 after 22639
At refinement iteration 6 (OVERLAPS) 356/482 variables, 126/178 constraints. Problems are: Problem set: 0 solved, 523 unsolved
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :100573 after 115604
At refinement iteration 7 (INCLUDED_ONLY) 0/482 variables, 43/221 constraints. Problems are: Problem set: 0 solved, 523 unsolved
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :405407 after 441069
At refinement iteration 8 (INCLUDED_ONLY) 0/482 variables, 523/744 constraints. Problems are: Problem set: 0 solved, 523 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 482/482 variables, and 744 constraints, problems are : Problem set: 0 solved, 523 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 523/523 constraints, Known Traps: 29/29 constraints]
After SMT, in 61487ms problems are : Problem set: 0 solved, 523 unsolved
Search for dead transitions found 0 dead transitions in 61493ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62091 ms. Remains : 126/126 places, 529/529 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 173 transitions
Reduce isomorphic transitions removed 173 transitions.
Iterating post reduction 0 with 173 rules applied. Total rules applied 173 place count 126 transition count 356
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 203 place count 96 transition count 296
Iterating global reduction 1 with 30 rules applied. Total rules applied 233 place count 96 transition count 296
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 236 place count 94 transition count 295
Graph (trivial) has 19 edges and 94 vertex of which 8 / 94 are part of one of the 1 SCC in 1 ms
Free SCC test removed 7 places
Iterating global reduction 1 with 1 rules applied. Total rules applied 237 place count 87 transition count 295
Drop transitions (Empty/Sink Transition effects.) removed 19 transitions
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 163 transitions.
Iterating post reduction 1 with 163 rules applied. Total rules applied 400 place count 87 transition count 132
Applied a total of 400 rules in 52 ms. Remains 87 /126 variables (removed 39) and now considering 132/529 (removed 397) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 132 rows 87 cols
[2024-05-27 14:42:45] [INFO ] Computed 22 invariants in 1 ms
[2024-05-27 14:42:45] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-27 14:42:45] [INFO ] [Real]Absence check using 9 positive and 13 generalized place invariants in 3 ms returned sat
[2024-05-27 14:42:45] [INFO ] After 154ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-27 14:42:45] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-27 14:42:45] [INFO ] [Nat]Absence check using 9 positive and 13 generalized place invariants in 3 ms returned sat
[2024-05-27 14:42:45] [INFO ] After 67ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-27 14:42:45] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-27 14:42:45] [INFO ] After 17ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-27 14:42:45] [INFO ] After 39ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-27 14:42:45] [INFO ] After 153ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2024-05-27 14:42:45] [INFO ] Flatten gal took : 14 ms
[2024-05-27 14:42:45] [INFO ] Flatten gal took : 24 ms
[2024-05-27 14:42:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18382639478830292665.gal : 2 ms
[2024-05-27 14:42:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15942037475039810687.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality18382639478830292665.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15942037475039810687.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality15942037475039810687.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 5
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :5 after 9
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :9 after 18
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :18 after 42
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :42 after 102
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :102 after 203
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :203 after 449
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :449 after 966
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :966 after 3140
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :3140 after 16033
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :16033 after 24404
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :24404 after 42969
Invariant property MIN0 does not hold.
Reachability property MAX0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 16385 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,163980,3.42179,105096,2,53323,19,362671,6,0,483,219617,0
Total reachable state count : 163980

Verifying 2 reachability properties.
Reachability property MAX0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,1,3.4414,105096,2,88,19,362671,7,0,513,219617,0
Invariant property MIN0 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,1,3.45861,105096,2,88,19,362671,8,0,542,219617,0
Over-approximation ignoring read arcs solved 0 properties in 3892 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA SafeBus-COL-06-UpperBounds-03 5 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[5] Max Struct:[6]
Starting property specific reduction for SafeBus-COL-06-UpperBounds-02
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[6]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[6]
[2024-05-27 14:42:48] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
// Phase 1: matrix 356 rows 126 cols
[2024-05-27 14:42:48] [INFO ] Computed 23 invariants in 11 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[6]
RANDOM walk for 10000 steps (2 resets) in 34 ms. (285 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 13 ms. (714 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5] Max Struct:[6]
[2024-05-27 14:42:49] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2024-05-27 14:42:49] [INFO ] Invariant cache hit.
[2024-05-27 14:42:49] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-27 14:42:49] [INFO ] [Real]Absence check using 10 positive and 13 generalized place invariants in 4 ms returned sat
[2024-05-27 14:42:49] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2024-05-27 14:42:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 14:42:49] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-27 14:42:49] [INFO ] [Nat]Absence check using 10 positive and 13 generalized place invariants in 2 ms returned sat
[2024-05-27 14:42:49] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2024-05-27 14:42:49] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-27 14:42:49] [INFO ] [Nat]Added 43 Read/Feed constraints in 87 ms returned sat
[2024-05-27 14:42:49] [INFO ] Computed and/alt/rep : 42/102/42 causal constraints (skipped 308 transitions) in 24 ms.
[2024-05-27 14:42:49] [INFO ] Added : 6 causal constraints over 2 iterations in 81 ms. Result :sat
Minimization took 218 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5] Max Struct:[6]
Support contains 6 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 529/529 transitions.
Applied a total of 0 rules in 17 ms. Remains 126 /126 variables (removed 0) and now considering 529/529 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 126/126 places, 529/529 transitions.
[2024-05-27 14:42:49] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2024-05-27 14:42:49] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[5] Max Struct:[6]
RANDOM walk for 1000000 steps (2 resets) in 2938 ms. (340 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 1114 ms. (896 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5] Max Struct:[6]
[2024-05-27 14:42:53] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2024-05-27 14:42:53] [INFO ] Invariant cache hit.
[2024-05-27 14:42:53] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-27 14:42:53] [INFO ] [Real]Absence check using 10 positive and 13 generalized place invariants in 3 ms returned sat
[2024-05-27 14:42:53] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2024-05-27 14:42:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 14:42:54] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-27 14:42:54] [INFO ] [Nat]Absence check using 10 positive and 13 generalized place invariants in 4 ms returned sat
[2024-05-27 14:42:54] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2024-05-27 14:42:54] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-27 14:42:54] [INFO ] [Nat]Added 43 Read/Feed constraints in 87 ms returned sat
[2024-05-27 14:42:54] [INFO ] Computed and/alt/rep : 42/102/42 causal constraints (skipped 308 transitions) in 26 ms.
[2024-05-27 14:42:54] [INFO ] Added : 6 causal constraints over 2 iterations in 86 ms. Result :sat
Minimization took 222 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5] Max Struct:[6]
Support contains 6 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 529/529 transitions.
Applied a total of 0 rules in 17 ms. Remains 126 /126 variables (removed 0) and now considering 529/529 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 126/126 places, 529/529 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 529/529 transitions.
Applied a total of 0 rules in 16 ms. Remains 126 /126 variables (removed 0) and now considering 529/529 (removed 0) transitions.
[2024-05-27 14:42:54] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2024-05-27 14:42:54] [INFO ] Invariant cache hit.
[2024-05-27 14:42:54] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-05-27 14:42:54] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2024-05-27 14:42:54] [INFO ] Invariant cache hit.
[2024-05-27 14:42:54] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-27 14:42:55] [INFO ] Implicit Places using invariants and state equation in 447 ms returned []
Implicit Place search using SMT with State Equation took 585 ms to find 0 implicit places.
[2024-05-27 14:42:55] [INFO ] Redundant transitions in 2 ms returned []
Running 523 sub problems to find dead transitions.
[2024-05-27 14:42:55] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2024-05-27 14:42:55] [INFO ] Invariant cache hit.
[2024-05-27 14:42:55] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-27 14:42:58] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2024-05-27 14:42:58] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
[2024-05-27 14:42:58] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 2 ms to minimize.
[2024-05-27 14:42:58] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 1 ms to minimize.
[2024-05-27 14:42:58] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-05-27 14:42:58] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-05-27 14:42:58] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-05-27 14:42:59] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 1 ms to minimize.
[2024-05-27 14:42:59] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 0 ms to minimize.
[2024-05-27 14:42:59] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 0 ms to minimize.
[2024-05-27 14:42:59] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 1 ms to minimize.
[2024-05-27 14:42:59] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 1 ms to minimize.
[2024-05-27 14:42:59] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 1 ms to minimize.
[2024-05-27 14:43:00] [INFO ] Deduced a trap composed of 26 places in 109 ms of which 1 ms to minimize.
[2024-05-27 14:43:00] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 1 ms to minimize.
[2024-05-27 14:43:00] [INFO ] Deduced a trap composed of 18 places in 107 ms of which 1 ms to minimize.
[2024-05-27 14:43:00] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2024-05-27 14:43:00] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
[2024-05-27 14:43:00] [INFO ] Deduced a trap composed of 46 places in 91 ms of which 1 ms to minimize.
[2024-05-27 14:43:00] [INFO ] Deduced a trap composed of 60 places in 89 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-27 14:43:01] [INFO ] Deduced a trap composed of 18 places in 106 ms of which 0 ms to minimize.
[2024-05-27 14:43:01] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 1 ms to minimize.
[2024-05-27 14:43:01] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 1 ms to minimize.
[2024-05-27 14:43:02] [INFO ] Deduced a trap composed of 60 places in 89 ms of which 3 ms to minimize.
[2024-05-27 14:43:02] [INFO ] Deduced a trap composed of 37 places in 82 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 5/48 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-27 14:43:05] [INFO ] Deduced a trap composed of 21 places in 105 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 6 (OVERLAPS) 356/482 variables, 126/175 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/482 variables, 43/218 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-27 14:43:15] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/482 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/482 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 523 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 482/482 variables, and 219 constraints, problems are : Problem set: 0 solved, 523 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 523/523 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 523 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 27/50 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-27 14:43:29] [INFO ] Deduced a trap composed of 18 places in 107 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-27 14:43:32] [INFO ] Deduced a trap composed of 18 places in 106 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 6 (OVERLAPS) 356/482 variables, 126/178 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/482 variables, 43/221 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/482 variables, 523/744 constraints. Problems are: Problem set: 0 solved, 523 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 482/482 variables, and 744 constraints, problems are : Problem set: 0 solved, 523 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 523/523 constraints, Known Traps: 29/29 constraints]
After SMT, in 61529ms problems are : Problem set: 0 solved, 523 unsolved
Search for dead transitions found 0 dead transitions in 61537ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62149 ms. Remains : 126/126 places, 529/529 transitions.
[2024-05-27 14:43:56] [INFO ] Flatten gal took : 36 ms
[2024-05-27 14:43:56] [INFO ] Flatten gal took : 34 ms
[2024-05-27 14:43:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12903489791513771724.gal : 8 ms
[2024-05-27 14:43:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17227086066878661853.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12903489791513771724.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17227086066878661853.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
RANDOM walk for 40000 steps (8 resets) in 468 ms. (85 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality17227086066878661853.prop.
BEST_FIRST walk for 40001 steps (8 resets) in 104 ms. (380 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 5
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :5 after 14
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :14 after 16
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :16 after 41
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :41 after 109
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :109 after 592
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :592 after 721
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :721 after 1147
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1147 after 2990
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2990 after 5439
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :5439 after 79134
Interrupted probabilistic random walk after 514948 steps, run timeout after 3001 ms. (steps per millisecond=171 ) properties seen :0 out of 2
Probabilistic random walk after 514948 steps, saw 226450 distinct states, run finished after 3005 ms. (steps per millisecond=171 ) properties seen :0
[2024-05-27 14:44:00] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2024-05-27 14:44:00] [INFO ] Invariant cache hit.
[2024-05-27 14:44:00] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 91/97 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-27 14:44:00] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2024-05-27 14:44:00] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-05-27 14:44:00] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2024-05-27 14:44:00] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1/98 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 25/123 variables, 13/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/124 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 355/479 variables, 124/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/479 variables, 42/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/479 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 3/482 variables, 2/194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/482 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 16384
At refinement iteration 15 (INCLUDED_ONLY) 0/482 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD size :79134 after 88208
At refinement iteration 16 (INCLUDED_ONLY) 0/482 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/482 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 482/482 variables, and 196 constraints, problems are : Problem set: 0 solved, 2 unsolved in 503 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 91/97 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-27 14:44:00] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/98 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/123 variables, 13/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/124 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/124 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 355/479 variables, 124/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/479 variables, 42/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/479 variables, 2/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/479 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 3/482 variables, 2/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/482 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/482 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/482 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/482 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 482/482 variables, and 199 constraints, problems are : Problem set: 0 solved, 2 unsolved in 362 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
After SMT, in 877ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 50 ms.
Support contains 6 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 529/529 transitions.
Applied a total of 0 rules in 17 ms. Remains 126 /126 variables (removed 0) and now considering 529/529 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 126/126 places, 529/529 transitions.
RANDOM walk for 40000 steps (8 resets) in 409 ms. (97 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 139 ms. (285 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (8 resets) in 86 ms. (459 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :88208 after 110709
Interrupted probabilistic random walk after 454080 steps, run timeout after 3001 ms. (steps per millisecond=151 ) properties seen :0 out of 2
Probabilistic random walk after 454080 steps, saw 200994 distinct states, run finished after 3005 ms. (steps per millisecond=151 ) properties seen :0
[2024-05-27 14:44:04] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2024-05-27 14:44:04] [INFO ] Invariant cache hit.
[2024-05-27 14:44:04] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 91/97 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-27 14:44:04] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
[2024-05-27 14:44:04] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 0 ms to minimize.
[2024-05-27 14:44:04] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-05-27 14:44:04] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1/98 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 25/123 variables, 13/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/124 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 355/479 variables, 124/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/479 variables, 42/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/479 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 3/482 variables, 2/194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/482 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/482 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/482 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/482 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 482/482 variables, and 196 constraints, problems are : Problem set: 0 solved, 2 unsolved in 482 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 91/97 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-27 14:44:04] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/98 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/123 variables, 13/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/124 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/124 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 355/479 variables, 124/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/479 variables, 42/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/479 variables, 2/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/479 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 3/482 variables, 2/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/482 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/482 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/482 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/482 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 482/482 variables, and 199 constraints, problems are : Problem set: 0 solved, 2 unsolved in 361 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
After SMT, in 864ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 65 ms.
Support contains 6 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 529/529 transitions.
Applied a total of 0 rules in 16 ms. Remains 126 /126 variables (removed 0) and now considering 529/529 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 126/126 places, 529/529 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 529/529 transitions.
Applied a total of 0 rules in 16 ms. Remains 126 /126 variables (removed 0) and now considering 529/529 (removed 0) transitions.
[2024-05-27 14:44:05] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2024-05-27 14:44:05] [INFO ] Invariant cache hit.
[2024-05-27 14:44:05] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-05-27 14:44:05] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2024-05-27 14:44:05] [INFO ] Invariant cache hit.
[2024-05-27 14:44:05] [INFO ] State equation strengthened by 43 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :110709 after 180549
[2024-05-27 14:44:05] [INFO ] Implicit Places using invariants and state equation in 444 ms returned []
Implicit Place search using SMT with State Equation took 577 ms to find 0 implicit places.
[2024-05-27 14:44:05] [INFO ] Redundant transitions in 3 ms returned []
Running 523 sub problems to find dead transitions.
[2024-05-27 14:44:05] [INFO ] Flow matrix only has 356 transitions (discarded 173 similar events)
[2024-05-27 14:44:05] [INFO ] Invariant cache hit.
[2024-05-27 14:44:05] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-27 14:44:08] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2024-05-27 14:44:08] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2024-05-27 14:44:08] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 1 ms to minimize.
[2024-05-27 14:44:08] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-05-27 14:44:08] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
[2024-05-27 14:44:08] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-05-27 14:44:08] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 0 ms to minimize.
[2024-05-27 14:44:09] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 1 ms to minimize.
[2024-05-27 14:44:09] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2024-05-27 14:44:09] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2024-05-27 14:44:10] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 1 ms to minimize.
[2024-05-27 14:44:10] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 1 ms to minimize.
[2024-05-27 14:44:10] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 1 ms to minimize.
[2024-05-27 14:44:10] [INFO ] Deduced a trap composed of 26 places in 97 ms of which 1 ms to minimize.
[2024-05-27 14:44:10] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 1 ms to minimize.
[2024-05-27 14:44:10] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 1 ms to minimize.
[2024-05-27 14:44:10] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 0 ms to minimize.
[2024-05-27 14:44:10] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 1 ms to minimize.
[2024-05-27 14:44:11] [INFO ] Deduced a trap composed of 46 places in 79 ms of which 1 ms to minimize.
[2024-05-27 14:44:11] [INFO ] Deduced a trap composed of 60 places in 82 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-27 14:44:12] [INFO ] Deduced a trap composed of 18 places in 101 ms of which 1 ms to minimize.
[2024-05-27 14:44:12] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 1 ms to minimize.
[2024-05-27 14:44:12] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 1 ms to minimize.
[2024-05-27 14:44:12] [INFO ] Deduced a trap composed of 60 places in 86 ms of which 1 ms to minimize.
[2024-05-27 14:44:12] [INFO ] Deduced a trap composed of 37 places in 84 ms of which 1 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :180549 after 498734
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 5/48 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-27 14:44:15] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 6 (OVERLAPS) 356/482 variables, 126/175 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/482 variables, 43/218 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-27 14:44:25] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/482 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 523 unsolved
SDD proceeding with computation,2 properties remain. new max is 262144
SDD size :498734 after 1.29089e+06
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (INCLUDED_ONLY) 0/482 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 523 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 482/482 variables, and 219 constraints, problems are : Problem set: 0 solved, 523 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 523/523 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 523 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 523 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 27/50 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-27 14:44:39] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 523 unsolved
[2024-05-27 14:44:43] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 523 unsolved
Detected timeout of ITS tools.
[2024-05-27 14:44:46] [INFO ] Flatten gal took : 28 ms
[2024-05-27 14:44:46] [INFO ] Applying decomposition
[2024-05-27 14:44:47] [INFO ] Flatten gal took : 25 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/graph7128212022645108594.txt' '-o' '/tmp/graph7128212022645108594.bin' '-w' '/tmp/graph7128212022645108594.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7128212022645108594.bin' '-l' '-1' '-v' '-w' '/tmp/graph7128212022645108594.weights' '-q' '0' '-e' '0.001'
[2024-05-27 14:44:47] [INFO ] Decomposing Gal with order
[2024-05-27 14:44:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 14:44:47] [INFO ] Removed a total of 77 redundant transitions.
[2024-05-27 14:44:47] [INFO ] Flatten gal took : 45 ms
[2024-05-27 14:44:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 98 labels/synchronizations in 3 ms.
[2024-05-27 14:44:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11053811207465121037.gal : 6 ms
[2024-05-27 14:44:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1803406390769886400.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11053811207465121037.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1803406390769886400.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality1803406390769886400.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 11
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :11 after 12
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :12 after 14
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :14 after 16
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :16 after 19
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :19 after 27
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :27 after 55
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :55 after 1050
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1050 after 1373
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1373 after 2151
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2151 after 16711
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 523 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :16711 after 23706
At refinement iteration 6 (OVERLAPS) 356/482 variables, 126/178 constraints. Problems are: Problem set: 0 solved, 523 unsolved
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :100573 after 116245
At refinement iteration 7 (INCLUDED_ONLY) 0/482 variables, 43/221 constraints. Problems are: Problem set: 0 solved, 523 unsolved
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :405407 after 453486
At refinement iteration 8 (INCLUDED_ONLY) 0/482 variables, 523/744 constraints. Problems are: Problem set: 0 solved, 523 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 482/482 variables, and 744 constraints, problems are : Problem set: 0 solved, 523 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 126/126 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 523/523 constraints, Known Traps: 29/29 constraints]
After SMT, in 61395ms problems are : Problem set: 0 solved, 523 unsolved
Search for dead transitions found 0 dead transitions in 61401ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62006 ms. Remains : 126/126 places, 529/529 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 173 transitions
Reduce isomorphic transitions removed 173 transitions.
Iterating post reduction 0 with 173 rules applied. Total rules applied 173 place count 126 transition count 356
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 203 place count 96 transition count 296
Iterating global reduction 1 with 30 rules applied. Total rules applied 233 place count 96 transition count 296
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 236 place count 94 transition count 295
Graph (trivial) has 19 edges and 94 vertex of which 8 / 94 are part of one of the 1 SCC in 0 ms
Free SCC test removed 7 places
Iterating global reduction 1 with 1 rules applied. Total rules applied 237 place count 87 transition count 295
Drop transitions (Empty/Sink Transition effects.) removed 19 transitions
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 163 transitions.
Iterating post reduction 1 with 163 rules applied. Total rules applied 400 place count 87 transition count 132
Applied a total of 400 rules in 10 ms. Remains 87 /126 variables (removed 39) and now considering 132/529 (removed 397) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 132 rows 87 cols
[2024-05-27 14:45:07] [INFO ] Computed 22 invariants in 1 ms
[2024-05-27 14:45:07] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-05-27 14:45:07] [INFO ] [Real]Absence check using 9 positive and 13 generalized place invariants in 3 ms returned sat
[2024-05-27 14:45:07] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-27 14:45:07] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-27 14:45:07] [INFO ] [Nat]Absence check using 9 positive and 13 generalized place invariants in 3 ms returned sat
[2024-05-27 14:45:07] [INFO ] After 39ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-27 14:45:07] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-27 14:45:07] [INFO ] After 10ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-27 14:45:07] [INFO ] After 25ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-27 14:45:07] [INFO ] After 117ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2024-05-27 14:45:07] [INFO ] Flatten gal took : 7 ms
[2024-05-27 14:45:07] [INFO ] Flatten gal took : 6 ms
[2024-05-27 14:45:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3341128473952538983.gal : 2 ms
[2024-05-27 14:45:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13881781345272433962.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3341128473952538983.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13881781345272433962.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality13881781345272433962.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 5
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :5 after 9
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :9 after 18
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :18 after 42
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :42 after 102
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :102 after 203
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :203 after 449
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :449 after 966
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :966 after 3140
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :3140 after 16033
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :16033 after 24404
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :24404 after 42969
Invariant property MIN0 does not hold.
Reachability property MAX0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 16385 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,163980,3.0134,105412,2,53323,19,362671,6,0,483,219617,0
Total reachable state count : 163980

Verifying 2 reachability properties.
Reachability property MAX0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,1,3.02829,105412,2,88,19,362671,7,0,513,219617,0
Invariant property MIN0 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,1,3.0447,105412,2,88,19,362671,8,0,542,219617,0
Over-approximation ignoring read arcs solved 0 properties in 3303 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[5] Max Struct:[6]
Ending property specific reduction for SafeBus-COL-06-UpperBounds-02 in 141558 ms.
[2024-05-27 14:45:10] [INFO ] Flatten gal took : 28 ms
[2024-05-27 14:45:10] [INFO ] Applying decomposition
[2024-05-27 14:45:10] [INFO ] Flatten gal took : 22 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/graph4385145933439187823.txt' '-o' '/tmp/graph4385145933439187823.bin' '-w' '/tmp/graph4385145933439187823.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4385145933439187823.bin' '-l' '-1' '-v' '-w' '/tmp/graph4385145933439187823.weights' '-q' '0' '-e' '0.001'
[2024-05-27 14:45:10] [INFO ] Decomposing Gal with order
[2024-05-27 14:45:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 14:45:10] [INFO ] Removed a total of 1271 redundant transitions.
[2024-05-27 14:45:10] [INFO ] Flatten gal took : 102 ms
[2024-05-27 14:45:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 245 labels/synchronizations in 19 ms.
[2024-05-27 14:45:10] [INFO ] Time to serialize gal into /tmp/UpperBounds10064295332323330373.gal : 4 ms
[2024-05-27 14:45:10] [INFO ] Time to serialize properties into /tmp/UpperBounds1533593360371332092.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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds10064295332323330373.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds1533593360371332092.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...305
Loading property file /tmp/UpperBounds1533593360371332092.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flatf,6.44639e+06,167.365,3555808,2,352793,5,7.99692e+06,6,0,831,8.39915e+06,0
Total reachable state count : 6446388

Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 5
Bounds property SafeBus-COL-06-UpperBounds-02 :0 <= gi3.gu9.wait_msg_0+gi3.gu9.wait_msg_1+gi3.gu9.wait_msg_2+gi3.gu9.wait_msg_3+gi3.gu9.wait_msg_4+gi3.gu9....170
FORMULA SafeBus-COL-06-UpperBounds-02 5 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
SafeBus-COL-06-UpperBounds-02,0,167.833,3555808,1,0,7,7.99692e+06,9,1,1181,8.39915e+06,4
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 533722 ms.

BK_STOP 1716821279044

--------------------
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
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -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 UpperBounds -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="SafeBus-COL-06"
export BK_EXAMINATION="UpperBounds"
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 SafeBus-COL-06, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r334-tall-171679080200365"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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