About the Execution of 2024-gold for PGCD-PT-D05N025
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r153-tall-174876824800094.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
Input is PGCD-PT-D05N025, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r153-tall-174876824800094
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 432K
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.8K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 8 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 12K May 29 14:32 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
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME PGCD-PT-D05N025-UpperBounds-00
FORMULA_NAME PGCD-PT-D05N025-UpperBounds-01
FORMULA_NAME PGCD-PT-D05N025-UpperBounds-02
FORMULA_NAME PGCD-PT-D05N025-UpperBounds-03
FORMULA_NAME PGCD-PT-D05N025-UpperBounds-04
FORMULA_NAME PGCD-PT-D05N025-UpperBounds-05
FORMULA_NAME PGCD-PT-D05N025-UpperBounds-06
FORMULA_NAME PGCD-PT-D05N025-UpperBounds-07
FORMULA_NAME PGCD-PT-D05N025-UpperBounds-08
FORMULA_NAME PGCD-PT-D05N025-UpperBounds-09
FORMULA_NAME PGCD-PT-D05N025-UpperBounds-10
FORMULA_NAME PGCD-PT-D05N025-UpperBounds-11
FORMULA_NAME PGCD-PT-D05N025-UpperBounds-12
FORMULA_NAME PGCD-PT-D05N025-UpperBounds-13
FORMULA_NAME PGCD-PT-D05N025-UpperBounds-14
FORMULA_NAME PGCD-PT-D05N025-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1748842603950
Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PGCD-PT-D05N025
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-02 05:36:45] [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]
[2025-06-02 05:36:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 05:36:45] [INFO ] Load time of PNML (sax parser for PT used): 33 ms
[2025-06-02 05:36:45] [INFO ] Transformed 18 places.
[2025-06-02 05:36:45] [INFO ] Transformed 18 transitions.
[2025-06-02 05:36:45] [INFO ] Parsed PT model containing 18 places and 18 transitions and 84 arcs in 133 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Current structural bounds on expressions (Initially) : Max Seen:[25, 1, 1, 1, 1, 25, 1, 1, 1, 1, 1, 25, 25, 1, 1, 1] 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:[25, 1, 1, 1, 1, 25, 1, 1, 1, 1, 1, 25, 25, 1, 1, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 18 rows 18 cols
[2025-06-02 05:36:45] [INFO ] Computed 7 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[25, 1, 1, 1, 1, 25, 1, 1, 1, 1, 1, 25, 25, 1, 1, 1] Max Struct:[156, 156, 156, 156, 156, 156, 156, 156, 156, 156, 156, 156, 156, 156, 156, 156]
RANDOM walk for 10007 steps (2 resets) in 32 ms. (303 steps per ms)
BEST_FIRST walk for 160012 steps (32 resets) in 122 ms. (1300 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[110, 92, 92, 96, 94, 112, 92, 96, 92, 102, 94, 114, 116, 82, 102, 82] Max Struct:[156, 156, 156, 156, 156, 156, 156, 156, 156, 156, 156, 156, 156, 156, 156, 156]
[2025-06-02 05:36:45] [INFO ] Invariant cache hit.
[2025-06-02 05:36:45] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2025-06-02 05:36:45] [INFO ] [Real]Absence check using 2 positive and 5 generalized place invariants in 2 ms returned sat
[2025-06-02 05:36:45] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2025-06-02 05:36:45] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:36:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:36:45] [INFO ] [Nat]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2025-06-02 05:36:45] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2025-06-02 05:36:45] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-02 05:36:45] [INFO ] [Nat]Added 6 Read/Feed constraints in 3 ms returned sat
[2025-06-02 05:36:45] [INFO ] Computed and/alt/rep : 6/12/6 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-02 05:36:45] [INFO ] Added : 1 causal constraints over 1 iterations in 18 ms. Result :sat
Minimization took 11 ms.
[2025-06-02 05:36:45] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:36:45] [INFO ] [Real]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2025-06-02 05:36:45] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2025-06-02 05:36:45] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:36:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-02 05:36:45] [INFO ] [Nat]Absence check using 2 positive and 5 generalized place invariants in 2 ms returned sat
[2025-06-02 05:36:45] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2025-06-02 05:36:45] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2025-06-02 05:36:45] [INFO ] Computed and/alt/rep : 6/12/6 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:36:45] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Minimization took 8 ms.
[2025-06-02 05:36:45] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2025-06-02 05:36:45] [INFO ] [Real]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2025-06-02 05:36:45] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2025-06-02 05:36:45] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:36:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:36:45] [INFO ] [Nat]Absence check using 2 positive and 5 generalized place invariants in 2 ms returned sat
[2025-06-02 05:36:45] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2025-06-02 05:36:46] [INFO ] [Nat]Added 6 Read/Feed constraints in 3 ms returned sat
[2025-06-02 05:36:46] [INFO ] Computed and/alt/rep : 6/12/6 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 05:36:46] [INFO ] Added : 0 causal constraints over 0 iterations in 8 ms. Result :sat
Minimization took 9 ms.
[2025-06-02 05:36:46] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:36:46] [INFO ] [Real]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2025-06-02 05:36:46] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2025-06-02 05:36:46] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:36:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-02 05:36:46] [INFO ] [Nat]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2025-06-02 05:36:46] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2025-06-02 05:36:46] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2025-06-02 05:36:46] [INFO ] Computed and/alt/rep : 6/12/6 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:36:46] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Minimization took 9 ms.
[2025-06-02 05:36:46] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:36:46] [INFO ] [Real]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2025-06-02 05:36:46] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2025-06-02 05:36:46] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:36:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:36:46] [INFO ] [Nat]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2025-06-02 05:36:46] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2025-06-02 05:36:46] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2025-06-02 05:36:46] [INFO ] Computed and/alt/rep : 6/12/6 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:36:46] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Minimization took 9 ms.
[2025-06-02 05:36:46] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2025-06-02 05:36:46] [INFO ] [Real]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2025-06-02 05:36:46] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2025-06-02 05:36:46] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:36:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-02 05:36:46] [INFO ] [Nat]Absence check using 2 positive and 5 generalized place invariants in 2 ms returned sat
[2025-06-02 05:36:46] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2025-06-02 05:36:46] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:36:46] [INFO ] Computed and/alt/rep : 6/12/6 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-02 05:36:46] [INFO ] Added : 1 causal constraints over 1 iterations in 19 ms. Result :sat
Minimization took 12 ms.
[2025-06-02 05:36:46] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:36:46] [INFO ] [Real]Absence check using 2 positive and 5 generalized place invariants in 2 ms returned sat
[2025-06-02 05:36:46] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2025-06-02 05:36:46] [INFO ] [Real]Added 6 Read/Feed constraints in 3 ms returned sat
[2025-06-02 05:36:46] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:36:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2025-06-02 05:36:46] [INFO ] [Nat]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2025-06-02 05:36:46] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2025-06-02 05:36:46] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:36:46] [INFO ] Computed and/alt/rep : 6/12/6 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:36:46] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Minimization took 14 ms.
[2025-06-02 05:36:46] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2025-06-02 05:36:46] [INFO ] [Real]Absence check using 2 positive and 5 generalized place invariants in 2 ms returned sat
[2025-06-02 05:36:46] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2025-06-02 05:36:46] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:36:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2025-06-02 05:36:46] [INFO ] [Nat]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2025-06-02 05:36:46] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2025-06-02 05:36:46] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:36:46] [INFO ] Computed and/alt/rep : 6/12/6 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:36:46] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 7 ms.
[2025-06-02 05:36:46] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:36:46] [INFO ] [Real]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2025-06-02 05:36:46] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2025-06-02 05:36:46] [INFO ] [Real]Added 6 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:36:46] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:36:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2025-06-02 05:36:46] [INFO ] [Nat]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2025-06-02 05:36:46] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2025-06-02 05:36:46] [INFO ] [Nat]Added 6 Read/Feed constraints in 3 ms returned sat
[2025-06-02 05:36:46] [INFO ] Computed and/alt/rep : 6/12/6 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 05:36:46] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Minimization took 10 ms.
[2025-06-02 05:36:46] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:36:46] [INFO ] [Real]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2025-06-02 05:36:46] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2025-06-02 05:36:46] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:36:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:36:46] [INFO ] [Nat]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2025-06-02 05:36:46] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2025-06-02 05:36:46] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:36:46] [INFO ] Computed and/alt/rep : 6/12/6 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-02 05:36:46] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Minimization took 9 ms.
[2025-06-02 05:36:46] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2025-06-02 05:36:46] [INFO ] [Real]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2025-06-02 05:36:46] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2025-06-02 05:36:46] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:36:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:36:46] [INFO ] [Nat]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2025-06-02 05:36:46] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2025-06-02 05:36:46] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:36:46] [INFO ] Computed and/alt/rep : 6/12/6 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:36:46] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Minimization took 8 ms.
[2025-06-02 05:36:46] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2025-06-02 05:36:46] [INFO ] [Real]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2025-06-02 05:36:46] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-06-02 05:36:46] [INFO ] [Real]Added 6 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:36:46] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:36:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:36:46] [INFO ] [Nat]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2025-06-02 05:36:46] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2025-06-02 05:36:46] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:36:46] [INFO ] Computed and/alt/rep : 6/12/6 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:36:46] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 8 ms.
[2025-06-02 05:36:46] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:36:46] [INFO ] [Real]Absence check using 2 positive and 5 generalized place invariants in 2 ms returned sat
[2025-06-02 05:36:46] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2025-06-02 05:36:46] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:36:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-02 05:36:46] [INFO ] [Nat]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2025-06-02 05:36:46] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2025-06-02 05:36:46] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:36:46] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 11 ms to minimize.
[2025-06-02 05:36:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2025-06-02 05:36:46] [INFO ] Computed and/alt/rep : 6/12/6 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 05:36:46] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 11 ms.
[2025-06-02 05:36:46] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:36:46] [INFO ] [Real]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2025-06-02 05:36:47] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2025-06-02 05:36:47] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:36:47] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:36:47] [INFO ] [Nat]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2025-06-02 05:36:47] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2025-06-02 05:36:47] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:36:47] [INFO ] Computed and/alt/rep : 6/12/6 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 05:36:47] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Minimization took 7 ms.
[2025-06-02 05:36:47] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:36:47] [INFO ] [Real]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2025-06-02 05:36:47] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2025-06-02 05:36:47] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:36:47] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:36:47] [INFO ] [Nat]Absence check using 2 positive and 5 generalized place invariants in 5 ms returned sat
[2025-06-02 05:36:47] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2025-06-02 05:36:47] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:36:47] [INFO ] Computed and/alt/rep : 6/12/6 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:36:47] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 8 ms.
[2025-06-02 05:36:47] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:36:47] [INFO ] [Real]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2025-06-02 05:36:47] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2025-06-02 05:36:47] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:36:47] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:36:47] [INFO ] [Nat]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2025-06-02 05:36:47] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2025-06-02 05:36:47] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:36:47] [INFO ] Computed and/alt/rep : 6/12/6 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:36:47] [INFO ] Added : 0 causal constraints over 0 iterations in 16 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[110, 92, 92, 96, 94, 112, 92, 96, 92, 102, 94, 114, 116, 82, 102, 82] Max Struct:[156, 156, 156, 156, 156, 156, 156, 156, 156, 156, 156, 156, 156, 156, 156, 156]
FORMULA PGCD-PT-D05N025-UpperBounds-15 156 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA PGCD-PT-D05N025-UpperBounds-13 156 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA PGCD-PT-D05N025-UpperBounds-14 156 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA PGCD-PT-D05N025-UpperBounds-09 156 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA PGCD-PT-D05N025-UpperBounds-08 156 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA PGCD-PT-D05N025-UpperBounds-06 156 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA PGCD-PT-D05N025-UpperBounds-07 156 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA PGCD-PT-D05N025-UpperBounds-03 156 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA PGCD-PT-D05N025-UpperBounds-02 156 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA PGCD-PT-D05N025-UpperBounds-01 156 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[154, 154, 154, 154, 152, 148] Max Struct:[156, 156, 156, 156, 156, 156]
Support contains 6 out of 18 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 18/18 transitions.
Applied a total of 0 rules in 9 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Running 6 sub problems to find dead transitions.
[2025-06-02 05:36:47] [INFO ] Invariant cache hit.
[2025-06-02 05:36:47] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 6/18 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 18/36 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 6/31 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/36 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/36 variables, and 31 constraints, problems are : Problem set: 0 solved, 6 unsolved in 91 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 18/18 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 6/18 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 18/36 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 6/31 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 6/37 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/36 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/36 variables, and 37 constraints, problems are : Problem set: 0 solved, 6 unsolved in 70 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 18/18 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 180ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 186ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 205 ms. Remains : 18/18 places, 18/18 transitions.
[2025-06-02 05:36:48] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[154, 154, 154, 154, 152, 148] Max Struct:[156, 156, 156, 156, 156, 156]
RANDOM walk for 1000033 steps (2 resets) in 221 ms. (4504 steps per ms)
BEST_FIRST walk for 6000004 steps (676 resets) in 2071 ms. (2895 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[154, 154, 154, 154, 152, 148] Max Struct:[156, 156, 156, 156, 156, 156]
[2025-06-02 05:36:50] [INFO ] Invariant cache hit.
[2025-06-02 05:36:50] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:36:50] [INFO ] [Real]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2025-06-02 05:36:50] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-06-02 05:36:50] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:36:50] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2025-06-02 05:36:50] [INFO ] [Nat]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2025-06-02 05:36:50] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2025-06-02 05:36:50] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-02 05:36:50] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:36:50] [INFO ] Computed and/alt/rep : 6/12/6 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:36:50] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 6 ms.
[2025-06-02 05:36:50] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:36:50] [INFO ] [Real]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2025-06-02 05:36:50] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2025-06-02 05:36:50] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:36:50] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:36:50] [INFO ] [Nat]Absence check using 2 positive and 5 generalized place invariants in 0 ms returned sat
[2025-06-02 05:36:50] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2025-06-02 05:36:50] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:36:50] [INFO ] Computed and/alt/rep : 6/12/6 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:36:50] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Minimization took 6 ms.
[2025-06-02 05:36:50] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:36:50] [INFO ] [Real]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2025-06-02 05:36:50] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2025-06-02 05:36:50] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:36:50] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2025-06-02 05:36:50] [INFO ] [Nat]Absence check using 2 positive and 5 generalized place invariants in 7 ms returned sat
[2025-06-02 05:36:50] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2025-06-02 05:36:50] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2025-06-02 05:36:50] [INFO ] Computed and/alt/rep : 6/12/6 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:36:50] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 5 ms.
[2025-06-02 05:36:50] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:36:50] [INFO ] [Real]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2025-06-02 05:36:50] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2025-06-02 05:36:50] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:36:50] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:36:50] [INFO ] [Nat]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2025-06-02 05:36:50] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2025-06-02 05:36:50] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:36:50] [INFO ] Computed and/alt/rep : 6/12/6 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:36:50] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Minimization took 6 ms.
[2025-06-02 05:36:50] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:36:50] [INFO ] [Real]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2025-06-02 05:36:50] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2025-06-02 05:36:50] [INFO ] [Real]Added 6 Read/Feed constraints in 2 ms returned sat
[2025-06-02 05:36:50] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:36:50] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:36:50] [INFO ] [Nat]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2025-06-02 05:36:50] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2025-06-02 05:36:50] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:36:50] [INFO ] Computed and/alt/rep : 6/12/6 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:36:50] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 7 ms.
[2025-06-02 05:36:50] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:36:50] [INFO ] [Real]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2025-06-02 05:36:50] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2025-06-02 05:36:50] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:36:50] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2025-06-02 05:36:50] [INFO ] [Nat]Absence check using 2 positive and 5 generalized place invariants in 0 ms returned sat
[2025-06-02 05:36:50] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2025-06-02 05:36:50] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:36:50] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
[2025-06-02 05:36:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2025-06-02 05:36:50] [INFO ] Computed and/alt/rep : 6/12/6 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:36:50] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[154, 154, 154, 154, 152, 148] Max Struct:[156, 156, 156, 156, 156, 156]
FORMULA PGCD-PT-D05N025-UpperBounds-10 156 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA PGCD-PT-D05N025-UpperBounds-04 156 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[154, 154, 154, 152] Max Struct:[156, 156, 156, 156]
Support contains 4 out of 18 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 18/18 places, 18/18 transitions.
[2025-06-02 05:36:51] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[154, 154, 154, 152] Max Struct:[156, 156, 156, 156]
RANDOM walk for 1000006 steps (2 resets) in 196 ms. (5076 steps per ms)
BEST_FIRST walk for 4000004 steps (677 resets) in 1298 ms. (3079 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[154, 154, 154, 152] Max Struct:[156, 156, 156, 156]
[2025-06-02 05:36:52] [INFO ] Invariant cache hit.
[2025-06-02 05:36:52] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:36:52] [INFO ] [Real]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2025-06-02 05:36:52] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2025-06-02 05:36:52] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:36:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:36:52] [INFO ] [Nat]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2025-06-02 05:36:52] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2025-06-02 05:36:52] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-02 05:36:52] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:36:52] [INFO ] Computed and/alt/rep : 6/12/6 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:36:52] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 6 ms.
[2025-06-02 05:36:52] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:36:52] [INFO ] [Real]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2025-06-02 05:36:52] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2025-06-02 05:36:52] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:36:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:36:52] [INFO ] [Nat]Absence check using 2 positive and 5 generalized place invariants in 0 ms returned sat
[2025-06-02 05:36:52] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2025-06-02 05:36:52] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2025-06-02 05:36:52] [INFO ] Computed and/alt/rep : 6/12/6 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:36:52] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 5 ms.
[2025-06-02 05:36:52] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2025-06-02 05:36:52] [INFO ] [Real]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2025-06-02 05:36:52] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2025-06-02 05:36:52] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:36:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2025-06-02 05:36:52] [INFO ] [Nat]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2025-06-02 05:36:52] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2025-06-02 05:36:52] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:36:52] [INFO ] Computed and/alt/rep : 6/12/6 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:36:52] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 7 ms.
[2025-06-02 05:36:52] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:36:52] [INFO ] [Real]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2025-06-02 05:36:52] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2025-06-02 05:36:52] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:36:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:36:52] [INFO ] [Nat]Absence check using 2 positive and 5 generalized place invariants in 0 ms returned sat
[2025-06-02 05:36:52] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2025-06-02 05:36:52] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:36:52] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 1 ms to minimize.
[2025-06-02 05:36:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 24 ms
[2025-06-02 05:36:52] [INFO ] Computed and/alt/rep : 6/12/6 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:36:52] [INFO ] Added : 1 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 16 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[154, 154, 154, 152] Max Struct:[156, 156, 156, 156]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[154, 154, 154, 152] Max Struct:[156, 156, 156, 156]
Support contains 4 out of 18 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 18/18 places, 18/18 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2025-06-02 05:36:53] [INFO ] Invariant cache hit.
[2025-06-02 05:36:53] [INFO ] Implicit Places using invariants in 44 ms returned [12, 13, 14, 15, 16, 17]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 48 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 12/18 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 50 ms. Remains : 12/18 places, 18/18 transitions.
// Phase 1: matrix 18 rows 12 cols
[2025-06-02 05:36:53] [INFO ] Computed 1 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[154, 154, 154, 152] Max Struct:[156, 156, 156, 156]
RANDOM walk for 1000002 steps (2 resets) in 162 ms. (6134 steps per ms)
BEST_FIRST walk for 4000003 steps (690 resets) in 1009 ms. (3960 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[154, 154, 154, 152] Max Struct:[156, 156, 156, 156]
[2025-06-02 05:36:54] [INFO ] Invariant cache hit.
[2025-06-02 05:36:54] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-02 05:36:54] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2025-06-02 05:36:54] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:36:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 05:36:54] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2025-06-02 05:36:54] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-02 05:36:54] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:36:54] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 2 ms to minimize.
[2025-06-02 05:36:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 26 ms
[2025-06-02 05:36:54] [INFO ] Computed and/alt/rep : 6/12/6 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 05:36:54] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 4 ms.
[2025-06-02 05:36:54] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 05:36:54] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2025-06-02 05:36:54] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:36:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 05:36:54] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2025-06-02 05:36:54] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:36:54] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
[2025-06-02 05:36:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 27 ms
[2025-06-02 05:36:54] [INFO ] Computed and/alt/rep : 6/12/6 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:36:54] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 5 ms.
[2025-06-02 05:36:54] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-02 05:36:54] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2025-06-02 05:36:54] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:36:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-02 05:36:54] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2025-06-02 05:36:54] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:36:54] [INFO ] Computed and/alt/rep : 6/12/6 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 05:36:54] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 7 ms.
[2025-06-02 05:36:54] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-02 05:36:54] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2025-06-02 05:36:54] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:36:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-02 05:36:54] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2025-06-02 05:36:54] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:36:54] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
[2025-06-02 05:36:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2025-06-02 05:36:54] [INFO ] Computed and/alt/rep : 6/12/6 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:36:54] [INFO ] Added : 1 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[154, 154, 154, 152] Max Struct:[156, 156, 156, 156]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[154, 154, 154, 152] Max Struct:[156, 156, 156, 156]
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 12/12 places, 18/18 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2025-06-02 05:36:54] [INFO ] Invariant cache hit.
[2025-06-02 05:36:54] [INFO ] Implicit Places using invariants in 24 ms returned []
[2025-06-02 05:36:54] [INFO ] Invariant cache hit.
[2025-06-02 05:36:54] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-02 05:36:54] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2025-06-02 05:36:54] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-02 05:36:54] [INFO ] Invariant cache hit.
[2025-06-02 05:36:54] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 6/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 18/30 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/30 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 30/30 variables, and 19 constraints, problems are : Problem set: 0 solved, 6 unsolved in 56 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 6/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 18/30 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/30 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 30/30 variables, and 25 constraints, problems are : Problem set: 0 solved, 6 unsolved in 56 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 116ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 117ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 176 ms. Remains : 12/12 places, 18/18 transitions.
RANDOM walk for 40055 steps (8 resets) in 302 ms. (132 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 168 ms. (236 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 207 ms. (192 steps per ms) remains 8/8 properties
[2025-06-02 05:36:55] [INFO ] Flatten gal took : 24 ms
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 8/8 properties
[2025-06-02 05:36:55] [INFO ] Flatten gal took : 4 ms
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 8/8 properties
[2025-06-02 05:36:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3807923615793771401.gal : 3 ms
[2025-06-02 05:36:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12354094196343477256.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/ReachabilityCardinality3807923615793771401.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12354094196343477256.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/ReachabilityCardinality12354094196343477256.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :19 after 1651
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 8/8 properties
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :1651 after 6479
BEST_FIRST walk for 40003 steps (8 resets) in 71 ms. (555 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 50 ms. (784 steps per ms) remains 8/8 properties
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :6479 after 2.44742e+06
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :2.44742e+06 after 3.40467e+10
Interrupted probabilistic random walk after 360113 steps, run timeout after 3001 ms. (steps per millisecond=119 ) properties seen :0 out of 8
Probabilistic random walk after 360113 steps, saw 222475 distinct states, run finished after 3004 ms. (steps per millisecond=119 ) properties seen :0
[2025-06-02 05:36:58] [INFO ] Invariant cache hit.
[2025-06-02 05:36:58] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 8/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2025-06-02 05:36:58] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
Problem MAX1 is UNSAT
Problem MAX2 is UNSAT
Problem MAX3 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 1/2 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 18/30 variables, 12/14 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 6/20 constraints. Problems are: Problem set: 4 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/20 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/30 variables, 0/20 constraints. Problems are: Problem set: 4 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 30/30 variables, and 20 constraints, problems are : Problem set: 4 solved, 4 unsolved in 118 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 4 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 8/12 variables, 1/1 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 1/2 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 18/30 variables, 12/14 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 6/20 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 4/24 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/30 variables, 0/24 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/30 variables, 0/24 constraints. Problems are: Problem set: 4 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 30/30 variables, and 24 constraints, problems are : Problem set: 4 solved, 4 unsolved in 80 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 4/8 constraints, Known Traps: 1/1 constraints]
After SMT, in 202ms problems are : Problem set: 4 solved, 4 unsolved
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :2.10517e+12 after 2.225e+12
Parikh walk visited 0 properties in 1597 ms.
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 18/18 transitions.
Applied a total of 0 rules in 5 ms. Remains 12 /12 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Running 6 sub problems to find dead transitions.
[2025-06-02 05:37:00] [INFO ] Invariant cache hit.
[2025-06-02 05:37:00] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 6/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 18/30 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/30 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 30/30 variables, and 19 constraints, problems are : Problem set: 0 solved, 6 unsolved in 57 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 6/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 18/30 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/30 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 30/30 variables, and 25 constraints, problems are : Problem set: 0 solved, 6 unsolved in 54 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 118ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 118ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 126 ms. Remains : 12/12 places, 18/18 transitions.
RANDOM walk for 40043 steps (8 resets) in 50 ms. (785 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 60 ms. (655 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 49 ms. (800 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 61 ms. (645 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 317531 steps, run timeout after 3001 ms. (steps per millisecond=105 ) properties seen :0 out of 4
Probabilistic random walk after 317531 steps, saw 196790 distinct states, run finished after 3001 ms. (steps per millisecond=105 ) properties seen :0
[2025-06-02 05:37:03] [INFO ] Invariant cache hit.
[2025-06-02 05:37:03] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 8/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2025-06-02 05:37:03] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 18/30 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/30 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 30/30 variables, and 20 constraints, problems are : Problem set: 0 solved, 4 unsolved in 97 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 8/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 18/30 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/30 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/30 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 30/30 variables, and 24 constraints, problems are : Problem set: 0 solved, 4 unsolved in 51 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 156ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 1912 ms.
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 12/12 places, 18/18 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 18/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 12 /12 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2025-06-02 05:37:05] [INFO ] Invariant cache hit.
[2025-06-02 05:37:05] [INFO ] Implicit Places using invariants in 16 ms returned []
[2025-06-02 05:37:05] [INFO ] Invariant cache hit.
[2025-06-02 05:37:05] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-02 05:37:05] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2025-06-02 05:37:05] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-02 05:37:05] [INFO ] Invariant cache hit.
[2025-06-02 05:37:05] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 6/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 18/30 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/30 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 30/30 variables, and 19 constraints, problems are : Problem set: 0 solved, 6 unsolved in 71 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 6/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 18/30 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/30 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 30/30 variables, and 25 constraints, problems are : Problem set: 0 solved, 6 unsolved in 80 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 155ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 156ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 212 ms. Remains : 12/12 places, 18/18 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-02 05:37:05] [INFO ] Flatten gal took : 3 ms
[2025-06-02 05:37:05] [INFO ] Applying decomposition
[2025-06-02 05:37:05] [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/graph3588796553158137576.txt' '-o' '/tmp/graph3588796553158137576.bin' '-w' '/tmp/graph3588796553158137576.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3588796553158137576.bin' '-l' '-1' '-v' '-w' '/tmp/graph3588796553158137576.weights' '-q' '0' '-e' '0.001'
[2025-06-02 05:37:05] [INFO ] Decomposing Gal with order
[2025-06-02 05:37:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 05:37:05] [INFO ] Flatten gal took : 29 ms
[2025-06-02 05:37:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-02 05:37:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6094795303289381140.gal : 2 ms
[2025-06-02 05:37:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17762107387579952297.prop : 74 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/ReachabilityCardinality6094795303289381140.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17762107387579952297.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/ReachabilityCardinality17762107387579952297.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :19 after 286
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :286 after 32695
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :32695 after 2.44725e+06
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :4.33137e+13 after 4.33201e+13
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :4.33201e+13 after 4.33201e+13
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :4.33201e+13 after 4.33202e+13
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :4.33202e+13 after 4.652e+13
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :4.652e+13 after 4.67318e+13
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :4.67318e+13 after 4.67325e+13
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[154, 154, 154, 152] Max Struct:[156, 156, 156, 156]
Starting property specific reduction for PGCD-PT-D05N025-UpperBounds-00
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:[156]
Current structural bounds on expressions (Before main loop) : Max Seen:[25] Max Struct:[156]
[2025-06-02 05:37:55] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[25] Max Struct:[156]
RANDOM walk for 10001 steps (2 resets) in 3 ms. (2500 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:[111] Max Struct:[156]
[2025-06-02 05:37:55] [INFO ] Invariant cache hit.
[2025-06-02 05:37:55] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 05:37:55] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2025-06-02 05:37:55] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-02 05:37:55] [INFO ] [Real]Added 6 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:37:55] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:37:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 05:37:55] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2025-06-02 05:37:55] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:37:55] [INFO ] Computed and/alt/rep : 6/12/6 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:37:55] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 13 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[111] Max Struct:[156]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[152] Max Struct:[156]
Support contains 1 out of 12 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Running 6 sub problems to find dead transitions.
[2025-06-02 05:37:56] [INFO ] Invariant cache hit.
[2025-06-02 05:37:56] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 6/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 18/30 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/30 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 30/30 variables, and 19 constraints, problems are : Problem set: 0 solved, 6 unsolved in 61 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 6/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 18/30 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/30 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 30/30 variables, and 25 constraints, problems are : Problem set: 0 solved, 6 unsolved in 68 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 135ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 135ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 136 ms. Remains : 12/12 places, 18/18 transitions.
[2025-06-02 05:37:56] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[152] Max Struct:[156]
RANDOM walk for 1000004 steps (2 resets) in 173 ms. (5747 steps per ms)
BEST_FIRST walk for 1000001 steps (173 resets) in 256 ms. (3891 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[152] Max Struct:[156]
[2025-06-02 05:37:56] [INFO ] Invariant cache hit.
[2025-06-02 05:37:56] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 05:37:56] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-06-02 05:37:56] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:37:56] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 05:37:56] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2025-06-02 05:37:56] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-02 05:37:56] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:37:56] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 0 ms to minimize.
[2025-06-02 05:37:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 23 ms
[2025-06-02 05:37:56] [INFO ] Computed and/alt/rep : 6/12/6 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 05:37:56] [INFO ] Added : 1 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[152] Max Struct:[156]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[152] Max Struct:[156]
Support contains 1 out of 12 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 12/12 places, 18/18 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2025-06-02 05:37:56] [INFO ] Invariant cache hit.
[2025-06-02 05:37:56] [INFO ] Implicit Places using invariants in 21 ms returned []
[2025-06-02 05:37:56] [INFO ] Invariant cache hit.
[2025-06-02 05:37:56] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-02 05:37:56] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2025-06-02 05:37:56] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-02 05:37:56] [INFO ] Invariant cache hit.
[2025-06-02 05:37:56] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 6/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 18/30 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/30 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 30/30 variables, and 19 constraints, problems are : Problem set: 0 solved, 6 unsolved in 61 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 6/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 18/30 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/30 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 30/30 variables, and 25 constraints, problems are : Problem set: 0 solved, 6 unsolved in 62 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 127ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 127ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 186 ms. Remains : 12/12 places, 18/18 transitions.
[2025-06-02 05:37:56] [INFO ] Flatten gal took : 4 ms
RANDOM walk for 40058 steps (8 resets) in 19 ms. (2002 steps per ms) remains 2/2 properties
[2025-06-02 05:37:56] [INFO ] Flatten gal took : 3 ms
[2025-06-02 05:37:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12421559484025401368.gal : 2 ms
[2025-06-02 05:37:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16405357318583498628.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/ReachabilityCardinality12421559484025401368.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16405357318583498628.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/ReachabilityCardinality16405357318583498628.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10 after 19
BEST_FIRST walk for 40004 steps (8 resets) in 19 ms. (2000 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :19 after 1651
BEST_FIRST walk for 40004 steps (8 resets) in 21 ms. (1818 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1651 after 6479
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :6479 after 2.44742e+06
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :2.44742e+06 after 3.40467e+10
Interrupted probabilistic random walk after 1007966 steps, run timeout after 3001 ms. (steps per millisecond=335 ) properties seen :0 out of 2
Probabilistic random walk after 1007966 steps, saw 611120 distinct states, run finished after 3001 ms. (steps per millisecond=335 ) properties seen :0
[2025-06-02 05:37:59] [INFO ] Invariant cache hit.
[2025-06-02 05:37:59] [INFO ] State equation strengthened by 6 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) 11/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 05:38:00] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 18/30 variables, 12/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 6/20 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/20 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/30 variables, 0/20 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 30/30 variables, and 20 constraints, problems are : Problem set: 1 solved, 1 unsolved in 50 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 6/6 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) 11/12 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 18/30 variables, 12/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 6/20 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 1/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/30 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/30 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 30/30 variables, and 21 constraints, problems are : Problem set: 1 solved, 1 unsolved in 30 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 83ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 746 steps, including 3 resets, run visited all 1 properties in 2 ms. (steps per millisecond=373 )
Parikh walk visited 1 properties in 8 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[152] Max Struct:[156]
Ending property specific reduction for PGCD-PT-D05N025-UpperBounds-00 in 4145 ms.
Starting property specific reduction for PGCD-PT-D05N025-UpperBounds-05
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:[156]
Current structural bounds on expressions (Before main loop) : Max Seen:[25] Max Struct:[156]
[2025-06-02 05:38:00] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[25] Max Struct:[156]
RANDOM walk for 10024 steps (2 resets) in 3 ms. (2506 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:[116] Max Struct:[156]
[2025-06-02 05:38:00] [INFO ] Invariant cache hit.
[2025-06-02 05:38:00] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 05:38:00] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2025-06-02 05:38:00] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:38:00] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-02 05:38:00] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2025-06-02 05:38:00] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-02 05:38:00] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:38:00] [INFO ] Computed and/alt/rep : 6/12/6 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:38:00] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[116] Max Struct:[156]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[150] Max Struct:[156]
Support contains 1 out of 12 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Running 6 sub problems to find dead transitions.
[2025-06-02 05:38:00] [INFO ] Invariant cache hit.
[2025-06-02 05:38:00] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 6/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 18/30 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/30 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 30/30 variables, and 19 constraints, problems are : Problem set: 0 solved, 6 unsolved in 64 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 6/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 18/30 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/30 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 30/30 variables, and 25 constraints, problems are : Problem set: 0 solved, 6 unsolved in 67 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 133ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 133ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 134 ms. Remains : 12/12 places, 18/18 transitions.
[2025-06-02 05:38:00] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[150] Max Struct:[156]
RANDOM walk for 1000006 steps (2 resets) in 186 ms. (5347 steps per ms)
BEST_FIRST walk for 1000000 steps (173 resets) in 243 ms. (4098 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[150] Max Struct:[156]
[2025-06-02 05:38:00] [INFO ] Invariant cache hit.
[2025-06-02 05:38:00] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-02 05:38:00] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2025-06-02 05:38:00] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:38:00] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 05:38:00] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2025-06-02 05:38:00] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-02 05:38:00] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:38:00] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 1 ms to minimize.
[2025-06-02 05:38:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 21 ms
[2025-06-02 05:38:00] [INFO ] Computed and/alt/rep : 6/12/6 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 05:38:00] [INFO ] Added : 1 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[150] Max Struct:[156]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[154] Max Struct:[156]
Support contains 1 out of 12 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 18/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 12 /12 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 12/12 places, 18/18 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2025-06-02 05:38:00] [INFO ] Invariant cache hit.
[2025-06-02 05:38:00] [INFO ] Implicit Places using invariants in 25 ms returned []
[2025-06-02 05:38:00] [INFO ] Invariant cache hit.
[2025-06-02 05:38:00] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-02 05:38:00] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2025-06-02 05:38:00] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-02 05:38:00] [INFO ] Invariant cache hit.
[2025-06-02 05:38:00] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 6/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 18/30 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/30 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 30/30 variables, and 19 constraints, problems are : Problem set: 0 solved, 6 unsolved in 55 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 6/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 18/30 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/30 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 30/30 variables, and 25 constraints, problems are : Problem set: 0 solved, 6 unsolved in 52 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 113ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 114ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 170 ms. Remains : 12/12 places, 18/18 transitions.
[2025-06-02 05:38:01] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[154] Max Struct:[156]
RANDOM walk for 1000002 steps (2 resets) in 160 ms. (6211 steps per ms)
BEST_FIRST walk for 1000001 steps (174 resets) in 248 ms. (4016 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[154] Max Struct:[156]
[2025-06-02 05:38:01] [INFO ] Invariant cache hit.
[2025-06-02 05:38:01] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-02 05:38:01] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2025-06-02 05:38:01] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:38:01] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 05:38:01] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2025-06-02 05:38:01] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-02 05:38:01] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:38:01] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
[2025-06-02 05:38:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 24 ms
[2025-06-02 05:38:01] [INFO ] Computed and/alt/rep : 6/12/6 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:38:01] [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:[154] Max Struct:[156]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[154] Max Struct:[156]
Support contains 1 out of 12 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 12/12 places, 18/18 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2025-06-02 05:38:01] [INFO ] Invariant cache hit.
[2025-06-02 05:38:01] [INFO ] Implicit Places using invariants in 25 ms returned []
[2025-06-02 05:38:01] [INFO ] Invariant cache hit.
[2025-06-02 05:38:01] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-02 05:38:01] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2025-06-02 05:38:01] [INFO ] Redundant transitions in 1 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-02 05:38:01] [INFO ] Invariant cache hit.
[2025-06-02 05:38:01] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 6/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 18/30 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/30 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 30/30 variables, and 19 constraints, problems are : Problem set: 0 solved, 6 unsolved in 58 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 6/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 18/30 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/30 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 30/30 variables, and 25 constraints, problems are : Problem set: 0 solved, 6 unsolved in 59 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 120ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 120ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 187 ms. Remains : 12/12 places, 18/18 transitions.
[2025-06-02 05:38:01] [INFO ] Flatten gal took : 5 ms
[2025-06-02 05:38:01] [INFO ] Flatten gal took : 4 ms
[2025-06-02 05:38:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4415695604978792348.gal : 1 ms
[2025-06-02 05:38:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13722260314841510274.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/ReachabilityCardinality4415695604978792348.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13722260314841510274.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40075 steps (8 resets) in 24 ms. (1603 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/ReachabilityCardinality13722260314841510274.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :19 after 1651
BEST_FIRST walk for 40003 steps (8 resets) in 28 ms. (1379 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1651 after 6479
BEST_FIRST walk for 40004 steps (8 resets) in 37 ms. (1052 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :6479 after 2.44742e+06
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :2.44742e+06 after 3.40467e+10
Interrupted probabilistic random walk after 899756 steps, run timeout after 3001 ms. (steps per millisecond=299 ) properties seen :0 out of 2
Probabilistic random walk after 899756 steps, saw 549113 distinct states, run finished after 3001 ms. (steps per millisecond=299 ) properties seen :0
[2025-06-02 05:38:04] [INFO ] Invariant cache hit.
[2025-06-02 05:38:04] [INFO ] State equation strengthened by 6 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) 11/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 05:38:04] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 18/30 variables, 12/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 6/20 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/20 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/30 variables, 0/20 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 30/30 variables, and 20 constraints, problems are : Problem set: 1 solved, 1 unsolved in 61 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 6/6 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) 11/12 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 18/30 variables, 12/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 6/20 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 1/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/30 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/30 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 30/30 variables, and 21 constraints, problems are : Problem set: 1 solved, 1 unsolved in 32 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 96ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 46 ms.
Support contains 1 out of 12 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Running 6 sub problems to find dead transitions.
[2025-06-02 05:38:04] [INFO ] Invariant cache hit.
[2025-06-02 05:38:04] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 6/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 18/30 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/30 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 30/30 variables, and 19 constraints, problems are : Problem set: 0 solved, 6 unsolved in 52 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 6/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 18/30 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/30 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 30/30 variables, and 25 constraints, problems are : Problem set: 0 solved, 6 unsolved in 54 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 108ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 109ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 12/12 places, 18/18 transitions.
RANDOM walk for 40058 steps (8 resets) in 13 ms. (2861 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 17 ms. (2222 steps per ms) remains 1/1 properties
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :2.10517e+12 after 2.225e+12
Interrupted probabilistic random walk after 3214667 steps, run timeout after 3038 ms. (steps per millisecond=1058 ) properties seen :0 out of 1
Probabilistic random walk after 3214667 steps, saw 1874265 distinct states, run finished after 3039 ms. (steps per millisecond=1057 ) properties seen :0
[2025-06-02 05:38:08] [INFO ] Invariant cache hit.
[2025-06-02 05:38:08] [INFO ] State equation strengthened by 6 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) 11/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 05:38:08] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 18/30 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/30 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 30/30 variables, and 20 constraints, problems are : Problem set: 0 solved, 1 unsolved in 51 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 6/6 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) 11/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 18/30 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/30 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/30 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 30/30 variables, and 21 constraints, problems are : Problem set: 0 solved, 1 unsolved in 29 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 81ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 28 ms.
Support contains 1 out of 12 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 12/12 places, 18/18 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2025-06-02 05:38:08] [INFO ] Invariant cache hit.
[2025-06-02 05:38:08] [INFO ] Implicit Places using invariants in 21 ms returned []
[2025-06-02 05:38:08] [INFO ] Invariant cache hit.
[2025-06-02 05:38:08] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-02 05:38:08] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2025-06-02 05:38:08] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-02 05:38:08] [INFO ] Invariant cache hit.
[2025-06-02 05:38:08] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 6/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 18/30 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/30 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 30/30 variables, and 19 constraints, problems are : Problem set: 0 solved, 6 unsolved in 46 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 6/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 18/30 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/30 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 30/30 variables, and 25 constraints, problems are : Problem set: 0 solved, 6 unsolved in 47 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 94ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 94ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 144 ms. Remains : 12/12 places, 18/18 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-02 05:38:08] [INFO ] Flatten gal took : 2 ms
[2025-06-02 05:38:08] [INFO ] Applying decomposition
[2025-06-02 05:38:08] [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/graph18007066183383550931.txt' '-o' '/tmp/graph18007066183383550931.bin' '-w' '/tmp/graph18007066183383550931.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18007066183383550931.bin' '-l' '-1' '-v' '-w' '/tmp/graph18007066183383550931.weights' '-q' '0' '-e' '0.001'
[2025-06-02 05:38:08] [INFO ] Decomposing Gal with order
[2025-06-02 05:38:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 05:38:08] [INFO ] Flatten gal took : 2 ms
[2025-06-02 05:38:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-02 05:38:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13899889663676862441.gal : 1 ms
[2025-06-02 05:38:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7596594572208739648.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/ReachabilityCardinality13899889663676862441.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7596594572208739648.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/ReachabilityCardinality7596594572208739648.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 9.10046e+07
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :9.10046e+07 after 2.41627e+13
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2.41627e+13 after 2.42631e+13
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2.42631e+13 after 2.42631e+13
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2.42631e+13 after 2.59113e+13
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2.59113e+13 after 2.59114e+13
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :5.08346e+13 after 5.35244e+13
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[154] Max Struct:[156]
Ending property specific reduction for PGCD-PT-D05N025-UpperBounds-05 in 58371 ms.
Starting property specific reduction for PGCD-PT-D05N025-UpperBounds-11
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:[156]
Current structural bounds on expressions (Before main loop) : Max Seen:[25] Max Struct:[156]
[2025-06-02 05:38:58] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[25] Max Struct:[156]
RANDOM walk for 10001 steps (2 resets) in 4 ms. (2000 steps per ms)
BEST_FIRST walk for 10000 steps (2 resets) in 4 ms. (2000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[108] Max Struct:[156]
[2025-06-02 05:38:58] [INFO ] Invariant cache hit.
[2025-06-02 05:38:58] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 05:38:58] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2025-06-02 05:38:58] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:38:58] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 05:38:58] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2025-06-02 05:38:58] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-02 05:38:58] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2025-06-02 05:38:58] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 1 ms to minimize.
[2025-06-02 05:38:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 20 ms
[2025-06-02 05:38:58] [INFO ] Computed and/alt/rep : 6/12/6 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:38:58] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[108] Max Struct:[156]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[154] Max Struct:[156]
Support contains 1 out of 12 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Running 6 sub problems to find dead transitions.
[2025-06-02 05:38:58] [INFO ] Invariant cache hit.
[2025-06-02 05:38:58] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 6/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 18/30 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/30 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 30/30 variables, and 19 constraints, problems are : Problem set: 0 solved, 6 unsolved in 84 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 6/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 18/30 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/30 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 30/30 variables, and 25 constraints, problems are : Problem set: 0 solved, 6 unsolved in 70 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 159ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 159ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 160 ms. Remains : 12/12 places, 18/18 transitions.
[2025-06-02 05:38:58] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[154] Max Struct:[156]
RANDOM walk for 1000041 steps (2 resets) in 204 ms. (4878 steps per ms)
BEST_FIRST walk for 1000001 steps (171 resets) in 249 ms. (4000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[154] Max Struct:[156]
[2025-06-02 05:38:59] [INFO ] Invariant cache hit.
[2025-06-02 05:38:59] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-02 05:38:59] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2025-06-02 05:38:59] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:38:59] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 05:38:59] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2025-06-02 05:38:59] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-02 05:38:59] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2025-06-02 05:38:59] [INFO ] Computed and/alt/rep : 6/12/6 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:38:59] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[154] Max Struct:[156]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[154] Max Struct:[156]
Support contains 1 out of 12 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 12/12 places, 18/18 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2025-06-02 05:38:59] [INFO ] Invariant cache hit.
[2025-06-02 05:38:59] [INFO ] Implicit Places using invariants in 18 ms returned []
[2025-06-02 05:38:59] [INFO ] Invariant cache hit.
[2025-06-02 05:38:59] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-02 05:38:59] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2025-06-02 05:38:59] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-02 05:38:59] [INFO ] Invariant cache hit.
[2025-06-02 05:38:59] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 6/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 18/30 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/30 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 30/30 variables, and 19 constraints, problems are : Problem set: 0 solved, 6 unsolved in 78 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 6/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 18/30 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/30 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 30/30 variables, and 25 constraints, problems are : Problem set: 0 solved, 6 unsolved in 64 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 149ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 149ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 216 ms. Remains : 12/12 places, 18/18 transitions.
[2025-06-02 05:38:59] [INFO ] Flatten gal took : 5 ms
RANDOM walk for 40041 steps (8 resets) in 20 ms. (1906 steps per ms) remains 2/2 properties
[2025-06-02 05:38:59] [INFO ] Flatten gal took : 7 ms
[2025-06-02 05:38:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9096661232618687457.gal : 2 ms
[2025-06-02 05:38:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11409008574309763212.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/ReachabilityCardinality9096661232618687457.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11409008574309763212.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/ReachabilityCardinality11409008574309763212.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :19 after 1651
BEST_FIRST walk for 40004 steps (8 resets) in 45 ms. (869 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 18 ms. (2105 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1651 after 6479
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :6479 after 2.44742e+06
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :2.44742e+06 after 3.40467e+10
Interrupted probabilistic random walk after 896040 steps, run timeout after 3001 ms. (steps per millisecond=298 ) properties seen :0 out of 2
Probabilistic random walk after 896040 steps, saw 547064 distinct states, run finished after 3001 ms. (steps per millisecond=298 ) properties seen :0
[2025-06-02 05:39:02] [INFO ] Invariant cache hit.
[2025-06-02 05:39:02] [INFO ] State equation strengthened by 6 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) 11/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 05:39:02] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 18/30 variables, 12/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 6/20 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/20 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/30 variables, 0/20 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 30/30 variables, and 20 constraints, problems are : Problem set: 1 solved, 1 unsolved in 75 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 6/6 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) 11/12 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 18/30 variables, 12/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 6/20 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 1/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/30 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/30 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 30/30 variables, and 21 constraints, problems are : Problem set: 1 solved, 1 unsolved in 30 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 107ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 29 ms.
Support contains 1 out of 12 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Running 6 sub problems to find dead transitions.
[2025-06-02 05:39:02] [INFO ] Invariant cache hit.
[2025-06-02 05:39:02] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 6/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 18/30 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/30 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 30/30 variables, and 19 constraints, problems are : Problem set: 0 solved, 6 unsolved in 57 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 6/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 18/30 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/30 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 30/30 variables, and 25 constraints, problems are : Problem set: 0 solved, 6 unsolved in 52 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 113ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 114ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 115 ms. Remains : 12/12 places, 18/18 transitions.
RANDOM walk for 40081 steps (8 resets) in 16 ms. (2357 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 20 ms. (1904 steps per ms) remains 1/1 properties
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :2.10517e+12 after 2.225e+12
Interrupted probabilistic random walk after 3028739 steps, run timeout after 3001 ms. (steps per millisecond=1009 ) properties seen :0 out of 1
Probabilistic random walk after 3028739 steps, saw 1766109 distinct states, run finished after 3001 ms. (steps per millisecond=1009 ) properties seen :0
[2025-06-02 05:39:05] [INFO ] Invariant cache hit.
[2025-06-02 05:39:05] [INFO ] State equation strengthened by 6 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) 11/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 05:39:05] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 18/30 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/30 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 30/30 variables, and 20 constraints, problems are : Problem set: 0 solved, 1 unsolved in 62 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 6/6 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) 11/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 18/30 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/30 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/30 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 30/30 variables, and 21 constraints, problems are : Problem set: 0 solved, 1 unsolved in 32 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 102ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 26 ms.
Support contains 1 out of 12 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 12/12 places, 18/18 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2025-06-02 05:39:05] [INFO ] Invariant cache hit.
[2025-06-02 05:39:05] [INFO ] Implicit Places using invariants in 35 ms returned []
[2025-06-02 05:39:05] [INFO ] Invariant cache hit.
[2025-06-02 05:39:06] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-02 05:39:06] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2025-06-02 05:39:06] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-02 05:39:06] [INFO ] Invariant cache hit.
[2025-06-02 05:39:06] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 6/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 18/30 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/30 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 30/30 variables, and 19 constraints, problems are : Problem set: 0 solved, 6 unsolved in 58 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 6/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 18/30 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/30 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 30/30 variables, and 25 constraints, problems are : Problem set: 0 solved, 6 unsolved in 57 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 120ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 121ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 194 ms. Remains : 12/12 places, 18/18 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-02 05:39:06] [INFO ] Flatten gal took : 2 ms
[2025-06-02 05:39:06] [INFO ] Applying decomposition
[2025-06-02 05:39:06] [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/graph16173572438411201261.txt' '-o' '/tmp/graph16173572438411201261.bin' '-w' '/tmp/graph16173572438411201261.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16173572438411201261.bin' '-l' '-1' '-v' '-w' '/tmp/graph16173572438411201261.weights' '-q' '0' '-e' '0.001'
[2025-06-02 05:39:06] [INFO ] Decomposing Gal with order
[2025-06-02 05:39:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 05:39:06] [INFO ] Flatten gal took : 2 ms
[2025-06-02 05:39:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-02 05:39:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12274778255255004738.gal : 0 ms
[2025-06-02 05:39:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5370863892173688733.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/ReachabilityCardinality12274778255255004738.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5370863892173688733.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/ReachabilityCardinality5370863892173688733.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.61461e+08
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2.41765e+13 after 2.41781e+13
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2.41781e+13 after 2.5991e+13
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2.5991e+13 after 2.5991e+13
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2.5991e+13 after 2.5991e+13
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2.5991e+13 after 2.59947e+13
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :5.08947e+13 after 5.34937e+13
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[154] Max Struct:[156]
Ending property specific reduction for PGCD-PT-D05N025-UpperBounds-11 in 57773 ms.
Starting property specific reduction for PGCD-PT-D05N025-UpperBounds-12
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:[156]
Current structural bounds on expressions (Before main loop) : Max Seen:[25] Max Struct:[156]
[2025-06-02 05:39:56] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[25] Max Struct:[156]
RANDOM walk for 10008 steps (2 resets) in 3 ms. (2502 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:[114] Max Struct:[156]
[2025-06-02 05:39:56] [INFO ] Invariant cache hit.
[2025-06-02 05:39:56] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 05:39:56] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2025-06-02 05:39:56] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:39:56] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 05:39:56] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2025-06-02 05:39:56] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-02 05:39:56] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:39:56] [INFO ] Computed and/alt/rep : 6/12/6 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:39:56] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[114] Max Struct:[156]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[154] Max Struct:[156]
Support contains 1 out of 12 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Running 6 sub problems to find dead transitions.
[2025-06-02 05:39:56] [INFO ] Invariant cache hit.
[2025-06-02 05:39:56] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 6/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 18/30 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/30 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 30/30 variables, and 19 constraints, problems are : Problem set: 0 solved, 6 unsolved in 59 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 6/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 18/30 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/30 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 30/30 variables, and 25 constraints, problems are : Problem set: 0 solved, 6 unsolved in 48 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 136ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 137ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 138 ms. Remains : 12/12 places, 18/18 transitions.
[2025-06-02 05:39:56] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[154] Max Struct:[156]
RANDOM walk for 1000011 steps (2 resets) in 159 ms. (6250 steps per ms)
BEST_FIRST walk for 1000000 steps (171 resets) in 288 ms. (3460 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[154] Max Struct:[156]
[2025-06-02 05:39:56] [INFO ] Invariant cache hit.
[2025-06-02 05:39:56] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 05:39:56] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2025-06-02 05:39:56] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:39:56] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 05:39:56] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2025-06-02 05:39:56] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-02 05:39:56] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:39:56] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 1 ms to minimize.
[2025-06-02 05:39:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 23 ms
[2025-06-02 05:39:56] [INFO ] Computed and/alt/rep : 6/12/6 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:39:56] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[154] Max Struct:[156]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[154] Max Struct:[156]
Support contains 1 out of 12 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 12/12 places, 18/18 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2025-06-02 05:39:57] [INFO ] Invariant cache hit.
[2025-06-02 05:39:57] [INFO ] Implicit Places using invariants in 23 ms returned []
[2025-06-02 05:39:57] [INFO ] Invariant cache hit.
[2025-06-02 05:39:57] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-02 05:39:57] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2025-06-02 05:39:57] [INFO ] Redundant transitions in 1 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-02 05:39:57] [INFO ] Invariant cache hit.
[2025-06-02 05:39:57] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 6/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 18/30 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/30 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 30/30 variables, and 19 constraints, problems are : Problem set: 0 solved, 6 unsolved in 55 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 6/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 18/30 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/30 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 30/30 variables, and 25 constraints, problems are : Problem set: 0 solved, 6 unsolved in 48 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 107ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 109ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 168 ms. Remains : 12/12 places, 18/18 transitions.
[2025-06-02 05:39:57] [INFO ] Flatten gal took : 3 ms
RANDOM walk for 40071 steps (8 resets) in 23 ms. (1669 steps per ms) remains 2/2 properties
[2025-06-02 05:39:57] [INFO ] Flatten gal took : 13 ms
[2025-06-02 05:39:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14044509156072557511.gal : 0 ms
BEST_FIRST walk for 40004 steps (8 resets) in 30 ms. (1290 steps per ms) remains 2/2 properties
[2025-06-02 05:39:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16379498582571889764.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/ReachabilityCardinality14044509156072557511.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16379498582571889764.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/ReachabilityCardinality16379498582571889764.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10 after 19
BEST_FIRST walk for 40004 steps (8 resets) in 25 ms. (1538 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :19 after 1651
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1651 after 6479
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :6479 after 2.44742e+06
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :2.44742e+06 after 3.40467e+10
Interrupted probabilistic random walk after 893441 steps, run timeout after 3001 ms. (steps per millisecond=297 ) properties seen :0 out of 2
Probabilistic random walk after 893441 steps, saw 545563 distinct states, run finished after 3001 ms. (steps per millisecond=297 ) properties seen :0
[2025-06-02 05:40:00] [INFO ] Invariant cache hit.
[2025-06-02 05:40:00] [INFO ] State equation strengthened by 6 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) 11/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 05:40:00] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 18/30 variables, 12/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 6/20 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/20 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/30 variables, 0/20 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 30/30 variables, and 20 constraints, problems are : Problem set: 1 solved, 1 unsolved in 54 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 6/6 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) 11/12 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 18/30 variables, 12/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 6/20 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 1/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/30 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/30 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 30/30 variables, and 21 constraints, problems are : Problem set: 1 solved, 1 unsolved in 27 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 83ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 24 ms.
Support contains 1 out of 12 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Running 6 sub problems to find dead transitions.
[2025-06-02 05:40:00] [INFO ] Invariant cache hit.
[2025-06-02 05:40:00] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 6/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 18/30 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/30 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 30/30 variables, and 19 constraints, problems are : Problem set: 0 solved, 6 unsolved in 66 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 6/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 18/30 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/30 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 30/30 variables, and 25 constraints, problems are : Problem set: 0 solved, 6 unsolved in 46 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 117ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 117ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118 ms. Remains : 12/12 places, 18/18 transitions.
RANDOM walk for 40093 steps (8 resets) in 13 ms. (2863 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 17 ms. (2222 steps per ms) remains 1/1 properties
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :2.10517e+12 after 2.225e+12
Interrupted probabilistic random walk after 3182400 steps, run timeout after 3001 ms. (steps per millisecond=1060 ) properties seen :0 out of 1
Probabilistic random walk after 3182400 steps, saw 1854801 distinct states, run finished after 3001 ms. (steps per millisecond=1060 ) properties seen :0
[2025-06-02 05:40:03] [INFO ] Invariant cache hit.
[2025-06-02 05:40:03] [INFO ] State equation strengthened by 6 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) 11/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 05:40:03] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 18/30 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/30 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 30/30 variables, and 20 constraints, problems are : Problem set: 0 solved, 1 unsolved in 64 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 6/6 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) 11/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 18/30 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/30 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/30 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 30/30 variables, and 21 constraints, problems are : Problem set: 0 solved, 1 unsolved in 32 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 100ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 27 ms.
Support contains 1 out of 12 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 12/12 places, 18/18 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2025-06-02 05:40:03] [INFO ] Invariant cache hit.
[2025-06-02 05:40:03] [INFO ] Implicit Places using invariants in 19 ms returned []
[2025-06-02 05:40:03] [INFO ] Invariant cache hit.
[2025-06-02 05:40:03] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-02 05:40:03] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2025-06-02 05:40:03] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-02 05:40:03] [INFO ] Invariant cache hit.
[2025-06-02 05:40:03] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 6/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 18/30 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/30 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 30/30 variables, and 19 constraints, problems are : Problem set: 0 solved, 6 unsolved in 96 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 6/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 18/30 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/30 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 30/30 variables, and 25 constraints, problems are : Problem set: 0 solved, 6 unsolved in 46 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 147ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 147ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 204 ms. Remains : 12/12 places, 18/18 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-02 05:40:03] [INFO ] Flatten gal took : 1 ms
[2025-06-02 05:40:03] [INFO ] Applying decomposition
[2025-06-02 05:40:03] [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/graph7239228214932570866.txt' '-o' '/tmp/graph7239228214932570866.bin' '-w' '/tmp/graph7239228214932570866.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7239228214932570866.bin' '-l' '-1' '-v' '-w' '/tmp/graph7239228214932570866.weights' '-q' '0' '-e' '0.001'
[2025-06-02 05:40:03] [INFO ] Decomposing Gal with order
[2025-06-02 05:40:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 05:40:03] [INFO ] Flatten gal took : 2 ms
[2025-06-02 05:40:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-02 05:40:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16811066309327188206.gal : 1 ms
[2025-06-02 05:40:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2686824492903633464.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/ReachabilityCardinality16811066309327188206.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2686824492903633464.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/ReachabilityCardinality2686824492903633464.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 2.44725e+06
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :4.33137e+13 after 4.33201e+13
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :4.33201e+13 after 4.33201e+13
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :4.33201e+13 after 4.33201e+13
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :4.33201e+13 after 4.65226e+13
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :4.65226e+13 after 4.67318e+13
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :4.67318e+13 after 4.67324e+13
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[154] Max Struct:[156]
Ending property specific reduction for PGCD-PT-D05N025-UpperBounds-12 in 57647 ms.
[2025-06-02 05:40:53] [INFO ] Flatten gal took : 2 ms
[2025-06-02 05:40:53] [INFO ] Applying decomposition
[2025-06-02 05:40: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/graph5348606710967837604.txt' '-o' '/tmp/graph5348606710967837604.bin' '-w' '/tmp/graph5348606710967837604.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5348606710967837604.bin' '-l' '-1' '-v' '-w' '/tmp/graph5348606710967837604.weights' '-q' '0' '-e' '0.001'
[2025-06-02 05:40:53] [INFO ] Decomposing Gal with order
[2025-06-02 05:40:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 05:40:53] [INFO ] Flatten gal took : 1 ms
[2025-06-02 05:40:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-02 05:40:53] [INFO ] Time to serialize gal into /tmp/UpperBounds4564925358337079318.gal : 0 ms
[2025-06-02 05:40:53] [INFO ] Time to serialize properties into /tmp/UpperBounds1032667758534589158.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/UpperBounds4564925358337079318.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds1032667758534589158.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 ...283
Loading property file /tmp/UpperBounds1032667758534589158.prop.
Detected timeout of ITS tools.
[2025-06-02 06:02:16] [INFO ] Flatten gal took : 2 ms
[2025-06-02 06:02:16] [INFO ] Time to serialize gal into /tmp/UpperBounds2300706413548978251.gal : 1 ms
[2025-06-02 06:02:16] [INFO ] Time to serialize properties into /tmp/UpperBounds12268392628936610070.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/UpperBounds2300706413548978251.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds12268392628936610070.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...305
Loading property file /tmp/UpperBounds12268392628936610070.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,1.58554e+15,75.0727,1122700,2,3317,5,4.12299e+06,6,0,87,4.252e+06,0
Total reachable state count : 1585536525017640
Verifying 4 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 154
Bounds property PGCD-PT-D05N025-UpperBounds-00 :0 <= p1_4 <= 154
FORMULA PGCD-PT-D05N025-UpperBounds-00 154 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
PGCD-PT-D05N025-UpperBounds-00,0,75.1273,1122700,1,0,7,4.12299e+06,9,1,267,4.252e+06,4
Min sum of variable value : 0
Maximum sum along a path : 154
Bounds property PGCD-PT-D05N025-UpperBounds-05 :0 <= p1_2 <= 154
FORMULA PGCD-PT-D05N025-UpperBounds-05 154 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
PGCD-PT-D05N025-UpperBounds-05,0,75.2271,1122700,1,0,8,4.12299e+06,10,1,441,4.252e+06,5
Min sum of variable value : 0
Maximum sum along a path : 154
Bounds property PGCD-PT-D05N025-UpperBounds-11 :0 <= p1_1 <= 154
FORMULA PGCD-PT-D05N025-UpperBounds-11 154 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
PGCD-PT-D05N025-UpperBounds-11,0,75.3469,1122700,1,0,9,4.12299e+06,11,1,619,4.252e+06,6
Min sum of variable value : 0
Maximum sum along a path : 154
Bounds property PGCD-PT-D05N025-UpperBounds-12 :0 <= p1_3 <= 154
FORMULA PGCD-PT-D05N025-UpperBounds-12 154 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
PGCD-PT-D05N025-UpperBounds-12,0,75.4306,1122700,1,0,10,4.12299e+06,12,1,789,4.252e+06,7
Total runtime 1606342 ms.
BK_STOP 1748844211574
--------------------
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="PGCD-PT-D05N025"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is PGCD-PT-D05N025, 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 r153-tall-174876824800094"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PGCD-PT-D05N025.tgz
mv PGCD-PT-D05N025 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.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 '
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 ;