fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r153-tall-174876824800091
Last Updated
June 24, 2025

About the Execution of 2024-gold for PGCD-PT-D03N050

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15691.280 648380.00 707050.00 2311.20 201 201 201 199 201 201 201 201 199 201 201 201 201 201 201 201 normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r153-tall-174876824800091.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool gold2024
Input is PGCD-PT-D03N050, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r153-tall-174876824800091
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 440K
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 8 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 7.4K May 29 14:32 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1748841699137

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PGCD-PT-D03N050
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-02 05:21:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 05:21:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 05:21:40] [INFO ] Load time of PNML (sax parser for PT used): 31 ms
[2025-06-02 05:21:40] [INFO ] Transformed 12 places.
[2025-06-02 05:21:40] [INFO ] Transformed 12 transitions.
[2025-06-02 05:21:40] [INFO ] Parsed PT model containing 12 places and 12 transitions and 56 arcs in 124 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Reduction of identical properties reduced properties to check from 16 to 9
Current structural bounds on expressions (Initially) : Max Seen:[1, 1, 1, 50, 1, 50, 1, 1, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[1, 1, 1, 50, 1, 50, 1, 1, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 12 rows 12 cols
[2025-06-02 05:21:40] [INFO ] Computed 5 invariants in 7 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1, 1, 50, 1, 50, 1, 1, 1] Max Struct:[204, 204, 204, 204, 204, 204, 204, 204, 204]
RANDOM walk for 10005 steps (2 resets) in 14 ms. (667 steps per ms)
BEST_FIRST walk for 90008 steps (18 resets) in 78 ms. (1139 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[93, 105, 79, 151, 69, 151, 79, 69, 105] Max Struct:[204, 204, 204, 204, 204, 204, 204, 204, 204]
[2025-06-02 05:21:40] [INFO ] Invariant cache hit.
[2025-06-02 05:21:40] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2025-06-02 05:21:40] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-02 05:21:40] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2025-06-02 05:21:40] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:21:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2025-06-02 05:21:40] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-02 05:21:40] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2025-06-02 05:21:40] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-06-02 05:21:40] [INFO ] [Nat]Added 4 Read/Feed constraints in 4 ms returned sat
[2025-06-02 05:21:40] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 05:21:40] [INFO ] Added : 0 causal constraints over 0 iterations in 11 ms. Result :sat
Minimization took 20 ms.
[2025-06-02 05:21:41] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-02 05:21:41] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 5 ms returned sat
[2025-06-02 05:21:41] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2025-06-02 05:21:41] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:21:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:21:41] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2025-06-02 05:21:41] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2025-06-02 05:21:41] [INFO ] [Nat]Added 4 Read/Feed constraints in 3 ms returned sat
[2025-06-02 05:21:41] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-02 05:21:41] [INFO ] Added : 0 causal constraints over 0 iterations in 14 ms. Result :sat
Minimization took 22 ms.
[2025-06-02 05:21:41] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:21:41] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2025-06-02 05:21:41] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2025-06-02 05:21:41] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:21:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:21:41] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-02 05:21:41] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2025-06-02 05:21:41] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:21:41] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:21:41] [INFO ] Added : 0 causal constraints over 0 iterations in 11 ms. Result :sat
Minimization took 18 ms.
[2025-06-02 05:21:41] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-02 05:21:41] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-02 05:21:41] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2025-06-02 05:21:41] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:21:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:21:41] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-02 05:21:41] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2025-06-02 05:21:41] [INFO ] [Nat]Added 4 Read/Feed constraints in 2 ms returned sat
[2025-06-02 05:21:41] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:21:41] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 25 ms.
[2025-06-02 05:21:41] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:21:41] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-02 05:21:41] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2025-06-02 05:21:41] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:21:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2025-06-02 05:21:41] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-02 05:21:41] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2025-06-02 05:21:41] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:21:41] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:21:41] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Minimization took 24 ms.
[2025-06-02 05:21:41] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:21:41] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-02 05:21:41] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2025-06-02 05:21:41] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:21:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-02 05:21:41] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-02 05:21:41] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2025-06-02 05:21:41] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:21:41] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:21:41] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 19 ms.
[2025-06-02 05:21:41] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:21:41] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-02 05:21:41] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2025-06-02 05:21:41] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:21:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:21:41] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2025-06-02 05:21:41] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2025-06-02 05:21:41] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:21:41] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:21:41] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Minimization took 18 ms.
[2025-06-02 05:21:41] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:21:41] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-02 05:21:41] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2025-06-02 05:21:41] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:21:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:21:41] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-02 05:21:41] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2025-06-02 05:21:41] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:21:41] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:21:41] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 31 ms.
[2025-06-02 05:21:41] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-02 05:21:41] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-02 05:21:41] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2025-06-02 05:21:41] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:21:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:21:41] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-02 05:21:41] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2025-06-02 05:21:41] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:21:41] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-02 05:21:41] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Minimization took 21 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[93, 105, 79, 151, 69, 151, 79, 69, 105] Max Struct:[204, 204, 204, 204, 204, 204, 204, 204, 204]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[199, 201, 201, 195, 201, 195, 201, 201, 201] Max Struct:[204, 204, 204, 204, 204, 204, 204, 204, 204]
Support contains 9 out of 12 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 14 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Running 4 sub problems to find dead transitions.
[2025-06-02 05:21:42] [INFO ] Invariant cache hit.
[2025-06-02 05:21:42] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 4/12 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 12/24 variables, 12/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/24 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24/24 variables, and 21 constraints, problems are : Problem set: 0 solved, 4 unsolved in 111 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 12/12 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 4/12 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 12/24 variables, 12/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 4/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/24 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/24 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/24 variables, and 25 constraints, problems are : Problem set: 0 solved, 4 unsolved in 94 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 12/12 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 234ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 241ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 265 ms. Remains : 12/12 places, 12/12 transitions.
[2025-06-02 05:21:42] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[199, 201, 201, 195, 201, 195, 201, 201, 201] Max Struct:[204, 204, 204, 204, 204, 204, 204, 204, 204]
RANDOM walk for 1000061 steps (2 resets) in 213 ms. (4673 steps per ms)
BEST_FIRST walk for 9000008 steps (18 resets) in 2453 ms. (3667 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[199, 201, 201, 195, 201, 195, 201, 201, 201] Max Struct:[204, 204, 204, 204, 204, 204, 204, 204, 204]
[2025-06-02 05:21:45] [INFO ] Invariant cache hit.
[2025-06-02 05:21:45] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-02 05:21:45] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-02 05:21:45] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-06-02 05:21:45] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:21:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2025-06-02 05:21:45] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-02 05:21:45] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2025-06-02 05:21:45] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-06-02 05:21:45] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:21:45] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:21:45] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Minimization took 13 ms.
[2025-06-02 05:21:45] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2025-06-02 05:21:45] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-02 05:21:45] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2025-06-02 05:21:45] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:21:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2025-06-02 05:21:45] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-02 05:21:45] [INFO ] [Nat]Absence check using state equation in 5 ms returned unsat
[2025-06-02 05:21:45] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:21:45] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-02 05:21:45] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2025-06-02 05:21:45] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:21:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:21:45] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2025-06-02 05:21:45] [INFO ] [Nat]Absence check using state equation in 10 ms returned unsat
[2025-06-02 05:21:45] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:21:45] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2025-06-02 05:21:45] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2025-06-02 05:21:45] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:21:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:21:45] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2025-06-02 05:21:45] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2025-06-02 05:21:45] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:21:45] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:21:45] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 10 ms.
[2025-06-02 05:21:45] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:21:45] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-02 05:21:45] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2025-06-02 05:21:45] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:21:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2025-06-02 05:21:45] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2025-06-02 05:21:45] [INFO ] [Nat]Absence check using state equation in 4 ms returned unsat
[2025-06-02 05:21:45] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2025-06-02 05:21:45] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2025-06-02 05:21:45] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2025-06-02 05:21:45] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:21:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:21:45] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-02 05:21:45] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2025-06-02 05:21:45] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:21:45] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:21:45] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 10 ms.
[2025-06-02 05:21:45] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:21:45] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-02 05:21:45] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2025-06-02 05:21:45] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:21:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:21:45] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-02 05:21:45] [INFO ] [Nat]Absence check using state equation in 7 ms returned unsat
[2025-06-02 05:21:45] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:21:45] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-02 05:21:45] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2025-06-02 05:21:45] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:21:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:21:45] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-02 05:21:45] [INFO ] [Nat]Absence check using state equation in 27 ms returned unsat
[2025-06-02 05:21:45] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:21:45] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-02 05:21:45] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2025-06-02 05:21:45] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:21:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:21:45] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-02 05:21:45] [INFO ] [Nat]Absence check using state equation in 4 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[199, 201, 201, 195, 201, 195, 201, 201, 201] Max Struct:[204, 201, 201, 204, 201, 204, 201, 201, 201]
FORMULA PGCD-PT-D03N050-UpperBounds-15 201 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PGCD-PT-D03N050-UpperBounds-14 201 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PGCD-PT-D03N050-UpperBounds-10 201 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PGCD-PT-D03N050-UpperBounds-11 201 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PGCD-PT-D03N050-UpperBounds-06 201 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PGCD-PT-D03N050-UpperBounds-09 201 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PGCD-PT-D03N050-UpperBounds-12 201 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PGCD-PT-D03N050-UpperBounds-02 201 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PGCD-PT-D03N050-UpperBounds-04 201 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PGCD-PT-D03N050-UpperBounds-01 201 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[199, 199, 197] Max Struct:[204, 204, 204]
Support contains 3 out of 12 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 3 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 12/12 places, 12/12 transitions.
[2025-06-02 05:21:45] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[199, 199, 197] Max Struct:[204, 204, 204]
RANDOM walk for 1000015 steps (2 resets) in 154 ms. (6451 steps per ms)
BEST_FIRST walk for 3000002 steps (6 resets) in 734 ms. (4081 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[199, 199, 197] Max Struct:[204, 204, 204]
[2025-06-02 05:21:46] [INFO ] Invariant cache hit.
[2025-06-02 05:21:46] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:21:46] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-02 05:21:46] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2025-06-02 05:21:46] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:21:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:21:46] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-02 05:21:46] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2025-06-02 05:21:46] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-06-02 05:21:46] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:21:46] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 05:21:46] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Minimization took 12 ms.
[2025-06-02 05:21:46] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:21:46] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-02 05:21:46] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2025-06-02 05:21:46] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:21:47] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:21:47] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-02 05:21:47] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2025-06-02 05:21:47] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:21:47] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 05:21:47] [INFO ] Added : 1 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 10 ms.
[2025-06-02 05:21:47] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:21:47] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-02 05:21:47] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2025-06-02 05:21:47] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:21:47] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2025-06-02 05:21:47] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-02 05:21:47] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2025-06-02 05:21:47] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:21:47] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:21:47] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 10 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[199, 199, 197] Max Struct:[204, 204, 204]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[201, 199, 198] Max Struct:[204, 204, 204]
Support contains 3 out of 12 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 12/12 places, 12/12 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2025-06-02 05:21:47] [INFO ] Invariant cache hit.
[2025-06-02 05:21:47] [INFO ] Implicit Places using invariants in 39 ms returned [8, 9, 11]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 43 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 9/12 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 45 ms. Remains : 9/12 places, 12/12 transitions.
// Phase 1: matrix 12 rows 9 cols
[2025-06-02 05:21:47] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[201, 199, 198] Max Struct:[204, 204, 204]
RANDOM walk for 1000001 steps (2 resets) in 130 ms. (7633 steps per ms)
BEST_FIRST walk for 3000002 steps (6 resets) in 635 ms. (4716 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[201, 199, 198] Max Struct:[204, 204, 204]
[2025-06-02 05:21:47] [INFO ] Invariant cache hit.
[2025-06-02 05:21:48] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:21:48] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2025-06-02 05:21:48] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:21:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:21:48] [INFO ] [Nat]Absence check using state equation in 10 ms returned unsat
[2025-06-02 05:21:48] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:21:48] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2025-06-02 05:21:48] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:21:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:21:48] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2025-06-02 05:21:48] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-06-02 05:21:48] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:21:48] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 12 ms to minimize.
[2025-06-02 05:21:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2025-06-02 05:21:48] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-02 05:21:48] [INFO ] Added : 1 causal constraints over 1 iterations in 13 ms. Result :sat
Minimization took 7 ms.
[2025-06-02 05:21:48] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:21:48] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2025-06-02 05:21:48] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:21:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:21:48] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2025-06-02 05:21:48] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:21:48] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:21:48] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[201, 199, 198] Max Struct:[201, 204, 204]
FORMULA PGCD-PT-D03N050-UpperBounds-05 201 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PGCD-PT-D03N050-UpperBounds-07 201 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PGCD-PT-D03N050-UpperBounds-13 201 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PGCD-PT-D03N050-UpperBounds-00 201 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[199, 199] Max Struct:[204, 204]
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 9/9 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 9/9 places, 12/12 transitions.
[2025-06-02 05:21:48] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[199, 199] Max Struct:[204, 204]
RANDOM walk for 1000032 steps (2 resets) in 126 ms. (7874 steps per ms)
BEST_FIRST walk for 2000002 steps (4 resets) in 410 ms. (4866 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[199, 199] Max Struct:[204, 204]
[2025-06-02 05:21:48] [INFO ] Invariant cache hit.
[2025-06-02 05:21:48] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:21:48] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2025-06-02 05:21:48] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:21:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:21:48] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2025-06-02 05:21:48] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-06-02 05:21:48] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:21:48] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2025-06-02 05:21:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 25 ms
[2025-06-02 05:21:48] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:21:48] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 7 ms.
[2025-06-02 05:21:48] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:21:48] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2025-06-02 05:21:48] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:21:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:21:48] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2025-06-02 05:21:48] [INFO ] [Nat]Added 4 Read/Feed constraints in 2 ms returned sat
[2025-06-02 05:21:48] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:21:48] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[199, 199] Max Struct:[204, 204]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[199, 199] Max Struct:[204, 204]
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 9/9 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 9/9 places, 12/12 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 9/9 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2025-06-02 05:21:49] [INFO ] Invariant cache hit.
[2025-06-02 05:21:49] [INFO ] Implicit Places using invariants in 27 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 28 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 8/9 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 29 ms. Remains : 8/9 places, 12/12 transitions.
// Phase 1: matrix 12 rows 8 cols
[2025-06-02 05:21:49] [INFO ] Computed 1 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[199, 199] Max Struct:[204, 204]
RANDOM walk for 1000005 steps (2 resets) in 123 ms. (8064 steps per ms)
BEST_FIRST walk for 2000002 steps (4 resets) in 385 ms. (5181 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[199, 199] Max Struct:[204, 204]
[2025-06-02 05:21:49] [INFO ] Invariant cache hit.
[2025-06-02 05:21:49] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 05:21:49] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2025-06-02 05:21:49] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:21:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-02 05:21:49] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2025-06-02 05:21:49] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-06-02 05:21:49] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:21:49] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:21:49] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 8 ms.
[2025-06-02 05:21:49] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 05:21:49] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2025-06-02 05:21:49] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:21:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-02 05:21:49] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2025-06-02 05:21:49] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:21:49] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:21:49] [INFO ] Added : 1 causal constraints over 1 iterations in 3 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[199, 199] Max Struct:[204, 204]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[199, 199] Max Struct:[204, 204]
Support contains 2 out of 8 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8/8 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 8/8 places, 12/12 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8/8 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2025-06-02 05:21:49] [INFO ] Invariant cache hit.
[2025-06-02 05:21:49] [INFO ] Implicit Places using invariants in 21 ms returned []
[2025-06-02 05:21:49] [INFO ] Invariant cache hit.
[2025-06-02 05:21:49] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-06-02 05:21:49] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2025-06-02 05:21:49] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2025-06-02 05:21:49] [INFO ] Invariant cache hit.
[2025-06-02 05:21:49] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 4/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 12/20 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/20 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 20/20 variables, and 13 constraints, problems are : Problem set: 0 solved, 4 unsolved in 44 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 8/8 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 4/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 12/20 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/20 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 20/20 variables, and 17 constraints, problems are : Problem set: 0 solved, 4 unsolved in 43 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 8/8 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 89ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 89ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 140 ms. Remains : 8/8 places, 12/12 transitions.
RANDOM walk for 40098 steps (8 resets) in 194 ms. (205 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 248 ms. (160 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 233 ms. (170 steps per ms) remains 4/4 properties
[2025-06-02 05:21:50] [INFO ] Flatten gal took : 14 ms
[2025-06-02 05:21:50] [INFO ] Flatten gal took : 3 ms
[2025-06-02 05:21:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8149706155196409231.gal : 4 ms
[2025-06-02 05:21:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4109373835419544349.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/ReachabilityCardinality8149706155196409231.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4109373835419544349.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40003 steps (8 resets) in 195 ms. (204 steps per ms) remains 4/4 properties

BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 4/4 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/ReachabilityCardinality4109373835419544349.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :36 after 9957
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :9957 after 46231
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :46231 after 6.44381e+07
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :1.00836e+09 after 1.01532e+09
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :2.47892e+09 after 2.49454e+09
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :4.57255e+09 after 4.58937e+09
Interrupted probabilistic random walk after 379456 steps, run timeout after 3001 ms. (steps per millisecond=126 ) properties seen :0 out of 4
Probabilistic random walk after 379456 steps, saw 217275 distinct states, run finished after 3009 ms. (steps per millisecond=126 ) properties seen :0
[2025-06-02 05:21:53] [INFO ] Invariant cache hit.
[2025-06-02 05:21:53] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2025-06-02 05:21:53] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
Problem MAX1 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 1/2 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 12/20 variables, 8/10 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 4/14 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/14 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/20 variables, 0/14 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 20/20 variables, and 14 constraints, problems are : Problem set: 2 solved, 2 unsolved in 165 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 8/8 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 2 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 1/2 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 12/20 variables, 8/10 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 4/14 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 2/16 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/20 variables, 0/16 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/20 variables, 0/16 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 20/20 variables, and 16 constraints, problems are : Problem set: 2 solved, 2 unsolved in 50 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 8/8 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 2/4 constraints, Known Traps: 1/1 constraints]
SDD proceeding with computation,4 properties remain. new max is 4096
After SMT, in 235ms problems are : Problem set: 2 solved, 2 unsolved
SDD size :1.48506e+10 after 1.4871e+10
Parikh walk visited 0 properties in 709 ms.
Support contains 2 out of 8 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8/8 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Running 4 sub problems to find dead transitions.
[2025-06-02 05:21:54] [INFO ] Invariant cache hit.
[2025-06-02 05:21:54] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 4/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 12/20 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/20 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 20/20 variables, and 13 constraints, problems are : Problem set: 0 solved, 4 unsolved in 67 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 8/8 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 4/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 12/20 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/20 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 20/20 variables, and 17 constraints, problems are : Problem set: 0 solved, 4 unsolved in 56 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 8/8 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 131ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 131ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 132 ms. Remains : 8/8 places, 12/12 transitions.
RANDOM walk for 40122 steps (8 resets) in 17 ms. (2229 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (8 resets) in 93 ms. (425 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 39 ms. (1000 steps per ms) remains 2/2 properties
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :5.58847e+10 after 5.59122e+10
Interrupted probabilistic random walk after 708969 steps, run timeout after 3001 ms. (steps per millisecond=236 ) properties seen :0 out of 2
Probabilistic random walk after 708969 steps, saw 395679 distinct states, run finished after 3001 ms. (steps per millisecond=236 ) properties seen :0
[2025-06-02 05:21:57] [INFO ] Invariant cache hit.
[2025-06-02 05:21:57] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 05:21:57] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 12/20 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/20 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 20/20 variables, and 14 constraints, problems are : Problem set: 0 solved, 2 unsolved in 62 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 8/8 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 12/20 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/20 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/20 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 20/20 variables, and 16 constraints, problems are : Problem set: 0 solved, 2 unsolved in 42 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 8/8 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 108ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 640 ms.
Support contains 2 out of 8 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8/8 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 8/8 places, 12/12 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8/8 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2025-06-02 05:21:58] [INFO ] Invariant cache hit.
[2025-06-02 05:21:58] [INFO ] Implicit Places using invariants in 17 ms returned []
[2025-06-02 05:21:58] [INFO ] Invariant cache hit.
[2025-06-02 05:21:58] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-06-02 05:21:58] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2025-06-02 05:21:58] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2025-06-02 05:21:58] [INFO ] Invariant cache hit.
[2025-06-02 05:21:58] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 4/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 12/20 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/20 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 20/20 variables, and 13 constraints, problems are : Problem set: 0 solved, 4 unsolved in 40 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 8/8 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 4/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 12/20 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/20 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 20/20 variables, and 17 constraints, problems are : Problem set: 0 solved, 4 unsolved in 39 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 8/8 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 82ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 82ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 143 ms. Remains : 8/8 places, 12/12 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-02 05:21:58] [INFO ] Flatten gal took : 3 ms
[2025-06-02 05:21:58] [INFO ] Applying decomposition
[2025-06-02 05:21:58] [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/graph2783023399310950003.txt' '-o' '/tmp/graph2783023399310950003.bin' '-w' '/tmp/graph2783023399310950003.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2783023399310950003.bin' '-l' '-1' '-v' '-w' '/tmp/graph2783023399310950003.weights' '-q' '0' '-e' '0.001'
[2025-06-02 05:21:58] [INFO ] Decomposing Gal with order
[2025-06-02 05:21:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 05:21:58] [INFO ] Flatten gal took : 24 ms
[2025-06-02 05:21:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-02 05:21:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4219215559726667657.gal : 1 ms
[2025-06-02 05:21:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5575711285906820076.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/ReachabilityCardinality4219215559726667657.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5575711285906820076.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality5575711285906820076.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 969
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :969 after 421209
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1.01288e+10 after 1.01291e+10
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1.01291e+10 after 1.01291e+10
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1.01291e+10 after 1.04634e+10
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1.04634e+10 after 1.04634e+10
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1.04634e+10 after 1.04634e+10
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1.04634e+10 after 1.04634e+10
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :4.71601e+10 after 4.765e+10
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[199, 199] Max Struct:[204, 204]
Starting property specific reduction for PGCD-PT-D03N050-UpperBounds-03
Current structural bounds on expressions (Initially) : Max Seen:[50] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[50] Max Struct:[204]
Current structural bounds on expressions (Before main loop) : Max Seen:[50] Max Struct:[204]
[2025-06-02 05:22:48] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[50] Max Struct:[204]
RANDOM walk for 10052 steps (2 resets) in 3 ms. (2513 steps per ms)
BEST_FIRST walk for 10000 steps (2 resets) in 4 ms. (2000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[151] Max Struct:[204]
[2025-06-02 05:22:48] [INFO ] Invariant cache hit.
[2025-06-02 05:22:48] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-06-02 05:22:48] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2025-06-02 05:22:48] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:22:48] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-02 05:22:48] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2025-06-02 05:22:48] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-06-02 05:22:48] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:22:48] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:22:48] [INFO ] Added : 1 causal constraints over 1 iterations in 3 ms. Result :sat
Minimization took 15 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[151] Max Struct:[204]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[199] Max Struct:[204]
Support contains 1 out of 8 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8/8 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Running 4 sub problems to find dead transitions.
[2025-06-02 05:22:48] [INFO ] Invariant cache hit.
[2025-06-02 05:22:48] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 4/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 12/20 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/20 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 20/20 variables, and 13 constraints, problems are : Problem set: 0 solved, 4 unsolved in 51 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 8/8 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 4/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 12/20 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/20 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 20/20 variables, and 17 constraints, problems are : Problem set: 0 solved, 4 unsolved in 47 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 8/8 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 102ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 102ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103 ms. Remains : 8/8 places, 12/12 transitions.
[2025-06-02 05:22:48] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[199] Max Struct:[204]
RANDOM walk for 1000013 steps (2 resets) in 143 ms. (6944 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 232 ms. (4291 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[199] Max Struct:[204]
[2025-06-02 05:22:49] [INFO ] Invariant cache hit.
[2025-06-02 05:22:49] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-02 05:22:49] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-06-02 05:22:49] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:22:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 05:22:49] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2025-06-02 05:22:49] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-06-02 05:22:49] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:22:49] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:22:49] [INFO ] Added : 1 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[199] Max Struct:[204]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[199] Max Struct:[204]
Support contains 1 out of 8 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8/8 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 8/8 places, 12/12 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8/8 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2025-06-02 05:22:49] [INFO ] Invariant cache hit.
[2025-06-02 05:22:49] [INFO ] Implicit Places using invariants in 29 ms returned []
[2025-06-02 05:22:49] [INFO ] Invariant cache hit.
[2025-06-02 05:22:49] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-06-02 05:22:49] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2025-06-02 05:22:49] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2025-06-02 05:22:49] [INFO ] Invariant cache hit.
[2025-06-02 05:22:49] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 4/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 12/20 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/20 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 20/20 variables, and 13 constraints, problems are : Problem set: 0 solved, 4 unsolved in 38 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 8/8 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 4/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 12/20 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/20 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 20/20 variables, and 17 constraints, problems are : Problem set: 0 solved, 4 unsolved in 41 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 8/8 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 81ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 81ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 141 ms. Remains : 8/8 places, 12/12 transitions.
RANDOM walk for 40099 steps (8 resets) in 13 ms. (2864 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 23 ms. (1666 steps per ms) remains 2/2 properties
[2025-06-02 05:22:49] [INFO ] Flatten gal took : 10 ms
[2025-06-02 05:22:49] [INFO ] Flatten gal took : 1 ms
[2025-06-02 05:22:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5377465780919911635.gal : 1 ms
[2025-06-02 05:22:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10020608939230089392.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/ReachabilityCardinality5377465780919911635.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10020608939230089392.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 2/2 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality10020608939230089392.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 9957
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :9957 after 46231
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :46231 after 6.44381e+07
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1.00836e+09 after 1.01532e+09
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :2.47892e+09 after 2.49454e+09
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :4.57255e+09 after 4.58937e+09
Interrupted probabilistic random walk after 921768 steps, run timeout after 3001 ms. (steps per millisecond=307 ) properties seen :0 out of 2
Probabilistic random walk after 921768 steps, saw 514801 distinct states, run finished after 3001 ms. (steps per millisecond=307 ) properties seen :0
[2025-06-02 05:22:52] [INFO ] Invariant cache hit.
[2025-06-02 05:22:52] [INFO ] State equation strengthened by 4 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) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 05:22:52] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 12/20 variables, 8/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 4/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/20 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 20/20 variables, and 14 constraints, problems are : Problem set: 1 solved, 1 unsolved in 57 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 8/8 constraints, ReadFeed: 4/4 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) 7/8 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 12/20 variables, 8/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 4/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 1/15 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/20 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/20 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 20/20 variables, and 15 constraints, problems are : Problem set: 1 solved, 1 unsolved in 48 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 8/8 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 109ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 19 ms.
Support contains 1 out of 8 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8/8 places, 12/12 transitions.
Applied a total of 0 rules in 2 ms. Remains 8 /8 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Running 4 sub problems to find dead transitions.
[2025-06-02 05:22:52] [INFO ] Invariant cache hit.
[2025-06-02 05:22:52] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 4/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 12/20 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/20 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 20/20 variables, and 13 constraints, problems are : Problem set: 0 solved, 4 unsolved in 56 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 8/8 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 4/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 12/20 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/20 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 20/20 variables, and 17 constraints, problems are : Problem set: 0 solved, 4 unsolved in 42 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 8/8 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 104ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 105ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 8/8 places, 12/12 transitions.
RANDOM walk for 40125 steps (8 resets) in 12 ms. (3086 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 17 ms. (2222 steps per ms) remains 1/1 properties
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1.48506e+10 after 1.4871e+10
Interrupted probabilistic random walk after 2943069 steps, run timeout after 3001 ms. (steps per millisecond=980 ) properties seen :0 out of 1
Probabilistic random walk after 2943069 steps, saw 1598506 distinct states, run finished after 3001 ms. (steps per millisecond=980 ) properties seen :0
[2025-06-02 05:22:55] [INFO ] Invariant cache hit.
[2025-06-02 05:22:55] [INFO ] State equation strengthened by 4 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) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 05:22:55] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 12/20 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/20 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 20/20 variables, and 14 constraints, problems are : Problem set: 0 solved, 1 unsolved in 67 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 8/8 constraints, ReadFeed: 4/4 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) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 12/20 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/20 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/20 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 20/20 variables, and 15 constraints, problems are : Problem set: 0 solved, 1 unsolved in 29 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 8/8 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 99ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 19 ms.
Support contains 1 out of 8 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8/8 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 8/8 places, 12/12 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8/8 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2025-06-02 05:22:55] [INFO ] Invariant cache hit.
[2025-06-02 05:22:55] [INFO ] Implicit Places using invariants in 15 ms returned []
[2025-06-02 05:22:55] [INFO ] Invariant cache hit.
[2025-06-02 05:22:55] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-06-02 05:22:55] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2025-06-02 05:22:55] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2025-06-02 05:22:55] [INFO ] Invariant cache hit.
[2025-06-02 05:22:55] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 4/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 12/20 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/20 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 20/20 variables, and 13 constraints, problems are : Problem set: 0 solved, 4 unsolved in 53 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 8/8 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 4/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 12/20 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/20 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 20/20 variables, and 17 constraints, problems are : Problem set: 0 solved, 4 unsolved in 60 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 8/8 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 117ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 117ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 169 ms. Remains : 8/8 places, 12/12 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-02 05:22:55] [INFO ] Flatten gal took : 2 ms
[2025-06-02 05:22:55] [INFO ] Applying decomposition
[2025-06-02 05:22:55] [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/graph10916896403202392882.txt' '-o' '/tmp/graph10916896403202392882.bin' '-w' '/tmp/graph10916896403202392882.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10916896403202392882.bin' '-l' '-1' '-v' '-w' '/tmp/graph10916896403202392882.weights' '-q' '0' '-e' '0.001'
[2025-06-02 05:22:55] [INFO ] Decomposing Gal with order
[2025-06-02 05:22:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 05:22:55] [INFO ] Flatten gal took : 2 ms
[2025-06-02 05:22:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-02 05:22:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9291730572856921625.gal : 1 ms
[2025-06-02 05:22:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5255585798873474980.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/ReachabilityCardinality9291730572856921625.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5255585798873474980.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality5255585798873474980.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 969
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :969 after 374408
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :374408 after 6.41708e+07
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.01288e+10 after 1.02955e+10
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.02955e+10 after 1.02955e+10
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.02955e+10 after 1.02955e+10
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.02955e+10 after 1.02955e+10
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.02955e+10 after 1.04645e+10
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :2.71427e+10 after 2.75794e+10
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[199] Max Struct:[204]
Ending property specific reduction for PGCD-PT-D03N050-UpperBounds-03 in 57542 ms.
Starting property specific reduction for PGCD-PT-D03N050-UpperBounds-08
Current structural bounds on expressions (Initially) : Max Seen:[50] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[50] Max Struct:[204]
Current structural bounds on expressions (Before main loop) : Max Seen:[50] Max Struct:[204]
[2025-06-02 05:23:45] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[50] Max Struct:[204]
RANDOM walk for 10014 steps (2 resets) in 2 ms. (3338 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 3 ms. (2500 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[151] Max Struct:[204]
[2025-06-02 05:23:45] [INFO ] Invariant cache hit.
[2025-06-02 05:23:46] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-02 05:23:46] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2025-06-02 05:23:46] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:23:46] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-02 05:23:46] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2025-06-02 05:23:46] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-06-02 05:23:46] [INFO ] [Nat]Added 4 Read/Feed constraints in 2 ms returned sat
[2025-06-02 05:23:46] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:23:46] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[151] Max Struct:[204]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[199] Max Struct:[204]
Support contains 1 out of 8 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8/8 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Running 4 sub problems to find dead transitions.
[2025-06-02 05:23:46] [INFO ] Invariant cache hit.
[2025-06-02 05:23:46] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 4/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 12/20 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/20 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 20/20 variables, and 13 constraints, problems are : Problem set: 0 solved, 4 unsolved in 63 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 8/8 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 4/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 12/20 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/20 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 20/20 variables, and 17 constraints, problems are : Problem set: 0 solved, 4 unsolved in 55 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 8/8 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 124ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 124ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 125 ms. Remains : 8/8 places, 12/12 transitions.
[2025-06-02 05:23:46] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[199] Max Struct:[204]
RANDOM walk for 1000021 steps (2 resets) in 149 ms. (6666 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 198 ms. (5025 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[199] Max Struct:[204]
[2025-06-02 05:23:46] [INFO ] Invariant cache hit.
[2025-06-02 05:23:46] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-02 05:23:46] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2025-06-02 05:23:46] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:23:46] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 05:23:46] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2025-06-02 05:23:46] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-06-02 05:23:46] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:23:46] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:23:46] [INFO ] Added : 1 causal constraints over 1 iterations in 3 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[199] Max Struct:[204]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[199] Max Struct:[204]
Support contains 1 out of 8 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8/8 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 8/8 places, 12/12 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8/8 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2025-06-02 05:23:46] [INFO ] Invariant cache hit.
[2025-06-02 05:23:46] [INFO ] Implicit Places using invariants in 23 ms returned []
[2025-06-02 05:23:46] [INFO ] Invariant cache hit.
[2025-06-02 05:23:46] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-06-02 05:23:46] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2025-06-02 05:23:46] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2025-06-02 05:23:46] [INFO ] Invariant cache hit.
[2025-06-02 05:23:46] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 4/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 12/20 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/20 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 20/20 variables, and 13 constraints, problems are : Problem set: 0 solved, 4 unsolved in 48 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 8/8 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 4/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 12/20 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/20 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 20/20 variables, and 17 constraints, problems are : Problem set: 0 solved, 4 unsolved in 88 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 8/8 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 141ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 141ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 205 ms. Remains : 8/8 places, 12/12 transitions.
RANDOM walk for 40091 steps (8 resets) in 24 ms. (1603 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 19 ms. (2000 steps per ms) remains 2/2 properties
[2025-06-02 05:23:46] [INFO ] Flatten gal took : 23 ms
BEST_FIRST walk for 40002 steps (8 resets) in 20 ms. (1904 steps per ms) remains 2/2 properties
[2025-06-02 05:23:46] [INFO ] Flatten gal took : 38 ms
[2025-06-02 05:23:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8391101161736772196.gal : 23 ms
[2025-06-02 05:23:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15292388859430428715.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/ReachabilityCardinality8391101161736772196.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15292388859430428715.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/ReachabilityCardinality15292388859430428715.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 9957
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :9957 after 46231
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :46231 after 6.44381e+07
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1.00836e+09 after 1.01532e+09
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :2.47892e+09 after 2.49454e+09
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :4.57255e+09 after 4.58937e+09
Interrupted probabilistic random walk after 725654 steps, run timeout after 3001 ms. (steps per millisecond=241 ) properties seen :0 out of 2
Probabilistic random walk after 725654 steps, saw 405517 distinct states, run finished after 3001 ms. (steps per millisecond=241 ) properties seen :0
[2025-06-02 05:23:49] [INFO ] Invariant cache hit.
[2025-06-02 05:23:49] [INFO ] State equation strengthened by 4 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) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 05:23:49] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 2 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 12/20 variables, 8/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 4/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/20 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 20/20 variables, and 14 constraints, problems are : Problem set: 1 solved, 1 unsolved in 61 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 8/8 constraints, ReadFeed: 4/4 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) 7/8 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 12/20 variables, 8/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 4/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 1/15 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/20 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/20 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 20/20 variables, and 15 constraints, problems are : Problem set: 1 solved, 1 unsolved in 33 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 8/8 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 98ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 28 ms.
Support contains 1 out of 8 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8/8 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Running 4 sub problems to find dead transitions.
[2025-06-02 05:23:50] [INFO ] Invariant cache hit.
[2025-06-02 05:23:50] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 4/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 12/20 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/20 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 20/20 variables, and 13 constraints, problems are : Problem set: 0 solved, 4 unsolved in 52 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 8/8 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 4/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 12/20 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/20 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 20/20 variables, and 17 constraints, problems are : Problem set: 0 solved, 4 unsolved in 40 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 8/8 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 102ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 102ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103 ms. Remains : 8/8 places, 12/12 transitions.
RANDOM walk for 40076 steps (8 resets) in 14 ms. (2671 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 20 ms. (1904 steps per ms) remains 1/1 properties
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1.48506e+10 after 1.4871e+10
Interrupted probabilistic random walk after 3105921 steps, run timeout after 3001 ms. (steps per millisecond=1034 ) properties seen :0 out of 1
Probabilistic random walk after 3105921 steps, saw 1683346 distinct states, run finished after 3001 ms. (steps per millisecond=1034 ) properties seen :0
[2025-06-02 05:23:53] [INFO ] Invariant cache hit.
[2025-06-02 05:23:53] [INFO ] State equation strengthened by 4 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) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 05:23:53] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 12/20 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/20 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 20/20 variables, and 14 constraints, problems are : Problem set: 0 solved, 1 unsolved in 70 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 8/8 constraints, ReadFeed: 4/4 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) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 12/20 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/20 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/20 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 20/20 variables, and 15 constraints, problems are : Problem set: 0 solved, 1 unsolved in 33 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 8/8 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 107ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 32 ms.
Support contains 1 out of 8 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8/8 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 8/8 places, 12/12 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8/8 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2025-06-02 05:23:53] [INFO ] Invariant cache hit.
[2025-06-02 05:23:53] [INFO ] Implicit Places using invariants in 22 ms returned []
[2025-06-02 05:23:53] [INFO ] Invariant cache hit.
[2025-06-02 05:23:53] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-06-02 05:23:53] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2025-06-02 05:23:53] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2025-06-02 05:23:53] [INFO ] Invariant cache hit.
[2025-06-02 05:23:53] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 4/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 12/20 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/20 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 20/20 variables, and 13 constraints, problems are : Problem set: 0 solved, 4 unsolved in 38 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 8/8 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 4/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 12/20 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/20 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 20/20 variables, and 17 constraints, problems are : Problem set: 0 solved, 4 unsolved in 40 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 8/8 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 85ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 85ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 137 ms. Remains : 8/8 places, 12/12 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-02 05:23:53] [INFO ] Flatten gal took : 2 ms
[2025-06-02 05:23:53] [INFO ] Applying decomposition
[2025-06-02 05:23:53] [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/graph11760296404290417657.txt' '-o' '/tmp/graph11760296404290417657.bin' '-w' '/tmp/graph11760296404290417657.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11760296404290417657.bin' '-l' '-1' '-v' '-w' '/tmp/graph11760296404290417657.weights' '-q' '0' '-e' '0.001'
[2025-06-02 05:23:53] [INFO ] Decomposing Gal with order
[2025-06-02 05:23:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 05:23:53] [INFO ] Flatten gal took : 2 ms
[2025-06-02 05:23:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-02 05:23:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10431110509490663427.gal : 1 ms
[2025-06-02 05:23:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12887179089163407630.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/ReachabilityCardinality10431110509490663427.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12887179089163407630.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality12887179089163407630.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 969
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :969 after 374408
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :374408 after 6.41708e+07
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.01288e+10 after 1.02927e+10
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.02927e+10 after 1.02927e+10
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.02927e+10 after 1.02927e+10
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.02927e+10 after 1.0306e+10
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.0306e+10 after 1.0463e+10
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :2.70011e+10 after 2.72802e+10
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[199] Max Struct:[204]
Ending property specific reduction for PGCD-PT-D03N050-UpperBounds-08 in 57485 ms.
[2025-06-02 05:24:43] [INFO ] Flatten gal took : 2 ms
[2025-06-02 05:24:43] [INFO ] Applying decomposition
[2025-06-02 05:24:43] [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/graph9732273381031439169.txt' '-o' '/tmp/graph9732273381031439169.bin' '-w' '/tmp/graph9732273381031439169.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9732273381031439169.bin' '-l' '-1' '-v' '-w' '/tmp/graph9732273381031439169.weights' '-q' '0' '-e' '0.001'
[2025-06-02 05:24:43] [INFO ] Decomposing Gal with order
[2025-06-02 05:24:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 05:24:43] [INFO ] Flatten gal took : 2 ms
[2025-06-02 05:24:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-02 05:24:43] [INFO ] Time to serialize gal into /tmp/UpperBounds2204014350528666835.gal : 1 ms
[2025-06-02 05:24:43] [INFO ] Time to serialize properties into /tmp/UpperBounds15052914793500141165.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/UpperBounds2204014350528666835.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds15052914793500141165.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/UpperBounds15052914793500141165.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,4.17215e+11,295.215,1209416,1386,696,895083,64519,31,337391,19,205279,0
Total reachable state count : 417214571243

Verifying 2 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 199
Bounds property PGCD-PT-D03N050-UpperBounds-03 :0 <= u3.p1_4 <= 199
FORMULA PGCD-PT-D03N050-UpperBounds-03 199 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PGCD-PT-D03N050-UpperBounds-03,0,427.525,2537372,1,0,1.0088e+06,621471,55,1.73603e+06,226,1.61711e+06,1714
Min sum of variable value : 0
Maximum sum along a path : 199
Bounds property PGCD-PT-D03N050-UpperBounds-08 :0 <= u1.p1_2 <= 199
FORMULA PGCD-PT-D03N050-UpperBounds-08 199 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PGCD-PT-D03N050-UpperBounds-08,0,463.565,2538164,1,0,1.0088e+06,621471,47,1.73603e+06,225,1.61711e+06,526
Total runtime 647117 ms.

BK_STOP 1748842347517

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool gold2024"
echo " Input is PGCD-PT-D03N050, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r153-tall-174876824800091"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PGCD-PT-D03N050.tgz
mv PGCD-PT-D03N050 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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;