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.r246-tall-171654351400325.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 Murphy-PT-D4N025, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r246-tall-171654351400325
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 6.2K Apr 11 22:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Apr 11 22:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Apr 11 22:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 11 22:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 6 10:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 6 10:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 6 10:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 6 10:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 22:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Apr 11 22:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 22:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K Apr 11 22:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 6 10:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 6 10:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 19K 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 Murphy-PT-D4N025-UpperBounds-00
FORMULA_NAME Murphy-PT-D4N025-UpperBounds-01
FORMULA_NAME Murphy-PT-D4N025-UpperBounds-02
FORMULA_NAME Murphy-PT-D4N025-UpperBounds-03
FORMULA_NAME Murphy-PT-D4N025-UpperBounds-04
FORMULA_NAME Murphy-PT-D4N025-UpperBounds-05
FORMULA_NAME Murphy-PT-D4N025-UpperBounds-06
FORMULA_NAME Murphy-PT-D4N025-UpperBounds-07
FORMULA_NAME Murphy-PT-D4N025-UpperBounds-08
FORMULA_NAME Murphy-PT-D4N025-UpperBounds-09
FORMULA_NAME Murphy-PT-D4N025-UpperBounds-10
FORMULA_NAME Murphy-PT-D4N025-UpperBounds-11
FORMULA_NAME Murphy-PT-D4N025-UpperBounds-12
FORMULA_NAME Murphy-PT-D4N025-UpperBounds-13
FORMULA_NAME Murphy-PT-D4N025-UpperBounds-14
FORMULA_NAME Murphy-PT-D4N025-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716663330171

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Murphy-PT-D4N025
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-25 18:55:31] [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-25 18:55:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 18:55:31] [INFO ] Load time of PNML (sax parser for PT used): 40 ms
[2024-05-25 18:55:31] [INFO ] Transformed 30 places.
[2024-05-25 18:55:31] [INFO ] Transformed 35 transitions.
[2024-05-25 18:55:31] [INFO ] Parsed PT model containing 30 places and 35 transitions and 135 arcs in 131 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Current structural bounds on expressions (Initially) : Max Seen:[1, 0, 3, 1, 1, 0, 0, 0, 25, 1, 25, 1, 1, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[1, 0, 3, 1, 1, 0, 0, 0, 25, 1, 25, 1, 1, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 35 rows 30 cols
[2024-05-25 18:55:31] [INFO ] Computed 6 invariants in 11 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 3, 1, 1, 0, 0, 0, 25, 1, 25, 1, 1, 0, 0, 0] Max Struct:[130, +inf, +inf, 130, 130, +inf, +inf, +inf, 130, 130, 130, 130, 130, +inf, +inf, +inf]
RANDOM walk for 10000 steps (2 resets) in 31 ms. (312 steps per ms)
BEST_FIRST walk for 160015 steps (32 resets) in 134 ms. (1185 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[64, 2, 3, 64, 64, 1, 2, 2, 56, 64, 42, 64, 64, 1, 1, 2] Max Struct:[130, +inf, +inf, 130, 130, +inf, +inf, +inf, 130, 130, 130, 130, 130, +inf, +inf, +inf]
[2024-05-25 18:55:31] [INFO ] Invariant cache hit.
[2024-05-25 18:55:31] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-25 18:55:31] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 7 ms returned sat
[2024-05-25 18:55:31] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-25 18:55:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:55:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:55:31] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 18:55:31] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-25 18:55:31] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 18:55:31] [INFO ] [Nat]Added 10 Read/Feed constraints in 3 ms returned sat
[2024-05-25 18:55:31] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-25 18:55:31] [INFO ] Added : 0 causal constraints over 0 iterations in 17 ms. Result :sat
Minimization took 13 ms.
[2024-05-25 18:55:31] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-25 18:55:31] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 18:55:31] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-25 18:55:31] [INFO ] [Real]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:55:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:55:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-25 18:55:32] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 18:55:32] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-25 18:55:32] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 18:55:32] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 18:55:32] [INFO ] Added : 2 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 7 ms.
[2024-05-25 18:55:32] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:55:32] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 10 ms returned sat
[2024-05-25 18:55:32] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-25 18:55:32] [INFO ] [Real]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:55:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:55:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:55:32] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 18:55:32] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-05-25 18:55:32] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:55:32] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-25 18:55:32] [INFO ] Added : 3 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 5 ms.
[2024-05-25 18:55:32] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:55:32] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-25 18:55:32] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-25 18:55:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:55:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:55:32] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 18:55:32] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-25 18:55:32] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:55:32] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-25 18:55:32] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Minimization took 10 ms.
[2024-05-25 18:55:32] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-25 18:55:32] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 18:55:32] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-25 18:55:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:55:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-25 18:55:32] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 18:55:32] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-25 18:55:32] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 18:55:32] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 18:55:32] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Minimization took 10 ms.
[2024-05-25 18:55:32] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:55:32] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2024-05-25 18:55:32] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-25 18:55:32] [INFO ] [Real]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:55:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:55:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:55:32] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 18:55:32] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-05-25 18:55:32] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:55:32] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 18:55:32] [INFO ] Added : 1 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 5 ms.
[2024-05-25 18:55:32] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:55:32] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 18:55:32] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-25 18:55:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:55:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:55:32] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 18:55:32] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-25 18:55:32] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 18:55:32] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 18 ms to minimize.
[2024-05-25 18:55:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2024-05-25 18:55:32] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 18:55:32] [INFO ] Added : 3 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 6 ms.
[2024-05-25 18:55:32] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:55:32] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2024-05-25 18:55:32] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-25 18:55:32] [INFO ] [Real]Added 10 Read/Feed constraints in 4 ms returned sat
[2024-05-25 18:55:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:55:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:55:32] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 18:55:32] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-25 18:55:32] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:55:32] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 2 ms to minimize.
[2024-05-25 18:55:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 27 ms
[2024-05-25 18:55:32] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-25 18:55:32] [INFO ] Added : 3 causal constraints over 1 iterations in 13 ms. Result :sat
Minimization took 6 ms.
[2024-05-25 18:55:32] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 18:55:32] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2024-05-25 18:55:32] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 18:55:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:55:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:55:32] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 18:55:32] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-25 18:55:32] [INFO ] [Nat]Added 10 Read/Feed constraints in 4 ms returned sat
[2024-05-25 18:55:32] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 18:55:32] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Minimization took 8 ms.
[2024-05-25 18:55:32] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:55:32] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 18:55:32] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-25 18:55:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:55:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:55:32] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 18:55:32] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-25 18:55:32] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:55:32] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 18:55:32] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Minimization took 13 ms.
[2024-05-25 18:55:32] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:55:32] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2024-05-25 18:55:32] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-25 18:55:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:55:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 18:55:32] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 18:55:32] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 18:55:32] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 18:55:32] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 18:55:32] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Minimization took 14 ms.
[2024-05-25 18:55:33] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:55:33] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 18:55:33] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 18:55:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:55:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:55:33] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 18:55:33] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-25 18:55:33] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:55:33] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 18:55:33] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Minimization took 10 ms.
[2024-05-25 18:55:33] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 18:55:33] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2024-05-25 18:55:33] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-25 18:55:33] [INFO ] [Real]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:55:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:55:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 18:55:33] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2024-05-25 18:55:33] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-05-25 18:55:33] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 18:55:33] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-25 18:55:33] [INFO ] Added : 0 causal constraints over 0 iterations in 10 ms. Result :sat
Minimization took 9 ms.
[2024-05-25 18:55:33] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 18:55:33] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 18:55:33] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-25 18:55:33] [INFO ] [Real]Added 10 Read/Feed constraints in 4 ms returned sat
[2024-05-25 18:55:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:55:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:55:33] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 18:55:33] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 18:55:33] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 18:55:33] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-25 18:55:33] [INFO ] Added : 1 causal constraints over 1 iterations in 14 ms. Result :sat
Minimization took 6 ms.
[2024-05-25 18:55:33] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:55:33] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 18:55:33] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-25 18:55:33] [INFO ] [Real]Added 10 Read/Feed constraints in 11 ms returned sat
[2024-05-25 18:55:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:55:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:55:33] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2024-05-25 18:55:33] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 18:55:33] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:55:33] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 18:55:33] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 8 ms.
[2024-05-25 18:55:33] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:55:33] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 18:55:33] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-25 18:55:33] [INFO ] [Real]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:55:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:55:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:55:33] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2024-05-25 18:55:33] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-25 18:55:33] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:55:33] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
[2024-05-25 18:55:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 25 ms
[2024-05-25 18:55:33] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-25 18:55:33] [INFO ] Added : 3 causal constraints over 1 iterations in 15 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[64, 2, 3, 64, 64, 1, 2, 2, 56, 64, 42, 64, 64, 1, 1, 2] Max Struct:[130, +inf, +inf, 130, 130, +inf, +inf, +inf, 130, 130, 130, 130, 130, +inf, +inf, +inf]
FORMULA Murphy-PT-D4N025-UpperBounds-12 130 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Murphy-PT-D4N025-UpperBounds-11 130 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Murphy-PT-D4N025-UpperBounds-03 130 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Murphy-PT-D4N025-UpperBounds-09 130 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Murphy-PT-D4N025-UpperBounds-04 130 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Murphy-PT-D4N025-UpperBounds-00 130 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 3, 1, 2, 2, 116, 79, 1, 1, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, 130, 130, +inf, +inf, +inf]
Support contains 10 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 8 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Running 20 sub problems to find dead transitions.
[2024-05-25 18:55:33] [INFO ] Invariant cache hit.
[2024-05-25 18:55:33] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 5/25 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 35/60 variables, 25/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 10/41 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 5/65 variables, 5/46 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/65 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 0/65 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/65 variables, and 46 constraints, problems are : Problem set: 0 solved, 20 unsolved in 286 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 30/30 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 5/25 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 35/60 variables, 25/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 10/41 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 5/65 variables, 5/46 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/65 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/65 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (OVERLAPS) 0/65 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/65 variables, and 66 constraints, problems are : Problem set: 0 solved, 20 unsolved in 242 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 30/30 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 554ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 564ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 583 ms. Remains : 30/30 places, 35/35 transitions.
Found an invariant !
This invariant on transitions {19=1, 24=1, 34=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {17=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 10) seen :[2, 3, 1, 2, 2, 33, 30, 1, 1, 2]
Current structural bounds on expressions (after cover walk) : Max Seen:[2, 3, 1, 2, 2, 116, 79, 1, 1, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, 130, 130, +inf, +inf, +inf]
[2024-05-25 18:55:34] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2, 3, 1, 2, 2, 116, 79, 1, 1, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, 130, 130, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 608 ms. (1642 steps per ms)
BEST_FIRST walk for 10000010 steps (20 resets) in 4388 ms. (2278 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 3, 1, 2, 2, 116, 79, 1, 1, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, 130, 130, +inf, +inf, +inf]
[2024-05-25 18:55:39] [INFO ] Invariant cache hit.
[2024-05-25 18:55:39] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:55:39] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2024-05-25 18:55:39] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-25 18:55:39] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 18:55:39] [INFO ] [Real]Added 10 Read/Feed constraints in 3 ms returned sat
[2024-05-25 18:55:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:55:39] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:55:39] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 18:55:39] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 18:55:39] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 18:55:39] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 18:55:39] [INFO ] Added : 2 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 7 ms.
[2024-05-25 18:55:39] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:55:39] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 18:55:39] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-25 18:55:39] [INFO ] [Real]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:55:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:55:39] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:55:39] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 18:55:39] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 18:55:39] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:55:39] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 18:55:39] [INFO ] Added : 3 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 5 ms.
[2024-05-25 18:55:39] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:55:39] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-25 18:55:39] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-25 18:55:39] [INFO ] [Real]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:55:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:55:39] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:55:39] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 18:55:39] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-25 18:55:39] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:55:39] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-25 18:55:39] [INFO ] Added : 1 causal constraints over 1 iterations in 15 ms. Result :sat
Minimization took 5 ms.
[2024-05-25 18:55:39] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 18:55:39] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 18:55:39] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-25 18:55:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:55:39] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:55:39] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-25 18:55:39] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-25 18:55:39] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 18:55:39] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
[2024-05-25 18:55:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 21 ms
[2024-05-25 18:55:39] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 18:55:39] [INFO ] Added : 3 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 7 ms.
[2024-05-25 18:55:39] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:55:39] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 18:55:39] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 18:55:39] [INFO ] [Real]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:55:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:55:39] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:55:39] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 18:55:39] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-25 18:55:39] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:55:39] [INFO ] Deduced a trap composed of 2 places in 12 ms of which 0 ms to minimize.
[2024-05-25 18:55:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 16 ms
[2024-05-25 18:55:39] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 18:55:39] [INFO ] Added : 3 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 7 ms.
[2024-05-25 18:55:40] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:55:40] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 18:55:40] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-25 18:55:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:55:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-25 18:55:40] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2024-05-25 18:55:40] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 18:55:40] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 18:55:40] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
[2024-05-25 18:55:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2024-05-25 18:55:40] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-25 18:55:40] [INFO ] Added : 2 causal constraints over 1 iterations in 16 ms. Result :sat
Minimization took 10 ms.
[2024-05-25 18:55:40] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:55:40] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 18:55:40] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 18:55:40] [INFO ] [Real]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:55:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:55:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:55:40] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2024-05-25 18:55:40] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-25 18:55:40] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:55:40] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 2 ms to minimize.
[2024-05-25 18:55:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 21 ms
[2024-05-25 18:55:40] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-25 18:55:40] [INFO ] Added : 3 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 10 ms.
[2024-05-25 18:55:40] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:55:40] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-25 18:55:40] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-25 18:55:40] [INFO ] [Real]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 18:55:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:55:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:55:40] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 18:55:40] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 18:55:40] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 18:55:40] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-25 18:55:40] [INFO ] Added : 1 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 7 ms.
[2024-05-25 18:55:40] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:55:40] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 18:55:40] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-25 18:55:40] [INFO ] [Real]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 18:55:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:55:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:55:40] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 5 ms returned sat
[2024-05-25 18:55:40] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-25 18:55:40] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 18:55:40] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 18:55:40] [INFO ] Added : 1 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 6 ms.
[2024-05-25 18:55:40] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 18:55:40] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 18:55:40] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 18:55:40] [INFO ] [Real]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:55:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:55:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 18:55:40] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 18:55:40] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-25 18:55:40] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:55:40] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 1 ms to minimize.
[2024-05-25 18:55:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 19 ms
[2024-05-25 18:55:40] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-25 18:55:40] [INFO ] Added : 3 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2, 3, 1, 2, 2, 116, 79, 1, 1, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, 130, 130, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 3, 1, 2, 2, 116, 84, 1, 1, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, 130, 130, +inf, +inf, +inf]
Support contains 10 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 5 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 30/30 places, 35/35 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 4 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2024-05-25 18:55:40] [INFO ] Invariant cache hit.
[2024-05-25 18:55:40] [INFO ] Implicit Places using invariants in 33 ms returned [10, 11, 12, 13, 14]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 35 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 25/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 41 ms. Remains : 25/30 places, 35/35 transitions.
Found an invariant !
This invariant on transitions {19=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {19=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) seen :[2, 3, 1, 2, 2, 26, 28, 1, 1, 2]
Current structural bounds on expressions (after cover walk) : Max Seen:[2, 3, 1, 2, 2, 116, 84, 1, 1, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, 130, 130, +inf, +inf, +inf]
// Phase 1: matrix 35 rows 25 cols
[2024-05-25 18:55:40] [INFO ] Computed 1 invariants in 7 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2, 3, 1, 2, 2, 116, 84, 1, 1, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, 130, 130, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 575 ms. (1736 steps per ms)
BEST_FIRST walk for 10000009 steps (20 resets) in 3802 ms. (2629 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 3, 1, 2, 2, 116, 84, 1, 1, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, 130, 130, +inf, +inf, +inf]
[2024-05-25 18:55:45] [INFO ] Invariant cache hit.
[2024-05-25 18:55:45] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 18:55:45] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-25 18:55:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:55:45] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 18:55:45] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 18:55:45] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 18:55:45] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:55:45] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 18:55:45] [INFO ] Added : 2 causal constraints over 1 iterations in 22 ms. Result :sat
Minimization took 6 ms.
[2024-05-25 18:55:45] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 18:55:45] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 18:55:45] [INFO ] [Real]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:55:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:55:45] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 18:55:45] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 18:55:45] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:55:45] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 18:55:45] [INFO ] Added : 3 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 6 ms.
[2024-05-25 18:55:45] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:55:45] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 18:55:45] [INFO ] [Real]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 18:55:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:55:45] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 18:55:45] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-25 18:55:45] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:55:45] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 18:55:45] [INFO ] Added : 1 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 6 ms.
[2024-05-25 18:55:45] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 18:55:45] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 18:55:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:55:45] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:55:45] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-25 18:55:45] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 18:55:45] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 18:55:45] [INFO ] Added : 2 causal constraints over 1 iterations in 14 ms. Result :sat
Minimization took 7 ms.
[2024-05-25 18:55:45] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:55:45] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-25 18:55:45] [INFO ] [Real]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:55:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:55:45] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:55:45] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-25 18:55:45] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 18:55:45] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 18:55:45] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 7 ms.
[2024-05-25 18:55:45] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:55:45] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-25 18:55:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:55:45] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 18:55:45] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 18:55:45] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 18:55:45] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
[2024-05-25 18:55:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 18 ms
[2024-05-25 18:55:45] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-25 18:55:45] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 8 ms.
[2024-05-25 18:55:45] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:55:45] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 18:55:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:55:45] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 18:55:45] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 18:55:45] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 18:55:45] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 18:55:45] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 8 ms.
[2024-05-25 18:55:45] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:55:45] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 18:55:45] [INFO ] [Real]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:55:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:55:45] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:55:45] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 18:55:45] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:55:45] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 18:55:45] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 4 ms.
[2024-05-25 18:55:45] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 18:55:45] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 18:55:45] [INFO ] [Real]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:55:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:55:45] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:55:45] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 18:55:45] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:55:45] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 18:55:45] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 6 ms.
[2024-05-25 18:55:45] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 18:55:45] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-25 18:55:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:55:45] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:55:45] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 18:55:45] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:55:45] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 18:55:45] [INFO ] Added : 2 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2, 3, 1, 2, 2, 116, 84, 1, 1, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, 130, 130, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 3, 1, 2, 2, 128, 100, 1, 1, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, 130, 130, +inf, +inf, +inf]
Support contains 10 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 25/25 places, 35/35 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 8 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2024-05-25 18:55:45] [INFO ] Invariant cache hit.
[2024-05-25 18:55:46] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-25 18:55:46] [INFO ] Invariant cache hit.
[2024-05-25 18:55:46] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 18:55:46] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2024-05-25 18:55:46] [INFO ] Redundant transitions in 0 ms returned []
Running 20 sub problems to find dead transitions.
[2024-05-25 18:55:46] [INFO ] Invariant cache hit.
[2024-05-25 18:55:46] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 36 constraints, problems are : Problem set: 0 solved, 20 unsolved in 178 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 56 constraints, problems are : Problem set: 0 solved, 20 unsolved in 205 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 391ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 392ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 465 ms. Remains : 25/25 places, 35/35 transitions.
Found an invariant !
This invariant on transitions {19=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {19=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 10) seen :[2, 3, 1, 2, 2, 30, 33, 1, 1, 2]
Current structural bounds on expressions (after cover walk) : Max Seen:[2, 3, 1, 2, 2, 128, 100, 1, 1, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, 130, 130, +inf, +inf, +inf]
[2024-05-25 18:55:46] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2, 3, 1, 2, 2, 128, 100, 1, 1, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, 130, 130, +inf, +inf, +inf]
RANDOM walk for 1000005 steps (2 resets) in 565 ms. (1766 steps per ms)
BEST_FIRST walk for 10000009 steps (20 resets) in 3973 ms. (2516 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 3, 1, 2, 2, 128, 100, 1, 1, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, 130, 130, +inf, +inf, +inf]
[2024-05-25 18:55:51] [INFO ] Invariant cache hit.
[2024-05-25 18:55:51] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 18:55:51] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-25 18:55:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:55:51] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:55:51] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-25 18:55:51] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 18:55:51] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:55:51] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 18:55:51] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 6 ms.
[2024-05-25 18:55:51] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:55:51] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 18:55:51] [INFO ] [Real]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:55:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:55:51] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 18:55:51] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 18:55:51] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:55:51] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 18:55:51] [INFO ] Added : 3 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 7 ms.
[2024-05-25 18:55:51] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:55:51] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-25 18:55:51] [INFO ] [Real]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 18:55:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:55:51] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:55:51] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 18:55:51] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:55:51] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 18:55:51] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 16 ms.
[2024-05-25 18:55:51] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:55:51] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 18:55:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:55:51] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 18:55:51] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-25 18:55:51] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:55:51] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 18:55:51] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 6 ms.
[2024-05-25 18:55:51] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 18:55:51] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 18:55:51] [INFO ] [Real]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:55:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:55:51] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 18:55:51] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-25 18:55:51] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 18:55:51] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 18:55:51] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 6 ms.
[2024-05-25 18:55:51] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:55:51] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 18:55:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:55:51] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 18:55:51] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 18:55:51] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 18:55:51] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
[2024-05-25 18:55:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 21 ms
[2024-05-25 18:55:51] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-25 18:55:51] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 6 ms.
[2024-05-25 18:55:51] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 18:55:51] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 18:55:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:55:51] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:55:51] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 18:55:51] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 18:55:51] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 18:55:51] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 8 ms.
[2024-05-25 18:55:51] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:55:51] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 18:55:51] [INFO ] [Real]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:55:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:55:51] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:55:51] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-25 18:55:51] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 18:55:51] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 18:55:51] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 5 ms.
[2024-05-25 18:55:51] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 18:55:51] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-25 18:55:51] [INFO ] [Real]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:55:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:55:51] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 18:55:51] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-25 18:55:51] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:55:51] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 18:55:51] [INFO ] Added : 1 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 7 ms.
[2024-05-25 18:55:51] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:55:51] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 18:55:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:55:51] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 18:55:51] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 18:55:51] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:55:51] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 18:55:51] [INFO ] Added : 2 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2, 3, 1, 2, 2, 128, 100, 1, 1, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, 130, 130, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 3, 1, 2, 2, 128, 100, 1, 1, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, 130, 130, +inf, +inf, +inf]
Support contains 10 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 25/25 places, 35/35 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 5 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2024-05-25 18:55:51] [INFO ] Invariant cache hit.
[2024-05-25 18:55:51] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-25 18:55:51] [INFO ] Invariant cache hit.
[2024-05-25 18:55:51] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 18:55:51] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2024-05-25 18:55:51] [INFO ] Redundant transitions in 1 ms returned []
Running 20 sub problems to find dead transitions.
[2024-05-25 18:55:51] [INFO ] Invariant cache hit.
[2024-05-25 18:55:51] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 36 constraints, problems are : Problem set: 0 solved, 20 unsolved in 211 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 56 constraints, problems are : Problem set: 0 solved, 20 unsolved in 188 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 405ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 405ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 485 ms. Remains : 25/25 places, 35/35 transitions.
Found an invariant !
This invariant on transitions {19=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {19=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 10) seen :[2, 3, 1, 2, 2, 28, 35, 1, 1, 2]
Current structural bounds on expressions (after cover walk) : Max Seen:[2, 3, 1, 2, 2, 128, 100, 1, 1, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, 130, 130, +inf, +inf, +inf]
RANDOM walk for 40060 steps (8 resets) in 896 ms. (44 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 12/12 properties
[2024-05-25 18:55:52] [INFO ] Flatten gal took : 44 ms
[2024-05-25 18:55:52] [INFO ] Flatten gal took : 7 ms
BEST_FIRST walk for 40003 steps (8 resets) in 102 ms. (388 steps per ms) remains 12/12 properties
[2024-05-25 18:55:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16689345122017497143.gal : 12 ms
[2024-05-25 18:55:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3336035022018403083.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/ReachabilityCardinality16689345122017497143.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3336035022018403083.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 12/12 properties

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/ReachabilityCardinality3336035022018403083.prop.
SDD proceeding with computation,12 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,12 properties remain. new max is 8
SDD size :6 after 36
SDD proceeding with computation,12 properties remain. new max is 16
SDD size :36 after 90
SDD proceeding with computation,12 properties remain. new max is 32
SDD size :90 after 3822
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 12/12 properties
SDD proceeding with computation,12 properties remain. new max is 64
SDD size :3822 after 34242
SDD proceeding with computation,12 properties remain. new max is 128
SDD size :34242 after 6.33906e+07
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 67 ms. (588 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 70 ms. (563 steps per ms) remains 12/12 properties
SDD proceeding with computation,12 properties remain. new max is 256
SDD size :6.33906e+07 after 1.93336e+11
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 52 ms. (754 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 236389 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :0 out of 12
Probabilistic random walk after 236389 steps, saw 162039 distinct states, run finished after 3015 ms. (steps per millisecond=78 ) properties seen :0
[2024-05-25 18:55:56] [INFO ] Invariant cache hit.
[2024-05-25 18:55:56] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 8/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-25 18:55:56] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 1 ms to minimize.
Problem MAX5 is UNSAT
Problem MAX6 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 1/2 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 32/50 variables, 18/20 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 10/30 constraints. Problems are: Problem set: 2 solved, 10 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 0/30 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 10/60 variables, 7/37 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/60 variables, 0/37 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 0/60 variables, 0/37 constraints. Problems are: Problem set: 2 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 37 constraints, problems are : Problem set: 2 solved, 10 unsolved in 145 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 2 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 8/18 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 1/2 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 32/50 variables, 18/20 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 10/30 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 4/34 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/50 variables, 0/34 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 10/60 variables, 7/41 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/60 variables, 6/47 constraints. Problems are: Problem set: 2 solved, 10 unsolved
[2024-05-25 18:55:56] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
[2024-05-25 18:55:56] [INFO ] Deduced a trap composed of 2 places in 13 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/60 variables, 2/49 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/60 variables, 0/49 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 0/60 variables, 0/49 constraints. Problems are: Problem set: 2 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 49 constraints, problems are : Problem set: 2 solved, 10 unsolved in 197 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 10/12 constraints, Known Traps: 3/3 constraints]
After SMT, in 349ms problems are : Problem set: 2 solved, 10 unsolved
Fused 10 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 911 ms.
Support contains 10 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Running 20 sub problems to find dead transitions.
[2024-05-25 18:55:57] [INFO ] Invariant cache hit.
[2024-05-25 18:55:57] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 36 constraints, problems are : Problem set: 0 solved, 20 unsolved in 178 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 56 constraints, problems are : Problem set: 0 solved, 20 unsolved in 193 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 378ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 379ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 380 ms. Remains : 25/25 places, 35/35 transitions.
RANDOM walk for 40018 steps (8 resets) in 113 ms. (351 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 68 ms. (579 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 40 ms. (975 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 71 ms. (555 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 67 ms. (588 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 77 ms. (512 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 54 ms. (727 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 220693 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :0 out of 10
Probabilistic random walk after 220693 steps, saw 151222 distinct states, run finished after 3001 ms. (steps per millisecond=73 ) properties seen :0
[2024-05-25 18:56:01] [INFO ] Invariant cache hit.
[2024-05-25 18:56:01] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 8/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-25 18:56:01] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 32/50 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 10/60 variables, 7/37 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/60 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 0/60 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 37 constraints, problems are : Problem set: 0 solved, 10 unsolved in 128 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 8/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 32/50 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/50 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 10/60 variables, 7/41 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/60 variables, 6/47 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-25 18:56:01] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
[2024-05-25 18:56:01] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/60 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/60 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 0/60 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 49 constraints, problems are : Problem set: 0 solved, 10 unsolved in 230 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 3/3 constraints]
After SMT, in 365ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1294 ms.
Support contains 10 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 25/25 places, 35/35 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2024-05-25 18:56:02] [INFO ] Invariant cache hit.
[2024-05-25 18:56:02] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-25 18:56:02] [INFO ] Invariant cache hit.
[2024-05-25 18:56:02] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 18:56:02] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2024-05-25 18:56:02] [INFO ] Redundant transitions in 0 ms returned []
Running 20 sub problems to find dead transitions.
[2024-05-25 18:56:02] [INFO ] Invariant cache hit.
[2024-05-25 18:56:02] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 36 constraints, problems are : Problem set: 0 solved, 20 unsolved in 180 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 56 constraints, problems are : Problem set: 0 solved, 20 unsolved in 208 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 391ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 392ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 451 ms. Remains : 25/25 places, 35/35 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Running SMT prover for 10 properties.
[2024-05-25 18:56:03] [INFO ] Invariant cache hit.
[2024-05-25 18:56:03] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 18:56:03] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2024-05-25 18:56:03] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 18:56:03] [INFO ] After 22ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2024-05-25 18:56:03] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 18:56:03] [INFO ] After 17ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :10
TRAPS : Iteration 0
[2024-05-25 18:56:03] [INFO ] After 40ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
[2024-05-25 18:56:03] [INFO ] After 107ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
[2024-05-25 18:56:03] [INFO ] Flatten gal took : 5 ms
[2024-05-25 18:56:03] [INFO ] Flatten gal took : 4 ms
[2024-05-25 18:56:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1495898538183856728.gal : 1 ms
[2024-05-25 18:56:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9185669659964472483.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/ReachabilityCardinality1495898538183856728.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9185669659964472483.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
Loading property file /tmp/ReachabilityCardinality9185669659964472483.prop.
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 12
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :12 after 42
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :42 after 96
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :96 after 5802
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :5802 after 38358
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :38358 after 8.6937e+07
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :8.6937e+07 after 2.35386e+11
SDD proceeding with computation,10 properties remain. new max is 512
SDD size :2.35386e+11 after 9.85588e+11
SDD proceeding with computation,10 properties remain. new max is 1024
SDD size :9.85588e+11 after 2.00538e+12
SDD proceeding with computation,12 properties remain. new max is 512
SDD size :1.93336e+11 after 8.28437e+11
Detected timeout of ITS tools.
[2024-05-25 18:56:18] [INFO ] Flatten gal took : 4 ms
[2024-05-25 18:56:18] [INFO ] Applying decomposition
[2024-05-25 18:56:18] [INFO ] Flatten gal took : 4 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/graph14675627363494399713.txt' '-o' '/tmp/graph14675627363494399713.bin' '-w' '/tmp/graph14675627363494399713.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14675627363494399713.bin' '-l' '-1' '-v' '-w' '/tmp/graph14675627363494399713.weights' '-q' '0' '-e' '0.001'
[2024-05-25 18:56:18] [INFO ] Decomposing Gal with order
[2024-05-25 18:56:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 18:56:18] [INFO ] Flatten gal took : 46 ms
[2024-05-25 18:56:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-25 18:56:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14536033453137941594.gal : 2 ms
[2024-05-25 18:56:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17178559119491391420.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/ReachabilityCardinality14536033453137941594.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17178559119491391420.prop' '--nowitness'

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 ...309
Loading property file /tmp/ReachabilityCardinality17178559119491391420.prop.
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :19 after 286
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :286 after 32695
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :32695 after 3.39288e+09
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :3.39288e+09 after 5.29849e+10
SDD proceeding with computation,10 properties remain. new max is 512
SDD size :5.29849e+10 after 5.30672e+10
SDD proceeding with computation,10 properties remain. new max is 1024
SDD size :5.30672e+10 after 5.30672e+10
SDD proceeding with computation,10 properties remain. new max is 2048
SDD size :5.30672e+10 after 5.80555e+10
SDD proceeding with computation,10 properties remain. new max is 4096
SDD size :5.80555e+10 after 1.88321e+11
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30520 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-25 18:56:33] [INFO ] Flatten gal took : 3 ms
[2024-05-25 18:56:33] [INFO ] Applying decomposition
[2024-05-25 18:56:33] [INFO ] Flatten gal took : 3 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/graph5460492609623357088.txt' '-o' '/tmp/graph5460492609623357088.bin' '-w' '/tmp/graph5460492609623357088.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5460492609623357088.bin' '-l' '-1' '-v' '-w' '/tmp/graph5460492609623357088.weights' '-q' '0' '-e' '0.001'
[2024-05-25 18:56:33] [INFO ] Decomposing Gal with order
[2024-05-25 18:56:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 18:56:33] [INFO ] Flatten gal took : 4 ms
[2024-05-25 18:56:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-25 18:56:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3245886533993224381.gal : 1 ms
[2024-05-25 18:56:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18250511815863735025.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/ReachabilityCardinality3245886533993224381.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18250511815863735025.prop' '--nowitness'

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 ...308
Loading property file /tmp/ReachabilityCardinality18250511815863735025.prop.
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 12
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :12 after 144
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :144 after 468
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :468 after 4680
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :4680 after 210600
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :210600 after 1.42719e+12
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :1.42719e+12 after 1.42789e+12
SDD proceeding with computation,10 properties remain. new max is 512
SDD size :1.42789e+12 after 6.05366e+13
SDD proceeding with computation,10 properties remain. new max is 1024
SDD size :6.05366e+13 after 6.2128e+13
SDD proceeding with computation,10 properties remain. new max is 2048
SDD size :6.2128e+13 after 6.36263e+13
SDD proceeding with computation,10 properties remain. new max is 4096
SDD size :6.36263e+13 after 6.48394e+13
SDD proceeding with computation,10 properties remain. new max is 8192
SDD size :6.48394e+13 after 6.58988e+13
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[2, 3, 1, 2, 2, 128, 100, 1, 1, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, 130, 130, +inf, +inf, +inf]
Starting property specific reduction for Murphy-PT-D4N025-UpperBounds-01
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:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-25 18:57:23] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10023 steps (2 resets) in 6 ms. (1431 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2024-05-25 18:57:23] [INFO ] Invariant cache hit.
[2024-05-25 18:57:23] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:57:23] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 18:57:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:57:23] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:57:23] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 18:57:23] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 18:57:23] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:57:23] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 18:57:24] [INFO ] Added : 2 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[+inf]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Graph (complete) has 70 edges and 25 vertex of which 3 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.1 ms
Discarding 22 places :
Also discarding 30 output transitions
Drop transitions (Output transitions of discarded places.) removed 30 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 3 transition count 4
Applied a total of 2 rules in 11 ms. Remains 3 /25 variables (removed 22) and now considering 4/35 (removed 31) transitions.
Running 3 sub problems to find dead transitions.
// Phase 1: matrix 4 rows 3 cols
[2024-05-25 18:57:24] [INFO ] Computed 0 invariants in 0 ms
[2024-05-25 18:57:24] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 32 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 40 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 74ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 74ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 3/25 places, 4/35 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
[2024-05-25 18:57:24] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 270 ms. (3690 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 439 ms. (2272 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2024-05-25 18:57:24] [INFO ] Invariant cache hit.
[2024-05-25 18:57:24] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-25 18:57:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 18:57:24] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-25 18:57:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:57:24] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-05-25 18:57:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:57:24] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-25 18:57:24] [INFO ] Added : 2 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[+inf]
Support contains 1 out of 3 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 3/3 places, 4/4 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2024-05-25 18:57:24] [INFO ] Invariant cache hit.
[2024-05-25 18:57:24] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-05-25 18:57:24] [INFO ] Invariant cache hit.
[2024-05-25 18:57:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 18:57:24] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 30 ms to find 0 implicit places.
[2024-05-25 18:57:24] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-05-25 18:57:24] [INFO ] Invariant cache hit.
[2024-05-25 18:57:24] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 30 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 26 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 58ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 58ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 3/3 places, 4/4 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
[2024-05-25 18:57:25] [INFO ] Flatten gal took : 2 ms
[2024-05-25 18:57:25] [INFO ] Flatten gal took : 1 ms
[2024-05-25 18:57:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17708401954659418404.gal : 1 ms
[2024-05-25 18:57:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14104110053253077721.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/ReachabilityCardinality17708401954659418404.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14104110053253077721.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/ReachabilityCardinality14104110053253077721.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,6,0.002802,3808,2,8,5,44,7,0,24,26,0
Total reachable state count : 6

Verifying 1 reachability properties.
Invariant property MIN0 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
MIN0,0,0.003351,3808,1,0,5,44,7,0,25,26,0
RANDOM walk for 40001 steps (8 resets) in 18 ms. (2105 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 13 ms. (2857 steps per ms) remains 1/1 properties
Probably explored full state space saw : 6 states, properties seen :0
Probabilistic random walk after 14 steps, saw 6 distinct states, run finished after 5 ms. (steps per millisecond=2 ) properties seen :0
Explored full state space saw : 6 states, properties seen :0
Exhaustive walk after 14 steps, saw 6 distinct states, run finished after 2 ms. (steps per millisecond=7 ) properties seen :0
FORMULA Murphy-PT-D4N025-UpperBounds-01 2 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for Murphy-PT-D4N025-UpperBounds-01 in 1153 ms.
Starting property specific reduction for Murphy-PT-D4N025-UpperBounds-02
Current structural bounds on expressions (Initially) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[3] Max Struct:[+inf]
// Phase 1: matrix 35 rows 25 cols
[2024-05-25 18:57:25] [INFO ] Computed 1 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 5 ms. (1666 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 4 ms. (2000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[+inf]
[2024-05-25 18:57:25] [INFO ] Invariant cache hit.
[2024-05-25 18:57:25] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:57:25] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 18:57:25] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 18:57:25] [INFO ] [Real]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:57:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:57:25] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:57:25] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 18:57:25] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 18:57:25] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 18:57:25] [INFO ] Added : 3 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[+inf]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Graph (complete) has 70 edges and 25 vertex of which 3 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.1 ms
Discarding 22 places :
Also discarding 30 output transitions
Drop transitions (Output transitions of discarded places.) removed 30 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 3 transition count 4
Applied a total of 2 rules in 2 ms. Remains 3 /25 variables (removed 22) and now considering 4/35 (removed 31) transitions.
Running 3 sub problems to find dead transitions.
// Phase 1: matrix 4 rows 3 cols
[2024-05-25 18:57:25] [INFO ] Computed 0 invariants in 0 ms
[2024-05-25 18:57:25] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 26 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 26 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 55ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 56ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 3/25 places, 4/35 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
[2024-05-25 18:57:25] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 216 ms. (4608 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 175 ms. (5681 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[+inf]
[2024-05-25 18:57:25] [INFO ] Invariant cache hit.
[2024-05-25 18:57:25] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-25 18:57:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 18:57:25] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-25 18:57:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:57:25] [INFO ] [Nat]Absence check using state equation in 1 ms returned sat
[2024-05-25 18:57:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-25 18:57:25] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-25 18:57:25] [INFO ] Added : 3 causal constraints over 1 iterations in 3 ms. Result :sat
Minimization took 2 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[+inf]
Support contains 1 out of 3 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 3/3 places, 4/4 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2024-05-25 18:57:25] [INFO ] Invariant cache hit.
[2024-05-25 18:57:25] [INFO ] Implicit Places using invariants in 12 ms returned []
[2024-05-25 18:57:25] [INFO ] Invariant cache hit.
[2024-05-25 18:57:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 18:57:25] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 29 ms to find 0 implicit places.
[2024-05-25 18:57:25] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-05-25 18:57:25] [INFO ] Invariant cache hit.
[2024-05-25 18:57:25] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 34 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 34 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 70ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 70ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 3/3 places, 4/4 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
[2024-05-25 18:57:25] [INFO ] Flatten gal took : 0 ms
[2024-05-25 18:57:25] [INFO ] Flatten gal took : 1 ms
[2024-05-25 18:57:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13010868404139739570.gal : 3 ms
[2024-05-25 18:57:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10757285389130937681.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/ReachabilityCardinality13010868404139739570.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10757285389130937681.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40001 steps (8 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties

its-reach command run as :
BEST_FIRST walk for 40001 steps (8 resets) in 16 ms. (2353 steps per ms) remains 1/1 properties

/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/ReachabilityCardinality10757285389130937681.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,6,0.001874,3812,2,8,5,44,7,0,24,26,0
Total reachable state count : 6

Verifying 1 reachability properties.
Invariant property MIN0 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
MIN0,0,0.002089,3812,1,0,5,44,7,0,25,26,0
Probably explored full state space saw : 6 states, properties seen :0
Probabilistic random walk after 14 steps, saw 6 distinct states, run finished after 4 ms. (steps per millisecond=3 ) properties seen :0
Explored full state space saw : 6 states, properties seen :0
Exhaustive walk after 14 steps, saw 6 distinct states, run finished after 1 ms. (steps per millisecond=14 ) properties seen :0
FORMULA Murphy-PT-D4N025-UpperBounds-02 3 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for Murphy-PT-D4N025-UpperBounds-02 in 779 ms.
Starting property specific reduction for Murphy-PT-D4N025-UpperBounds-05
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:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
// Phase 1: matrix 35 rows 25 cols
[2024-05-25 18:57:25] [INFO ] Computed 1 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10016 steps (2 resets) in 6 ms. (1430 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[+inf]
[2024-05-25 18:57:25] [INFO ] Invariant cache hit.
[2024-05-25 18:57:25] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:57:25] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-25 18:57:25] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 18:57:25] [INFO ] [Real]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:57:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:57:25] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:57:25] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-25 18:57:25] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:57:25] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 18:57:25] [INFO ] Added : 1 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[+inf]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Graph (complete) has 70 edges and 25 vertex of which 3 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.0 ms
Discarding 22 places :
Also discarding 30 output transitions
Drop transitions (Output transitions of discarded places.) removed 30 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 3 transition count 4
Applied a total of 2 rules in 1 ms. Remains 3 /25 variables (removed 22) and now considering 4/35 (removed 31) transitions.
Running 3 sub problems to find dead transitions.
// Phase 1: matrix 4 rows 3 cols
[2024-05-25 18:57:25] [INFO ] Computed 0 invariants in 1 ms
[2024-05-25 18:57:25] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 33 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 38 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 75ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 75ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 3/25 places, 4/35 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[1] Max Struct:[+inf]
[2024-05-25 18:57:26] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 216 ms. (4608 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 173 ms. (5747 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[+inf]
[2024-05-25 18:57:26] [INFO ] Invariant cache hit.
[2024-05-25 18:57:26] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-25 18:57:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 18:57:26] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-25 18:57:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:57:26] [INFO ] [Nat]Absence check using state equation in 1 ms returned sat
[2024-05-25 18:57:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-25 18:57:26] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 18:57:26] [INFO ] Added : 3 causal constraints over 2 iterations in 4 ms. Result :sat
Minimization took 2 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[+inf]
Support contains 1 out of 3 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 3/3 places, 4/4 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2024-05-25 18:57:26] [INFO ] Invariant cache hit.
[2024-05-25 18:57:26] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-25 18:57:26] [INFO ] Invariant cache hit.
[2024-05-25 18:57:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 18:57:26] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2024-05-25 18:57:26] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-05-25 18:57:26] [INFO ] Invariant cache hit.
[2024-05-25 18:57:26] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 28 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 32 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 64ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 64ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108 ms. Remains : 3/3 places, 4/4 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[1] Max Struct:[+inf]
[2024-05-25 18:57:26] [INFO ] Flatten gal took : 0 ms
[2024-05-25 18:57:26] [INFO ] Flatten gal took : 0 ms
[2024-05-25 18:57:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4787804605611177957.gal : 0 ms
[2024-05-25 18:57:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16426318825605299697.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/ReachabilityCardinality4787804605611177957.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16426318825605299697.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/ReachabilityCardinality16426318825605299697.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,6,0.001589,3812,2,8,5,44,7,0,24,26,0
Total reachable state count : 6

Verifying 1 reachability properties.
Invariant property MIN0 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
MIN0,0,0.001855,3812,1,0,5,44,7,0,25,26,0
RANDOM walk for 40001 steps (8 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 15 ms. (2500 steps per ms) remains 1/1 properties
Probably explored full state space saw : 6 states, properties seen :0
Probabilistic random walk after 14 steps, saw 6 distinct states, run finished after 4 ms. (steps per millisecond=3 ) properties seen :0
Explored full state space saw : 6 states, properties seen :0
Exhaustive walk after 14 steps, saw 6 distinct states, run finished after 1 ms. (steps per millisecond=14 ) properties seen :0
FORMULA Murphy-PT-D4N025-UpperBounds-05 1 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for Murphy-PT-D4N025-UpperBounds-05 in 816 ms.
Starting property specific reduction for Murphy-PT-D4N025-UpperBounds-06
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:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
// Phase 1: matrix 35 rows 25 cols
[2024-05-25 18:57:26] [INFO ] Computed 1 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 7 ms. (1250 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2024-05-25 18:57:26] [INFO ] Invariant cache hit.
[2024-05-25 18:57:26] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:57:26] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 18:57:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:57:26] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:57:26] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-25 18:57:26] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 18:57:26] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:57:26] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-25 18:57:26] [INFO ] Added : 2 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[+inf]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Graph (complete) has 70 edges and 25 vertex of which 3 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.0 ms
Discarding 22 places :
Also discarding 30 output transitions
Drop transitions (Output transitions of discarded places.) removed 30 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 3 transition count 4
Applied a total of 2 rules in 1 ms. Remains 3 /25 variables (removed 22) and now considering 4/35 (removed 31) transitions.
Running 3 sub problems to find dead transitions.
// Phase 1: matrix 4 rows 3 cols
[2024-05-25 18:57:26] [INFO ] Computed 0 invariants in 1 ms
[2024-05-25 18:57:26] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 27 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 25 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 54ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 54ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 3/25 places, 4/35 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
[2024-05-25 18:57:26] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 218 ms. (4566 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 171 ms. (5813 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2024-05-25 18:57:27] [INFO ] Invariant cache hit.
[2024-05-25 18:57:27] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-25 18:57:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 18:57:27] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:57:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:57:27] [INFO ] [Nat]Absence check using state equation in 1 ms returned sat
[2024-05-25 18:57:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-25 18:57:27] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-25 18:57:27] [INFO ] Added : 2 causal constraints over 1 iterations in 2 ms. Result :sat
Minimization took 2 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[+inf]
Support contains 1 out of 3 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 3/3 places, 4/4 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2024-05-25 18:57:27] [INFO ] Invariant cache hit.
[2024-05-25 18:57:27] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-25 18:57:27] [INFO ] Invariant cache hit.
[2024-05-25 18:57:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 18:57:27] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2024-05-25 18:57:27] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-05-25 18:57:27] [INFO ] Invariant cache hit.
[2024-05-25 18:57:27] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 33 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 32 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 68ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 68ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 114 ms. Remains : 3/3 places, 4/4 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
[2024-05-25 18:57:27] [INFO ] Flatten gal took : 2 ms
[2024-05-25 18:57:27] [INFO ] Flatten gal took : 1 ms
[2024-05-25 18:57:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4871570294441860338.gal : 1 ms
[2024-05-25 18:57:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5350712823606862112.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/ReachabilityCardinality4871570294441860338.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5350712823606862112.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
Loading property file /tmp/ReachabilityCardinality5350712823606862112.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,6,0.001883,3812,2,8,5,44,7,0,24,26,0
Total reachable state count : 6

Verifying 1 reachability properties.
Invariant property MIN0 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
MIN0,0,0.002091,3812,1,0,5,44,7,0,25,26,0
RANDOM walk for 40000 steps (8 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (8 resets) in 18 ms. (2105 steps per ms) remains 1/1 properties
Probably explored full state space saw : 6 states, properties seen :0
Probabilistic random walk after 14 steps, saw 6 distinct states, run finished after 4 ms. (steps per millisecond=3 ) properties seen :0
Explored full state space saw : 6 states, properties seen :0
Exhaustive walk after 14 steps, saw 6 distinct states, run finished after 1 ms. (steps per millisecond=14 ) properties seen :0
FORMULA Murphy-PT-D4N025-UpperBounds-06 2 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for Murphy-PT-D4N025-UpperBounds-06 in 787 ms.
Starting property specific reduction for Murphy-PT-D4N025-UpperBounds-07
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:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
// Phase 1: matrix 35 rows 25 cols
[2024-05-25 18:57:27] [INFO ] Computed 1 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 6 ms. (1428 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2024-05-25 18:57:27] [INFO ] Invariant cache hit.
[2024-05-25 18:57:27] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:57:27] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 18:57:27] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 18:57:27] [INFO ] [Real]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:57:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:57:27] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:57:27] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 18:57:27] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:57:27] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 18:57:27] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[+inf]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Graph (complete) has 70 edges and 25 vertex of which 3 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.0 ms
Discarding 22 places :
Also discarding 30 output transitions
Drop transitions (Output transitions of discarded places.) removed 30 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 3 transition count 4
Applied a total of 2 rules in 1 ms. Remains 3 /25 variables (removed 22) and now considering 4/35 (removed 31) transitions.
Running 3 sub problems to find dead transitions.
// Phase 1: matrix 4 rows 3 cols
[2024-05-25 18:57:27] [INFO ] Computed 0 invariants in 1 ms
[2024-05-25 18:57:27] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 33 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 29 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 66ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 66ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 3/25 places, 4/35 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
[2024-05-25 18:57:27] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 218 ms. (4566 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 172 ms. (5780 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2024-05-25 18:57:28] [INFO ] Invariant cache hit.
[2024-05-25 18:57:28] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-25 18:57:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 18:57:28] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-25 18:57:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:57:28] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-25 18:57:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-25 18:57:28] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-25 18:57:28] [INFO ] Added : 2 causal constraints over 1 iterations in 2 ms. Result :sat
Minimization took 2 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[+inf]
Support contains 1 out of 3 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 3/3 places, 4/4 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2024-05-25 18:57:28] [INFO ] Invariant cache hit.
[2024-05-25 18:57:28] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-25 18:57:28] [INFO ] Invariant cache hit.
[2024-05-25 18:57:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 18:57:28] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2024-05-25 18:57:28] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-05-25 18:57:28] [INFO ] Invariant cache hit.
[2024-05-25 18:57:28] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 38 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 32 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 71ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 71ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 116 ms. Remains : 3/3 places, 4/4 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
[2024-05-25 18:57:28] [INFO ] Flatten gal took : 1 ms
[2024-05-25 18:57:28] [INFO ] Flatten gal took : 5 ms
RANDOM walk for 40000 steps (8 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
[2024-05-25 18:57:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13127723063797670457.gal : 3 ms
[2024-05-25 18:57:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17241582349687924763.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/ReachabilityCardinality13127723063797670457.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17241582349687924763.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/ReachabilityCardinality17241582349687924763.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,6,0.001736,3808,2,8,5,44,7,0,24,26,0
Total reachable state count : 6

Verifying 1 reachability properties.
Invariant property MIN0 is true.
BEST_FIRST walk for 40004 steps (8 resets) in 17 ms. (2222 steps per ms) remains 1/1 properties

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,0,0.001896,3808,1,0,5,44,7,0,25,26,0
Probably explored full state space saw : 6 states, properties seen :0
Probabilistic random walk after 14 steps, saw 6 distinct states, run finished after 3 ms. (steps per millisecond=4 ) properties seen :0
Explored full state space saw : 6 states, properties seen :0
Exhaustive walk after 14 steps, saw 6 distinct states, run finished after 1 ms. (steps per millisecond=14 ) properties seen :0
FORMULA Murphy-PT-D4N025-UpperBounds-07 2 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for Murphy-PT-D4N025-UpperBounds-07 in 783 ms.
Starting property specific reduction for Murphy-PT-D4N025-UpperBounds-08
Current structural bounds on expressions (Initially) : Max Seen:[25] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[25] Max Struct:[130]
Current structural bounds on expressions (Before main loop) : Max Seen:[25] Max Struct:[130]
// Phase 1: matrix 35 rows 25 cols
[2024-05-25 18:57:28] [INFO ] Computed 1 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[25] Max Struct:[130]
RANDOM walk for 10000 steps (2 resets) in 5 ms. (1666 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[56] Max Struct:[130]
[2024-05-25 18:57:28] [INFO ] Invariant cache hit.
[2024-05-25 18:57:28] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 18:57:28] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 18:57:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:57:28] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:57:28] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 18:57:28] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 18:57:28] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:57:28] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 18:57:28] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[56] Max Struct:[130]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[81] Max Struct:[130]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Running 20 sub problems to find dead transitions.
[2024-05-25 18:57:28] [INFO ] Invariant cache hit.
[2024-05-25 18:57:28] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 36 constraints, problems are : Problem set: 0 solved, 20 unsolved in 178 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 56 constraints, problems are : Problem set: 0 solved, 20 unsolved in 175 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 358ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 358ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 359 ms. Remains : 25/25 places, 35/35 transitions.
[2024-05-25 18:57:28] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[81] Max Struct:[130]
RANDOM walk for 1000000 steps (2 resets) in 464 ms. (2150 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 362 ms. (2754 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[81] Max Struct:[130]
[2024-05-25 18:57:29] [INFO ] Invariant cache hit.
[2024-05-25 18:57:29] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:57:29] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-25 18:57:29] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 18:57:29] [INFO ] [Real]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 18:57:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:57:29] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:57:29] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-05-25 18:57:29] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 18:57:29] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 18:57:29] [INFO ] Added : 1 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[81] Max Struct:[130]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[128] Max Struct:[130]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 25/25 places, 35/35 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2024-05-25 18:57:29] [INFO ] Invariant cache hit.
[2024-05-25 18:57:29] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-25 18:57:29] [INFO ] Invariant cache hit.
[2024-05-25 18:57:29] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 18:57:29] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2024-05-25 18:57:29] [INFO ] Redundant transitions in 0 ms returned []
Running 20 sub problems to find dead transitions.
[2024-05-25 18:57:29] [INFO ] Invariant cache hit.
[2024-05-25 18:57:29] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 36 constraints, problems are : Problem set: 0 solved, 20 unsolved in 162 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 56 constraints, problems are : Problem set: 0 solved, 20 unsolved in 178 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 344ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 344ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 405 ms. Remains : 25/25 places, 35/35 transitions.
[2024-05-25 18:57:30] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[128] Max Struct:[130]
RANDOM walk for 1000037 steps (2 resets) in 476 ms. (2096 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 343 ms. (2906 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[128] Max Struct:[130]
[2024-05-25 18:57:30] [INFO ] Invariant cache hit.
[2024-05-25 18:57:30] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:57:30] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 18:57:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:57:30] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:57:30] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 18:57:30] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 18:57:30] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:57:30] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
[2024-05-25 18:57:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2024-05-25 18:57:30] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-25 18:57:30] [INFO ] Added : 1 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[128] Max Struct:[130]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[128] Max Struct:[130]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 25/25 places, 35/35 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 3 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2024-05-25 18:57:31] [INFO ] Invariant cache hit.
[2024-05-25 18:57:31] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-25 18:57:31] [INFO ] Invariant cache hit.
[2024-05-25 18:57:31] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 18:57:31] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2024-05-25 18:57:31] [INFO ] Redundant transitions in 1 ms returned []
Running 20 sub problems to find dead transitions.
[2024-05-25 18:57:31] [INFO ] Invariant cache hit.
[2024-05-25 18:57:31] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 36 constraints, problems are : Problem set: 0 solved, 20 unsolved in 166 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 56 constraints, problems are : Problem set: 0 solved, 20 unsolved in 170 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 341ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 341ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 412 ms. Remains : 25/25 places, 35/35 transitions.
[2024-05-25 18:57:31] [INFO ] Flatten gal took : 3 ms
[2024-05-25 18:57:31] [INFO ] Flatten gal took : 5 ms
[2024-05-25 18:57:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15747871707510692878.gal : 1 ms
[2024-05-25 18:57:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3828880247196779369.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/ReachabilityCardinality15747871707510692878.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3828880247196779369.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/ReachabilityCardinality3828880247196779369.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :6 after 36
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :36 after 90
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :90 after 3822
RANDOM walk for 40023 steps (8 resets) in 66 ms. (597 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 23 ms. (1666 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 23 ms. (1666 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :3822 after 34242
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :34242 after 6.33906e+07
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :6.33906e+07 after 1.93336e+11
Interrupted probabilistic random walk after 614843 steps, run timeout after 3001 ms. (steps per millisecond=204 ) properties seen :0 out of 2
Probabilistic random walk after 614843 steps, saw 428156 distinct states, run finished after 3001 ms. (steps per millisecond=204 ) properties seen :0
[2024-05-25 18:57:34] [INFO ] Invariant cache hit.
[2024-05-25 18:57:34] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-25 18:57:34] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 15/25 variables, 10/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 10/35 variables, 5/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/35 variables, 5/22 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/35 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 25/60 variables, 15/37 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/60 variables, 0/37 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/60 variables, 0/37 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 37 constraints, problems are : Problem set: 1 solved, 1 unsolved in 58 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 15/25 variables, 10/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/35 variables, 5/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/35 variables, 5/22 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/35 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 25/60 variables, 15/37 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/60 variables, 1/38 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/60 variables, 0/38 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/60 variables, 0/38 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 38 constraints, problems are : Problem set: 1 solved, 1 unsolved in 35 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 97ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 25 ms.
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 8 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Running 20 sub problems to find dead transitions.
[2024-05-25 18:57:34] [INFO ] Invariant cache hit.
[2024-05-25 18:57:34] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 36 constraints, problems are : Problem set: 0 solved, 20 unsolved in 170 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 56 constraints, problems are : Problem set: 0 solved, 20 unsolved in 187 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 367ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 367ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 375 ms. Remains : 25/25 places, 35/35 transitions.
RANDOM walk for 40032 steps (8 resets) in 40 ms. (976 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 24 ms. (1600 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2058618 steps, run timeout after 3013 ms. (steps per millisecond=683 ) properties seen :0 out of 1
Probabilistic random walk after 2058618 steps, saw 1439851 distinct states, run finished after 3013 ms. (steps per millisecond=683 ) properties seen :0
[2024-05-25 18:57:38] [INFO ] Invariant cache hit.
[2024-05-25 18:57:38] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-25 18:57:38] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 15/25 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 10/35 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/35 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/35 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 25/60 variables, 15/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/60 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/60 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 37 constraints, problems are : Problem set: 0 solved, 1 unsolved in 56 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 15/25 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/35 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/35 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/35 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 25/60 variables, 15/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/60 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/60 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/60 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 38 constraints, problems are : Problem set: 0 solved, 1 unsolved in 34 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 94ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 22 ms.
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 25/25 places, 35/35 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2024-05-25 18:57:38] [INFO ] Invariant cache hit.
[2024-05-25 18:57:38] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-25 18:57:38] [INFO ] Invariant cache hit.
[2024-05-25 18:57:38] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 18:57:38] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2024-05-25 18:57:38] [INFO ] Redundant transitions in 0 ms returned []
Running 20 sub problems to find dead transitions.
[2024-05-25 18:57:38] [INFO ] Invariant cache hit.
[2024-05-25 18:57:38] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 36 constraints, problems are : Problem set: 0 solved, 20 unsolved in 169 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 56 constraints, problems are : Problem set: 0 solved, 20 unsolved in 179 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 353ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 353ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 421 ms. Remains : 25/25 places, 35/35 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 60 edges and 25 vertex of which 10 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.1 ms
Discarding 15 places :
Also discarding 20 output transitions
Drop transitions (Output transitions of discarded places.) removed 20 transitions
Applied a total of 1 rules in 1 ms. Remains 10 /25 variables (removed 15) and now considering 15/35 (removed 20) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 15 rows 10 cols
[2024-05-25 18:57:38] [INFO ] Computed 1 invariants in 1 ms
[2024-05-25 18:57:38] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:57:38] [INFO ] After 14ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 18:57:38] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 18:57:38] [INFO ] After 5ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 18:57:38] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-25 18:57:38] [INFO ] After 2ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-25 18:57:38] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-25 18:57:38] [INFO ] After 31ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-25 18:57:38] [INFO ] Flatten gal took : 4 ms
[2024-05-25 18:57:38] [INFO ] Flatten gal took : 1 ms
[2024-05-25 18:57:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16102934931938569962.gal : 1 ms
[2024-05-25 18:57:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2931532739550562901.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/ReachabilityCardinality16102934931938569962.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2931532739550562901.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/ReachabilityCardinality2931532739550562901.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 1651
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1651 after 6479
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :6479 after 2.44742e+06
Detected timeout of ITS tools.
[2024-05-25 18:57:53] [INFO ] Flatten gal took : 1 ms
[2024-05-25 18:57:53] [INFO ] Applying decomposition
[2024-05-25 18:57:53] [INFO ] Flatten gal took : 1 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/graph12221510458429087237.txt' '-o' '/tmp/graph12221510458429087237.bin' '-w' '/tmp/graph12221510458429087237.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12221510458429087237.bin' '-l' '-1' '-v' '-w' '/tmp/graph12221510458429087237.weights' '-q' '0' '-e' '0.001'
[2024-05-25 18:57:53] [INFO ] Decomposing Gal with order
[2024-05-25 18:57:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 18:57:53] [INFO ] Flatten gal took : 1 ms
[2024-05-25 18:57:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-25 18:57:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7734512672870473244.gal : 0 ms
[2024-05-25 18:57:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9425744565630082235.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/ReachabilityCardinality7734512672870473244.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9425744565630082235.prop' '--nowitness'

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 ...307
Loading property file /tmp/ReachabilityCardinality9425744565630082235.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 286
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :286 after 39234
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :39234 after 2.6145e+08
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :8.8882e+10 after 8.8882e+10
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :8.8882e+10 after 8.8882e+10
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :8.8882e+10 after 8.8882e+10
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :8.8882e+10 after 8.8882e+10
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :8.8882e+10 after 8.8882e+10
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1.93336e+11 after 8.28437e+11
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.71432e+11 after 1.79763e+11
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30137 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-25 18:58:08] [INFO ] Flatten gal took : 3 ms
[2024-05-25 18:58:08] [INFO ] Applying decomposition
[2024-05-25 18:58:08] [INFO ] Flatten gal took : 4 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/graph9361108774890447003.txt' '-o' '/tmp/graph9361108774890447003.bin' '-w' '/tmp/graph9361108774890447003.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9361108774890447003.bin' '-l' '-1' '-v' '-w' '/tmp/graph9361108774890447003.weights' '-q' '0' '-e' '0.001'
[2024-05-25 18:58:08] [INFO ] Decomposing Gal with order
[2024-05-25 18:58:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 18:58:08] [INFO ] Flatten gal took : 2 ms
[2024-05-25 18:58:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-25 18:58:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14821997908988527474.gal : 0 ms
[2024-05-25 18:58:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3305160767041065880.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/ReachabilityCardinality14821997908988527474.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3305160767041065880.prop' '--nowitness'

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 ...308
Loading property file /tmp/ReachabilityCardinality3305160767041065880.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 12
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :12 after 42
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :42 after 96
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :96 after 1248
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1248 after 212004
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :212004 after 231540
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :231540 after 1.55768e+12
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.55768e+12 after 1.56857e+12
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.56857e+12 after 1.56857e+12
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.56857e+12 after 3.39202e+12
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :3.39202e+12 after 1.12029e+13
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.12029e+13 after 2.86025e+13
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[128] Max Struct:[130]
Ending property specific reduction for Murphy-PT-D4N025-UpperBounds-08 in 90519 ms.
Starting property specific reduction for Murphy-PT-D4N025-UpperBounds-10
Current structural bounds on expressions (Initially) : Max Seen:[25] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[25] Max Struct:[130]
Current structural bounds on expressions (Before main loop) : Max Seen:[25] Max Struct:[130]
// Phase 1: matrix 35 rows 25 cols
[2024-05-25 18:58:58] [INFO ] Computed 1 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[25] Max Struct:[130]
RANDOM walk for 10021 steps (2 resets) in 10 ms. (911 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[54] Max Struct:[130]
[2024-05-25 18:58:58] [INFO ] Invariant cache hit.
[2024-05-25 18:58:58] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:58:58] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-25 18:58:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:58:58] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:58:58] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 18:58:58] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 18:58:58] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 18:58:58] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-25 18:58:58] [INFO ] Added : 0 causal constraints over 0 iterations in 8 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[54] Max Struct:[130]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[80] Max Struct:[130]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Running 20 sub problems to find dead transitions.
[2024-05-25 18:58:58] [INFO ] Invariant cache hit.
[2024-05-25 18:58:58] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 36 constraints, problems are : Problem set: 0 solved, 20 unsolved in 168 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 56 constraints, problems are : Problem set: 0 solved, 20 unsolved in 190 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 364ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 364ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 366 ms. Remains : 25/25 places, 35/35 transitions.
[2024-05-25 18:58:59] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[80] Max Struct:[130]
RANDOM walk for 1000000 steps (2 resets) in 499 ms. (2000 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 342 ms. (2915 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[102] Max Struct:[130]
[2024-05-25 18:59:00] [INFO ] Invariant cache hit.
[2024-05-25 18:59:00] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:59:00] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-25 18:59:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:59:00] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 18:59:00] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 18:59:00] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 18:59:00] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 18:59:00] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 18:59:00] [INFO ] Added : 1 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[102] Max Struct:[130]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[102] Max Struct:[130]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 25/25 places, 35/35 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2024-05-25 18:59:00] [INFO ] Invariant cache hit.
[2024-05-25 18:59:00] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-25 18:59:00] [INFO ] Invariant cache hit.
[2024-05-25 18:59:00] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 18:59:00] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2024-05-25 18:59:00] [INFO ] Redundant transitions in 1 ms returned []
Running 20 sub problems to find dead transitions.
[2024-05-25 18:59:00] [INFO ] Invariant cache hit.
[2024-05-25 18:59:00] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 36 constraints, problems are : Problem set: 0 solved, 20 unsolved in 163 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 56 constraints, problems are : Problem set: 0 solved, 20 unsolved in 224 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 390ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 392ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 454 ms. Remains : 25/25 places, 35/35 transitions.
[2024-05-25 18:59:00] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[102] Max Struct:[130]
RANDOM walk for 1000000 steps (2 resets) in 471 ms. (2118 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 351 ms. (2840 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[102] Max Struct:[130]
[2024-05-25 18:59:01] [INFO ] Invariant cache hit.
[2024-05-25 18:59:01] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:59:01] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 18:59:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 18:59:01] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 18:59:01] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 18:59:01] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 18:59:01] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 18:59:01] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 18:59:01] [INFO ] Added : 1 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 10 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[102] Max Struct:[130]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[102] Max Struct:[130]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 25/25 places, 35/35 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2024-05-25 18:59:01] [INFO ] Invariant cache hit.
[2024-05-25 18:59:01] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-25 18:59:01] [INFO ] Invariant cache hit.
[2024-05-25 18:59:01] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 18:59:01] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2024-05-25 18:59:01] [INFO ] Redundant transitions in 1 ms returned []
Running 20 sub problems to find dead transitions.
[2024-05-25 18:59:01] [INFO ] Invariant cache hit.
[2024-05-25 18:59:01] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 36 constraints, problems are : Problem set: 0 solved, 20 unsolved in 174 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 56 constraints, problems are : Problem set: 0 solved, 20 unsolved in 188 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 367ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 367ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 433 ms. Remains : 25/25 places, 35/35 transitions.
[2024-05-25 18:59:02] [INFO ] Flatten gal took : 9 ms
[2024-05-25 18:59:02] [INFO ] Flatten gal took : 1 ms
[2024-05-25 18:59:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5237536792062893975.gal : 1 ms
[2024-05-25 18:59:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18177834859123726784.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/ReachabilityCardinality5237536792062893975.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18177834859123726784.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40006 steps (8 resets) in 47 ms. (833 steps per ms) remains 2/2 properties

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/ReachabilityCardinality18177834859123726784.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :6 after 36
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :36 after 90
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :90 after 3822
BEST_FIRST walk for 40004 steps (8 resets) in 30 ms. (1290 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :3822 after 34242
SDD proceeding with computation,2 properties remain. new max is 128
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 2/2 properties
SDD size :34242 after 6.33906e+07
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :6.33906e+07 after 1.93336e+11
Interrupted probabilistic random walk after 532949 steps, run timeout after 3001 ms. (steps per millisecond=177 ) properties seen :0 out of 2
Probabilistic random walk after 532949 steps, saw 370561 distinct states, run finished after 3006 ms. (steps per millisecond=177 ) properties seen :0
[2024-05-25 18:59:05] [INFO ] Invariant cache hit.
[2024-05-25 18:59:05] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-25 18:59:05] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 15/25 variables, 10/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 10/35 variables, 5/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/35 variables, 5/22 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/35 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 25/60 variables, 15/37 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/60 variables, 0/37 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/60 variables, 0/37 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 37 constraints, problems are : Problem set: 1 solved, 1 unsolved in 58 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 15/25 variables, 10/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/35 variables, 5/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/35 variables, 5/22 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/35 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 25/60 variables, 15/37 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/60 variables, 1/38 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/60 variables, 0/38 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/60 variables, 0/38 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 38 constraints, problems are : Problem set: 1 solved, 1 unsolved in 62 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 124ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 16 ms.
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Running 20 sub problems to find dead transitions.
[2024-05-25 18:59:05] [INFO ] Invariant cache hit.
[2024-05-25 18:59:05] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 36 constraints, problems are : Problem set: 0 solved, 20 unsolved in 176 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 56 constraints, problems are : Problem set: 0 solved, 20 unsolved in 212 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 394ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 394ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 397 ms. Remains : 25/25 places, 35/35 transitions.
RANDOM walk for 40031 steps (8 resets) in 37 ms. (1053 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 21 ms. (1818 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2172071 steps, run timeout after 3001 ms. (steps per millisecond=723 ) properties seen :0 out of 1
Probabilistic random walk after 2172071 steps, saw 1516943 distinct states, run finished after 3003 ms. (steps per millisecond=723 ) properties seen :0
[2024-05-25 18:59:08] [INFO ] Invariant cache hit.
[2024-05-25 18:59:08] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-25 18:59:08] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 15/25 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 10/35 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/35 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/35 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 25/60 variables, 15/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/60 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/60 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 37 constraints, problems are : Problem set: 0 solved, 1 unsolved in 64 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 15/25 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/35 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/35 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/35 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 25/60 variables, 15/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/60 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/60 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/60 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 38 constraints, problems are : Problem set: 0 solved, 1 unsolved in 41 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 109ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 18 ms.
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 25/25 places, 35/35 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2024-05-25 18:59:08] [INFO ] Invariant cache hit.
[2024-05-25 18:59:08] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-25 18:59:08] [INFO ] Invariant cache hit.
[2024-05-25 18:59:08] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 18:59:08] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2024-05-25 18:59:08] [INFO ] Redundant transitions in 0 ms returned []
Running 20 sub problems to find dead transitions.
[2024-05-25 18:59:08] [INFO ] Invariant cache hit.
[2024-05-25 18:59:08] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 36 constraints, problems are : Problem set: 0 solved, 20 unsolved in 169 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 56 constraints, problems are : Problem set: 0 solved, 20 unsolved in 230 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 403ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 403ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 464 ms. Remains : 25/25 places, 35/35 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 60 edges and 25 vertex of which 10 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 20 output transitions
Drop transitions (Output transitions of discarded places.) removed 20 transitions
Applied a total of 1 rules in 2 ms. Remains 10 /25 variables (removed 15) and now considering 15/35 (removed 20) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 15 rows 10 cols
[2024-05-25 18:59:09] [INFO ] Computed 1 invariants in 0 ms
[2024-05-25 18:59:09] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 18:59:09] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 18:59:09] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 18:59:09] [INFO ] After 5ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 18:59:09] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-25 18:59:09] [INFO ] After 2ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-25 18:59:09] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-25 18:59:09] [INFO ] After 32ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-25 18:59:09] [INFO ] Flatten gal took : 1 ms
[2024-05-25 18:59:09] [INFO ] Flatten gal took : 1 ms
[2024-05-25 18:59:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14440423004964168416.gal : 1 ms
[2024-05-25 18:59:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14069832756445288002.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/ReachabilityCardinality14440423004964168416.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14069832756445288002.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/ReachabilityCardinality14069832756445288002.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 1651
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1651 after 6479
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :6479 after 2.44742e+06
Detected timeout of ITS tools.
[2024-05-25 18:59:24] [INFO ] Flatten gal took : 1 ms
[2024-05-25 18:59:24] [INFO ] Applying decomposition
[2024-05-25 18:59:24] [INFO ] Flatten gal took : 1 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/graph11842776450492712610.txt' '-o' '/tmp/graph11842776450492712610.bin' '-w' '/tmp/graph11842776450492712610.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11842776450492712610.bin' '-l' '-1' '-v' '-w' '/tmp/graph11842776450492712610.weights' '-q' '0' '-e' '0.001'
[2024-05-25 18:59:24] [INFO ] Decomposing Gal with order
[2024-05-25 18:59:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 18:59:24] [INFO ] Flatten gal took : 1 ms
[2024-05-25 18:59:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-25 18:59:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10970571600604227438.gal : 1 ms
[2024-05-25 18:59:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9743945069576675202.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/ReachabilityCardinality10970571600604227438.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9743945069576675202.prop' '--nowitness'

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 ...308
Loading property file /tmp/ReachabilityCardinality9743945069576675202.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 286
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :286 after 32695
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :32695 after 8.59358e+07
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :8.8882e+10 after 8.92458e+10
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :8.92458e+10 after 8.94056e+10
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :8.94056e+10 after 8.94286e+10
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :8.94286e+10 after 8.95557e+10
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :8.95557e+10 after 8.95557e+10
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1.93336e+11 after 8.28437e+11
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :5.21236e+11 after 5.22188e+11
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30122 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-25 18:59:39] [INFO ] Flatten gal took : 1 ms
[2024-05-25 18:59:39] [INFO ] Applying decomposition
[2024-05-25 18:59:39] [INFO ] Flatten gal took : 2 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/graph10100842813239962750.txt' '-o' '/tmp/graph10100842813239962750.bin' '-w' '/tmp/graph10100842813239962750.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10100842813239962750.bin' '-l' '-1' '-v' '-w' '/tmp/graph10100842813239962750.weights' '-q' '0' '-e' '0.001'
[2024-05-25 18:59:39] [INFO ] Decomposing Gal with order
[2024-05-25 18:59:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 18:59:39] [INFO ] Flatten gal took : 2 ms
[2024-05-25 18:59:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-25 18:59:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6018235571266148783.gal : 1 ms
[2024-05-25 18:59:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality998277182120713329.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/ReachabilityCardinality6018235571266148783.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality998277182120713329.prop' '--nowitness'

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 ...306
Loading property file /tmp/ReachabilityCardinality998277182120713329.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 12
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :12 after 144
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :144 after 468
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :468 after 4680
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :4680 after 210600
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :210600 after 2.79377e+12
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2.79377e+12 after 4.6442e+12
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :4.6442e+12 after 6.92021e+12
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :6.92021e+12 after 9.65069e+12
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :9.65069e+12 after 1.27873e+13
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.27873e+13 after 2.42488e+13
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :2.42488e+13 after 4.29618e+13
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[102] Max Struct:[130]
Ending property specific reduction for Murphy-PT-D4N025-UpperBounds-10 in 90686 ms.
Starting property specific reduction for Murphy-PT-D4N025-UpperBounds-13
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:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
// Phase 1: matrix 35 rows 25 cols
[2024-05-25 19:00:29] [INFO ] Computed 1 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 5 ms. (1666 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[+inf]
[2024-05-25 19:00:29] [INFO ] Invariant cache hit.
[2024-05-25 19:00:29] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 19:00:29] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 19:00:29] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 19:00:29] [INFO ] [Real]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 19:00:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 19:00:29] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 19:00:29] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-25 19:00:29] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 19:00:29] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 19:00:29] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[+inf]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Graph (complete) has 70 edges and 25 vertex of which 3 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.0 ms
Discarding 22 places :
Also discarding 30 output transitions
Drop transitions (Output transitions of discarded places.) removed 30 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 3 transition count 4
Applied a total of 2 rules in 1 ms. Remains 3 /25 variables (removed 22) and now considering 4/35 (removed 31) transitions.
Running 3 sub problems to find dead transitions.
// Phase 1: matrix 4 rows 3 cols
[2024-05-25 19:00:29] [INFO ] Computed 0 invariants in 0 ms
[2024-05-25 19:00:29] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 29 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 35 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 67ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 68ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 3/25 places, 4/35 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[1] Max Struct:[+inf]
[2024-05-25 19:00:29] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 248 ms. (4016 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 173 ms. (5747 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[+inf]
[2024-05-25 19:00:30] [INFO ] Invariant cache hit.
[2024-05-25 19:00:30] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-25 19:00:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 19:00:30] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-25 19:00:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 19:00:30] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-05-25 19:00:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-25 19:00:30] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-25 19:00:30] [INFO ] Added : 3 causal constraints over 2 iterations in 3 ms. Result :sat
Minimization took 1 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[+inf]
Support contains 1 out of 3 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 3/3 places, 4/4 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2024-05-25 19:00:30] [INFO ] Invariant cache hit.
[2024-05-25 19:00:30] [INFO ] Implicit Places using invariants in 12 ms returned []
[2024-05-25 19:00:30] [INFO ] Invariant cache hit.
[2024-05-25 19:00:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 19:00:30] [INFO ] Implicit Places using invariants and state equation in 13 ms returned []
Implicit Place search using SMT with State Equation took 26 ms to find 0 implicit places.
[2024-05-25 19:00:30] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-05-25 19:00:30] [INFO ] Invariant cache hit.
[2024-05-25 19:00:30] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 27 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 30 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 67ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 67ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 3/3 places, 4/4 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[1] Max Struct:[+inf]
[2024-05-25 19:00:30] [INFO ] Flatten gal took : 0 ms
RANDOM walk for 40000 steps (8 resets) in 22 ms. (1739 steps per ms) remains 1/1 properties
[2024-05-25 19:00:30] [INFO ] Flatten gal took : 6 ms
BEST_FIRST walk for 40004 steps (8 resets) in 17 ms. (2222 steps per ms) remains 1/1 properties
[2024-05-25 19:00:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1259135779875742742.gal : 0 ms
[2024-05-25 19:00:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8704643924267664833.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/ReachabilityCardinality1259135779875742742.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8704643924267664833.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
Probably explored full state space saw : 6 states, properties seen :0
Probabilistic random walk after 14 steps, saw 6 distinct states, run finished after 5 ms. (steps per millisecond=2 ) properties seen :0
Loading property file /tmp/ReachabilityCardinality8704643924267664833.prop.
Explored full state space saw : 6 states, properties seen :0
Exhaustive walk after 14 steps, saw 6 distinct states, run finished after 1 ms. (steps per millisecond=14 ) properties seen :0
ITS runner timed out or was interrupted.
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,6,0.001951,3812,2,8,5,44,7,0,24,26,0
Total reachable state count : 6

Verifying 1 reachability properties.
Invariant property MIN0 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
MIN0,0,0.002114,3812,1,0,5,44,7,0,25,26,0
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA Murphy-PT-D4N025-UpperBounds-13 1 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for Murphy-PT-D4N025-UpperBounds-13 in 815 ms.
Starting property specific reduction for Murphy-PT-D4N025-UpperBounds-14
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:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
// Phase 1: matrix 35 rows 25 cols
[2024-05-25 19:00:30] [INFO ] Computed 1 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10014 steps (2 resets) in 6 ms. (1430 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[+inf]
[2024-05-25 19:00:30] [INFO ] Invariant cache hit.
[2024-05-25 19:00:30] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 19:00:30] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 19:00:30] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 19:00:30] [INFO ] [Real]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 19:00:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 19:00:30] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 19:00:30] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 19:00:30] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 19:00:30] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 19:00:30] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[+inf]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Graph (complete) has 70 edges and 25 vertex of which 3 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.0 ms
Discarding 22 places :
Also discarding 30 output transitions
Drop transitions (Output transitions of discarded places.) removed 30 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 3 transition count 4
Applied a total of 2 rules in 1 ms. Remains 3 /25 variables (removed 22) and now considering 4/35 (removed 31) transitions.
Running 3 sub problems to find dead transitions.
// Phase 1: matrix 4 rows 3 cols
[2024-05-25 19:00:30] [INFO ] Computed 0 invariants in 0 ms
[2024-05-25 19:00:30] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 24 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 24 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 56ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 56ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 3/25 places, 4/35 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[1] Max Struct:[+inf]
[2024-05-25 19:00:30] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 214 ms. (4651 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 175 ms. (5681 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[+inf]
[2024-05-25 19:00:30] [INFO ] Invariant cache hit.
[2024-05-25 19:00:30] [INFO ] [Real]Absence check using state equation in 1 ms returned sat
[2024-05-25 19:00:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 19:00:30] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-25 19:00:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 19:00:30] [INFO ] [Nat]Absence check using state equation in 1 ms returned sat
[2024-05-25 19:00:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-25 19:00:30] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 19:00:30] [INFO ] Added : 3 causal constraints over 2 iterations in 4 ms. Result :sat
Minimization took 1 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[+inf]
Support contains 1 out of 3 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 3/3 places, 4/4 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2024-05-25 19:00:30] [INFO ] Invariant cache hit.
[2024-05-25 19:00:30] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-25 19:00:30] [INFO ] Invariant cache hit.
[2024-05-25 19:00:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 19:00:30] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2024-05-25 19:00:30] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-05-25 19:00:30] [INFO ] Invariant cache hit.
[2024-05-25 19:00:30] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 25 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 26 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 54ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 55ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 3/3 places, 4/4 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[1] Max Struct:[+inf]
[2024-05-25 19:00:30] [INFO ] Flatten gal took : 7 ms
[2024-05-25 19:00:30] [INFO ] Flatten gal took : 0 ms
RANDOM walk for 40002 steps (8 resets) in 21 ms. (1818 steps per ms) remains 1/1 properties
[2024-05-25 19:00:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1356143441558728593.gal : 5 ms
BEST_FIRST walk for 40004 steps (8 resets) in 16 ms. (2353 steps per ms) remains 1/1 properties
[2024-05-25 19:00:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7236962340608522753.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/ReachabilityCardinality1356143441558728593.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7236962340608522753.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
Probably explored full state space saw : 6 states, properties seen :0
Probabilistic random walk after 14 steps, saw 6 distinct states, run finished after 3 ms. (steps per millisecond=4 ) properties seen :0
Explored full state space saw : 6 states, properties seen :0
Exhaustive walk after 14 steps, saw 6 distinct states, run finished after 1 ms. (steps per millisecond=14 ) properties seen :0
ITS runner timed out or was interrupted.
Loading property file /tmp/ReachabilityCardinality7236962340608522753.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,6,0.001671,3812,2,8,5,44,7,0,24,26,0
Total reachable state count : 6

Verifying 1 reachability properties.
Invariant property MIN0 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
MIN0,0,0.001837,3812,1,0,5,44,7,0,25,26,0
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA Murphy-PT-D4N025-UpperBounds-14 1 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for Murphy-PT-D4N025-UpperBounds-14 in 747 ms.
Starting property specific reduction for Murphy-PT-D4N025-UpperBounds-15
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:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
// Phase 1: matrix 35 rows 25 cols
[2024-05-25 19:00:31] [INFO ] Computed 1 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10010 steps (2 resets) in 7 ms. (1251 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2024-05-25 19:00:31] [INFO ] Invariant cache hit.
[2024-05-25 19:00:31] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 19:00:31] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 19:00:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 19:00:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 19:00:31] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-25 19:00:31] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 19:00:31] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 19:00:31] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 19:00:31] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[+inf]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Graph (complete) has 70 edges and 25 vertex of which 3 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.0 ms
Discarding 22 places :
Also discarding 30 output transitions
Drop transitions (Output transitions of discarded places.) removed 30 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 3 transition count 4
Applied a total of 2 rules in 1 ms. Remains 3 /25 variables (removed 22) and now considering 4/35 (removed 31) transitions.
Running 3 sub problems to find dead transitions.
// Phase 1: matrix 4 rows 3 cols
[2024-05-25 19:00:31] [INFO ] Computed 0 invariants in 0 ms
[2024-05-25 19:00:31] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 27 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 32 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 65ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 65ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 3/25 places, 4/35 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
[2024-05-25 19:00:31] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 1000001 steps (2 resets) in 217 ms. (4587 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 179 ms. (5555 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2024-05-25 19:00:31] [INFO ] Invariant cache hit.
[2024-05-25 19:00:31] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-25 19:00:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 19:00:31] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-25 19:00:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 19:00:31] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-05-25 19:00:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-25 19:00:31] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 19:00:31] [INFO ] Added : 2 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 2 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[+inf]
Support contains 1 out of 3 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 3/3 places, 4/4 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2024-05-25 19:00:31] [INFO ] Invariant cache hit.
[2024-05-25 19:00:31] [INFO ] Implicit Places using invariants in 11 ms returned []
[2024-05-25 19:00:31] [INFO ] Invariant cache hit.
[2024-05-25 19:00:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 19:00:31] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
[2024-05-25 19:00:31] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-05-25 19:00:31] [INFO ] Invariant cache hit.
[2024-05-25 19:00:31] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 30 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 29 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 63ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 63ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 3/3 places, 4/4 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
[2024-05-25 19:00:31] [INFO ] Flatten gal took : 0 ms
[2024-05-25 19:00:31] [INFO ] Flatten gal took : 1 ms
[2024-05-25 19:00:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16090287642743949434.gal : 0 ms
[2024-05-25 19:00:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8396256117417375914.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/ReachabilityCardinality16090287642743949434.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8396256117417375914.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/ReachabilityCardinality8396256117417375914.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,6,0.001585,3812,2,8,5,44,7,0,24,26,0
Total reachable state count : 6

Verifying 1 reachability properties.
Invariant property MIN0 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
MIN0,0,0.001725,3812,1,0,5,44,7,0,25,26,0
RANDOM walk for 40001 steps (8 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (8 resets) in 15 ms. (2500 steps per ms) remains 1/1 properties
Probably explored full state space saw : 6 states, properties seen :0
Probabilistic random walk after 14 steps, saw 6 distinct states, run finished after 3 ms. (steps per millisecond=4 ) properties seen :0
Explored full state space saw : 6 states, properties seen :0
Exhaustive walk after 14 steps, saw 6 distinct states, run finished after 1 ms. (steps per millisecond=14 ) properties seen :0
FORMULA Murphy-PT-D4N025-UpperBounds-15 2 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for Murphy-PT-D4N025-UpperBounds-15 in 772 ms.
[2024-05-25 19:00:31] [INFO ] Flatten gal took : 2 ms
[2024-05-25 19:00:31] [INFO ] Applying decomposition
[2024-05-25 19:00:31] [INFO ] Flatten gal took : 2 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/graph6009465988411372794.txt' '-o' '/tmp/graph6009465988411372794.bin' '-w' '/tmp/graph6009465988411372794.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6009465988411372794.bin' '-l' '-1' '-v' '-w' '/tmp/graph6009465988411372794.weights' '-q' '0' '-e' '0.001'
[2024-05-25 19:00:31] [INFO ] Decomposing Gal with order
[2024-05-25 19:00:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 19:00:31] [INFO ] Flatten gal took : 2 ms
[2024-05-25 19:00:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-25 19:00:31] [INFO ] Time to serialize gal into /tmp/UpperBounds10193849787020594421.gal : 1 ms
[2024-05-25 19:00:31] [INFO ] Time to serialize properties into /tmp/UpperBounds9222171467399042053.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/UpperBounds10193849787020594421.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds9222171467399042053.prop' '--nowitness'

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 ...284
Loading property file /tmp/UpperBounds9222171467399042053.prop.
Detected timeout of ITS tools.
[2024-05-25 19:22:12] [INFO ] Flatten gal took : 2 ms
[2024-05-25 19:22:12] [INFO ] Time to serialize gal into /tmp/UpperBounds18178743271494488428.gal : 0 ms
[2024-05-25 19:22:12] [INFO ] Time to serialize properties into /tmp/UpperBounds81595477096818615.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/UpperBounds18178743271494488428.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds81595477096818615.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 ...303
Loading property file /tmp/UpperBounds81595477096818615.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,2.00126e+16,30.5285,472012,2,5274,5,1.81204e+06,6,0,173,2.0019e+06,0
Total reachable state count : 20012606308670976

Verifying 2 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 128
Bounds property Murphy-PT-D4N025-UpperBounds-08 :0 <= p1_4 <= 128
FORMULA Murphy-PT-D4N025-UpperBounds-08 128 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Murphy-PT-D4N025-UpperBounds-08,0,30.5451,472012,1,0,7,1.81204e+06,9,1,348,2.0019e+06,4
Min sum of variable value : 0
Maximum sum along a path : 128
Bounds property Murphy-PT-D4N025-UpperBounds-10 :0 <= p1_3 <= 128
FORMULA Murphy-PT-D4N025-UpperBounds-10 128 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Murphy-PT-D4N025-UpperBounds-10,0,30.5958,472012,1,0,8,1.81204e+06,10,1,506,2.0019e+06,5
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 1631407 ms.

BK_STOP 1716664962708

--------------------
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="Murphy-PT-D4N025"
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 Murphy-PT-D4N025, 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 r246-tall-171654351400325"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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