About the Execution of 2024-gold for Murphy-PT-D2N100
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.r139-smll-174876533200074.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 Murphy-PT-D2N100, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r139-smll-174876533200074
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 7.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K 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 7 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 Murphy-PT-D2N100-UpperBounds-00
FORMULA_NAME Murphy-PT-D2N100-UpperBounds-01
FORMULA_NAME Murphy-PT-D2N100-UpperBounds-02
FORMULA_NAME Murphy-PT-D2N100-UpperBounds-03
FORMULA_NAME Murphy-PT-D2N100-UpperBounds-04
FORMULA_NAME Murphy-PT-D2N100-UpperBounds-05
FORMULA_NAME Murphy-PT-D2N100-UpperBounds-06
FORMULA_NAME Murphy-PT-D2N100-UpperBounds-07
FORMULA_NAME Murphy-PT-D2N100-UpperBounds-08
FORMULA_NAME Murphy-PT-D2N100-UpperBounds-09
FORMULA_NAME Murphy-PT-D2N100-UpperBounds-10
FORMULA_NAME Murphy-PT-D2N100-UpperBounds-11
FORMULA_NAME Murphy-PT-D2N100-UpperBounds-12
FORMULA_NAME Murphy-PT-D2N100-UpperBounds-13
FORMULA_NAME Murphy-PT-D2N100-UpperBounds-14
FORMULA_NAME Murphy-PT-D2N100-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1748938031887
Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Murphy-PT-D2N100
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-03 08:07:13] [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-03 08:07:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 08:07:14] [INFO ] Load time of PNML (sax parser for PT used): 100 ms
[2025-06-03 08:07:14] [INFO ] Transformed 18 places.
[2025-06-03 08:07:14] [INFO ] Transformed 21 transitions.
[2025-06-03 08:07:14] [INFO ] Parsed PT model containing 18 places and 21 transitions and 81 arcs in 282 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 14 ms.
Current structural bounds on expressions (Initially) : Max Seen:[100, 1, 1, 0, 1, 0, 0, 1, 0, 1, 0, 100, 3, 100, 3, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[100, 1, 1, 0, 1, 0, 0, 1, 0, 1, 0, 100, 3, 100, 3, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 21 rows 18 cols
[2025-06-03 08:07:14] [INFO ] Computed 4 invariants in 12 ms
Current structural bounds on expressions (after invariants) : Max Seen:[100, 1, 1, 0, 1, 0, 0, 1, 0, 1, 0, 100, 3, 100, 3, 0] Max Struct:[303, 303, 303, +inf, 303, +inf, +inf, 303, +inf, 303, +inf, 303, +inf, 303, +inf, +inf]
RANDOM walk for 10057 steps (2 resets) in 31 ms. (314 steps per ms)
BEST_FIRST walk for 160015 steps (32 resets) in 169 ms. (941 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[117, 129, 129, 1, 119, 1, 2, 131, 1, 131, 2, 127, 3, 143, 3, 2] Max Struct:[303, 303, 303, +inf, 303, +inf, +inf, 303, +inf, 303, +inf, 303, +inf, 303, +inf, +inf]
[2025-06-03 08:07:14] [INFO ] Invariant cache hit.
[2025-06-03 08:07:14] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2025-06-03 08:07:14] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 3 ms returned sat
[2025-06-03 08:07:15] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2025-06-03 08:07:15] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:07:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 8 ms returned sat
[2025-06-03 08:07:15] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2025-06-03 08:07:15] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2025-06-03 08:07:15] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-03 08:07:15] [INFO ] [Nat]Added 6 Read/Feed constraints in 8 ms returned sat
[2025-06-03 08:07:15] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 9 ms.
[2025-06-03 08:07:15] [INFO ] Added : 0 causal constraints over 0 iterations in 35 ms. Result :sat
Minimization took 55 ms.
[2025-06-03 08:07:15] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:07:15] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2025-06-03 08:07:15] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2025-06-03 08:07:15] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:07:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:07:15] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-03 08:07:15] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2025-06-03 08:07:15] [INFO ] [Nat]Added 6 Read/Feed constraints in 3 ms returned sat
[2025-06-03 08:07:15] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 11 ms.
[2025-06-03 08:07:15] [INFO ] Added : 0 causal constraints over 0 iterations in 21 ms. Result :sat
Minimization took 45 ms.
[2025-06-03 08:07:15] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:07:15] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-03 08:07:15] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2025-06-03 08:07:15] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:07:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:07:15] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2025-06-03 08:07:15] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2025-06-03 08:07:15] [INFO ] [Nat]Added 6 Read/Feed constraints in 3 ms returned sat
[2025-06-03 08:07:15] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-03 08:07:15] [INFO ] Added : 0 causal constraints over 0 iterations in 11 ms. Result :sat
Minimization took 28 ms.
[2025-06-03 08:07:15] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:07:15] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 3 ms returned sat
[2025-06-03 08:07:15] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2025-06-03 08:07:15] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:07:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:07:15] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-03 08:07:15] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2025-06-03 08:07:15] [INFO ] [Nat]Added 6 Read/Feed constraints in 3 ms returned sat
[2025-06-03 08:07:15] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-03 08:07:15] [INFO ] Added : 1 causal constraints over 1 iterations in 17 ms. Result :sat
Minimization took 7 ms.
[2025-06-03 08:07:15] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:07:15] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-03 08:07:15] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2025-06-03 08:07:15] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:07:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:07:16] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-03 08:07:16] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2025-06-03 08:07:16] [INFO ] [Nat]Added 6 Read/Feed constraints in 3 ms returned sat
[2025-06-03 08:07:16] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-03 08:07:16] [INFO ] Added : 0 causal constraints over 0 iterations in 11 ms. Result :sat
Minimization took 28 ms.
[2025-06-03 08:07:16] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:07:16] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2025-06-03 08:07:16] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-06-03 08:07:16] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:07:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:07:16] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-03 08:07:16] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2025-06-03 08:07:16] [INFO ] [Nat]Added 6 Read/Feed constraints in 3 ms returned sat
[2025-06-03 08:07:16] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 9 ms.
[2025-06-03 08:07:16] [INFO ] Added : 1 causal constraints over 1 iterations in 22 ms. Result :sat
Minimization took 6 ms.
[2025-06-03 08:07:16] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:07:16] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-03 08:07:16] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2025-06-03 08:07:16] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:07:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:07:16] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-03 08:07:16] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2025-06-03 08:07:16] [INFO ] [Nat]Added 6 Read/Feed constraints in 3 ms returned sat
[2025-06-03 08:07:16] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 15 ms to minimize.
[2025-06-03 08:07:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2025-06-03 08:07:16] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-03 08:07:16] [INFO ] Added : 3 causal constraints over 1 iterations in 16 ms. Result :sat
Minimization took 7 ms.
[2025-06-03 08:07:16] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:07:16] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 7 ms returned sat
[2025-06-03 08:07:16] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-03 08:07:16] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:07:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:07:16] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2025-06-03 08:07:16] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2025-06-03 08:07:16] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2025-06-03 08:07:16] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-03 08:07:16] [INFO ] Added : 0 causal constraints over 0 iterations in 11 ms. Result :sat
Minimization took 48 ms.
[2025-06-03 08:07:16] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:07:16] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-03 08:07:16] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2025-06-03 08:07:16] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:07:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:07:16] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-03 08:07:16] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2025-06-03 08:07:16] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2025-06-03 08:07:16] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-03 08:07:16] [INFO ] Added : 1 causal constraints over 1 iterations in 14 ms. Result :sat
Minimization took 7 ms.
[2025-06-03 08:07:16] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:07:16] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-03 08:07:16] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-03 08:07:16] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:07:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:07:16] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 3 ms returned sat
[2025-06-03 08:07:16] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2025-06-03 08:07:16] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2025-06-03 08:07:16] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-03 08:07:16] [INFO ] Added : 0 causal constraints over 0 iterations in 10 ms. Result :sat
Minimization took 31 ms.
[2025-06-03 08:07:16] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:07:16] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2025-06-03 08:07:16] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2025-06-03 08:07:16] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:07:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:07:16] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-03 08:07:16] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2025-06-03 08:07:16] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2025-06-03 08:07:16] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-03 08:07:16] [INFO ] Added : 2 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 5 ms.
[2025-06-03 08:07:16] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:07:16] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-03 08:07:17] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-06-03 08:07:17] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:07:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:07:17] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-03 08:07:17] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2025-06-03 08:07:17] [INFO ] [Nat]Added 6 Read/Feed constraints in 3 ms returned sat
[2025-06-03 08:07:17] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-03 08:07:17] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Minimization took 28 ms.
[2025-06-03 08:07:17] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:07:17] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-03 08:07:17] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-06-03 08:07:17] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:07:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:07:17] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2025-06-03 08:07:17] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2025-06-03 08:07:17] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2025-06-03 08:07:17] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-03 08:07:17] [INFO ] Added : 3 causal constraints over 1 iterations in 14 ms. Result :sat
Minimization took 5 ms.
[2025-06-03 08:07:17] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2025-06-03 08:07:17] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-03 08:07:17] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-06-03 08:07:17] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:07:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:07:17] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-03 08:07:17] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2025-06-03 08:07:17] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2025-06-03 08:07:17] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-03 08:07:17] [INFO ] Added : 0 causal constraints over 0 iterations in 8 ms. Result :sat
Minimization took 38 ms.
[2025-06-03 08:07:17] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:07:17] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-03 08:07:17] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-03 08:07:17] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:07:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:07:17] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-03 08:07:17] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2025-06-03 08:07:17] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2025-06-03 08:07:17] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-03 08:07:17] [INFO ] Added : 3 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 7 ms.
[2025-06-03 08:07:17] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:07:17] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-03 08:07:17] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-06-03 08:07:17] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:07:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2025-06-03 08:07:17] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-03 08:07:17] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-06-03 08:07:17] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2025-06-03 08:07:17] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-03 08:07:17] [INFO ] Added : 2 causal constraints over 1 iterations in 13 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[117, 129, 129, 1, 119, 1, 2, 131, 1, 131, 2, 127, 3, 143, 3, 2] Max Struct:[303, 303, 303, +inf, 303, +inf, +inf, 303, +inf, 303, +inf, 303, +inf, 303, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[273, 301, 301, 1, 301, 1, 2, 301, 1, 301, 2, 299, 3, 287, 3, 2] Max Struct:[303, 303, 303, +inf, 303, +inf, +inf, 303, +inf, 303, +inf, 303, +inf, 303, +inf, +inf]
Support contains 16 out of 18 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 11 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Running 12 sub problems to find dead transitions.
[2025-06-03 08:07:18] [INFO ] Invariant cache hit.
[2025-06-03 08:07:18] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 3/15 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 21/36 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 3/39 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 0/39 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 28 constraints, problems are : Problem set: 0 solved, 12 unsolved in 343 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 18/18 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 3/15 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 21/36 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 3/39 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 12/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/39 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 0/39 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 40 constraints, problems are : Problem set: 0 solved, 12 unsolved in 320 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 18/18 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 714ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 725ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 753 ms. Remains : 18/18 places, 21/21 transitions.
Found an invariant !
This invariant on transitions {10=1, 13=1, 19=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {10=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 16) seen :[105, 128, 128, 1, 119, 1, 2, 119, 1, 119, 2, 108, 3, 105, 3, 2]
Current structural bounds on expressions (after cover walk) : Max Seen:[273, 301, 301, 1, 301, 1, 2, 301, 1, 301, 2, 299, 3, 287, 3, 2] Max Struct:[303, 303, 303, +inf, 303, +inf, +inf, 303, +inf, 303, +inf, 303, +inf, 303, +inf, +inf]
[2025-06-03 08:07:19] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[273, 301, 301, 1, 301, 1, 2, 301, 1, 301, 2, 299, 3, 287, 3, 2] Max Struct:[303, 303, 303, +inf, 303, +inf, +inf, 303, +inf, 303, +inf, 303, +inf, 303, +inf, +inf]
RANDOM walk for 1000098 steps (2 resets) in 621 ms. (1607 steps per ms)
BEST_FIRST walk for 16000015 steps (32 resets) in 7453 ms. (2146 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[273, 301, 301, 1, 301, 1, 2, 301, 1, 301, 2, 299, 3, 287, 3, 2] Max Struct:[303, 303, 303, +inf, 303, +inf, +inf, 303, +inf, 303, +inf, 303, +inf, 303, +inf, +inf]
[2025-06-03 08:07:27] [INFO ] Invariant cache hit.
[2025-06-03 08:07:27] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:07:27] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-03 08:07:27] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2025-06-03 08:07:27] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:07:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:07:27] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-03 08:07:27] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-06-03 08:07:27] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-03 08:07:27] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2025-06-03 08:07:27] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-03 08:07:27] [INFO ] Added : 3 causal constraints over 2 iterations in 15 ms. Result :sat
Minimization took 34 ms.
[2025-06-03 08:07:27] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:07:27] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2025-06-03 08:07:27] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2025-06-03 08:07:27] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:07:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:07:27] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-03 08:07:27] [INFO ] [Nat]Absence check using state equation in 10 ms returned unsat
[2025-06-03 08:07:27] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:07:27] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-03 08:07:27] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2025-06-03 08:07:27] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:07:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:07:27] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-03 08:07:27] [INFO ] [Nat]Absence check using state equation in 10 ms returned unsat
[2025-06-03 08:07:27] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:07:27] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-03 08:07:27] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2025-06-03 08:07:27] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:07:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:07:27] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2025-06-03 08:07:27] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2025-06-03 08:07:27] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2025-06-03 08:07:27] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-03 08:07:27] [INFO ] Added : 1 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 5 ms.
[2025-06-03 08:07:27] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:07:27] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-03 08:07:27] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2025-06-03 08:07:27] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:07:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:07:27] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-03 08:07:27] [INFO ] [Nat]Absence check using state equation in 9 ms returned unsat
[2025-06-03 08:07:27] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:07:27] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-03 08:07:27] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2025-06-03 08:07:27] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:07:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2025-06-03 08:07:27] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-03 08:07:27] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2025-06-03 08:07:27] [INFO ] [Nat]Added 6 Read/Feed constraints in 6 ms returned sat
[2025-06-03 08:07:27] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-03 08:07:27] [INFO ] Added : 1 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 8 ms.
[2025-06-03 08:07:27] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:07:27] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-03 08:07:27] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2025-06-03 08:07:27] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:07:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:07:27] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-03 08:07:27] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2025-06-03 08:07:27] [INFO ] [Nat]Added 6 Read/Feed constraints in 3 ms returned sat
[2025-06-03 08:07:27] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2025-06-03 08:07:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2025-06-03 08:07:27] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-03 08:07:27] [INFO ] Added : 3 causal constraints over 1 iterations in 14 ms. Result :sat
Minimization took 10 ms.
[2025-06-03 08:07:27] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:07:27] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-03 08:07:27] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2025-06-03 08:07:27] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:07:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:07:28] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-03 08:07:28] [INFO ] [Nat]Absence check using state equation in 10 ms returned unsat
[2025-06-03 08:07:28] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:07:28] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-03 08:07:28] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2025-06-03 08:07:28] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:07:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:07:28] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2025-06-03 08:07:28] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2025-06-03 08:07:28] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2025-06-03 08:07:28] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-03 08:07:28] [INFO ] Added : 1 causal constraints over 1 iterations in 15 ms. Result :sat
Minimization took 8 ms.
[2025-06-03 08:07:28] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:07:28] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-03 08:07:28] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-03 08:07:28] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:07:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:07:28] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2025-06-03 08:07:28] [INFO ] [Nat]Absence check using state equation in 12 ms returned unsat
[2025-06-03 08:07:28] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:07:28] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-03 08:07:28] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-03 08:07:28] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:07:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:07:28] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-03 08:07:28] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-06-03 08:07:28] [INFO ] [Nat]Added 6 Read/Feed constraints in 3 ms returned sat
[2025-06-03 08:07:28] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-03 08:07:28] [INFO ] Added : 2 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 8 ms.
[2025-06-03 08:07:28] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:07:28] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-03 08:07:28] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-03 08:07:28] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:07:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:07:28] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-03 08:07:28] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2025-06-03 08:07:28] [INFO ] [Nat]Added 6 Read/Feed constraints in 3 ms returned sat
[2025-06-03 08:07:28] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-03 08:07:28] [INFO ] Added : 1 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 18 ms.
[2025-06-03 08:07:28] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:07:28] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 11 ms returned sat
[2025-06-03 08:07:28] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2025-06-03 08:07:28] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:07:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:07:28] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-03 08:07:28] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-06-03 08:07:28] [INFO ] [Nat]Added 6 Read/Feed constraints in 3 ms returned sat
[2025-06-03 08:07:28] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-03 08:07:28] [INFO ] Added : 3 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 9 ms.
[2025-06-03 08:07:28] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:07:28] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-03 08:07:28] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2025-06-03 08:07:28] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:07:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:07:28] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-03 08:07:28] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-06-03 08:07:28] [INFO ] [Nat]Added 6 Read/Feed constraints in 5 ms returned sat
[2025-06-03 08:07:28] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-03 08:07:28] [INFO ] Added : 1 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 37 ms.
[2025-06-03 08:07:28] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:07:28] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-03 08:07:28] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2025-06-03 08:07:28] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:07:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:07:28] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-03 08:07:28] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2025-06-03 08:07:28] [INFO ] [Nat]Added 6 Read/Feed constraints in 3 ms returned sat
[2025-06-03 08:07:28] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-03 08:07:28] [INFO ] Added : 3 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 12 ms.
[2025-06-03 08:07:28] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:07:28] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-03 08:07:28] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2025-06-03 08:07:28] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:07:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:07:28] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-03 08:07:28] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-06-03 08:07:28] [INFO ] [Nat]Added 6 Read/Feed constraints in 3 ms returned sat
[2025-06-03 08:07:28] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-03 08:07:28] [INFO ] Added : 2 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 10 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[273, 301, 301, 1, 301, 1, 2, 301, 1, 301, 2, 299, 3, 287, 3, 2] Max Struct:[303, 301, 301, +inf, 301, +inf, +inf, 301, +inf, 301, +inf, 303, +inf, 303, +inf, +inf]
FORMULA Murphy-PT-D2N100-UpperBounds-09 301 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Murphy-PT-D2N100-UpperBounds-07 301 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Murphy-PT-D2N100-UpperBounds-04 301 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Murphy-PT-D2N100-UpperBounds-02 301 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Murphy-PT-D2N100-UpperBounds-01 301 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[297, 1, 1, 2, 1, 2, 299, 3, 287, 3, 2] Max Struct:[303, +inf, +inf, +inf, +inf, +inf, 303, +inf, 303, +inf, +inf]
Support contains 11 out of 18 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 2 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 18/18 places, 21/21 transitions.
Found an invariant !
This invariant on transitions {10=1, 13=1, 19=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {10=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 11) seen :[104, 1, 1, 2, 1, 2, 101, 3, 107, 3, 2]
Current structural bounds on expressions (after cover walk) : Max Seen:[297, 1, 1, 2, 1, 2, 299, 3, 287, 3, 2] Max Struct:[303, +inf, +inf, +inf, +inf, +inf, 303, +inf, 303, +inf, +inf]
[2025-06-03 08:07:29] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[297, 1, 1, 2, 1, 2, 299, 3, 287, 3, 2] Max Struct:[303, +inf, +inf, +inf, +inf, +inf, 303, +inf, 303, +inf, +inf]
RANDOM walk for 1000001 steps (2 resets) in 613 ms. (1628 steps per ms)
BEST_FIRST walk for 11000010 steps (22 resets) in 5058 ms. (2174 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[297, 1, 1, 2, 1, 2, 299, 3, 287, 3, 2] Max Struct:[303, +inf, +inf, +inf, +inf, +inf, 303, +inf, 303, +inf, +inf]
[2025-06-03 08:07:34] [INFO ] Invariant cache hit.
[2025-06-03 08:07:34] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:07:34] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-03 08:07:34] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-06-03 08:07:34] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:07:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:07:34] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-03 08:07:34] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2025-06-03 08:07:34] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-03 08:07:34] [INFO ] [Nat]Added 6 Read/Feed constraints in 3 ms returned sat
[2025-06-03 08:07:34] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-03 08:07:34] [INFO ] Added : 3 causal constraints over 2 iterations in 12 ms. Result :sat
Minimization took 13 ms.
[2025-06-03 08:07:35] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:07:35] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-03 08:07:35] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2025-06-03 08:07:35] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:07:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:07:35] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2025-06-03 08:07:35] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2025-06-03 08:07:35] [INFO ] [Nat]Added 6 Read/Feed constraints in 3 ms returned sat
[2025-06-03 08:07:35] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-03 08:07:35] [INFO ] Added : 1 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 7 ms.
[2025-06-03 08:07:35] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:07:35] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2025-06-03 08:07:35] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2025-06-03 08:07:35] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:07:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:07:35] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-03 08:07:35] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2025-06-03 08:07:35] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2025-06-03 08:07:35] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-03 08:07:35] [INFO ] Added : 1 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 5 ms.
[2025-06-03 08:07:35] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:07:35] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-03 08:07:35] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2025-06-03 08:07:35] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:07:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:07:35] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-03 08:07:35] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2025-06-03 08:07:35] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2025-06-03 08:07:35] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 ms to minimize.
[2025-06-03 08:07:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 21 ms
[2025-06-03 08:07:35] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-03 08:07:35] [INFO ] Added : 3 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 7 ms.
[2025-06-03 08:07:35] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:07:35] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-03 08:07:35] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2025-06-03 08:07:35] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:07:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:07:35] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2025-06-03 08:07:35] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2025-06-03 08:07:35] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2025-06-03 08:07:35] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-03 08:07:35] [INFO ] Added : 1 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 8 ms.
[2025-06-03 08:07:35] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:07:35] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-03 08:07:35] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-06-03 08:07:35] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:07:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:07:35] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 3 ms returned sat
[2025-06-03 08:07:35] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2025-06-03 08:07:35] [INFO ] [Nat]Added 6 Read/Feed constraints in 3 ms returned sat
[2025-06-03 08:07:35] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-03 08:07:35] [INFO ] Added : 2 causal constraints over 1 iterations in 14 ms. Result :sat
Minimization took 6 ms.
[2025-06-03 08:07:35] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:07:35] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2025-06-03 08:07:35] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2025-06-03 08:07:35] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:07:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:07:35] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2025-06-03 08:07:35] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-06-03 08:07:35] [INFO ] [Nat]Added 6 Read/Feed constraints in 4 ms returned sat
[2025-06-03 08:07:35] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-03 08:07:35] [INFO ] Added : 1 causal constraints over 1 iterations in 13 ms. Result :sat
Minimization took 19 ms.
[2025-06-03 08:07:35] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:07:35] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-03 08:07:35] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-03 08:07:35] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:07:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:07:35] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2025-06-03 08:07:35] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2025-06-03 08:07:35] [INFO ] [Nat]Added 6 Read/Feed constraints in 3 ms returned sat
[2025-06-03 08:07:35] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-03 08:07:35] [INFO ] Added : 3 causal constraints over 1 iterations in 14 ms. Result :sat
Minimization took 8 ms.
[2025-06-03 08:07:35] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:07:35] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-03 08:07:35] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2025-06-03 08:07:35] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:07:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:07:35] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 3 ms returned sat
[2025-06-03 08:07:35] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2025-06-03 08:07:35] [INFO ] [Nat]Added 6 Read/Feed constraints in 4 ms returned sat
[2025-06-03 08:07:35] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-03 08:07:35] [INFO ] Added : 1 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 38 ms.
[2025-06-03 08:07:35] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:07:35] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 7 ms returned sat
[2025-06-03 08:07:35] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2025-06-03 08:07:35] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:07:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:07:35] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-03 08:07:35] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2025-06-03 08:07:35] [INFO ] [Nat]Added 6 Read/Feed constraints in 4 ms returned sat
[2025-06-03 08:07:35] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-03 08:07:35] [INFO ] Added : 3 causal constraints over 1 iterations in 16 ms. Result :sat
Minimization took 10 ms.
[2025-06-03 08:07:36] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 08:07:36] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-03 08:07:36] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2025-06-03 08:07:36] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:07:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 08:07:36] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-03 08:07:36] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2025-06-03 08:07:36] [INFO ] [Nat]Added 6 Read/Feed constraints in 3 ms returned sat
[2025-06-03 08:07:36] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-03 08:07:36] [INFO ] Added : 2 causal constraints over 1 iterations in 15 ms. Result :sat
Minimization took 10 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[297, 1, 1, 2, 1, 2, 299, 3, 287, 3, 2] Max Struct:[303, +inf, +inf, +inf, +inf, +inf, 303, +inf, 303, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[297, 1, 1, 2, 1, 2, 299, 3, 287, 3, 2] Max Struct:[303, +inf, +inf, +inf, +inf, +inf, 303, +inf, 303, +inf, +inf]
Support contains 11 out of 18 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 2 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 18/18 places, 21/21 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 21/21 transitions.
Applied a total of 0 rules in 2 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2025-06-03 08:07:36] [INFO ] Invariant cache hit.
[2025-06-03 08:07:36] [INFO ] Implicit Places using invariants in 53 ms returned [6, 7, 8]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 59 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 15/18 places, 21/21 transitions.
Applied a total of 0 rules in 2 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 64 ms. Remains : 15/18 places, 21/21 transitions.
Found an invariant !
This invariant on transitions {9=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {9=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 11) seen :[104, 1, 1, 2, 1, 2, 116, 3, 103, 3, 2]
Current structural bounds on expressions (after cover walk) : Max Seen:[297, 1, 1, 2, 1, 2, 299, 3, 287, 3, 2] Max Struct:[303, +inf, +inf, +inf, +inf, +inf, 303, +inf, 303, +inf, +inf]
// Phase 1: matrix 21 rows 15 cols
[2025-06-03 08:07:36] [INFO ] Computed 1 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[297, 1, 1, 2, 1, 2, 299, 3, 287, 3, 2] Max Struct:[303, +inf, +inf, +inf, +inf, +inf, 303, +inf, 303, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 535 ms. (1865 steps per ms)
BEST_FIRST walk for 11000009 steps (22 resets) in 4559 ms. (2412 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[297, 1, 1, 2, 1, 2, 299, 3, 287, 3, 2] Max Struct:[303, +inf, +inf, +inf, +inf, +inf, 303, +inf, 303, +inf, +inf]
[2025-06-03 08:07:41] [INFO ] Invariant cache hit.
[2025-06-03 08:07:41] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:07:41] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2025-06-03 08:07:41] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:07:41] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:07:41] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2025-06-03 08:07:41] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-03 08:07:41] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2025-06-03 08:07:41] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-03 08:07:41] [INFO ] Added : 3 causal constraints over 2 iterations in 10 ms. Result :sat
Minimization took 11 ms.
[2025-06-03 08:07:41] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-03 08:07:41] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2025-06-03 08:07:41] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:07:41] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:07:41] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2025-06-03 08:07:41] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2025-06-03 08:07:41] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-03 08:07:41] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 6 ms.
[2025-06-03 08:07:41] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:07:41] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2025-06-03 08:07:41] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:07:41] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:07:41] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2025-06-03 08:07:41] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2025-06-03 08:07:41] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-03 08:07:41] [INFO ] Added : 1 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 5 ms.
[2025-06-03 08:07:41] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:07:41] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2025-06-03 08:07:41] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:07:41] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:07:41] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2025-06-03 08:07:41] [INFO ] [Nat]Added 6 Read/Feed constraints in 3 ms returned sat
[2025-06-03 08:07:41] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-03 08:07:41] [INFO ] Added : 2 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 7 ms.
[2025-06-03 08:07:41] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:07:41] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-06-03 08:07:41] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:07:41] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:07:41] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2025-06-03 08:07:41] [INFO ] [Nat]Added 6 Read/Feed constraints in 3 ms returned sat
[2025-06-03 08:07:41] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-03 08:07:41] [INFO ] Added : 1 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 6 ms.
[2025-06-03 08:07:42] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:07:42] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2025-06-03 08:07:42] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:07:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:07:42] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-06-03 08:07:42] [INFO ] [Nat]Added 6 Read/Feed constraints in 3 ms returned sat
[2025-06-03 08:07:42] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-03 08:07:42] [INFO ] Added : 2 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 5 ms.
[2025-06-03 08:07:42] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:07:42] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-06-03 08:07:42] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:07:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:07:42] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2025-06-03 08:07:42] [INFO ] [Nat]Added 6 Read/Feed constraints in 6 ms returned sat
[2025-06-03 08:07:42] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-03 08:07:42] [INFO ] Added : 1 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 11 ms.
[2025-06-03 08:07:42] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:07:42] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2025-06-03 08:07:42] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:07:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:07:42] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2025-06-03 08:07:42] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2025-06-03 08:07:42] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-03 08:07:42] [INFO ] Added : 3 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 5 ms.
[2025-06-03 08:07:42] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:07:42] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-06-03 08:07:42] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:07:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-03 08:07:42] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2025-06-03 08:07:42] [INFO ] [Nat]Added 6 Read/Feed constraints in 12 ms returned sat
[2025-06-03 08:07:42] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-03 08:07:42] [INFO ] Added : 2 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 34 ms.
[2025-06-03 08:07:42] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-03 08:07:42] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2025-06-03 08:07:42] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:07:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:07:42] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2025-06-03 08:07:42] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2025-06-03 08:07:42] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-03 08:07:42] [INFO ] Added : 3 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 11 ms.
[2025-06-03 08:07:42] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-03 08:07:42] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-03 08:07:42] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:07:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:07:42] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2025-06-03 08:07:42] [INFO ] [Nat]Added 6 Read/Feed constraints in 3 ms returned sat
[2025-06-03 08:07:42] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-03 08:07:42] [INFO ] Added : 2 causal constraints over 1 iterations in 15 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[297, 1, 1, 2, 1, 2, 299, 3, 287, 3, 2] Max Struct:[303, +inf, +inf, +inf, +inf, +inf, 303, +inf, 303, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[297, 1, 1, 2, 1, 2, 299, 3, 287, 3, 2] Max Struct:[303, +inf, +inf, +inf, +inf, +inf, 303, +inf, 303, +inf, +inf]
Support contains 11 out of 15 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 21/21 transitions.
Applied a total of 0 rules in 2 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 15/15 places, 21/21 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2025-06-03 08:07:42] [INFO ] Invariant cache hit.
[2025-06-03 08:07:42] [INFO ] Implicit Places using invariants in 31 ms returned []
[2025-06-03 08:07:42] [INFO ] Invariant cache hit.
[2025-06-03 08:07:42] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-03 08:07:42] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2025-06-03 08:07:42] [INFO ] Redundant transitions in 1 ms returned []
Running 12 sub problems to find dead transitions.
[2025-06-03 08:07:42] [INFO ] Invariant cache hit.
[2025-06-03 08:07:42] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 3/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 21/33 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 3/36 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 0/36 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/36 variables, and 22 constraints, problems are : Problem set: 0 solved, 12 unsolved in 300 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 3/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 21/33 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 3/36 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/36 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 0/36 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/36 variables, and 34 constraints, problems are : Problem set: 0 solved, 12 unsolved in 286 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 605ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 606ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 695 ms. Remains : 15/15 places, 21/21 transitions.
Found an invariant !
This invariant on transitions {9=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {9=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 11) seen :[102, 1, 1, 2, 1, 2, 115, 3, 101, 3, 2]
Current structural bounds on expressions (after cover walk) : Max Seen:[297, 1, 1, 2, 1, 2, 299, 3, 287, 3, 2] Max Struct:[303, +inf, +inf, +inf, +inf, +inf, 303, +inf, 303, +inf, +inf]
RANDOM walk for 40216 steps (8 resets) in 706 ms. (56 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (8 resets) in 380 ms. (104 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 348 ms. (114 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 279 ms. (142 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 258 ms. (154 steps per ms) remains 14/14 properties
[2025-06-03 08:07:44] [INFO ] Flatten gal took : 74 ms
[2025-06-03 08:07:44] [INFO ] Flatten gal took : 35 ms
BEST_FIRST walk for 40003 steps (8 resets) in 353 ms. (113 steps per ms) remains 14/14 properties
[2025-06-03 08:07:44] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2071640287238366830.gal : 36 ms
BEST_FIRST walk for 40004 steps (8 resets) in 178 ms. (223 steps per ms) remains 14/14 properties
[2025-06-03 08:07:44] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4087094273496290585.prop : 15 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/ReachabilityCardinality2071640287238366830.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4087094273496290585.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40003 steps (8 resets) in 187 ms. (212 steps per ms) remains 14/14 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 ...328
Loading property file /tmp/ReachabilityCardinality4087094273496290585.prop.
SDD proceeding with computation,14 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,14 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,14 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,14 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,14 properties remain. new max is 64
SDD size :36 after 69
BEST_FIRST walk for 40004 steps (8 resets) in 248 ms. (160 steps per ms) remains 14/14 properties
SDD proceeding with computation,14 properties remain. new max is 128
SDD size :69 after 217326
BEST_FIRST walk for 40003 steps (8 resets) in 195 ms. (204 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 140 ms. (283 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 160 ms. (248 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 154 ms. (258 steps per ms) remains 14/14 properties
SDD proceeding with computation,14 properties remain. new max is 256
SDD size :217326 after 1.82617e+06
SDD proceeding with computation,14 properties remain. new max is 512
SDD size :1.82617e+06 after 5.0899e+07
SDD proceeding with computation,14 properties remain. new max is 1024
SDD size :5.0899e+07 after 3.93425e+08
Interrupted probabilistic random walk after 187811 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :0 out of 14
Probabilistic random walk after 187811 steps, saw 121496 distinct states, run finished after 3008 ms. (steps per millisecond=62 ) properties seen :0
[2025-06-03 08:07:47] [INFO ] Invariant cache hit.
[2025-06-03 08:07:47] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 3/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2025-06-03 08:07:48] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 2 ms to minimize.
Problem MAX0 is UNSAT
Problem MAX6 is UNSAT
Problem MAX8 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 21/35 variables, 14/16 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 6/22 constraints. Problems are: Problem set: 3 solved, 11 unsolved
SDD proceeding with computation,14 properties remain. new max is 2048
SDD size :3.93425e+08 after 4.29483e+09
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/35 variables, 0/22 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 1/36 variables, 1/23 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/36 variables, 0/23 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 0/36 variables, 0/23 constraints. Problems are: Problem set: 3 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/36 variables, and 23 constraints, problems are : Problem set: 3 solved, 11 unsolved in 246 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 3 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 3/14 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 21/35 variables, 14/16 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 6/22 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/35 variables, 9/31 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/35 variables, 0/31 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 1/36 variables, 1/32 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/36 variables, 2/34 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/36 variables, 0/34 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 0/36 variables, 0/34 constraints. Problems are: Problem set: 3 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/36 variables, and 34 constraints, problems are : Problem set: 3 solved, 11 unsolved in 236 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 11/14 constraints, Known Traps: 1/1 constraints]
After SMT, in 495ms problems are : Problem set: 3 solved, 11 unsolved
Fused 11 Parikh solutions to 4 different solutions.
SDD proceeding with computation,14 properties remain. new max is 4096
SDD size :4.29483e+09 after 1.80534e+10
Parikh walk visited 0 properties in 4582 ms.
Support contains 11 out of 15 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Running 12 sub problems to find dead transitions.
[2025-06-03 08:07:53] [INFO ] Invariant cache hit.
[2025-06-03 08:07:53] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 3/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 21/33 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 3/36 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 0/36 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/36 variables, and 22 constraints, problems are : Problem set: 0 solved, 12 unsolved in 164 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 3/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 21/33 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 3/36 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/36 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 0/36 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/36 variables, and 34 constraints, problems are : Problem set: 0 solved, 12 unsolved in 169 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 343ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 343ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 346 ms. Remains : 15/15 places, 21/21 transitions.
RANDOM walk for 40143 steps (8 resets) in 32 ms. (1216 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (8 resets) in 69 ms. (571 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 70 ms. (563 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 50 ms. (784 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 28 ms. (1379 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 49 ms. (800 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 34 ms. (1142 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (8 resets) in 49 ms. (800 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 59 ms. (666 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 183859 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :0 out of 11
Probabilistic random walk after 183859 steps, saw 118852 distinct states, run finished after 3001 ms. (steps per millisecond=61 ) properties seen :0
[2025-06-03 08:07:56] [INFO ] Invariant cache hit.
[2025-06-03 08:07:56] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 3/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2025-06-03 08:07:56] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 21/35 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 11 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/35 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 1/36 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/36 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 0/36 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/36 variables, and 23 constraints, problems are : Problem set: 0 solved, 11 unsolved in 227 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 3/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 21/35 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/35 variables, 9/31 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/35 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 1/36 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/36 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/36 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 0/36 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/36 variables, and 34 constraints, problems are : Problem set: 0 solved, 11 unsolved in 208 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 1/1 constraints]
After SMT, in 444ms problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 4 different solutions.
SDD proceeding with computation,14 properties remain. new max is 8192
SDD size :1.80534e+10 after 4.88734e+10
Parikh walk visited 0 properties in 5706 ms.
Support contains 11 out of 15 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 15/15 places, 21/21 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2025-06-03 08:08:02] [INFO ] Invariant cache hit.
[2025-06-03 08:08:02] [INFO ] Implicit Places using invariants in 25 ms returned []
[2025-06-03 08:08:02] [INFO ] Invariant cache hit.
[2025-06-03 08:08:03] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-03 08:08:03] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2025-06-03 08:08:03] [INFO ] Redundant transitions in 1 ms returned []
Running 12 sub problems to find dead transitions.
[2025-06-03 08:08:03] [INFO ] Invariant cache hit.
[2025-06-03 08:08:03] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 3/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 21/33 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 3/36 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 0/36 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/36 variables, and 22 constraints, problems are : Problem set: 0 solved, 12 unsolved in 150 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 3/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 21/33 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 3/36 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/36 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 0/36 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/36 variables, and 34 constraints, problems are : Problem set: 0 solved, 12 unsolved in 161 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 318ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 319ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 387 ms. Remains : 15/15 places, 21/21 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 0 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Running SMT prover for 11 properties.
[2025-06-03 08:08:03] [INFO ] Invariant cache hit.
[2025-06-03 08:08:03] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-03 08:08:03] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2025-06-03 08:08:03] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2025-06-03 08:08:03] [INFO ] After 37ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2025-06-03 08:08:03] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-03 08:08:03] [INFO ] After 36ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :11
TRAPS : Iteration 0
[2025-06-03 08:08:03] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 ms to minimize.
[2025-06-03 08:08:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 19 ms
TRAPS : Iteration 1
[2025-06-03 08:08:03] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
[2025-06-03 08:08:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 21 ms
TRAPS : Iteration 2
[2025-06-03 08:08:03] [INFO ] After 179ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
[2025-06-03 08:08:03] [INFO ] After 291ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
[2025-06-03 08:08:03] [INFO ] Flatten gal took : 6 ms
[2025-06-03 08:08:03] [INFO ] Flatten gal took : 5 ms
[2025-06-03 08:08:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8489848321755897597.gal : 1 ms
[2025-06-03 08:08:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13569829472406715369.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/ReachabilityCardinality8489848321755897597.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13569829472406715369.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/ReachabilityCardinality13569829472406715369.prop.
SDD proceeding with computation,11 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,11 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,11 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,11 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,11 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,11 properties remain. new max is 128
SDD size :69 after 315132
SDD proceeding with computation,11 properties remain. new max is 256
SDD size :315132 after 2.0791e+06
SDD proceeding with computation,11 properties remain. new max is 512
SDD size :2.0791e+06 after 5.0992e+07
SDD proceeding with computation,11 properties remain. new max is 1024
SDD size :5.0992e+07 after 8.52222e+08
SDD proceeding with computation,11 properties remain. new max is 2048
SDD size :8.52222e+08 after 6.63978e+09
SDD proceeding with computation,11 properties remain. new max is 4096
SDD size :6.63978e+09 after 1.80646e+10
SDD proceeding with computation,14 properties remain. new max is 16384
SDD size :4.88734e+10 after 1.17643e+11
Detected timeout of ITS tools.
[2025-06-03 08:08:18] [INFO ] Flatten gal took : 5 ms
[2025-06-03 08:08:18] [INFO ] Applying decomposition
[2025-06-03 08:08:18] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17601281200399788663.txt' '-o' '/tmp/graph17601281200399788663.bin' '-w' '/tmp/graph17601281200399788663.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17601281200399788663.bin' '-l' '-1' '-v' '-w' '/tmp/graph17601281200399788663.weights' '-q' '0' '-e' '0.001'
[2025-06-03 08:08:18] [INFO ] Decomposing Gal with order
[2025-06-03 08:08:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 08:08:19] [INFO ] Flatten gal took : 55 ms
[2025-06-03 08:08:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-06-03 08:08:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3557370984265502455.gal : 13 ms
[2025-06-03 08:08:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18045048581683248212.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/ReachabilityCardinality3557370984265502455.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18045048581683248212.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/ReachabilityCardinality18045048581683248212.prop.
SDD proceeding with computation,11 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,11 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,11 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,11 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,11 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,11 properties remain. new max is 128
SDD size :69 after 3434
SDD proceeding with computation,11 properties remain. new max is 256
SDD size :3434 after 4.24321e+06
SDD proceeding with computation,11 properties remain. new max is 512
SDD size :4.24321e+06 after 1.08908e+08
SDD proceeding with computation,11 properties remain. new max is 1024
SDD size :1.08908e+08 after 1.08908e+08
SDD proceeding with computation,11 properties remain. new max is 2048
SDD size :1.08908e+08 after 1.08908e+08
SDD proceeding with computation,11 properties remain. new max is 4096
SDD size :1.08908e+08 after 1.08908e+08
SDD proceeding with computation,11 properties remain. new max is 8192
SDD size :1.08908e+08 after 1.08908e+08
SDD proceeding with computation,11 properties remain. new max is 16384
SDD size :1.08908e+08 after 1.87564e+08
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30715 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-03 08:08:34] [INFO ] Flatten gal took : 4 ms
[2025-06-03 08:08:34] [INFO ] Applying decomposition
[2025-06-03 08:08:34] [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/graph16854734881135907886.txt' '-o' '/tmp/graph16854734881135907886.bin' '-w' '/tmp/graph16854734881135907886.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16854734881135907886.bin' '-l' '-1' '-v' '-w' '/tmp/graph16854734881135907886.weights' '-q' '0' '-e' '0.001'
[2025-06-03 08:08:34] [INFO ] Decomposing Gal with order
[2025-06-03 08:08:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 08:08:34] [INFO ] Flatten gal took : 6 ms
[2025-06-03 08:08:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-03 08:08:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality109398947732673076.gal : 1 ms
[2025-06-03 08:08:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5119016995558744429.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/ReachabilityCardinality109398947732673076.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5119016995558744429.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...306
Loading property file /tmp/ReachabilityCardinality5119016995558744429.prop.
SDD proceeding with computation,11 properties remain. new max is 4
SDD size :1 after 12
SDD proceeding with computation,11 properties remain. new max is 8
SDD size :12 after 42
SDD proceeding with computation,11 properties remain. new max is 16
SDD size :42 after 96
SDD proceeding with computation,11 properties remain. new max is 32
SDD size :96 after 198
SDD proceeding with computation,11 properties remain. new max is 64
SDD size :198 after 396
SDD proceeding with computation,11 properties remain. new max is 128
SDD size :396 after 18786
SDD proceeding with computation,11 properties remain. new max is 256
SDD size :18786 after 1.68454e+07
SDD proceeding with computation,11 properties remain. new max is 512
SDD size :1.68454e+07 after 2.67658e+10
SDD proceeding with computation,11 properties remain. new max is 1024
SDD size :2.67658e+10 after 2.67982e+10
SDD proceeding with computation,11 properties remain. new max is 2048
SDD size :2.67982e+10 after 2.67989e+10
SDD proceeding with computation,11 properties remain. new max is 4096
SDD size :2.67989e+10 after 2.68008e+10
SDD proceeding with computation,11 properties remain. new max is 8192
SDD size :2.68008e+10 after 2.68047e+10
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[297, 1, 1, 2, 1, 2, 299, 3, 287, 3, 2] Max Struct:[303, +inf, +inf, +inf, +inf, +inf, 303, +inf, 303, +inf, +inf]
Starting property specific reduction for Murphy-PT-D2N100-UpperBounds-00
Current structural bounds on expressions (Initially) : Max Seen:[100] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[100] Max Struct:[303]
Current structural bounds on expressions (Before main loop) : Max Seen:[100] Max Struct:[303]
[2025-06-03 08:09:24] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[100] Max Struct:[303]
RANDOM walk for 10070 steps (2 resets) in 4 ms. (2014 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:[109] Max Struct:[303]
[2025-06-03 08:09:24] [INFO ] Invariant cache hit.
[2025-06-03 08:09:24] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:09:24] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-06-03 08:09:24] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:09:24] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:09:24] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2025-06-03 08:09:24] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-03 08:09:24] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2025-06-03 08:09:24] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-03 08:09:24] [INFO ] Added : 0 causal constraints over 0 iterations in 8 ms. Result :sat
Minimization took 43 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[109] Max Struct:[303]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[249] Max Struct:[303]
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 21/21 transitions.
Applied a total of 0 rules in 2 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Running 12 sub problems to find dead transitions.
[2025-06-03 08:09:24] [INFO ] Invariant cache hit.
[2025-06-03 08:09:24] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 3/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 21/33 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 3/36 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 0/36 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/36 variables, and 22 constraints, problems are : Problem set: 0 solved, 12 unsolved in 266 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 3/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 21/33 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 3/36 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/36 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 0/36 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/36 variables, and 34 constraints, problems are : Problem set: 0 solved, 12 unsolved in 277 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 551ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 552ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 555 ms. Remains : 15/15 places, 21/21 transitions.
[2025-06-03 08:09:24] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[249] Max Struct:[303]
RANDOM walk for 1000049 steps (2 resets) in 496 ms. (2012 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 465 ms. (2145 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[249] Max Struct:[303]
[2025-06-03 08:09:25] [INFO ] Invariant cache hit.
[2025-06-03 08:09:25] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:09:25] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2025-06-03 08:09:25] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:09:25] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:09:26] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2025-06-03 08:09:26] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-03 08:09:26] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2025-06-03 08:09:26] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-03 08:09:26] [INFO ] Added : 3 causal constraints over 2 iterations in 10 ms. Result :sat
Minimization took 21 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[249] Max Struct:[303]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[297] Max Struct:[303]
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 15/15 places, 21/21 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2025-06-03 08:09:26] [INFO ] Invariant cache hit.
[2025-06-03 08:09:26] [INFO ] Implicit Places using invariants in 24 ms returned []
[2025-06-03 08:09:26] [INFO ] Invariant cache hit.
[2025-06-03 08:09:26] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-03 08:09:26] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2025-06-03 08:09:26] [INFO ] Redundant transitions in 0 ms returned []
Running 12 sub problems to find dead transitions.
[2025-06-03 08:09:26] [INFO ] Invariant cache hit.
[2025-06-03 08:09:26] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 3/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 21/33 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 3/36 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 0/36 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/36 variables, and 22 constraints, problems are : Problem set: 0 solved, 12 unsolved in 160 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 3/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 21/33 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 3/36 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/36 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 0/36 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/36 variables, and 34 constraints, problems are : Problem set: 0 solved, 12 unsolved in 267 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 432ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 433ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 498 ms. Remains : 15/15 places, 21/21 transitions.
[2025-06-03 08:09:26] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[297] Max Struct:[303]
RANDOM walk for 1000064 steps (2 resets) in 497 ms. (2008 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 605 ms. (1650 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[297] Max Struct:[303]
[2025-06-03 08:09:27] [INFO ] Invariant cache hit.
[2025-06-03 08:09:27] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-03 08:09:27] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2025-06-03 08:09:27] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:09:27] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:09:27] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2025-06-03 08:09:27] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-03 08:09:27] [INFO ] [Nat]Added 6 Read/Feed constraints in 4 ms returned sat
[2025-06-03 08:09:27] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-03 08:09:27] [INFO ] Added : 3 causal constraints over 2 iterations in 17 ms. Result :sat
Minimization took 18 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[297] Max Struct:[303]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[297] Max Struct:[303]
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 21/21 transitions.
Applied a total of 0 rules in 4 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 15/15 places, 21/21 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2025-06-03 08:09:27] [INFO ] Invariant cache hit.
[2025-06-03 08:09:27] [INFO ] Implicit Places using invariants in 34 ms returned []
[2025-06-03 08:09:27] [INFO ] Invariant cache hit.
[2025-06-03 08:09:27] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-03 08:09:27] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2025-06-03 08:09:27] [INFO ] Redundant transitions in 1 ms returned []
Running 12 sub problems to find dead transitions.
[2025-06-03 08:09:27] [INFO ] Invariant cache hit.
[2025-06-03 08:09:27] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 3/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 21/33 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 3/36 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 0/36 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/36 variables, and 22 constraints, problems are : Problem set: 0 solved, 12 unsolved in 277 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 3/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 21/33 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 3/36 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/36 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 0/36 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/36 variables, and 34 constraints, problems are : Problem set: 0 solved, 12 unsolved in 259 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 548ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 548ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 644 ms. Remains : 15/15 places, 21/21 transitions.
[2025-06-03 08:09:28] [INFO ] Flatten gal took : 5 ms
[2025-06-03 08:09:28] [INFO ] Flatten gal took : 4 ms
[2025-06-03 08:09:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2870822626623151163.gal : 2 ms
RANDOM walk for 40093 steps (8 resets) in 45 ms. (871 steps per ms) remains 2/2 properties
[2025-06-03 08:09:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3856323356368315911.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/ReachabilityCardinality2870822626623151163.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3856323356368315911.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (8 resets) in 42 ms. (930 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 ...328
Loading property file /tmp/ReachabilityCardinality3856323356368315911.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 36
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :36 after 69
BEST_FIRST walk for 40004 steps (8 resets) in 49 ms. (800 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :69 after 217326
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :217326 after 1.82617e+06
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1.82617e+06 after 5.0899e+07
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :5.0899e+07 after 3.93425e+08
Interrupted probabilistic random walk after 718629 steps, run timeout after 3001 ms. (steps per millisecond=239 ) properties seen :0 out of 2
Probabilistic random walk after 718629 steps, saw 462729 distinct states, run finished after 3001 ms. (steps per millisecond=239 ) properties seen :0
[2025-06-03 08:09:31] [INFO ] Invariant cache hit.
[2025-06-03 08:09:31] [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) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-03 08:09:31] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 9/15 variables, 6/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 6/21 variables, 3/11 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/21 variables, 3/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/21 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 15/36 variables, 9/23 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/36 variables, 0/23 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/36 variables, 0/23 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/36 variables, and 23 constraints, problems are : Problem set: 1 solved, 1 unsolved in 65 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 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) 5/6 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 9/15 variables, 6/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 6/21 variables, 3/11 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/21 variables, 3/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/21 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 15/36 variables, 9/23 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/36 variables, 1/24 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/36 variables, 0/24 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/36 variables, 0/24 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/36 variables, and 24 constraints, problems are : Problem set: 1 solved, 1 unsolved in 43 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 112ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 363 steps, including 2 resets, run visited all 1 properties in 1 ms. (steps per millisecond=363 )
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:[297] Max Struct:[303]
Ending property specific reduction for Murphy-PT-D2N100-UpperBounds-00 in 7502 ms.
Starting property specific reduction for Murphy-PT-D2N100-UpperBounds-03
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2025-06-03 08:09:31] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10040 steps (2 resets) in 4 ms. (2008 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[+inf]
[2025-06-03 08:09:31] [INFO ] Invariant cache hit.
[2025-06-03 08:09:31] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:09:31] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2025-06-03 08:09:31] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:09:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-03 08:09:31] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-06-03 08:09:31] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-03 08:09:31] [INFO ] [Nat]Added 6 Read/Feed constraints in 3 ms returned sat
[2025-06-03 08:09:31] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-03 08:09:31] [INFO ] Added : 1 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[+inf]
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 21/21 transitions.
Graph (complete) has 42 edges and 15 vertex of which 3 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 places :
Also discarding 16 output transitions
Drop transitions (Output transitions of discarded places.) removed 16 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 3 transition count 4
Applied a total of 2 rules in 13 ms. Remains 3 /15 variables (removed 12) and now considering 4/21 (removed 17) transitions.
Running 3 sub problems to find dead transitions.
// Phase 1: matrix 4 rows 3 cols
[2025-06-03 08:09:31] [INFO ] Computed 0 invariants in 1 ms
[2025-06-03 08:09:31] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 59 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 59 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 124ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 124ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 139 ms. Remains : 3/15 places, 4/21 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[1] Max Struct:[+inf]
[2025-06-03 08:09:32] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[+inf]
RANDOM walk for 1000001 steps (2 resets) in 482 ms. (2070 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 389 ms. (2564 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[+inf]
[2025-06-03 08:09:32] [INFO ] Invariant cache hit.
[2025-06-03 08:09:32] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2025-06-03 08:09:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 08:09:32] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-03 08:09:32] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:09:32] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2025-06-03 08:09:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-03 08:09:32] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 0 ms.
[2025-06-03 08:09:32] [INFO ] Added : 3 causal constraints over 2 iterations in 4 ms. Result :sat
Minimization took 2 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[+inf]
Support contains 1 out of 3 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 3/3 places, 4/4 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2025-06-03 08:09:32] [INFO ] Invariant cache hit.
[2025-06-03 08:09:33] [INFO ] Implicit Places using invariants in 14 ms returned []
[2025-06-03 08:09:33] [INFO ] Invariant cache hit.
[2025-06-03 08:09:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 08:09:33] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
[2025-06-03 08:09:33] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2025-06-03 08:09:33] [INFO ] Invariant cache hit.
[2025-06-03 08:09:33] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 45 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 39 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 87ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 88ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128 ms. Remains : 3/3 places, 4/4 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[1] Max Struct:[+inf]
[2025-06-03 08:09:33] [INFO ] Flatten gal took : 1 ms
[2025-06-03 08:09:33] [INFO ] Flatten gal took : 1 ms
[2025-06-03 08:09:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality25742507030026638.gal : 0 ms
[2025-06-03 08:09:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12506104922464124040.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/ReachabilityCardinality25742507030026638.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12506104922464124040.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
Loading property file /tmp/ReachabilityCardinality12506104922464124040.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,6,0.002198,3808,2,8,5,44,7,0,24,26,0
Total reachable state count : 6
Verifying 1 reachability properties.
Invariant property MIN0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,0,0.00242,3808,1,0,5,44,7,0,25,26,0
RANDOM walk for 40002 steps (8 resets) in 113 ms. (350 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
Probably explored full state space saw : 6 states, properties seen :0
Probabilistic random walk after 14 steps, saw 6 distinct states, run finished after 9 ms. (steps per millisecond=1 ) properties seen :0
Explored full state space saw : 6 states, properties seen :0
Exhaustive walk after 14 steps, saw 6 distinct states, run finished after 2 ms. (steps per millisecond=7 ) properties seen :0
FORMULA Murphy-PT-D2N100-UpperBounds-03 1 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for Murphy-PT-D2N100-UpperBounds-03 in 1506 ms.
Starting property specific reduction for Murphy-PT-D2N100-UpperBounds-05
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
// Phase 1: matrix 21 rows 15 cols
[2025-06-03 08:09:33] [INFO ] Computed 1 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10086 steps (2 resets) in 4 ms. (2017 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[+inf]
[2025-06-03 08:09:33] [INFO ] Invariant cache hit.
[2025-06-03 08:09:33] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-03 08:09:33] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2025-06-03 08:09:33] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:09:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:09:33] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-06-03 08:09:33] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-03 08:09:33] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2025-06-03 08:09:33] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-03 08:09:33] [INFO ] Added : 1 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[+inf]
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 21/21 transitions.
Graph (complete) has 42 edges and 15 vertex of which 3 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.0 ms
Discarding 12 places :
Also discarding 16 output transitions
Drop transitions (Output transitions of discarded places.) removed 16 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 3 transition count 4
Applied a total of 2 rules in 3 ms. Remains 3 /15 variables (removed 12) and now considering 4/21 (removed 17) transitions.
Running 3 sub problems to find dead transitions.
// Phase 1: matrix 4 rows 3 cols
[2025-06-03 08:09:33] [INFO ] Computed 0 invariants in 1 ms
[2025-06-03 08:09:33] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 52 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 58 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 115ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 115ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 119 ms. Remains : 3/15 places, 4/21 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[1] Max Struct:[+inf]
[2025-06-03 08:09:33] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 382 ms. (2610 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 211 ms. (4716 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[+inf]
[2025-06-03 08:09:34] [INFO ] Invariant cache hit.
[2025-06-03 08:09:34] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2025-06-03 08:09:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 08:09:34] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-03 08:09:34] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:09:34] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2025-06-03 08:09:34] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-03 08:09:34] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-03 08:09:34] [INFO ] Added : 3 causal constraints over 2 iterations in 5 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[+inf]
Support contains 1 out of 3 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 3/3 places, 4/4 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2025-06-03 08:09:34] [INFO ] Invariant cache hit.
[2025-06-03 08:09:34] [INFO ] Implicit Places using invariants in 13 ms returned []
[2025-06-03 08:09:34] [INFO ] Invariant cache hit.
[2025-06-03 08:09:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 08:09:34] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
[2025-06-03 08:09:34] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2025-06-03 08:09:34] [INFO ] Invariant cache hit.
[2025-06-03 08:09:34] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 44 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 45 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 92ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 92ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 130 ms. Remains : 3/3 places, 4/4 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[1] Max Struct:[+inf]
[2025-06-03 08:09:34] [INFO ] Flatten gal took : 1 ms
[2025-06-03 08:09:34] [INFO ] Flatten gal took : 2 ms
[2025-06-03 08:09:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4094431060301233935.gal : 1 ms
[2025-06-03 08:09:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17123685180604568047.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/ReachabilityCardinality4094431060301233935.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17123685180604568047.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40002 steps (8 resets) in 55 ms. (714 steps per ms) remains 1/1 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/ReachabilityCardinality17123685180604568047.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,6,0.003038,3812,2,8,5,44,7,0,24,26,0
Total reachable state count : 6
Verifying 1 reachability properties.
Invariant property MIN0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,0,0.003387,3812,1,0,5,44,7,0,25,26,0
BEST_FIRST walk for 40004 steps (8 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
Probably explored full state space saw : 6 states, properties seen :0
Probabilistic random walk after 14 steps, saw 6 distinct states, run finished after 5 ms. (steps per millisecond=2 ) properties seen :0
Explored full state space saw : 6 states, properties seen :0
Exhaustive walk after 14 steps, saw 6 distinct states, run finished after 1 ms. (steps per millisecond=14 ) properties seen :0
FORMULA Murphy-PT-D2N100-UpperBounds-05 1 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for Murphy-PT-D2N100-UpperBounds-05 in 1146 ms.
Starting property specific reduction for Murphy-PT-D2N100-UpperBounds-06
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
// Phase 1: matrix 21 rows 15 cols
[2025-06-03 08:09:34] [INFO ] Computed 1 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10050 steps (2 resets) in 6 ms. (1435 steps per ms)
BEST_FIRST walk for 10000 steps (2 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2025-06-03 08:09:34] [INFO ] Invariant cache hit.
[2025-06-03 08:09:34] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:09:34] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2025-06-03 08:09:34] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:09:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:09:34] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2025-06-03 08:09:34] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-03 08:09:34] [INFO ] [Nat]Added 6 Read/Feed constraints in 3 ms returned sat
[2025-06-03 08:09:34] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-03 08:09:34] [INFO ] Added : 2 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 10 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[+inf]
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 21/21 transitions.
Graph (complete) has 42 edges and 15 vertex of which 3 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.0 ms
Discarding 12 places :
Also discarding 16 output transitions
Drop transitions (Output transitions of discarded places.) removed 16 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 3 transition count 4
Applied a total of 2 rules in 3 ms. Remains 3 /15 variables (removed 12) and now considering 4/21 (removed 17) transitions.
Running 3 sub problems to find dead transitions.
// Phase 1: matrix 4 rows 3 cols
[2025-06-03 08:09:34] [INFO ] Computed 0 invariants in 0 ms
[2025-06-03 08:09:34] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 56 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 63 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 123ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 123ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 126 ms. Remains : 3/15 places, 4/21 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
[2025-06-03 08:09:34] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 493 ms. (2024 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 252 ms. (3952 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2025-06-03 08:09:35] [INFO ] Invariant cache hit.
[2025-06-03 08:09:35] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2025-06-03 08:09:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 08:09:35] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-03 08:09:35] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:09:35] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2025-06-03 08:09:35] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-03 08:09:35] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-03 08:09:35] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 2 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[+inf]
Support contains 1 out of 3 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 3/3 places, 4/4 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2025-06-03 08:09:35] [INFO ] Invariant cache hit.
[2025-06-03 08:09:35] [INFO ] Implicit Places using invariants in 13 ms returned []
[2025-06-03 08:09:35] [INFO ] Invariant cache hit.
[2025-06-03 08:09:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 08:09:35] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
[2025-06-03 08:09:35] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2025-06-03 08:09:35] [INFO ] Invariant cache hit.
[2025-06-03 08:09:35] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 40 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 37 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 81ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 81ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 119 ms. Remains : 3/3 places, 4/4 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
[2025-06-03 08:09:35] [INFO ] Flatten gal took : 1 ms
[2025-06-03 08:09:35] [INFO ] Flatten gal took : 1 ms
[2025-06-03 08:09:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality324939040582295357.gal : 9 ms
[2025-06-03 08:09:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7676152476007946747.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/ReachabilityCardinality324939040582295357.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7676152476007946747.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40001 steps (8 resets) in 29 ms. (1333 steps per ms) remains 1/1 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 ...327
Loading property file /tmp/ReachabilityCardinality7676152476007946747.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,6,0.002288,3812,2,8,5,44,7,0,24,26,0
Total reachable state count : 6
Verifying 1 reachability properties.
Invariant property MIN0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,0,0.002502,3812,1,0,5,44,7,0,25,26,0
BEST_FIRST walk for 40002 steps (8 resets) in 17 ms. (2222 steps per ms) remains 1/1 properties
Probably explored full state space saw : 6 states, properties seen :0
Probabilistic random walk after 14 steps, saw 6 distinct states, run finished after 4 ms. (steps per millisecond=3 ) properties seen :0
Explored full state space saw : 6 states, properties seen :0
Exhaustive walk after 14 steps, saw 6 distinct states, run finished after 2 ms. (steps per millisecond=7 ) properties seen :0
FORMULA Murphy-PT-D2N100-UpperBounds-06 2 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for Murphy-PT-D2N100-UpperBounds-06 in 1277 ms.
Starting property specific reduction for Murphy-PT-D2N100-UpperBounds-08
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
// Phase 1: matrix 21 rows 15 cols
[2025-06-03 08:09:35] [INFO ] Computed 1 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 4 ms. (2000 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[+inf]
[2025-06-03 08:09:35] [INFO ] Invariant cache hit.
[2025-06-03 08:09:35] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:09:35] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2025-06-03 08:09:35] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:09:35] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:09:35] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2025-06-03 08:09:35] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-03 08:09:35] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2025-06-03 08:09:35] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-03 08:09:35] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[+inf]
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 21/21 transitions.
Graph (complete) has 42 edges and 15 vertex of which 3 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.0 ms
Discarding 12 places :
Also discarding 16 output transitions
Drop transitions (Output transitions of discarded places.) removed 16 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 3 transition count 4
Applied a total of 2 rules in 1 ms. Remains 3 /15 variables (removed 12) and now considering 4/21 (removed 17) transitions.
Running 3 sub problems to find dead transitions.
// Phase 1: matrix 4 rows 3 cols
[2025-06-03 08:09:35] [INFO ] Computed 0 invariants in 1 ms
[2025-06-03 08:09:35] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 41 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 62 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 106ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 106ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 3/15 places, 4/21 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[1] Max Struct:[+inf]
[2025-06-03 08:09:35] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 470 ms. (2123 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 358 ms. (2785 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[+inf]
[2025-06-03 08:09:36] [INFO ] Invariant cache hit.
[2025-06-03 08:09:36] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2025-06-03 08:09:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 08:09:36] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-03 08:09:36] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:09:36] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2025-06-03 08:09:36] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-03 08:09:36] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-03 08:09:36] [INFO ] Added : 3 causal constraints over 2 iterations in 8 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[+inf]
Support contains 1 out of 3 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 3/3 places, 4/4 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2025-06-03 08:09:36] [INFO ] Invariant cache hit.
[2025-06-03 08:09:36] [INFO ] Implicit Places using invariants in 17 ms returned []
[2025-06-03 08:09:36] [INFO ] Invariant cache hit.
[2025-06-03 08:09:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 08:09:36] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2025-06-03 08:09:36] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2025-06-03 08:09:36] [INFO ] Invariant cache hit.
[2025-06-03 08:09:36] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 64 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 68 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 138ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 138ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 193 ms. Remains : 3/3 places, 4/4 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[1] Max Struct:[+inf]
RANDOM walk for 40000 steps (8 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
[2025-06-03 08:09:37] [INFO ] Flatten gal took : 1 ms
[2025-06-03 08:09:37] [INFO ] Flatten gal took : 1 ms
[2025-06-03 08:09:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17419599702176835385.gal : 2 ms
BEST_FIRST walk for 40004 steps (8 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
[2025-06-03 08:09:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9656889326707374160.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/ReachabilityCardinality17419599702176835385.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9656889326707374160.prop' '--nowitness' '--gen-order' 'FOLLOW'
Probably explored full state space saw : 6 states, properties seen :0
Probabilistic random walk after 14 steps, saw 6 distinct states, run finished after 4 ms. (steps per millisecond=3 ) properties seen :0
Explored full state space saw : 6 states, properties seen :0
Exhaustive walk after 14 steps, saw 6 distinct states, run finished after 1 ms. (steps per millisecond=14 ) properties seen :0
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/ReachabilityCardinality9656889326707374160.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,6,0.003238,3808,2,8,5,44,7,0,24,26,0
Total reachable state count : 6
Verifying 1 reachability properties.
Invariant property MIN0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,0,0.00357,3808,1,0,5,44,7,0,25,26,0
ITS runner timed out or was interrupted.
FORMULA Murphy-PT-D2N100-UpperBounds-08 1 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for Murphy-PT-D2N100-UpperBounds-08 in 1418 ms.
Starting property specific reduction for Murphy-PT-D2N100-UpperBounds-10
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
// Phase 1: matrix 21 rows 15 cols
[2025-06-03 08:09:37] [INFO ] Computed 1 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10045 steps (2 resets) in 6 ms. (1435 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2025-06-03 08:09:37] [INFO ] Invariant cache hit.
[2025-06-03 08:09:37] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:09:37] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2025-06-03 08:09:37] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:09:37] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:09:37] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2025-06-03 08:09:37] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-03 08:09:37] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2025-06-03 08:09:37] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-03 08:09:37] [INFO ] Added : 2 causal constraints over 1 iterations in 13 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[+inf]
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 21/21 transitions.
Graph (complete) has 42 edges and 15 vertex of which 3 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.0 ms
Discarding 12 places :
Also discarding 16 output transitions
Drop transitions (Output transitions of discarded places.) removed 16 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 3 transition count 4
Applied a total of 2 rules in 2 ms. Remains 3 /15 variables (removed 12) and now considering 4/21 (removed 17) transitions.
Running 3 sub problems to find dead transitions.
// Phase 1: matrix 4 rows 3 cols
[2025-06-03 08:09:37] [INFO ] Computed 0 invariants in 1 ms
[2025-06-03 08:09:37] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 49 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 54 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 121ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 121ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 123 ms. Remains : 3/15 places, 4/21 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
[2025-06-03 08:09:37] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 426 ms. (2341 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 313 ms. (3184 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2025-06-03 08:09:38] [INFO ] Invariant cache hit.
[2025-06-03 08:09:38] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2025-06-03 08:09:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 08:09:38] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-03 08:09:38] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:09:38] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2025-06-03 08:09:38] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-03 08:09:38] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-03 08:09:38] [INFO ] Added : 2 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[+inf]
Support contains 1 out of 3 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 3/3 places, 4/4 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2025-06-03 08:09:38] [INFO ] Invariant cache hit.
[2025-06-03 08:09:38] [INFO ] Implicit Places using invariants in 17 ms returned []
[2025-06-03 08:09:38] [INFO ] Invariant cache hit.
[2025-06-03 08:09:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 08:09:38] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2025-06-03 08:09:38] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2025-06-03 08:09:38] [INFO ] Invariant cache hit.
[2025-06-03 08:09:38] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 57 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 61 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 128ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 128ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 176 ms. Remains : 3/3 places, 4/4 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
[2025-06-03 08:09:38] [INFO ] Flatten gal took : 2 ms
[2025-06-03 08:09:38] [INFO ] Flatten gal took : 1 ms
RANDOM walk for 40000 steps (8 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
[2025-06-03 08:09:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10219887987786772294.gal : 6 ms
[2025-06-03 08:09:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality965577107544341625.prop : 6 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/ReachabilityCardinality10219887987786772294.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality965577107544341625.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40001 steps (8 resets) in 36 ms. (1081 steps per ms) remains 1/1 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 ...328
Loading property file /tmp/ReachabilityCardinality965577107544341625.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,6,0.003501,3808,2,8,5,44,7,0,24,26,0
Total reachable state count : 6
Verifying 1 reachability properties.
Invariant property MIN0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,0,0.003843,3808,1,0,5,44,7,0,25,26,0
Probably explored full state space saw : 6 states, properties seen :0
Probabilistic random walk after 14 steps, saw 6 distinct states, run finished after 5 ms. (steps per millisecond=2 ) properties seen :0
Explored full state space saw : 6 states, properties seen :0
Exhaustive walk after 14 steps, saw 6 distinct states, run finished after 1 ms. (steps per millisecond=14 ) properties seen :0
FORMULA Murphy-PT-D2N100-UpperBounds-10 2 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for Murphy-PT-D2N100-UpperBounds-10 in 1345 ms.
Starting property specific reduction for Murphy-PT-D2N100-UpperBounds-11
Current structural bounds on expressions (Initially) : Max Seen:[100] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[100] Max Struct:[303]
Current structural bounds on expressions (Before main loop) : Max Seen:[100] Max Struct:[303]
// Phase 1: matrix 21 rows 15 cols
[2025-06-03 08:09:38] [INFO ] Computed 1 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[100] Max Struct:[303]
RANDOM walk for 10000 steps (2 resets) in 6 ms. (1428 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[131] Max Struct:[303]
[2025-06-03 08:09:38] [INFO ] Invariant cache hit.
[2025-06-03 08:09:38] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:09:38] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2025-06-03 08:09:38] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:09:38] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-03 08:09:38] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-06-03 08:09:38] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-03 08:09:38] [INFO ] [Nat]Added 6 Read/Feed constraints in 4 ms returned sat
[2025-06-03 08:09:38] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-03 08:09:38] [INFO ] Added : 0 causal constraints over 0 iterations in 8 ms. Result :sat
Minimization took 49 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[131] Max Struct:[303]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[201] Max Struct:[303]
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Running 12 sub problems to find dead transitions.
[2025-06-03 08:09:38] [INFO ] Invariant cache hit.
[2025-06-03 08:09:38] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 3/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 21/33 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 3/36 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 0/36 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/36 variables, and 22 constraints, problems are : Problem set: 0 solved, 12 unsolved in 251 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 3/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 21/33 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 3/36 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/36 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 0/36 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/36 variables, and 34 constraints, problems are : Problem set: 0 solved, 12 unsolved in 291 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 567ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 568ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 571 ms. Remains : 15/15 places, 21/21 transitions.
[2025-06-03 08:09:39] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[201] Max Struct:[303]
RANDOM walk for 1000015 steps (2 resets) in 321 ms. (3105 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 351 ms. (2840 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[201] Max Struct:[303]
[2025-06-03 08:09:39] [INFO ] Invariant cache hit.
[2025-06-03 08:09:39] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:09:39] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2025-06-03 08:09:39] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:09:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:09:39] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2025-06-03 08:09:39] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-03 08:09:39] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2025-06-03 08:09:39] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-03 08:09:39] [INFO ] Added : 3 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[201] Max Struct:[303]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[299] Max Struct:[303]
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 21/21 transitions.
Applied a total of 0 rules in 2 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 15/15 places, 21/21 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2025-06-03 08:09:40] [INFO ] Invariant cache hit.
[2025-06-03 08:09:40] [INFO ] Implicit Places using invariants in 24 ms returned []
[2025-06-03 08:09:40] [INFO ] Invariant cache hit.
[2025-06-03 08:09:40] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-03 08:09:40] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2025-06-03 08:09:40] [INFO ] Redundant transitions in 0 ms returned []
Running 12 sub problems to find dead transitions.
[2025-06-03 08:09:40] [INFO ] Invariant cache hit.
[2025-06-03 08:09:40] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 3/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 21/33 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 3/36 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 0/36 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/36 variables, and 22 constraints, problems are : Problem set: 0 solved, 12 unsolved in 160 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 3/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 21/33 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 3/36 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/36 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 0/36 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/36 variables, and 34 constraints, problems are : Problem set: 0 solved, 12 unsolved in 171 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 351ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 352ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 435 ms. Remains : 15/15 places, 21/21 transitions.
[2025-06-03 08:09:40] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[299] Max Struct:[303]
RANDOM walk for 1000027 steps (2 resets) in 321 ms. (3105 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 357 ms. (2793 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[299] Max Struct:[303]
[2025-06-03 08:09:41] [INFO ] Invariant cache hit.
[2025-06-03 08:09:41] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:09:41] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2025-06-03 08:09:41] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:09:41] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:09:41] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2025-06-03 08:09:41] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-03 08:09:41] [INFO ] [Nat]Added 6 Read/Feed constraints in 4 ms returned sat
[2025-06-03 08:09:41] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-03 08:09:41] [INFO ] Added : 1 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 10 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[299] Max Struct:[303]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[299] Max Struct:[303]
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 15/15 places, 21/21 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2025-06-03 08:09:41] [INFO ] Invariant cache hit.
[2025-06-03 08:09:41] [INFO ] Implicit Places using invariants in 24 ms returned []
[2025-06-03 08:09:41] [INFO ] Invariant cache hit.
[2025-06-03 08:09:41] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-03 08:09:41] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2025-06-03 08:09:41] [INFO ] Redundant transitions in 0 ms returned []
Running 12 sub problems to find dead transitions.
[2025-06-03 08:09:41] [INFO ] Invariant cache hit.
[2025-06-03 08:09:41] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 3/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 21/33 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 3/36 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 0/36 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/36 variables, and 22 constraints, problems are : Problem set: 0 solved, 12 unsolved in 173 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 3/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 21/33 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 3/36 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/36 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 0/36 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/36 variables, and 34 constraints, problems are : Problem set: 0 solved, 12 unsolved in 202 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 405ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 406ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 485 ms. Remains : 15/15 places, 21/21 transitions.
RANDOM walk for 40164 steps (8 resets) in 30 ms. (1295 steps per ms) remains 2/2 properties
[2025-06-03 08:09:41] [INFO ] Flatten gal took : 2 ms
[2025-06-03 08:09:41] [INFO ] Flatten gal took : 2 ms
[2025-06-03 08:09:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4523447448663207603.gal : 1 ms
BEST_FIRST walk for 40002 steps (8 resets) in 28 ms. (1379 steps per ms) remains 2/2 properties
[2025-06-03 08:09:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12506401033213509726.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/ReachabilityCardinality4523447448663207603.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12506401033213509726.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/ReachabilityCardinality12506401033213509726.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 36
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :36 after 69
BEST_FIRST walk for 40003 steps (8 resets) in 54 ms. (727 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :69 after 217326
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :217326 after 1.82617e+06
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1.82617e+06 after 5.0899e+07
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :5.0899e+07 after 3.93425e+08
Interrupted probabilistic random walk after 696736 steps, run timeout after 3001 ms. (steps per millisecond=232 ) properties seen :0 out of 2
Probabilistic random walk after 696736 steps, saw 449345 distinct states, run finished after 3001 ms. (steps per millisecond=232 ) properties seen :0
[2025-06-03 08:09:44] [INFO ] Invariant cache hit.
[2025-06-03 08:09:44] [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) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-03 08:09:44] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 9/15 variables, 6/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 6/21 variables, 3/11 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/21 variables, 3/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/21 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 15/36 variables, 9/23 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/36 variables, 0/23 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/36 variables, 0/23 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/36 variables, and 23 constraints, problems are : Problem set: 1 solved, 1 unsolved in 78 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 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) 5/6 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 9/15 variables, 6/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 6/21 variables, 3/11 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/21 variables, 3/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/21 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 15/36 variables, 9/23 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/36 variables, 1/24 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/36 variables, 0/24 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/36 variables, 0/24 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/36 variables, and 24 constraints, problems are : Problem set: 1 solved, 1 unsolved in 57 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 140ms problems are : Problem set: 1 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :3.93425e+08 after 4.29483e+09
Parikh walk visited 0 properties in 34 ms.
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Running 12 sub problems to find dead transitions.
[2025-06-03 08:09:44] [INFO ] Invariant cache hit.
[2025-06-03 08:09:45] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 3/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 21/33 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 3/36 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 0/36 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/36 variables, and 22 constraints, problems are : Problem set: 0 solved, 12 unsolved in 164 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 3/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 21/33 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 3/36 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/36 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 0/36 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/36 variables, and 34 constraints, problems are : Problem set: 0 solved, 12 unsolved in 171 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 347ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 348ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 351 ms. Remains : 15/15 places, 21/21 transitions.
RANDOM walk for 40140 steps (8 resets) in 18 ms. (2112 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 20 ms. (1904 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2467348 steps, run timeout after 3001 ms. (steps per millisecond=822 ) properties seen :0 out of 1
Probabilistic random walk after 2467348 steps, saw 1585487 distinct states, run finished after 3001 ms. (steps per millisecond=822 ) properties seen :0
[2025-06-03 08:09:48] [INFO ] Invariant cache hit.
[2025-06-03 08:09:48] [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) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-03 08:09:48] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 9/15 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 6/21 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/21 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/21 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 15/36 variables, 9/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/36 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/36 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/36 variables, and 23 constraints, problems are : Problem set: 0 solved, 1 unsolved in 67 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 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) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 9/15 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 6/21 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/21 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/21 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 15/36 variables, 9/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/36 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/36 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/36 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/36 variables, and 24 constraints, problems are : Problem set: 0 solved, 1 unsolved in 47 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 119ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 33 ms.
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 21/21 transitions.
Applied a total of 0 rules in 3 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 15/15 places, 21/21 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 21/21 transitions.
Applied a total of 0 rules in 2 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2025-06-03 08:09:48] [INFO ] Invariant cache hit.
[2025-06-03 08:09:48] [INFO ] Implicit Places using invariants in 23 ms returned []
[2025-06-03 08:09:48] [INFO ] Invariant cache hit.
[2025-06-03 08:09:48] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-03 08:09:48] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2025-06-03 08:09:48] [INFO ] Redundant transitions in 0 ms returned []
Running 12 sub problems to find dead transitions.
[2025-06-03 08:09:48] [INFO ] Invariant cache hit.
[2025-06-03 08:09:48] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 3/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 21/33 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 3/36 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 0/36 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/36 variables, and 22 constraints, problems are : Problem set: 0 solved, 12 unsolved in 171 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 3/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 21/33 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 3/36 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/36 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 0/36 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/36 variables, and 34 constraints, problems are : Problem set: 0 solved, 12 unsolved in 170 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 349ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 350ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 416 ms. Remains : 15/15 places, 21/21 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 36 edges and 15 vertex of which 6 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 12 output transitions
Drop transitions (Output transitions of discarded places.) removed 12 transitions
Applied a total of 1 rules in 1 ms. Remains 6 /15 variables (removed 9) and now considering 9/21 (removed 12) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 9 rows 6 cols
[2025-06-03 08:09:48] [INFO ] Computed 1 invariants in 1 ms
[2025-06-03 08:09:48] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-03 08:09:48] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-03 08:09:48] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:09:48] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-03 08:09:48] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-06-03 08:09:49] [INFO ] After 4ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-03 08:09:49] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-03 08:09:49] [INFO ] After 39ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-06-03 08:09:49] [INFO ] Flatten gal took : 2 ms
[2025-06-03 08:09:49] [INFO ] Flatten gal took : 2 ms
[2025-06-03 08:09:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality144185572437230402.gal : 1 ms
[2025-06-03 08:09:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7803264996437987087.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/ReachabilityCardinality144185572437230402.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7803264996437987087.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
Loading property file /tmp/ReachabilityCardinality7803264996437987087.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 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :69 after 64974
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :4.29483e+09 after 1.80534e+10
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :64974 after 348281
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :5.40213e+07 after 5.40483e+07
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2.58862e+08 after 2.58895e+08
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1.80534e+10 after 4.88734e+10
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :6.8649e+08 after 6.8651e+08
Detected timeout of ITS tools.
[2025-06-03 08:10:04] [INFO ] Flatten gal took : 3 ms
[2025-06-03 08:10:04] [INFO ] Applying decomposition
[2025-06-03 08:10:04] [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/graph10646970888950950848.txt' '-o' '/tmp/graph10646970888950950848.bin' '-w' '/tmp/graph10646970888950950848.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10646970888950950848.bin' '-l' '-1' '-v' '-w' '/tmp/graph10646970888950950848.weights' '-q' '0' '-e' '0.001'
[2025-06-03 08:10:04] [INFO ] Decomposing Gal with order
[2025-06-03 08:10:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 08:10:04] [INFO ] Flatten gal took : 2 ms
[2025-06-03 08:10:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-03 08:10:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5975312053827064276.gal : 1 ms
[2025-06-03 08:10:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12907968628847361027.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/ReachabilityCardinality5975312053827064276.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12907968628847361027.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/ReachabilityCardinality12907968628847361027.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 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :69 after 3434
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :3434 after 4.24321e+06
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.08138e+08 after 1.08908e+08
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.08908e+08 after 1.08908e+08
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.08908e+08 after 1.08908e+08
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.08908e+08 after 1.08908e+08
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.08908e+08 after 1.08908e+08
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :2.67621e+08 after 2.68488e+08
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :4.88734e+10 after 1.17643e+11
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30159 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-03 08:10:19] [INFO ] Flatten gal took : 2 ms
[2025-06-03 08:10:19] [INFO ] Applying decomposition
[2025-06-03 08:10:19] [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/graph9540021167623654850.txt' '-o' '/tmp/graph9540021167623654850.bin' '-w' '/tmp/graph9540021167623654850.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9540021167623654850.bin' '-l' '-1' '-v' '-w' '/tmp/graph9540021167623654850.weights' '-q' '0' '-e' '0.001'
[2025-06-03 08:10:19] [INFO ] Decomposing Gal with order
[2025-06-03 08:10:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 08:10:19] [INFO ] Flatten gal took : 3 ms
[2025-06-03 08:10:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-03 08:10:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3904687588331311843.gal : 2 ms
[2025-06-03 08:10:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16551951903539732780.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/ReachabilityCardinality3904687588331311843.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16551951903539732780.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/ReachabilityCardinality16551951903539732780.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 12
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :12 after 42
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :42 after 96
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :96 after 198
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :198 after 396
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :396 after 18786
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :18786 after 1.68454e+07
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.68454e+07 after 2.67658e+10
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2.67658e+10 after 2.68709e+10
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2.68709e+10 after 2.70608e+10
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2.70608e+10 after 2.73999e+10
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :2.73999e+10 after 2.79348e+10
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[299] Max Struct:[303]
Ending property specific reduction for Murphy-PT-D2N100-UpperBounds-11 in 90798 ms.
Starting property specific reduction for Murphy-PT-D2N100-UpperBounds-12
Current structural bounds on expressions (Initially) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[3] Max Struct:[+inf]
// Phase 1: matrix 21 rows 15 cols
[2025-06-03 08:11:09] [INFO ] Computed 1 invariants in 36 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 10004 steps (2 resets) in 5 ms. (1667 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 4 ms. (2000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[+inf]
[2025-06-03 08:11:09] [INFO ] Invariant cache hit.
[2025-06-03 08:11:09] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:11:09] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2025-06-03 08:11:09] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:11:09] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:11:09] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2025-06-03 08:11:09] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-03 08:11:09] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2025-06-03 08:11:09] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-03 08:11:09] [INFO ] Added : 3 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[+inf]
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 21/21 transitions.
Graph (complete) has 42 edges and 15 vertex of which 3 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.0 ms
Discarding 12 places :
Also discarding 16 output transitions
Drop transitions (Output transitions of discarded places.) removed 16 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 3 transition count 4
Applied a total of 2 rules in 1 ms. Remains 3 /15 variables (removed 12) and now considering 4/21 (removed 17) transitions.
Running 3 sub problems to find dead transitions.
// Phase 1: matrix 4 rows 3 cols
[2025-06-03 08:11:09] [INFO ] Computed 0 invariants in 0 ms
[2025-06-03 08:11:09] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 39 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 45 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 88ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 89ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 3/15 places, 4/21 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
[2025-06-03 08:11:09] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 292 ms. (3412 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 219 ms. (4545 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[+inf]
[2025-06-03 08:11:09] [INFO ] Invariant cache hit.
[2025-06-03 08:11:09] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2025-06-03 08:11:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 08:11:09] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-03 08:11:09] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:11:10] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2025-06-03 08:11:10] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-03 08:11:10] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 0 ms.
[2025-06-03 08:11:10] [INFO ] Added : 3 causal constraints over 1 iterations in 3 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[+inf]
Support contains 1 out of 3 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 3/3 places, 4/4 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2025-06-03 08:11:10] [INFO ] Invariant cache hit.
[2025-06-03 08:11:10] [INFO ] Implicit Places using invariants in 14 ms returned []
[2025-06-03 08:11:10] [INFO ] Invariant cache hit.
[2025-06-03 08:11:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 08:11:10] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2025-06-03 08:11:10] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2025-06-03 08:11:10] [INFO ] Invariant cache hit.
[2025-06-03 08:11:10] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 39 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 39 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 81ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 82ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 119 ms. Remains : 3/3 places, 4/4 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
[2025-06-03 08:11:10] [INFO ] Flatten gal took : 0 ms
[2025-06-03 08:11:10] [INFO ] Flatten gal took : 0 ms
[2025-06-03 08:11:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15506343321862462133.gal : 1 ms
[2025-06-03 08:11:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18326968163248530870.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/ReachabilityCardinality15506343321862462133.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18326968163248530870.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40001 steps (8 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 18 ms. (2105 steps per ms) remains 1/1 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 ...330
Loading property file /tmp/ReachabilityCardinality18326968163248530870.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,6,0.002779,3812,2,8,5,44,7,0,24,26,0
Total reachable state count : 6
Verifying 1 reachability properties.
Invariant property MIN0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,0,0.003004,3812,1,0,5,44,7,0,25,26,0
Probably explored full state space saw : 6 states, properties seen :0
Probabilistic random walk after 14 steps, saw 6 distinct states, run finished after 4 ms. (steps per millisecond=3 ) properties seen :0
Explored full state space saw : 6 states, properties seen :0
Exhaustive walk after 14 steps, saw 6 distinct states, run finished after 2 ms. (steps per millisecond=7 ) properties seen :0
FORMULA Murphy-PT-D2N100-UpperBounds-12 3 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for Murphy-PT-D2N100-UpperBounds-12 in 1008 ms.
Starting property specific reduction for Murphy-PT-D2N100-UpperBounds-13
Current structural bounds on expressions (Initially) : Max Seen:[100] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[100] Max Struct:[303]
Current structural bounds on expressions (Before main loop) : Max Seen:[100] Max Struct:[303]
// Phase 1: matrix 21 rows 15 cols
[2025-06-03 08:11:10] [INFO ] Computed 1 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[100] Max Struct:[303]
RANDOM walk for 10001 steps (2 resets) in 4 ms. (2000 steps per ms)
BEST_FIRST walk for 10000 steps (2 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[113] Max Struct:[303]
[2025-06-03 08:11:10] [INFO ] Invariant cache hit.
[2025-06-03 08:11:10] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:11:10] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2025-06-03 08:11:10] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-03 08:11:10] [INFO ] [Real]Added 6 Read/Feed constraints in 2 ms returned sat
[2025-06-03 08:11:10] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:11:10] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:11:10] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2025-06-03 08:11:10] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2025-06-03 08:11:10] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-03 08:11:10] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Minimization took 26 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[113] Max Struct:[303]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[279] Max Struct:[303]
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Running 12 sub problems to find dead transitions.
[2025-06-03 08:11:10] [INFO ] Invariant cache hit.
[2025-06-03 08:11:10] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 3/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 21/33 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 3/36 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 0/36 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/36 variables, and 22 constraints, problems are : Problem set: 0 solved, 12 unsolved in 177 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 3/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 21/33 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 3/36 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/36 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 0/36 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/36 variables, and 34 constraints, problems are : Problem set: 0 solved, 12 unsolved in 182 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 364ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 365ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 366 ms. Remains : 15/15 places, 21/21 transitions.
[2025-06-03 08:11:10] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[279] Max Struct:[303]
RANDOM walk for 1000020 steps (2 resets) in 321 ms. (3105 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 397 ms. (2512 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[279] Max Struct:[303]
[2025-06-03 08:11:11] [INFO ] Invariant cache hit.
[2025-06-03 08:11:11] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:11:11] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-06-03 08:11:11] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:11:11] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:11:11] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2025-06-03 08:11:11] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-03 08:11:11] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2025-06-03 08:11:11] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-03 08:11:11] [INFO ] Added : 2 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[279] Max Struct:[303]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[291] Max Struct:[303]
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 15/15 places, 21/21 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2025-06-03 08:11:11] [INFO ] Invariant cache hit.
[2025-06-03 08:11:11] [INFO ] Implicit Places using invariants in 24 ms returned []
[2025-06-03 08:11:11] [INFO ] Invariant cache hit.
[2025-06-03 08:11:11] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-03 08:11:11] [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-03 08:11:11] [INFO ] Redundant transitions in 0 ms returned []
Running 12 sub problems to find dead transitions.
[2025-06-03 08:11:11] [INFO ] Invariant cache hit.
[2025-06-03 08:11:11] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 3/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 21/33 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 3/36 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 0/36 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/36 variables, and 22 constraints, problems are : Problem set: 0 solved, 12 unsolved in 153 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 3/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 21/33 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 3/36 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/36 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 0/36 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/36 variables, and 34 constraints, problems are : Problem set: 0 solved, 12 unsolved in 171 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 329ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 330ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 395 ms. Remains : 15/15 places, 21/21 transitions.
[2025-06-03 08:11:11] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[291] Max Struct:[303]
RANDOM walk for 1000103 steps (2 resets) in 291 ms. (3425 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 341 ms. (2923 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[291] Max Struct:[303]
[2025-06-03 08:11:12] [INFO ] Invariant cache hit.
[2025-06-03 08:11:12] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:11:12] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2025-06-03 08:11:12] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:11:12] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:11:12] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2025-06-03 08:11:12] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-03 08:11:12] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2025-06-03 08:11:12] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-03 08:11:12] [INFO ] Added : 2 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 16 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[291] Max Struct:[303]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[293] Max Struct:[303]
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 15/15 places, 21/21 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2025-06-03 08:11:12] [INFO ] Invariant cache hit.
[2025-06-03 08:11:12] [INFO ] Implicit Places using invariants in 22 ms returned []
[2025-06-03 08:11:12] [INFO ] Invariant cache hit.
[2025-06-03 08:11:12] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-03 08:11:12] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2025-06-03 08:11:12] [INFO ] Redundant transitions in 0 ms returned []
Running 12 sub problems to find dead transitions.
[2025-06-03 08:11:12] [INFO ] Invariant cache hit.
[2025-06-03 08:11:12] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 3/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 21/33 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 3/36 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 0/36 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/36 variables, and 22 constraints, problems are : Problem set: 0 solved, 12 unsolved in 261 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 3/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 21/33 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 3/36 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/36 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 0/36 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/36 variables, and 34 constraints, problems are : Problem set: 0 solved, 12 unsolved in 243 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 511ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 512ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 590 ms. Remains : 15/15 places, 21/21 transitions.
[2025-06-03 08:11:13] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[293] Max Struct:[303]
RANDOM walk for 1000000 steps (2 resets) in 499 ms. (2000 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 512 ms. (1949 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[293] Max Struct:[303]
[2025-06-03 08:11:14] [INFO ] Invariant cache hit.
[2025-06-03 08:11:14] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:11:14] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2025-06-03 08:11:14] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:11:14] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-03 08:11:14] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2025-06-03 08:11:14] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-03 08:11:14] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2025-06-03 08:11:14] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-03 08:11:14] [INFO ] Added : 2 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[293] Max Struct:[303]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[293] Max Struct:[303]
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 15/15 places, 21/21 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2025-06-03 08:11:14] [INFO ] Invariant cache hit.
[2025-06-03 08:11:14] [INFO ] Implicit Places using invariants in 22 ms returned []
[2025-06-03 08:11:14] [INFO ] Invariant cache hit.
[2025-06-03 08:11:14] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-03 08:11:14] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2025-06-03 08:11:14] [INFO ] Redundant transitions in 0 ms returned []
Running 12 sub problems to find dead transitions.
[2025-06-03 08:11:14] [INFO ] Invariant cache hit.
[2025-06-03 08:11:14] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 3/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 21/33 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 3/36 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 0/36 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/36 variables, and 22 constraints, problems are : Problem set: 0 solved, 12 unsolved in 172 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 3/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 21/33 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 3/36 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/36 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 0/36 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/36 variables, and 34 constraints, problems are : Problem set: 0 solved, 12 unsolved in 232 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 409ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 410ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 473 ms. Remains : 15/15 places, 21/21 transitions.
RANDOM walk for 40260 steps (8 resets) in 32 ms. (1220 steps per ms) remains 2/2 properties
[2025-06-03 08:11:14] [INFO ] Flatten gal took : 17 ms
BEST_FIRST walk for 40002 steps (8 resets) in 34 ms. (1142 steps per ms) remains 2/2 properties
[2025-06-03 08:11:14] [INFO ] Flatten gal took : 7 ms
[2025-06-03 08:11:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11494717959701083513.gal : 2 ms
[2025-06-03 08:11:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6160720554337867117.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/ReachabilityCardinality11494717959701083513.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6160720554337867117.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/ReachabilityCardinality6160720554337867117.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 36
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :36 after 69
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :69 after 217326
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :217326 after 1.82617e+06
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1.82617e+06 after 5.0899e+07
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :5.0899e+07 after 3.93425e+08
Interrupted probabilistic random walk after 512837 steps, run timeout after 3001 ms. (steps per millisecond=170 ) properties seen :0 out of 2
Probabilistic random walk after 512837 steps, saw 330260 distinct states, run finished after 3001 ms. (steps per millisecond=170 ) properties seen :0
[2025-06-03 08:11:17] [INFO ] Invariant cache hit.
[2025-06-03 08:11:17] [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) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-03 08:11:18] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 9/15 variables, 6/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 6/21 variables, 3/11 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/21 variables, 3/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/21 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 15/36 variables, 9/23 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/36 variables, 0/23 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/36 variables, 0/23 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/36 variables, and 23 constraints, problems are : Problem set: 1 solved, 1 unsolved in 66 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 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) 5/6 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 9/15 variables, 6/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 6/21 variables, 3/11 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/21 variables, 3/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/21 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 15/36 variables, 9/23 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/36 variables, 1/24 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/36 variables, 0/24 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/36 variables, 0/24 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/36 variables, and 24 constraints, problems are : Problem set: 1 solved, 1 unsolved in 43 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 112ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 31 ms.
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Running 12 sub problems to find dead transitions.
[2025-06-03 08:11:18] [INFO ] Invariant cache hit.
[2025-06-03 08:11:18] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 3/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 21/33 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 3/36 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 0/36 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/36 variables, and 22 constraints, problems are : Problem set: 0 solved, 12 unsolved in 162 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 3/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 21/33 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 3/36 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/36 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 0/36 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/36 variables, and 34 constraints, problems are : Problem set: 0 solved, 12 unsolved in 277 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 449ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 449ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 452 ms. Remains : 15/15 places, 21/21 transitions.
RANDOM walk for 40170 steps (8 resets) in 34 ms. (1147 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :3.93425e+08 after 4.29483e+09
Interrupted probabilistic random walk after 2457166 steps, run timeout after 3001 ms. (steps per millisecond=818 ) properties seen :0 out of 1
Probabilistic random walk after 2457166 steps, saw 1578852 distinct states, run finished after 3003 ms. (steps per millisecond=818 ) properties seen :0
[2025-06-03 08:11:21] [INFO ] Invariant cache hit.
[2025-06-03 08:11:21] [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) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-03 08:11:21] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 9/15 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 6/21 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/21 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/21 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 15/36 variables, 9/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/36 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/36 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/36 variables, and 23 constraints, problems are : Problem set: 0 solved, 1 unsolved in 73 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 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) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 9/15 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 6/21 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/21 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/21 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 15/36 variables, 9/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/36 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/36 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/36 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/36 variables, and 24 constraints, problems are : Problem set: 0 solved, 1 unsolved in 43 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 121ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 44 ms.
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 15/15 places, 21/21 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2025-06-03 08:11:21] [INFO ] Invariant cache hit.
[2025-06-03 08:11:21] [INFO ] Implicit Places using invariants in 32 ms returned []
[2025-06-03 08:11:21] [INFO ] Invariant cache hit.
[2025-06-03 08:11:21] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-03 08:11:21] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2025-06-03 08:11:21] [INFO ] Redundant transitions in 0 ms returned []
Running 12 sub problems to find dead transitions.
[2025-06-03 08:11:21] [INFO ] Invariant cache hit.
[2025-06-03 08:11:21] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 3/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 21/33 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 3/36 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 0/36 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/36 variables, and 22 constraints, problems are : Problem set: 0 solved, 12 unsolved in 271 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 3/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 21/33 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 3/36 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/36 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 0/36 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/36 variables, and 34 constraints, problems are : Problem set: 0 solved, 12 unsolved in 228 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 503ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 505ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 595 ms. Remains : 15/15 places, 21/21 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 36 edges and 15 vertex of which 6 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 12 output transitions
Drop transitions (Output transitions of discarded places.) removed 12 transitions
Applied a total of 1 rules in 2 ms. Remains 6 /15 variables (removed 9) and now considering 9/21 (removed 12) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 9 rows 6 cols
[2025-06-03 08:11:22] [INFO ] Computed 1 invariants in 0 ms
[2025-06-03 08:11:22] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:11:22] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-03 08:11:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:11:22] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-03 08:11:22] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-06-03 08:11:22] [INFO ] After 2ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-03 08:11:22] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-03 08:11:22] [INFO ] After 31ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-06-03 08:11:22] [INFO ] Flatten gal took : 4 ms
[2025-06-03 08:11:22] [INFO ] Flatten gal took : 2 ms
[2025-06-03 08:11:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3255809517400557992.gal : 0 ms
[2025-06-03 08:11:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14096871965657397725.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/ReachabilityCardinality3255809517400557992.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14096871965657397725.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/ReachabilityCardinality14096871965657397725.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 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :69 after 64974
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :64974 after 348281
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :4.29483e+09 after 1.80534e+10
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :5.40213e+07 after 5.40483e+07
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2.58862e+08 after 2.58895e+08
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :6.8649e+08 after 6.8651e+08
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1.80534e+10 after 4.88734e+10
Detected timeout of ITS tools.
[2025-06-03 08:11:37] [INFO ] Flatten gal took : 1 ms
[2025-06-03 08:11:37] [INFO ] Applying decomposition
[2025-06-03 08:11:37] [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/graph724223931148501185.txt' '-o' '/tmp/graph724223931148501185.bin' '-w' '/tmp/graph724223931148501185.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph724223931148501185.bin' '-l' '-1' '-v' '-w' '/tmp/graph724223931148501185.weights' '-q' '0' '-e' '0.001'
[2025-06-03 08:11:37] [INFO ] Decomposing Gal with order
[2025-06-03 08:11:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 08:11:37] [INFO ] Flatten gal took : 11 ms
[2025-06-03 08:11:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-03 08:11:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1228758523341779694.gal : 1 ms
[2025-06-03 08:11:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13095941974836979437.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/ReachabilityCardinality1228758523341779694.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13095941974836979437.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/ReachabilityCardinality13095941974836979437.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 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :69 after 3434
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :3434 after 4.24321e+06
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.08138e+08 after 1.08908e+08
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.08908e+08 after 1.08908e+08
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.08908e+08 after 1.08908e+08
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.08908e+08 after 1.08908e+08
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.08908e+08 after 1.08908e+08
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :2.67621e+08 after 2.68488e+08
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :4.88734e+10 after 1.17643e+11
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30147 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-03 08:11:52] [INFO ] Flatten gal took : 3 ms
[2025-06-03 08:11:52] [INFO ] Applying decomposition
[2025-06-03 08:11:52] [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/graph17617614941817895738.txt' '-o' '/tmp/graph17617614941817895738.bin' '-w' '/tmp/graph17617614941817895738.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17617614941817895738.bin' '-l' '-1' '-v' '-w' '/tmp/graph17617614941817895738.weights' '-q' '0' '-e' '0.001'
[2025-06-03 08:11:52] [INFO ] Decomposing Gal with order
[2025-06-03 08:11:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 08:11:52] [INFO ] Flatten gal took : 3 ms
[2025-06-03 08:11:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-03 08:11:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14144213303607316764.gal : 1 ms
[2025-06-03 08:11:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6643581609627015327.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/ReachabilityCardinality14144213303607316764.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6643581609627015327.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/ReachabilityCardinality6643581609627015327.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 12
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :12 after 42
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :42 after 96
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :96 after 198
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :198 after 396
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :396 after 18786
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :18786 after 1.68454e+07
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.68454e+07 after 2.67658e+10
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2.67658e+10 after 2.68709e+10
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2.68709e+10 after 2.70608e+10
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2.70608e+10 after 2.73999e+10
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :2.73999e+10 after 2.79348e+10
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[293] Max Struct:[303]
Ending property specific reduction for Murphy-PT-D2N100-UpperBounds-13 in 92424 ms.
Starting property specific reduction for Murphy-PT-D2N100-UpperBounds-14
Current structural bounds on expressions (Initially) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[3] Max Struct:[+inf]
// Phase 1: matrix 21 rows 15 cols
[2025-06-03 08:12:42] [INFO ] Computed 1 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 4 ms. (2000 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 4 ms. (2000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[+inf]
[2025-06-03 08:12:42] [INFO ] Invariant cache hit.
[2025-06-03 08:12:42] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:12:42] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2025-06-03 08:12:42] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:12:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:12:42] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2025-06-03 08:12:42] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-03 08:12:42] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2025-06-03 08:12:42] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-03 08:12:42] [INFO ] Added : 3 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[+inf]
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 21/21 transitions.
Graph (complete) has 42 edges and 15 vertex of which 3 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.0 ms
Discarding 12 places :
Also discarding 16 output transitions
Drop transitions (Output transitions of discarded places.) removed 16 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 3 transition count 4
Applied a total of 2 rules in 1 ms. Remains 3 /15 variables (removed 12) and now considering 4/21 (removed 17) transitions.
Running 3 sub problems to find dead transitions.
// Phase 1: matrix 4 rows 3 cols
[2025-06-03 08:12:42] [INFO ] Computed 0 invariants in 0 ms
[2025-06-03 08:12:42] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 53 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 63 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 122ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 122ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 123 ms. Remains : 3/15 places, 4/21 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
[2025-06-03 08:12:42] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 535 ms. (1865 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 366 ms. (2724 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[+inf]
[2025-06-03 08:12:43] [INFO ] Invariant cache hit.
[2025-06-03 08:12:43] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2025-06-03 08:12:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 08:12:43] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-03 08:12:43] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:12:43] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2025-06-03 08:12:43] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-03 08:12:43] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 0 ms.
[2025-06-03 08:12:43] [INFO ] Added : 3 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[+inf]
Support contains 1 out of 3 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 3/3 places, 4/4 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2025-06-03 08:12:43] [INFO ] Invariant cache hit.
[2025-06-03 08:12:43] [INFO ] Implicit Places using invariants in 14 ms returned []
[2025-06-03 08:12:43] [INFO ] Invariant cache hit.
[2025-06-03 08:12:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 08:12:43] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2025-06-03 08:12:43] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2025-06-03 08:12:43] [INFO ] Invariant cache hit.
[2025-06-03 08:12:43] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 39 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 38 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 84ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 84ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 122 ms. Remains : 3/3 places, 4/4 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
[2025-06-03 08:12:43] [INFO ] Flatten gal took : 0 ms
[2025-06-03 08:12:44] [INFO ] Flatten gal took : 0 ms
[2025-06-03 08:12:44] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7162103253292975855.gal : 1 ms
[2025-06-03 08:12:44] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3823249369839863392.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/ReachabilityCardinality7162103253292975855.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3823249369839863392.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40002 steps (8 resets) in 32 ms. (1212 steps per ms) remains 1/1 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 ...328
Loading property file /tmp/ReachabilityCardinality3823249369839863392.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,6,0.002766,3808,2,8,5,44,7,0,24,26,0
Total reachable state count : 6
Verifying 1 reachability properties.
Invariant property MIN0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,0,0.002987,3808,1,0,5,44,7,0,25,26,0
BEST_FIRST walk for 40002 steps (8 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Probably explored full state space saw : 6 states, properties seen :0
Probabilistic random walk after 14 steps, saw 6 distinct states, run finished after 4 ms. (steps per millisecond=3 ) properties seen :0
Explored full state space saw : 6 states, properties seen :0
Exhaustive walk after 14 steps, saw 6 distinct states, run finished after 1 ms. (steps per millisecond=14 ) properties seen :0
FORMULA Murphy-PT-D2N100-UpperBounds-14 3 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for Murphy-PT-D2N100-UpperBounds-14 in 1392 ms.
Starting property specific reduction for Murphy-PT-D2N100-UpperBounds-15
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
// Phase 1: matrix 21 rows 15 cols
[2025-06-03 08:12:44] [INFO ] Computed 1 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10014 steps (2 resets) in 4 ms. (2002 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2025-06-03 08:12:44] [INFO ] Invariant cache hit.
[2025-06-03 08:12:44] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:12:44] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2025-06-03 08:12:44] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:12:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-03 08:12:44] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2025-06-03 08:12:44] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-03 08:12:44] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2025-06-03 08:12:44] [INFO ] Computed and/alt/rep : 12/30/12 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-03 08:12:44] [INFO ] Added : 2 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[+inf]
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 21/21 transitions.
Graph (complete) has 42 edges and 15 vertex of which 3 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.0 ms
Discarding 12 places :
Also discarding 16 output transitions
Drop transitions (Output transitions of discarded places.) removed 16 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 3 transition count 4
Applied a total of 2 rules in 0 ms. Remains 3 /15 variables (removed 12) and now considering 4/21 (removed 17) transitions.
Running 3 sub problems to find dead transitions.
// Phase 1: matrix 4 rows 3 cols
[2025-06-03 08:12:44] [INFO ] Computed 0 invariants in 0 ms
[2025-06-03 08:12:44] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 38 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 41 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 81ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 81ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 3/15 places, 4/21 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
[2025-06-03 08:12:44] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 453 ms. (2202 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 246 ms. (4048 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2025-06-03 08:12:44] [INFO ] Invariant cache hit.
[2025-06-03 08:12:44] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2025-06-03 08:12:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 08:12:44] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-03 08:12:44] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 08:12:44] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2025-06-03 08:12:44] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-03 08:12:44] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-03 08:12:44] [INFO ] Added : 2 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 2 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[+inf]
Support contains 1 out of 3 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 3/3 places, 4/4 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2025-06-03 08:12:44] [INFO ] Invariant cache hit.
[2025-06-03 08:12:44] [INFO ] Implicit Places using invariants in 13 ms returned []
[2025-06-03 08:12:44] [INFO ] Invariant cache hit.
[2025-06-03 08:12:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 08:12:45] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2025-06-03 08:12:45] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2025-06-03 08:12:45] [INFO ] Invariant cache hit.
[2025-06-03 08:12:45] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 33 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 67 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 103ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 103ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 142 ms. Remains : 3/3 places, 4/4 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
[2025-06-03 08:12:45] [INFO ] Flatten gal took : 0 ms
[2025-06-03 08:12:45] [INFO ] Flatten gal took : 1 ms
RANDOM walk for 40001 steps (8 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
[2025-06-03 08:12:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9502137656828426814.gal : 1 ms
[2025-06-03 08:12:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7819518463029362181.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/ReachabilityCardinality9502137656828426814.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7819518463029362181.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality7819518463029362181.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,6,0.002051,3812,2,8,5,44,7,0,24,26,0
Total reachable state count : 6
Verifying 1 reachability properties.
Invariant property MIN0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,0,0.002261,3812,1,0,5,44,7,0,25,26,0
BEST_FIRST walk for 40002 steps (8 resets) in 20 ms. (1904 steps per ms) remains 1/1 properties
Probably explored full state space saw : 6 states, properties seen :0
Probabilistic random walk after 14 steps, saw 6 distinct states, run finished after 5 ms. (steps per millisecond=2 ) properties seen :0
Explored full state space saw : 6 states, properties seen :0
Exhaustive walk after 14 steps, saw 6 distinct states, run finished after 1 ms. (steps per millisecond=14 ) properties seen :0
FORMULA Murphy-PT-D2N100-UpperBounds-15 2 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for Murphy-PT-D2N100-UpperBounds-15 in 1168 ms.
[2025-06-03 08:12:45] [INFO ] Flatten gal took : 1 ms
[2025-06-03 08:12:45] [INFO ] Applying decomposition
[2025-06-03 08:12:45] [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/graph3675273145333112321.txt' '-o' '/tmp/graph3675273145333112321.bin' '-w' '/tmp/graph3675273145333112321.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3675273145333112321.bin' '-l' '-1' '-v' '-w' '/tmp/graph3675273145333112321.weights' '-q' '0' '-e' '0.001'
[2025-06-03 08:12:45] [INFO ] Decomposing Gal with order
[2025-06-03 08:12:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 08:12:45] [INFO ] Flatten gal took : 3 ms
[2025-06-03 08:12:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-03 08:12:45] [INFO ] Time to serialize gal into /tmp/UpperBounds5572781039951437341.gal : 1 ms
[2025-06-03 08:12:45] [INFO ] Time to serialize properties into /tmp/UpperBounds16361284963229116486.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/UpperBounds5572781039951437341.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds16361284963229116486.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds16361284963229116486.prop.
Detected timeout of ITS tools.
[2025-06-03 08:34:35] [INFO ] Flatten gal took : 2 ms
[2025-06-03 08:34:35] [INFO ] Time to serialize gal into /tmp/UpperBounds17138429632155352583.gal : 1 ms
[2025-06-03 08:34:35] [INFO ] Time to serialize properties into /tmp/UpperBounds9825048983308749883.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/UpperBounds17138429632155352583.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds9825048983308749883.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/UpperBounds9825048983308749883.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.20704e+12,76.3513,700796,2,9701,5,2.30096e+06,6,0,105,2.42323e+06,0
Total reachable state count : 1207044185616
Verifying 3 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 299
Bounds property Murphy-PT-D2N100-UpperBounds-00 :0 <= p1_2 <= 299
FORMULA Murphy-PT-D2N100-UpperBounds-00 299 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Murphy-PT-D2N100-UpperBounds-00,0,76.6115,700796,1,0,7,2.30096e+06,9,1,441,2.42323e+06,4
Min sum of variable value : 0
Maximum sum along a path : 299
Bounds property Murphy-PT-D2N100-UpperBounds-11 :0 <= p1_3 <= 299
FORMULA Murphy-PT-D2N100-UpperBounds-11 299 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Murphy-PT-D2N100-UpperBounds-11,0,76.6166,700796,1,0,8,2.30096e+06,10,1,750,2.42323e+06,5
Min sum of variable value : 0
Maximum sum along a path : 299
Bounds property Murphy-PT-D2N100-UpperBounds-13 :0 <= p1_1 <= 299
FORMULA Murphy-PT-D2N100-UpperBounds-13 299 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Murphy-PT-D2N100-UpperBounds-13,0,77.4295,700796,1,0,9,2.30096e+06,11,1,1079,2.42323e+06,6
Total runtime 1719156 ms.
BK_STOP 1748939753161
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Murphy-PT-D2N100"
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 Murphy-PT-D2N100, 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 r139-smll-174876533200074"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Murphy-PT-D2N100.tgz
mv Murphy-PT-D2N100 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 ;