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-174876824800092.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-D04N025, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r153-tall-174876824800092
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 8.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K 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 9.3K 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-D04N025-UpperBounds-00
FORMULA_NAME PGCD-PT-D04N025-UpperBounds-01
FORMULA_NAME PGCD-PT-D04N025-UpperBounds-02
FORMULA_NAME PGCD-PT-D04N025-UpperBounds-03
FORMULA_NAME PGCD-PT-D04N025-UpperBounds-04
FORMULA_NAME PGCD-PT-D04N025-UpperBounds-05
FORMULA_NAME PGCD-PT-D04N025-UpperBounds-06
FORMULA_NAME PGCD-PT-D04N025-UpperBounds-07
FORMULA_NAME PGCD-PT-D04N025-UpperBounds-08
FORMULA_NAME PGCD-PT-D04N025-UpperBounds-09
FORMULA_NAME PGCD-PT-D04N025-UpperBounds-10
FORMULA_NAME PGCD-PT-D04N025-UpperBounds-11
FORMULA_NAME PGCD-PT-D04N025-UpperBounds-12
FORMULA_NAME PGCD-PT-D04N025-UpperBounds-13
FORMULA_NAME PGCD-PT-D04N025-UpperBounds-14
FORMULA_NAME PGCD-PT-D04N025-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748841752179

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-D04N025
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-02 05:22:33] [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:22:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 05:22:33] [INFO ] Load time of PNML (sax parser for PT used): 30 ms
[2025-06-02 05:22:33] [INFO ] Transformed 15 places.
[2025-06-02 05:22:33] [INFO ] Transformed 15 transitions.
[2025-06-02 05:22:33] [INFO ] Parsed PT model containing 15 places and 15 transitions and 70 arcs in 119 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 10
Current structural bounds on expressions (Initially) : Max Seen:[1, 1, 25, 1, 1, 25, 1, 1, 25, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[1, 1, 25, 1, 1, 25, 1, 1, 25, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 15 rows 15 cols
[2025-06-02 05:22:33] [INFO ] Computed 6 invariants in 9 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1, 25, 1, 1, 25, 1, 1, 25, 1] Max Struct:[130, 130, 130, 130, 130, 130, 130, 130, 130, 130]
RANDOM walk for 10016 steps (2 resets) in 13 ms. (715 steps per ms)
BEST_FIRST walk for 100007 steps (21 resets) in 86 ms. (1149 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[92, 70, 102, 96, 70, 102, 90, 70, 102, 90] Max Struct:[130, 130, 130, 130, 130, 130, 130, 130, 130, 130]
[2025-06-02 05:22:33] [INFO ] Invariant cache hit.
[2025-06-02 05:22:33] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2025-06-02 05:22:33] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-02 05:22:33] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2025-06-02 05:22:33] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:22:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-02 05:22:33] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 5 ms returned sat
[2025-06-02 05:22:33] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2025-06-02 05:22:33] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-06-02 05:22:33] [INFO ] [Nat]Added 5 Read/Feed constraints in 2 ms returned sat
[2025-06-02 05:22:33] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 05:22:33] [INFO ] Added : 0 causal constraints over 0 iterations in 12 ms. Result :sat
Minimization took 9 ms.
[2025-06-02 05:22:33] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:22:33] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-02 05:22:33] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-06-02 05:22:34] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:22:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:22:34] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-02 05:22:34] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2025-06-02 05:22:34] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:22:34] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 05:22:34] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Minimization took 7 ms.
[2025-06-02 05:22:34] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:22:34] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-02 05:22:34] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-06-02 05:22:34] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:22:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-02 05:22:34] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 10 ms returned sat
[2025-06-02 05:22:34] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2025-06-02 05:22:34] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:22:34] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:22:34] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 7 ms.
[2025-06-02 05:22:34] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2025-06-02 05:22:34] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-02 05:22:34] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2025-06-02 05:22:34] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:22:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:22:34] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-02 05:22:34] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2025-06-02 05:22:34] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:22:34] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:22:34] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Minimization took 5 ms.
[2025-06-02 05:22:34] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2025-06-02 05:22:34] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2025-06-02 05:22:34] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2025-06-02 05:22:34] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:22:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:22:34] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-02 05:22:34] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2025-06-02 05:22:34] [INFO ] [Nat]Added 5 Read/Feed constraints in 2 ms returned sat
[2025-06-02 05:22:34] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-02 05:22:34] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Minimization took 7 ms.
[2025-06-02 05:22:34] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:22:34] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-02 05:22:34] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2025-06-02 05:22:34] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:22:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2025-06-02 05:22:34] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-02 05:22:34] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2025-06-02 05:22:34] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:22:34] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 6 ms to minimize.
[2025-06-02 05:22:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2025-06-02 05:22:34] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:22:34] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 6 ms.
[2025-06-02 05:22:34] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2025-06-02 05:22:34] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-02 05:22:34] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2025-06-02 05:22:34] [INFO ] [Real]Added 5 Read/Feed constraints in 5 ms returned sat
[2025-06-02 05:22:34] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:22:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:22:34] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-02 05:22:34] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2025-06-02 05:22:34] [INFO ] [Nat]Added 5 Read/Feed constraints in 3 ms returned sat
[2025-06-02 05:22:34] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:22:34] [INFO ] Added : 0 causal constraints over 0 iterations in 14 ms. Result :sat
Minimization took 5 ms.
[2025-06-02 05:22:34] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2025-06-02 05:22:34] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-02 05:22:34] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2025-06-02 05:22:34] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:22:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2025-06-02 05:22:34] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-02 05:22:34] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2025-06-02 05:22:34] [INFO ] [Nat]Added 5 Read/Feed constraints in 3 ms returned sat
[2025-06-02 05:22:34] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:22:34] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Minimization took 6 ms.
[2025-06-02 05:22:34] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:22:34] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 5 ms returned sat
[2025-06-02 05:22:34] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-06-02 05:22:34] [INFO ] [Real]Added 5 Read/Feed constraints in 12 ms returned sat
[2025-06-02 05:22:34] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:22:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2025-06-02 05:22:34] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-02 05:22:34] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2025-06-02 05:22:34] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:22:34] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 05:22:34] [INFO ] Added : 1 causal constraints over 1 iterations in 14 ms. Result :sat
Minimization took 6 ms.
[2025-06-02 05:22:34] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:22:34] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2025-06-02 05:22:34] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2025-06-02 05:22:34] [INFO ] [Real]Added 5 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:22:34] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:22:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2025-06-02 05:22:34] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2025-06-02 05:22:34] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2025-06-02 05:22:34] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:22:34] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-02 05:22:34] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[92, 70, 102, 96, 70, 102, 90, 70, 102, 90] Max Struct:[130, 130, 130, 130, 130, 130, 130, 130, 130, 130]
FORMULA PGCD-PT-D04N025-UpperBounds-15 130 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA PGCD-PT-D04N025-UpperBounds-08 130 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA PGCD-PT-D04N025-UpperBounds-10 130 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA PGCD-PT-D04N025-UpperBounds-06 130 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA PGCD-PT-D04N025-UpperBounds-05 130 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA PGCD-PT-D04N025-UpperBounds-01 130 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[130, 128, 128, 128, 128] Max Struct:[130, 130, 130, 130, 130]
Support contains 5 out of 15 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 15/15 transitions.
Applied a total of 0 rules in 19 ms. Remains 15 /15 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Running 5 sub problems to find dead transitions.
[2025-06-02 05:22:35] [INFO ] Invariant cache hit.
[2025-06-02 05:22:35] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 5/15 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 15/30 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/30 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 30/30 variables, and 26 constraints, problems are : Problem set: 0 solved, 5 unsolved in 93 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 15/15 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 5/15 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 15/30 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 5/31 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/30 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/30 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 30/30 variables, and 31 constraints, problems are : Problem set: 0 solved, 5 unsolved in 90 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 15/15 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 206ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 218ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 246 ms. Remains : 15/15 places, 15/15 transitions.
[2025-06-02 05:22:35] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[130, 128, 128, 128, 128] Max Struct:[130, 130, 130, 130, 130]
FORMULA PGCD-PT-D04N025-UpperBounds-04 130 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PGCD-PT-D04N025-UpperBounds-00 130 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000009 steps (2 resets) in 229 ms. (4347 steps per ms)
BEST_FIRST walk for 4000002 steps (673 resets) in 1250 ms. (3197 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[128, 128, 128, 128] Max Struct:[130, 130, 130, 130]
[2025-06-02 05:22:36] [INFO ] Invariant cache hit.
[2025-06-02 05:22:36] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:22:36] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-02 05:22:37] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-06-02 05:22:37] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:22:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2025-06-02 05:22:37] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-02 05:22:37] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2025-06-02 05:22:37] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-06-02 05:22:37] [INFO ] [Nat]Added 5 Read/Feed constraints in 2 ms returned sat
[2025-06-02 05:22:37] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:22:37] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 4 ms.
[2025-06-02 05:22:37] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2025-06-02 05:22:37] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-02 05:22:37] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2025-06-02 05:22:37] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:22:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2025-06-02 05:22:37] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2025-06-02 05:22:37] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2025-06-02 05:22:37] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:22:37] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 05:22:37] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Minimization took 4 ms.
[2025-06-02 05:22:37] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:22:37] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2025-06-02 05:22:37] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2025-06-02 05:22:37] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:22:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:22:37] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-02 05:22:37] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2025-06-02 05:22:37] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:22:37] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:22:37] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 4 ms.
[2025-06-02 05:22:37] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:22:37] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-02 05:22:37] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2025-06-02 05:22:37] [INFO ] [Real]Added 5 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:22:37] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:22:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:22:37] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-02 05:22:37] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2025-06-02 05:22:37] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:22:37] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 0 ms.
[2025-06-02 05:22:37] [INFO ] Added : 1 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[128, 128, 128, 128] Max Struct:[130, 130, 130, 130]
FORMULA PGCD-PT-D04N025-UpperBounds-11 130 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA PGCD-PT-D04N025-UpperBounds-12 130 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA PGCD-PT-D04N025-UpperBounds-03 130 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[128, 128, 128] Max Struct:[130, 130, 130]
Support contains 3 out of 15 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 15/15 places, 15/15 transitions.
[2025-06-02 05:22:37] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[128, 128, 128] Max Struct:[130, 130, 130]
RANDOM walk for 1000025 steps (2 resets) in 190 ms. (5235 steps per ms)
BEST_FIRST walk for 3000002 steps (680 resets) in 932 ms. (3215 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[128, 128, 128] Max Struct:[130, 130, 130]
[2025-06-02 05:22:38] [INFO ] Invariant cache hit.
[2025-06-02 05:22:38] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:22:38] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-02 05:22:38] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-06-02 05:22:38] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:22:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:22:38] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-02 05:22:38] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2025-06-02 05:22:38] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-06-02 05:22:38] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:22:38] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:22:38] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 4 ms.
[2025-06-02 05:22:38] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:22:38] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-02 05:22:38] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-06-02 05:22:38] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:22:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2025-06-02 05:22:38] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-02 05:22:38] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2025-06-02 05:22:38] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:22:38] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 05:22:38] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 4 ms.
[2025-06-02 05:22:38] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-02 05:22:38] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2025-06-02 05:22:38] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2025-06-02 05:22:38] [INFO ] [Real]Added 5 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:22:38] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:22:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2025-06-02 05:22:38] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2025-06-02 05:22:38] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2025-06-02 05:22:38] [INFO ] [Nat]Added 5 Read/Feed constraints in 2 ms returned sat
[2025-06-02 05:22:38] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:22:38] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[128, 128, 128] Max Struct:[130, 130, 130]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[128, 128, 128] Max Struct:[130, 130, 130]
Support contains 3 out of 15 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 15/15 places, 15/15 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 15/15 transitions.
Applied a total of 0 rules in 0 ms. Remains 15 /15 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2025-06-02 05:22:38] [INFO ] Invariant cache hit.
[2025-06-02 05:22:38] [INFO ] Implicit Places using invariants in 44 ms returned [10, 11, 12, 13, 14]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 47 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 10/15 places, 15/15 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 47 ms. Remains : 10/15 places, 15/15 transitions.
// Phase 1: matrix 15 rows 10 cols
[2025-06-02 05:22:38] [INFO ] Computed 1 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[128, 128, 128] Max Struct:[130, 130, 130]
RANDOM walk for 1000006 steps (2 resets) in 161 ms. (6172 steps per ms)
BEST_FIRST walk for 3000002 steps (683 resets) in 733 ms. (4087 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[128, 128, 128] Max Struct:[130, 130, 130]
[2025-06-02 05:22:39] [INFO ] Invariant cache hit.
[2025-06-02 05:22:39] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 05:22:39] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2025-06-02 05:22:39] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:22:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 05:22:39] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2025-06-02 05:22:39] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-06-02 05:22:39] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:22:39] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:22:39] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 4 ms.
[2025-06-02 05:22:39] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 05:22:39] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2025-06-02 05:22:39] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:22:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 05:22:39] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2025-06-02 05:22:39] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:22:39] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:22:39] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 3 ms.
[2025-06-02 05:22:39] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 05:22:39] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2025-06-02 05:22:39] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:22:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 05:22:39] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2025-06-02 05:22:39] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:22:39] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
[2025-06-02 05:22:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 21 ms
[2025-06-02 05:22:39] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:22:39] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[128, 128, 128] Max Struct:[130, 130, 130]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[128, 128, 128] Max Struct:[130, 130, 130]
Support contains 3 out of 10 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 10/10 places, 15/15 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2025-06-02 05:22:39] [INFO ] Invariant cache hit.
[2025-06-02 05:22:39] [INFO ] Implicit Places using invariants in 23 ms returned []
[2025-06-02 05:22:39] [INFO ] Invariant cache hit.
[2025-06-02 05:22:39] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-06-02 05:22:39] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2025-06-02 05:22:39] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2025-06-02 05:22:39] [INFO ] Invariant cache hit.
[2025-06-02 05:22:39] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 16 constraints, problems are : Problem set: 0 solved, 5 unsolved in 55 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 21 constraints, problems are : Problem set: 0 solved, 5 unsolved in 64 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 123ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 123ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 179 ms. Remains : 10/10 places, 15/15 transitions.
RANDOM walk for 40053 steps (8 resets) in 238 ms. (167 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (9 resets) in 163 ms. (243 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (10 resets) in 110 ms. (360 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (9 resets) in 77 ms. (512 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (11 resets) in 74 ms. (533 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (9 resets) in 49 ms. (800 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (9 resets) in 40 ms. (975 steps per ms) remains 6/6 properties
[2025-06-02 05:22:40] [INFO ] Flatten gal took : 28 ms
[2025-06-02 05:22:40] [INFO ] Flatten gal took : 2 ms
[2025-06-02 05:22:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7058047118263223098.gal : 20 ms
[2025-06-02 05:22:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5710367325534228297.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7058047118263223098.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5710367325534228297.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality5710367325534228297.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :19 after 1651
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :1651 after 6479
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :6479 after 2.44742e+06
Interrupted probabilistic random walk after 871903 steps, run timeout after 3001 ms. (steps per millisecond=290 ) properties seen :0 out of 6
Probabilistic random walk after 871903 steps, saw 502877 distinct states, run finished after 3004 ms. (steps per millisecond=290 ) properties seen :0
[2025-06-02 05:22:43] [INFO ] Invariant cache hit.
[2025-06-02 05:22:43] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 7/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2025-06-02 05:22:43] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
Problem MAX1 is UNSAT
Problem MAX2 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 15/25 variables, 10/12 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/17 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/17 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/17 constraints. Problems are: Problem set: 3 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 17 constraints, problems are : Problem set: 3 solved, 3 unsolved in 128 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 3 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 7/10 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 15/25 variables, 10/12 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/17 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 3/20 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/20 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/25 variables, 0/20 constraints. Problems are: Problem set: 3 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 20 constraints, problems are : Problem set: 3 solved, 3 unsolved in 49 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 3/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 205ms problems are : Problem set: 3 solved, 3 unsolved
Parikh walk visited 0 properties in 246 ms.
Support contains 3 out of 10 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Running 5 sub problems to find dead transitions.
[2025-06-02 05:22:43] [INFO ] Invariant cache hit.
[2025-06-02 05:22:43] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 16 constraints, problems are : Problem set: 0 solved, 5 unsolved in 78 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 21 constraints, problems are : Problem set: 0 solved, 5 unsolved in 83 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 177ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 177ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 178 ms. Remains : 10/10 places, 15/15 transitions.
RANDOM walk for 40052 steps (8 resets) in 35 ms. (1112 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (10 resets) in 34 ms. (1142 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (11 resets) in 44 ms. (888 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (11 resets) in 39 ms. (1000 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 1402485 steps, run timeout after 3001 ms. (steps per millisecond=467 ) properties seen :0 out of 3
Probabilistic random walk after 1402485 steps, saw 811092 distinct states, run finished after 3001 ms. (steps per millisecond=467 ) properties seen :0
[2025-06-02 05:22:47] [INFO ] Invariant cache hit.
[2025-06-02 05:22:47] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 7/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 16 constraints, problems are : Problem set: 0 solved, 3 unsolved in 60 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 7/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2025-06-02 05:22:47] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 15/25 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/25 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 20 constraints, problems are : Problem set: 0 solved, 3 unsolved in 81 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 146ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 668 ms.
Support contains 3 out of 10 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 3 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 10/10 places, 15/15 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 2 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2025-06-02 05:22:48] [INFO ] Invariant cache hit.
[2025-06-02 05:22:48] [INFO ] Implicit Places using invariants in 16 ms returned []
[2025-06-02 05:22:48] [INFO ] Invariant cache hit.
[2025-06-02 05:22:48] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-06-02 05:22:48] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2025-06-02 05:22:48] [INFO ] Redundant transitions in 0 ms returned []
Running 5 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 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 16 constraints, problems are : Problem set: 0 solved, 5 unsolved in 48 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 21 constraints, problems are : Problem set: 0 solved, 5 unsolved in 52 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 102ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 104ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 150 ms. Remains : 10/10 places, 15/15 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-02 05:22:48] [INFO ] Flatten gal took : 4 ms
[2025-06-02 05:22:48] [INFO ] Applying decomposition
[2025-06-02 05:22:48] [INFO ] Flatten gal took : 8 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/graph10544026335965926829.txt' '-o' '/tmp/graph10544026335965926829.bin' '-w' '/tmp/graph10544026335965926829.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10544026335965926829.bin' '-l' '-1' '-v' '-w' '/tmp/graph10544026335965926829.weights' '-q' '0' '-e' '0.001'
[2025-06-02 05:22:48] [INFO ] Decomposing Gal with order
[2025-06-02 05:22:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 05:22:48] [INFO ] Flatten gal took : 23 ms
[2025-06-02 05:22:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-02 05:22:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17913257401404764240.gal : 2 ms
[2025-06-02 05:22:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9982101154133591152.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/ReachabilityCardinality17913257401404764240.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9982101154133591152.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality9982101154133591152.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :19 after 286
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :286 after 39234
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :39234 after 2.6145e+08
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :8.8882e+10 after 8.8882e+10
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :8.8882e+10 after 8.8882e+10
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :8.8882e+10 after 8.8882e+10
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :8.8882e+10 after 8.8882e+10
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :8.8882e+10 after 8.8882e+10
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :1.71432e+11 after 1.79763e+11
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[128, 128, 128] Max Struct:[130, 130, 130]
Starting property specific reduction for PGCD-PT-D04N025-UpperBounds-02
Current structural bounds on expressions (Initially) : Max Seen:[25] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[25] Max Struct:[130]
Current structural bounds on expressions (Before main loop) : Max Seen:[25] Max Struct:[130]
[2025-06-02 05:23:38] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[25] Max Struct:[130]
RANDOM walk for 10010 steps (2 resets) in 5 ms. (1668 steps per ms)
BEST_FIRST walk for 10000 steps (3 resets) in 4 ms. (2000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[102] Max Struct:[130]
[2025-06-02 05:23:38] [INFO ] Invariant cache hit.
[2025-06-02 05:23:38] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 05:23:38] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2025-06-02 05:23:38] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:23:38] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 05:23:38] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2025-06-02 05:23:38] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-06-02 05:23:38] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:23:38] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 05:23:38] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[102] Max Struct:[130]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[126] Max Struct:[130]
Support contains 1 out of 10 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 2 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Running 5 sub problems to find dead transitions.
[2025-06-02 05:23:38] [INFO ] Invariant cache hit.
[2025-06-02 05:23:38] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 16 constraints, problems are : Problem set: 0 solved, 5 unsolved in 60 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 21 constraints, problems are : Problem set: 0 solved, 5 unsolved in 60 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 124ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 124ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 126 ms. Remains : 10/10 places, 15/15 transitions.
[2025-06-02 05:23:38] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[126] Max Struct:[130]
RANDOM walk for 1000032 steps (2 resets) in 173 ms. (5747 steps per ms)
BEST_FIRST walk for 1000001 steps (223 resets) in 258 ms. (3861 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[126] Max Struct:[130]
[2025-06-02 05:23:39] [INFO ] Invariant cache hit.
[2025-06-02 05:23:39] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-02 05:23:39] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2025-06-02 05:23:39] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:23:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-02 05:23:39] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2025-06-02 05:23:39] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-06-02 05:23:39] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:23:39] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 05:23:39] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[126] Max Struct:[130]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[128] Max Struct:[130]
Support contains 1 out of 10 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 10/10 places, 15/15 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2025-06-02 05:23:39] [INFO ] Invariant cache hit.
[2025-06-02 05:23:39] [INFO ] Implicit Places using invariants in 20 ms returned []
[2025-06-02 05:23:39] [INFO ] Invariant cache hit.
[2025-06-02 05:23:39] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-06-02 05:23:39] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2025-06-02 05:23:39] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2025-06-02 05:23:39] [INFO ] Invariant cache hit.
[2025-06-02 05:23:39] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 16 constraints, problems are : Problem set: 0 solved, 5 unsolved in 51 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 21 constraints, problems are : Problem set: 0 solved, 5 unsolved in 54 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 108ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 108ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 158 ms. Remains : 10/10 places, 15/15 transitions.
[2025-06-02 05:23:39] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[128] Max Struct:[130]
RANDOM walk for 1000020 steps (2 resets) in 159 ms. (6250 steps per ms)
BEST_FIRST walk for 1000001 steps (205 resets) in 248 ms. (4016 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[128] Max Struct:[130]
[2025-06-02 05:23:39] [INFO ] Invariant cache hit.
[2025-06-02 05:23:39] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 05:23:39] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2025-06-02 05:23:39] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:23:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-02 05:23:39] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2025-06-02 05:23:39] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-06-02 05:23:39] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:23:39] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:23:39] [INFO ] Added : 1 causal constraints over 1 iterations in 3 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[128] Max Struct:[130]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[128] Max Struct:[130]
Support contains 1 out of 10 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 10/10 places, 15/15 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2025-06-02 05:23:39] [INFO ] Invariant cache hit.
[2025-06-02 05:23:39] [INFO ] Implicit Places using invariants in 23 ms returned []
[2025-06-02 05:23:39] [INFO ] Invariant cache hit.
[2025-06-02 05:23:39] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-06-02 05:23:39] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2025-06-02 05:23:39] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2025-06-02 05:23:39] [INFO ] Invariant cache hit.
[2025-06-02 05:23:39] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 16 constraints, problems are : Problem set: 0 solved, 5 unsolved in 51 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 21 constraints, problems are : Problem set: 0 solved, 5 unsolved in 46 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 100ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 102ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 162 ms. Remains : 10/10 places, 15/15 transitions.
[2025-06-02 05:23:39] [INFO ] Flatten gal took : 3 ms
[2025-06-02 05:23:39] [INFO ] Flatten gal took : 2 ms
[2025-06-02 05:23:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6490400605526161368.gal : 1 ms
[2025-06-02 05:23:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14977392892207883975.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/ReachabilityCardinality6490400605526161368.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14977392892207883975.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
RANDOM walk for 40067 steps (8 resets) in 37 ms. (1054 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality14977392892207883975.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :19 after 1651
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1651 after 6479
BEST_FIRST walk for 40001 steps (9 resets) in 52 ms. (754 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (11 resets) in 35 ms. (1111 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :6479 after 2.44742e+06
Interrupted probabilistic random walk after 1029861 steps, run timeout after 3001 ms. (steps per millisecond=343 ) properties seen :0 out of 2
Probabilistic random walk after 1029861 steps, saw 594031 distinct states, run finished after 3001 ms. (steps per millisecond=343 ) properties seen :0
[2025-06-02 05:23:42] [INFO ] Invariant cache hit.
[2025-06-02 05:23:42] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 05:23:43] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 2 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 15/25 variables, 10/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 17 constraints, problems are : Problem set: 1 solved, 1 unsolved in 81 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 15/25 variables, 10/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 1/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/25 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 18 constraints, problems are : Problem set: 1 solved, 1 unsolved in 53 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 137ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 18 ms.
Support contains 1 out of 10 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Running 5 sub problems to find dead transitions.
[2025-06-02 05:23:43] [INFO ] Invariant cache hit.
[2025-06-02 05:23:43] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 16 constraints, problems are : Problem set: 0 solved, 5 unsolved in 43 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 21 constraints, problems are : Problem set: 0 solved, 5 unsolved in 48 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 103ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 103ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108 ms. Remains : 10/10 places, 15/15 transitions.
RANDOM walk for 40050 steps (8 resets) in 13 ms. (2860 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (10 resets) in 15 ms. (2500 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 3131374 steps, run timeout after 3001 ms. (steps per millisecond=1043 ) properties seen :0 out of 1
Probabilistic random walk after 3131374 steps, saw 1761129 distinct states, run finished after 3002 ms. (steps per millisecond=1043 ) properties seen :0
[2025-06-02 05:23:46] [INFO ] Invariant cache hit.
[2025-06-02 05:23:46] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 05:23:46] [INFO ] Deduced a trap composed of 5 places in 128 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 15/25 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 17 constraints, problems are : Problem set: 0 solved, 1 unsolved in 167 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 15/25 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/25 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 18 constraints, problems are : Problem set: 0 solved, 1 unsolved in 47 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 219ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 20 ms.
Support contains 1 out of 10 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 10/10 places, 15/15 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (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 5 read => feed constraints.
[2025-06-02 05:23:46] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2025-06-02 05:23:46] [INFO ] Redundant transitions in 0 ms returned []
Running 5 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 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 16 constraints, problems are : Problem set: 0 solved, 5 unsolved in 55 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 21 constraints, problems are : Problem set: 0 solved, 5 unsolved in 44 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 116ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 116ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 205 ms. Remains : 10/10 places, 15/15 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-02 05:23:46] [INFO ] Flatten gal took : 1 ms
[2025-06-02 05:23:46] [INFO ] Applying decomposition
[2025-06-02 05:23:46] [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/graph15654001001133853604.txt' '-o' '/tmp/graph15654001001133853604.bin' '-w' '/tmp/graph15654001001133853604.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15654001001133853604.bin' '-l' '-1' '-v' '-w' '/tmp/graph15654001001133853604.weights' '-q' '0' '-e' '0.001'
[2025-06-02 05:23:46] [INFO ] Decomposing Gal with order
[2025-06-02 05:23:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 05:23:46] [INFO ] Flatten gal took : 1 ms
[2025-06-02 05:23:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-02 05:23:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6711685971962629399.gal : 1 ms
[2025-06-02 05:23:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11860240083290593880.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6711685971962629399.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11860240083290593880.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality11860240083290593880.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 286
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :286 after 32695
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :32695 after 2.61461e+08
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :8.8882e+10 after 8.8905e+10
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :8.8905e+10 after 8.95557e+10
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :8.95557e+10 after 8.95557e+10
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :8.95557e+10 after 8.95557e+10
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :8.95557e+10 after 8.95557e+10
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :2.70331e+11 after 2.79094e+11
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[128] Max Struct:[130]
Ending property specific reduction for PGCD-PT-D04N025-UpperBounds-02 in 58454 ms.
Starting property specific reduction for PGCD-PT-D04N025-UpperBounds-07
Current structural bounds on expressions (Initially) : Max Seen:[25] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[25] Max Struct:[130]
Current structural bounds on expressions (Before main loop) : Max Seen:[25] Max Struct:[130]
[2025-06-02 05:24:36] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[25] Max Struct:[130]
RANDOM walk for 10001 steps (2 resets) in 3 ms. (2500 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 4 ms. (2000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[102] Max Struct:[130]
[2025-06-02 05:24:36] [INFO ] Invariant cache hit.
[2025-06-02 05:24:36] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 05:24:36] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2025-06-02 05:24:36] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:24:36] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 05:24:36] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2025-06-02 05:24:36] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-06-02 05:24:36] [INFO ] [Nat]Added 5 Read/Feed constraints in 2 ms returned sat
[2025-06-02 05:24:36] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:24:36] [INFO ] Added : 1 causal constraints over 1 iterations in 3 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[102] Max Struct:[130]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[128] Max Struct:[130]
Support contains 1 out of 10 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Running 5 sub problems to find dead transitions.
[2025-06-02 05:24:36] [INFO ] Invariant cache hit.
[2025-06-02 05:24:36] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 16 constraints, problems are : Problem set: 0 solved, 5 unsolved in 42 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 21 constraints, problems are : Problem set: 0 solved, 5 unsolved in 44 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 90ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 90ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 10/10 places, 15/15 transitions.
[2025-06-02 05:24:36] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[128] Max Struct:[130]
RANDOM walk for 1000005 steps (2 resets) in 151 ms. (6578 steps per ms)
BEST_FIRST walk for 1000000 steps (218 resets) in 277 ms. (3597 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[128] Max Struct:[130]
[2025-06-02 05:24:37] [INFO ] Invariant cache hit.
[2025-06-02 05:24:37] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 05:24:37] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2025-06-02 05:24:37] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:24:37] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-02 05:24:37] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2025-06-02 05:24:37] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-06-02 05:24:37] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:24:37] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:24:37] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[128] Max Struct:[130]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[128] Max Struct:[130]
Support contains 1 out of 10 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 10/10 places, 15/15 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2025-06-02 05:24:37] [INFO ] Invariant cache hit.
[2025-06-02 05:24:37] [INFO ] Implicit Places using invariants in 31 ms returned []
[2025-06-02 05:24:37] [INFO ] Invariant cache hit.
[2025-06-02 05:24:37] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-06-02 05:24:37] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2025-06-02 05:24:37] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2025-06-02 05:24:37] [INFO ] Invariant cache hit.
[2025-06-02 05:24:37] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 16 constraints, problems are : Problem set: 0 solved, 5 unsolved in 49 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 21 constraints, problems are : Problem set: 0 solved, 5 unsolved in 50 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 114ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 114ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 181 ms. Remains : 10/10 places, 15/15 transitions.
[2025-06-02 05:24:37] [INFO ] Flatten gal took : 1 ms
[2025-06-02 05:24:37] [INFO ] Flatten gal took : 1 ms
[2025-06-02 05:24:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5235288609920765631.gal : 1 ms
[2025-06-02 05:24:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2813332535455595529.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5235288609920765631.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2813332535455595529.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality2813332535455595529.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
RANDOM walk for 40076 steps (8 resets) in 31 ms. (1252 steps per ms) remains 2/2 properties
SDD size :19 after 1651
BEST_FIRST walk for 40003 steps (10 resets) in 18 ms. (2105 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1651 after 6479
BEST_FIRST walk for 40004 steps (11 resets) in 18 ms. (2105 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :6479 after 2.44742e+06
Interrupted probabilistic random walk after 1203237 steps, run timeout after 3001 ms. (steps per millisecond=400 ) properties seen :0 out of 2
Probabilistic random walk after 1203237 steps, saw 697480 distinct states, run finished after 3001 ms. (steps per millisecond=400 ) properties seen :0
[2025-06-02 05:24:40] [INFO ] Invariant cache hit.
[2025-06-02 05:24:40] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 05:24:40] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 15/25 variables, 10/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 17 constraints, problems are : Problem set: 1 solved, 1 unsolved in 50 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 15/25 variables, 10/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 1/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/25 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 18 constraints, problems are : Problem set: 1 solved, 1 unsolved in 35 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 88ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 16 ms.
Support contains 1 out of 10 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Running 5 sub problems to find dead transitions.
[2025-06-02 05:24:40] [INFO ] Invariant cache hit.
[2025-06-02 05:24:40] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 16 constraints, problems are : Problem set: 0 solved, 5 unsolved in 50 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 21 constraints, problems are : Problem set: 0 solved, 5 unsolved in 63 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 127ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 127ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128 ms. Remains : 10/10 places, 15/15 transitions.
RANDOM walk for 40051 steps (8 resets) in 21 ms. (1820 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 20 ms. (1904 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 3326156 steps, run timeout after 3001 ms. (steps per millisecond=1108 ) properties seen :0 out of 1
Probabilistic random walk after 3326156 steps, saw 1864886 distinct states, run finished after 3001 ms. (steps per millisecond=1108 ) properties seen :0
[2025-06-02 05:24:43] [INFO ] Invariant cache hit.
[2025-06-02 05:24:43] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 05:24:43] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 15/25 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 17 constraints, problems are : Problem set: 0 solved, 1 unsolved in 54 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 15/25 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/25 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 18 constraints, problems are : Problem set: 0 solved, 1 unsolved in 26 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 84ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 16 ms.
Support contains 1 out of 10 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 10/10 places, 15/15 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2025-06-02 05:24:44] [INFO ] Invariant cache hit.
[2025-06-02 05:24:44] [INFO ] Implicit Places using invariants in 22 ms returned []
[2025-06-02 05:24:44] [INFO ] Invariant cache hit.
[2025-06-02 05:24:44] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-06-02 05:24:44] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2025-06-02 05:24:44] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2025-06-02 05:24:44] [INFO ] Invariant cache hit.
[2025-06-02 05:24:44] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 16 constraints, problems are : Problem set: 0 solved, 5 unsolved in 55 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 21 constraints, problems are : Problem set: 0 solved, 5 unsolved in 43 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 102ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 103ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 156 ms. Remains : 10/10 places, 15/15 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-02 05:24:44] [INFO ] Flatten gal took : 2 ms
[2025-06-02 05:24:44] [INFO ] Applying decomposition
[2025-06-02 05:24:44] [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/graph7944829629253122184.txt' '-o' '/tmp/graph7944829629253122184.bin' '-w' '/tmp/graph7944829629253122184.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7944829629253122184.bin' '-l' '-1' '-v' '-w' '/tmp/graph7944829629253122184.weights' '-q' '0' '-e' '0.001'
[2025-06-02 05:24:44] [INFO ] Decomposing Gal with order
[2025-06-02 05:24:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 05:24:44] [INFO ] Flatten gal took : 1 ms
[2025-06-02 05:24:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-02 05:24:44] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17646472714315182392.gal : 1 ms
[2025-06-02 05:24:44] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5556193261862370655.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/ReachabilityCardinality17646472714315182392.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5556193261862370655.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality5556193261862370655.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 286
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :286 after 32695
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :32695 after 8.5885e+07
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :8.8882e+10 after 8.92458e+10
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :8.92458e+10 after 8.93945e+10
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :8.93945e+10 after 8.95166e+10
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :8.95166e+10 after 8.95557e+10
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :8.95557e+10 after 8.95557e+10
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :2.70331e+11 after 2.77477e+11
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[128] Max Struct:[130]
Ending property specific reduction for PGCD-PT-D04N025-UpperBounds-07 in 57478 ms.
Starting property specific reduction for PGCD-PT-D04N025-UpperBounds-14
Current structural bounds on expressions (Initially) : Max Seen:[25] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[25] Max Struct:[130]
Current structural bounds on expressions (Before main loop) : Max Seen:[25] Max Struct:[130]
[2025-06-02 05:25:34] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[25] Max Struct:[130]
RANDOM walk for 10004 steps (2 resets) in 3 ms. (2501 steps per ms)
BEST_FIRST walk for 10000 steps (3 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[104] Max Struct:[130]
[2025-06-02 05:25:34] [INFO ] Invariant cache hit.
[2025-06-02 05:25:34] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 05:25:34] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2025-06-02 05:25:34] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:25:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 05:25:34] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2025-06-02 05:25:34] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-06-02 05:25:34] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:25:34] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 05:25:34] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[104] Max Struct:[130]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[128] Max Struct:[130]
Support contains 1 out of 10 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Running 5 sub problems to find dead transitions.
[2025-06-02 05:25:34] [INFO ] Invariant cache hit.
[2025-06-02 05:25:34] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 16 constraints, problems are : Problem set: 0 solved, 5 unsolved in 48 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 21 constraints, problems are : Problem set: 0 solved, 5 unsolved in 49 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 101ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 101ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 10/10 places, 15/15 transitions.
[2025-06-02 05:25:34] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[128] Max Struct:[130]
RANDOM walk for 1000019 steps (2 resets) in 149 ms. (6666 steps per ms)
BEST_FIRST walk for 1000001 steps (232 resets) in 240 ms. (4149 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[128] Max Struct:[130]
[2025-06-02 05:25:34] [INFO ] Invariant cache hit.
[2025-06-02 05:25:34] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 05:25:34] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2025-06-02 05:25:34] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 05:25:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 05:25:34] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2025-06-02 05:25:34] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-06-02 05:25:34] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2025-06-02 05:25:34] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2025-06-02 05:25:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 25 ms
[2025-06-02 05:25:34] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 05:25:34] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[128] Max Struct:[130]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[128] Max Struct:[130]
Support contains 1 out of 10 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 10/10 places, 15/15 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2025-06-02 05:25:35] [INFO ] Invariant cache hit.
[2025-06-02 05:25:35] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-06-02 05:25:35] [INFO ] Invariant cache hit.
[2025-06-02 05:25:35] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-06-02 05:25:35] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2025-06-02 05:25:35] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2025-06-02 05:25:35] [INFO ] Invariant cache hit.
[2025-06-02 05:25:35] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 16 constraints, problems are : Problem set: 0 solved, 5 unsolved in 38 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 21 constraints, problems are : Problem set: 0 solved, 5 unsolved in 54 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 95ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 95ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 190 ms. Remains : 10/10 places, 15/15 transitions.
RANDOM walk for 40031 steps (8 resets) in 20 ms. (1906 steps per ms) remains 2/2 properties
[2025-06-02 05:25:35] [INFO ] Flatten gal took : 10 ms
[2025-06-02 05:25:35] [INFO ] Flatten gal took : 2 ms
[2025-06-02 05:25:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8475493558595682835.gal : 1 ms
[2025-06-02 05:25:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14279931861747009269.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/ReachabilityCardinality8475493558595682835.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14279931861747009269.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40002 steps (9 resets) in 25 ms. (1538 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 20 ms. (1904 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/ReachabilityCardinality14279931861747009269.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :19 after 1651
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1651 after 6479
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :6479 after 2.44742e+06
Interrupted probabilistic random walk after 1338517 steps, run timeout after 3001 ms. (steps per millisecond=446 ) properties seen :0 out of 2
Probabilistic random walk after 1338517 steps, saw 774467 distinct states, run finished after 3002 ms. (steps per millisecond=445 ) properties seen :0
[2025-06-02 05:25:38] [INFO ] Invariant cache hit.
[2025-06-02 05:25:38] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 05:25:38] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 15/25 variables, 10/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 17 constraints, problems are : Problem set: 1 solved, 1 unsolved in 48 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 15/25 variables, 10/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 1/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/25 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 18 constraints, problems are : Problem set: 1 solved, 1 unsolved in 29 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 88ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 17 ms.
Support contains 1 out of 10 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Running 5 sub problems to find dead transitions.
[2025-06-02 05:25:38] [INFO ] Invariant cache hit.
[2025-06-02 05:25:38] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 16 constraints, problems are : Problem set: 0 solved, 5 unsolved in 47 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 21 constraints, problems are : Problem set: 0 solved, 5 unsolved in 41 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 114ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 114ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 115 ms. Remains : 10/10 places, 15/15 transitions.
RANDOM walk for 40075 steps (8 resets) in 13 ms. (2862 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (10 resets) in 15 ms. (2500 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 3362296 steps, run timeout after 3001 ms. (steps per millisecond=1120 ) properties seen :0 out of 1
Probabilistic random walk after 3362296 steps, saw 1883282 distinct states, run finished after 3001 ms. (steps per millisecond=1120 ) properties seen :0
[2025-06-02 05:25:41] [INFO ] Invariant cache hit.
[2025-06-02 05:25:41] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 05:25:41] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 15/25 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 17 constraints, problems are : Problem set: 0 solved, 1 unsolved in 54 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 15/25 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/25 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 18 constraints, problems are : Problem set: 0 solved, 1 unsolved in 40 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 100ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 17 ms.
Support contains 1 out of 10 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 10/10 places, 15/15 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2025-06-02 05:25:41] [INFO ] Invariant cache hit.
[2025-06-02 05:25:41] [INFO ] Implicit Places using invariants in 17 ms returned []
[2025-06-02 05:25:41] [INFO ] Invariant cache hit.
[2025-06-02 05:25:41] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-06-02 05:25:41] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2025-06-02 05:25:41] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2025-06-02 05:25:41] [INFO ] Invariant cache hit.
[2025-06-02 05:25:41] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 16 constraints, problems are : Problem set: 0 solved, 5 unsolved in 40 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 15/25 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 21 constraints, problems are : Problem set: 0 solved, 5 unsolved in 49 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 91ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 92ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 136 ms. Remains : 10/10 places, 15/15 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-02 05:25:41] [INFO ] Flatten gal took : 1 ms
[2025-06-02 05:25:41] [INFO ] Applying decomposition
[2025-06-02 05:25:41] [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/graph17601916622049070052.txt' '-o' '/tmp/graph17601916622049070052.bin' '-w' '/tmp/graph17601916622049070052.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17601916622049070052.bin' '-l' '-1' '-v' '-w' '/tmp/graph17601916622049070052.weights' '-q' '0' '-e' '0.001'
[2025-06-02 05:25:41] [INFO ] Decomposing Gal with order
[2025-06-02 05:25:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 05:25:41] [INFO ] Flatten gal took : 1 ms
[2025-06-02 05:25:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-02 05:25:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1031140635731470202.gal : 0 ms
[2025-06-02 05:25:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6309133605727543924.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/ReachabilityCardinality1031140635731470202.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6309133605727543924.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/ReachabilityCardinality6309133605727543924.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 286
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :286 after 32695
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :32695 after 8.59231e+07
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :8.8882e+10 after 8.92458e+10
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :8.92458e+10 after 8.93945e+10
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :8.93945e+10 after 8.94811e+10
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :8.94811e+10 after 8.95557e+10
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :8.95557e+10 after 8.95557e+10
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :2.70331e+11 after 2.77251e+11
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[128] Max Struct:[130]
Ending property specific reduction for PGCD-PT-D04N025-UpperBounds-14 in 57476 ms.
[2025-06-02 05:26:31] [INFO ] Flatten gal took : 1 ms
[2025-06-02 05:26:31] [INFO ] Applying decomposition
[2025-06-02 05:26:31] [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/graph11026200943819191021.txt' '-o' '/tmp/graph11026200943819191021.bin' '-w' '/tmp/graph11026200943819191021.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11026200943819191021.bin' '-l' '-1' '-v' '-w' '/tmp/graph11026200943819191021.weights' '-q' '0' '-e' '0.001'
[2025-06-02 05:26:31] [INFO ] Decomposing Gal with order
[2025-06-02 05:26:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 05:26:31] [INFO ] Flatten gal took : 1 ms
[2025-06-02 05:26:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-02 05:26:31] [INFO ] Time to serialize gal into /tmp/UpperBounds5582301857849157889.gal : 1 ms
[2025-06-02 05:26:31] [INFO ] Time to serialize properties into /tmp/UpperBounds14483203263239062563.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/UpperBounds5582301857849157889.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds14483203263239062563.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/UpperBounds14483203263239062563.prop.
Detected timeout of ITS tools.
[2025-06-02 05:47:50] [INFO ] Flatten gal took : 2 ms
[2025-06-02 05:47:50] [INFO ] Time to serialize gal into /tmp/UpperBounds4604399983610765079.gal : 1 ms
[2025-06-02 05:47:50] [INFO ] Time to serialize properties into /tmp/UpperBounds10061829600880228540.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds4604399983610765079.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds10061829600880228540.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...305
Loading property file /tmp/UpperBounds10061829600880228540.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2.57364e+12,26.2656,426156,2,2182,5,1.54514e+06,6,0,73,1.57892e+06,0
Total reachable state count : 2573637642576

Verifying 3 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 128
Bounds property PGCD-PT-D04N025-UpperBounds-02 :0 <= p1_2 <= 128
FORMULA PGCD-PT-D04N025-UpperBounds-02 128 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PGCD-PT-D04N025-UpperBounds-02,0,26.3233,426156,1,0,7,1.54514e+06,9,1,229,1.57892e+06,4
Min sum of variable value : 0
Maximum sum along a path : 128
Bounds property PGCD-PT-D04N025-UpperBounds-07 :0 <= p1_4 <= 128
FORMULA PGCD-PT-D04N025-UpperBounds-09 128 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
FORMULA PGCD-PT-D04N025-UpperBounds-13 128 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
FORMULA PGCD-PT-D04N025-UpperBounds-07 128 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PGCD-PT-D04N025-UpperBounds-07,0,26.3391,426156,1,0,8,1.54514e+06,10,1,365,1.57892e+06,5
Min sum of variable value : 0
Maximum sum along a path : 128
Bounds property PGCD-PT-D04N025-UpperBounds-14 :0 <= p1_1 <= 128
FORMULA PGCD-PT-D04N025-UpperBounds-14 128 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PGCD-PT-D04N025-UpperBounds-14,0,26.4109,426156,1,0,9,1.54514e+06,11,1,513,1.57892e+06,6
Total runtime 1543950 ms.

BK_STOP 1748843297398

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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-D04N025"
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-D04N025, 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-174876824800092"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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