Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K Apr 12 12:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K Apr 12 12:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.6M May 18 16:42 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716329762214

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d2m08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-21 22:16:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 22:16:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 22:16:03] [INFO ] Load time of PNML (sax parser for PT used): 206 ms
[2024-05-21 22:16:03] [INFO ] Transformed 4763 places.
[2024-05-21 22:16:03] [INFO ] Transformed 2478 transitions.
[2024-05-21 22:16:03] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 323 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Deduced a syphon composed of 3580 places in 25 ms
Reduce places removed 3580 places and 0 transitions.
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf]
// Phase 1: matrix 2478 rows 1183 cols
[2024-05-21 22:16:03] [INFO ] Computed 6 invariants in 162 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[8, 8, 2887, 7]
RANDOM walk for 10000 steps (2341 resets) in 330 ms. (30 steps per ms)
BEST_FIRST walk for 40002 steps (3761 resets) in 239 ms. (166 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[8, 8, 2887, 7]
[2024-05-21 22:16:04] [INFO ] Invariant cache hit.
[2024-05-21 22:16:04] [INFO ] [Real]Absence check using 2 positive place invariants in 16 ms returned sat
[2024-05-21 22:16:04] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 10 ms returned sat
[2024-05-21 22:16:05] [INFO ] [Real]Absence check using state equation in 675 ms returned sat
[2024-05-21 22:16:05] [INFO ] State equation strengthened by 1588 read => feed constraints.
[2024-05-21 22:16:06] [INFO ] [Real]Added 1588 Read/Feed constraints in 704 ms returned sat
[2024-05-21 22:16:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:16:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 11 ms returned sat
[2024-05-21 22:16:06] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 8 ms returned sat
[2024-05-21 22:16:07] [INFO ] [Nat]Absence check using state equation in 682 ms returned sat
[2024-05-21 22:16:08] [INFO ] [Nat]Added 1588 Read/Feed constraints in 854 ms returned sat
[2024-05-21 22:16:09] [INFO ] Deduced a trap composed of 237 places in 687 ms of which 82 ms to minimize.
[2024-05-21 22:16:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 927 ms
[2024-05-21 22:16:10] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 675 ms.
[2024-05-21 22:16:11] [INFO ] Deduced a trap composed of 32 places in 718 ms of which 8 ms to minimize.
[2024-05-21 22:16:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 958 ms
Maximisation of solution failed !
Minimization took 3 ms.
[2024-05-21 22:16:11] [INFO ] [Real]Absence check using 2 positive place invariants in 11 ms returned sat
[2024-05-21 22:16:11] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 10 ms returned sat
[2024-05-21 22:16:12] [INFO ] [Real]Absence check using state equation in 662 ms returned sat
[2024-05-21 22:16:13] [INFO ] [Real]Added 1588 Read/Feed constraints in 753 ms returned sat
[2024-05-21 22:16:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:16:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 11 ms returned sat
[2024-05-21 22:16:13] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2024-05-21 22:16:14] [INFO ] [Nat]Absence check using state equation in 649 ms returned sat
[2024-05-21 22:16:15] [INFO ] [Nat]Added 1588 Read/Feed constraints in 904 ms returned sat
[2024-05-21 22:16:15] [INFO ] Deduced a trap composed of 243 places in 642 ms of which 8 ms to minimize.
[2024-05-21 22:16:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 815 ms
[2024-05-21 22:16:16] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 635 ms.
[2024-05-21 22:16:17] [INFO ] Added : 11 causal constraints over 3 iterations in 1262 ms. Result :sat
Minimization took 647 ms.
[2024-05-21 22:16:18] [INFO ] [Real]Absence check using 2 positive place invariants in 11 ms returned sat
[2024-05-21 22:16:18] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2024-05-21 22:16:18] [INFO ] [Real]Absence check using state equation in 597 ms returned sat
[2024-05-21 22:16:19] [INFO ] [Real]Added 1588 Read/Feed constraints in 793 ms returned sat
[2024-05-21 22:16:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:16:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 11 ms returned sat
[2024-05-21 22:16:19] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2024-05-21 22:16:20] [INFO ] [Nat]Absence check using state equation in 613 ms returned sat
[2024-05-21 22:16:21] [INFO ] [Nat]Added 1588 Read/Feed constraints in 951 ms returned sat
[2024-05-21 22:16:22] [INFO ] Deduced a trap composed of 194 places in 618 ms of which 8 ms to minimize.
[2024-05-21 22:16:22] [INFO ] Deduced a trap composed of 221 places in 607 ms of which 7 ms to minimize.
[2024-05-21 22:16:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1730 ms
[2024-05-21 22:16:23] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 458 ms.
[2024-05-21 22:16:24] [INFO ] Added : 10 causal constraints over 3 iterations in 1005 ms. Result :sat
Minimization took 558 ms.
[2024-05-21 22:16:24] [INFO ] [Real]Absence check using 2 positive place invariants in 12 ms returned sat
[2024-05-21 22:16:24] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 12 ms returned sat
[2024-05-21 22:16:25] [INFO ] [Real]Absence check using state equation in 707 ms returned sat
[2024-05-21 22:16:26] [INFO ] [Real]Added 1588 Read/Feed constraints in 760 ms returned sat
[2024-05-21 22:16:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:16:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 12 ms returned sat
[2024-05-21 22:16:26] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 10 ms returned sat
[2024-05-21 22:16:27] [INFO ] [Nat]Absence check using state equation in 632 ms returned sat
[2024-05-21 22:16:28] [INFO ] [Nat]Added 1588 Read/Feed constraints in 959 ms returned sat
[2024-05-21 22:16:28] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 375 ms.
[2024-05-21 22:16:30] [INFO ] Deduced a trap composed of 46 places in 692 ms of which 7 ms to minimize.
[2024-05-21 22:16:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 891 ms
[2024-05-21 22:16:30] [INFO ] Added : 16 causal constraints over 4 iterations in 2172 ms. Result :sat
Minimization took 686 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[8, 8, 2887, 7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[8, 8, 2887, 7]
Support contains 4 out of 1183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1183/1183 places, 2478/2478 transitions.
Graph (complete) has 4476 edges and 1183 vertex of which 1136 are kept as prefixes of interest. Removing 47 places using SCC suffix rule.8 ms
Discarding 47 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 217 transitions.
Iterating post reduction 0 with 217 rules applied. Total rules applied 218 place count 1136 transition count 2261
Discarding 388 places :
Symmetric choice reduction at 1 with 388 rule applications. Total rules 606 place count 748 transition count 1203
Iterating global reduction 1 with 388 rules applied. Total rules applied 994 place count 748 transition count 1203
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 1003 place count 748 transition count 1194
Discarding 314 places :
Symmetric choice reduction at 2 with 314 rule applications. Total rules 1317 place count 434 transition count 880
Iterating global reduction 2 with 314 rules applied. Total rules applied 1631 place count 434 transition count 880
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1643 place count 434 transition count 868
Discarding 238 places :
Symmetric choice reduction at 3 with 238 rule applications. Total rules 1881 place count 196 transition count 529
Iterating global reduction 3 with 238 rules applied. Total rules applied 2119 place count 196 transition count 529
Ensure Unique test removed 209 transitions
Reduce isomorphic transitions removed 209 transitions.
Iterating post reduction 3 with 209 rules applied. Total rules applied 2328 place count 196 transition count 320
Discarding 25 places :
Symmetric choice reduction at 4 with 25 rule applications. Total rules 2353 place count 171 transition count 280
Iterating global reduction 4 with 25 rules applied. Total rules applied 2378 place count 171 transition count 280
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 2384 place count 171 transition count 274
Discarding 17 places :
Symmetric choice reduction at 5 with 17 rule applications. Total rules 2401 place count 154 transition count 257
Iterating global reduction 5 with 17 rules applied. Total rules applied 2418 place count 154 transition count 257
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 2422 place count 154 transition count 253
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 2436 place count 140 transition count 239
Iterating global reduction 6 with 14 rules applied. Total rules applied 2450 place count 140 transition count 239
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 2463 place count 140 transition count 226
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 2468 place count 135 transition count 204
Iterating global reduction 7 with 5 rules applied. Total rules applied 2473 place count 135 transition count 204
Applied a total of 2473 rules in 234 ms. Remains 135 /1183 variables (removed 1048) and now considering 204/2478 (removed 2274) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 243 ms. Remains : 135/1183 places, 204/2478 transitions.
// Phase 1: matrix 204 rows 135 cols
[2024-05-21 22:16:31] [INFO ] Computed 2 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[8, 8, 2887, 7]
RANDOM walk for 1000000 steps (229593 resets) in 1430 ms. (698 steps per ms)
BEST_FIRST walk for 4000003 steps (383900 resets) in 2550 ms. (1568 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[8, 8, 2887, 7]
[2024-05-21 22:16:35] [INFO ] Invariant cache hit.
[2024-05-21 22:16:35] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-21 22:16:35] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2024-05-21 22:16:35] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-21 22:16:35] [INFO ] [Real]Added 77 Read/Feed constraints in 12 ms returned sat
[2024-05-21 22:16:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:16:35] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 22:16:35] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2024-05-21 22:16:35] [INFO ] [Nat]Added 77 Read/Feed constraints in 39 ms returned sat
[2024-05-21 22:16:35] [INFO ] Computed and/alt/rep : 52/125/52 causal constraints (skipped 151 transitions) in 16 ms.
[2024-05-21 22:16:35] [INFO ] Added : 17 causal constraints over 4 iterations in 149 ms. Result :sat
Minimization took 110 ms.
[2024-05-21 22:16:35] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 22:16:35] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2024-05-21 22:16:36] [INFO ] [Real]Added 77 Read/Feed constraints in 11 ms returned sat
[2024-05-21 22:16:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:16:36] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 22:16:36] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2024-05-21 22:16:36] [INFO ] [Nat]Added 77 Read/Feed constraints in 13 ms returned sat
[2024-05-21 22:16:36] [INFO ] Computed and/alt/rep : 52/125/52 causal constraints (skipped 151 transitions) in 17 ms.
[2024-05-21 22:16:36] [INFO ] Added : 12 causal constraints over 4 iterations in 82 ms. Result :sat
Minimization took 101 ms.
[2024-05-21 22:16:36] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 22:16:36] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2024-05-21 22:16:36] [INFO ] [Real]Added 77 Read/Feed constraints in 14 ms returned sat
[2024-05-21 22:16:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:16:36] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 22:16:36] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2024-05-21 22:16:36] [INFO ] [Nat]Added 77 Read/Feed constraints in 14 ms returned sat
[2024-05-21 22:16:36] [INFO ] Computed and/alt/rep : 52/125/52 causal constraints (skipped 151 transitions) in 13 ms.
[2024-05-21 22:16:36] [INFO ] Added : 10 causal constraints over 3 iterations in 62 ms. Result :sat
Minimization took 98 ms.
[2024-05-21 22:16:36] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 22:16:36] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2024-05-21 22:16:36] [INFO ] [Real]Added 77 Read/Feed constraints in 14 ms returned sat
[2024-05-21 22:16:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:16:36] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 22:16:36] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2024-05-21 22:16:36] [INFO ] [Nat]Added 77 Read/Feed constraints in 16 ms returned sat
[2024-05-21 22:16:36] [INFO ] Computed and/alt/rep : 52/125/52 causal constraints (skipped 151 transitions) in 13 ms.
[2024-05-21 22:16:37] [INFO ] Added : 15 causal constraints over 4 iterations in 94 ms. Result :sat
Minimization took 106 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[8, 8, 2887, 7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[8, 8, 2887, 7]
Support contains 4 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 204/204 transitions.
Applied a total of 0 rules in 14 ms. Remains 135 /135 variables (removed 0) and now considering 204/204 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 135/135 places, 204/204 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 204/204 transitions.
Applied a total of 0 rules in 10 ms. Remains 135 /135 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2024-05-21 22:16:37] [INFO ] Invariant cache hit.
[2024-05-21 22:16:37] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-21 22:16:37] [INFO ] Invariant cache hit.
[2024-05-21 22:16:37] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-21 22:16:37] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 423 ms to find 0 implicit places.
[2024-05-21 22:16:37] [INFO ] Redundant transitions in 6 ms returned []
Running 203 sub problems to find dead transitions.
[2024-05-21 22:16:37] [INFO ] Invariant cache hit.
[2024-05-21 22:16:37] [INFO ] State equation strengthened by 77 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (OVERLAPS) 1/135 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 204/339 variables, 135/137 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/339 variables, 77/214 constraints. Problems are: Problem set: 0 solved, 203 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (OVERLAPS) 0/339 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Real declared 339/339 variables, and 214 constraints, problems are : Problem set: 0 solved, 203 unsolved in 5771 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 135/135 constraints, ReadFeed: 77/77 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 203 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (OVERLAPS) 1/135 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 204/339 variables, 135/137 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/339 variables, 77/214 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 203/417 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/339 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (OVERLAPS) 0/339 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Int declared 339/339 variables, and 417 constraints, problems are : Problem set: 0 solved, 203 unsolved in 15461 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 135/135 constraints, ReadFeed: 77/77 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 0/0 constraints]
After SMT, in 21632ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 21644ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22101 ms. Remains : 135/135 places, 204/204 transitions.
[2024-05-21 22:16:59] [INFO ] Flatten gal took : 121 ms
RANDOM walk for 40000 steps (9183 resets) in 1385 ms. (28 steps per ms) remains 8/8 properties
[2024-05-21 22:16:59] [INFO ] Flatten gal took : 56 ms
BEST_FIRST walk for 40000 steps (3851 resets) in 204 ms. (195 steps per ms) remains 8/8 properties
[2024-05-21 22:16:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6656183229968317672.gal : 16 ms
BEST_FIRST walk for 40002 steps (3855 resets) in 141 ms. (281 steps per ms) remains 8/8 properties
[2024-05-21 22:16:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13284982043875632425.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/ReachabilityCardinality6656183229968317672.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13284982043875632425.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
BEST_FIRST walk for 40004 steps (3768 resets) in 141 ms. (281 steps per ms) remains 8/8 properties
Loading property file /tmp/ReachabilityCardinality13284982043875632425.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 7
BEST_FIRST walk for 40002 steps (3879 resets) in 137 ms. (289 steps per ms) remains 8/8 properties
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :7 after 30
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :30 after 68
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :68 after 106
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :106 after 182
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :182 after 330
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :330 after 588
BEST_FIRST walk for 40002 steps (3865 resets) in 185 ms. (215 steps per ms) remains 8/8 properties
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :588 after 1316
BEST_FIRST walk for 40001 steps (3881 resets) in 277 ms. (143 steps per ms) remains 8/8 properties
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :1316 after 21132
BEST_FIRST walk for 40002 steps (3886 resets) in 141 ms. (281 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (3744 resets) in 75 ms. (526 steps per ms) remains 8/8 properties
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :21132 after 46122
SDD proceeding with computation,8 properties remain. new max is 4096
SDD size :46122 after 336400
SDD proceeding with computation,8 properties remain. new max is 8192
SDD size :336400 after 828197
Interrupted probabilistic random walk after 755735 steps, run timeout after 3001 ms. (steps per millisecond=251 ) properties seen :4 out of 8
Probabilistic random walk after 755735 steps, saw 311221 distinct states, run finished after 3004 ms. (steps per millisecond=251 ) properties seen :4
[2024-05-21 22:17:03] [INFO ] Invariant cache hit.
[2024-05-21 22:17:03] [INFO ] State equation strengthened by 77 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 76/80 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 15/95 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 139/234 variables, 95/97 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem MAX0 is UNSAT
Problem MAX1 is UNSAT
Problem MAX2 is UNSAT
Problem MAX3 is UNSAT
After SMT solving in domain Real declared 330/339 variables, and 132 constraints, problems are : Problem set: 4 solved, 0 unsolved in 131 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 130/135 constraints, ReadFeed: 0/77 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 178ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0, 0, 0, 0] Max Struct:[8, 8, 2887, 7]
Starting property specific reduction for DBSingleClientW-PT-d2m08-UpperBounds-05
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[8]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[8]
[2024-05-21 22:17:03] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[8]
RANDOM walk for 10000 steps (2283 resets) in 17 ms. (555 steps per ms)
BEST_FIRST walk for 10000 steps (1000 resets) in 9 ms. (1000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[8]
[2024-05-21 22:17:03] [INFO ] Invariant cache hit.
[2024-05-21 22:17:03] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 22:17:03] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2024-05-21 22:17:03] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-21 22:17:03] [INFO ] [Real]Added 77 Read/Feed constraints in 13 ms returned sat
[2024-05-21 22:17:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:17:03] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 22:17:03] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2024-05-21 22:17:03] [INFO ] [Nat]Added 77 Read/Feed constraints in 14 ms returned sat
[2024-05-21 22:17:03] [INFO ] Computed and/alt/rep : 52/125/52 causal constraints (skipped 151 transitions) in 32 ms.
[2024-05-21 22:17:03] [INFO ] Added : 17 causal constraints over 4 iterations in 128 ms. Result :sat
Minimization took 108 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[8]
Support contains 1 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 204/204 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 132 transition count 201
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 132 transition count 201
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 132 transition count 200
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 130 transition count 197
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 130 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 130 transition count 196
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 14 place count 128 transition count 187
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 128 transition count 187
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 17 place count 128 transition count 186
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 18 place count 127 transition count 179
Iterating global reduction 3 with 1 rules applied. Total rules applied 19 place count 127 transition count 179
Applied a total of 19 rules in 36 ms. Remains 127 /135 variables (removed 8) and now considering 179/204 (removed 25) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 127/135 places, 179/204 transitions.
// Phase 1: matrix 179 rows 127 cols
[2024-05-21 22:17:04] [INFO ] Computed 2 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[8]
RANDOM walk for 1000000 steps (230289 resets) in 1210 ms. (825 steps per ms)
BEST_FIRST walk for 1000000 steps (95458 resets) in 533 ms. (1872 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[8]
[2024-05-21 22:17:05] [INFO ] Invariant cache hit.
[2024-05-21 22:17:05] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 22:17:05] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2024-05-21 22:17:05] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-21 22:17:05] [INFO ] [Real]Added 58 Read/Feed constraints in 10 ms returned sat
[2024-05-21 22:17:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:17:06] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 22:17:06] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2024-05-21 22:17:06] [INFO ] [Nat]Added 58 Read/Feed constraints in 12 ms returned sat
[2024-05-21 22:17:06] [INFO ] Computed and/alt/rep : 50/117/50 causal constraints (skipped 128 transitions) in 14 ms.
[2024-05-21 22:17:06] [INFO ] Added : 12 causal constraints over 3 iterations in 58 ms. Result :sat
Minimization took 94 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[8]
Support contains 1 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 179/179 transitions.
Applied a total of 0 rules in 5 ms. Remains 127 /127 variables (removed 0) and now considering 179/179 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 127/127 places, 179/179 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 179/179 transitions.
Applied a total of 0 rules in 5 ms. Remains 127 /127 variables (removed 0) and now considering 179/179 (removed 0) transitions.
[2024-05-21 22:17:06] [INFO ] Invariant cache hit.
[2024-05-21 22:17:06] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-21 22:17:06] [INFO ] Invariant cache hit.
[2024-05-21 22:17:06] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-21 22:17:06] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
[2024-05-21 22:17:06] [INFO ] Redundant transitions in 9 ms returned []
Running 178 sub problems to find dead transitions.
[2024-05-21 22:17:06] [INFO ] Invariant cache hit.
[2024-05-21 22:17:06] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (OVERLAPS) 179/306 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 58/187 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (OVERLAPS) 0/306 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 187 constraints, problems are : Problem set: 0 solved, 178 unsolved in 5435 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 127/127 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 178 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (OVERLAPS) 179/306 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 58/187 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 178/365 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 8 (OVERLAPS) 0/306 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 365 constraints, problems are : Problem set: 0 solved, 178 unsolved in 12282 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 127/127 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 0/0 constraints]
After SMT, in 17997ms problems are : Problem set: 0 solved, 178 unsolved
Search for dead transitions found 0 dead transitions in 17999ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18367 ms. Remains : 127/127 places, 179/179 transitions.
RANDOM walk for 40000 steps (9252 resets) in 100 ms. (396 steps per ms) remains 2/2 properties
[2024-05-21 22:17:24] [INFO ] Flatten gal took : 26 ms
[2024-05-21 22:17:24] [INFO ] Flatten gal took : 25 ms
[2024-05-21 22:17:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14249739807053981820.gal : 4 ms
[2024-05-21 22:17:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6777196274812612130.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/ReachabilityCardinality14249739807053981820.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6777196274812612130.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40002 steps (3832 resets) in 84 ms. (470 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/ReachabilityCardinality6777196274812612130.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 30
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :30 after 68
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :68 after 106
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :106 after 182
BEST_FIRST walk for 40001 steps (3946 resets) in 97 ms. (408 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :182 after 294
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :294 after 498
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :498 after 854
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :854 after 4808
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :4808 after 14790
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :14790 after 121300
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :121300 after 336722
Interrupted probabilistic random walk after 1737060 steps, run timeout after 3001 ms. (steps per millisecond=578 ) properties seen :1 out of 2
Probabilistic random walk after 1737060 steps, saw 725619 distinct states, run finished after 3004 ms. (steps per millisecond=578 ) properties seen :1
[2024-05-21 22:17:27] [INFO ] Invariant cache hit.
[2024-05-21 22:17:27] [INFO ] State equation strengthened by 58 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) 75/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/91 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 131/222 variables, 91/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 297/306 variables, and 124 constraints, problems are : Problem set: 1 solved, 0 unsolved in 198 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 122/127 constraints, ReadFeed: 0/58 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 206ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[8]
Ending property specific reduction for DBSingleClientW-PT-d2m08-UpperBounds-05 in 24454 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m08-UpperBounds-13
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[8]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[8]
// Phase 1: matrix 204 rows 135 cols
[2024-05-21 22:17:28] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[8]
RANDOM walk for 10000 steps (2322 resets) in 15 ms. (625 steps per ms)
BEST_FIRST walk for 10000 steps (935 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[8]
[2024-05-21 22:17:28] [INFO ] Invariant cache hit.
[2024-05-21 22:17:28] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 22:17:28] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2024-05-21 22:17:28] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-21 22:17:28] [INFO ] [Real]Added 77 Read/Feed constraints in 11 ms returned sat
[2024-05-21 22:17:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:17:28] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 22:17:28] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2024-05-21 22:17:28] [INFO ] [Nat]Added 77 Read/Feed constraints in 12 ms returned sat
[2024-05-21 22:17:28] [INFO ] Computed and/alt/rep : 52/125/52 causal constraints (skipped 151 transitions) in 12 ms.
[2024-05-21 22:17:28] [INFO ] Added : 12 causal constraints over 4 iterations in 105 ms. Result :sat
Minimization took 92 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[8]
Support contains 1 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 204/204 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 132 transition count 201
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 132 transition count 201
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 132 transition count 200
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 130 transition count 197
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 130 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 130 transition count 196
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 14 place count 128 transition count 187
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 128 transition count 187
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 17 place count 128 transition count 186
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 18 place count 127 transition count 179
Iterating global reduction 3 with 1 rules applied. Total rules applied 19 place count 127 transition count 179
Applied a total of 19 rules in 30 ms. Remains 127 /135 variables (removed 8) and now considering 179/204 (removed 25) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 127/135 places, 179/204 transitions.
// Phase 1: matrix 179 rows 127 cols
[2024-05-21 22:17:28] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[8]
RANDOM walk for 1000000 steps (229723 resets) in 1147 ms. (871 steps per ms)
BEST_FIRST walk for 1000001 steps (95568 resets) in 532 ms. (1876 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[8]
[2024-05-21 22:17:30] [INFO ] Invariant cache hit.
[2024-05-21 22:17:30] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 22:17:30] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2024-05-21 22:17:30] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-21 22:17:30] [INFO ] [Real]Added 58 Read/Feed constraints in 10 ms returned sat
[2024-05-21 22:17:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:17:30] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 22:17:30] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2024-05-21 22:17:30] [INFO ] [Nat]Added 58 Read/Feed constraints in 11 ms returned sat
[2024-05-21 22:17:30] [INFO ] Computed and/alt/rep : 50/117/50 causal constraints (skipped 128 transitions) in 10 ms.
[2024-05-21 22:17:30] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2024-05-21 22:17:30] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 2 ms to minimize.
[2024-05-21 22:17:30] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 1 ms to minimize.
[2024-05-21 22:17:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 255 ms
[2024-05-21 22:17:30] [INFO ] Added : 16 causal constraints over 4 iterations in 334 ms. Result :sat
Minimization took 78 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[8]
Support contains 1 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 179/179 transitions.
Applied a total of 0 rules in 12 ms. Remains 127 /127 variables (removed 0) and now considering 179/179 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 127/127 places, 179/179 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 179/179 transitions.
Applied a total of 0 rules in 5 ms. Remains 127 /127 variables (removed 0) and now considering 179/179 (removed 0) transitions.
[2024-05-21 22:17:30] [INFO ] Invariant cache hit.
[2024-05-21 22:17:31] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-05-21 22:17:31] [INFO ] Invariant cache hit.
[2024-05-21 22:17:31] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-21 22:17:31] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 420 ms to find 0 implicit places.
[2024-05-21 22:17:31] [INFO ] Redundant transitions in 2 ms returned []
Running 178 sub problems to find dead transitions.
[2024-05-21 22:17:31] [INFO ] Invariant cache hit.
[2024-05-21 22:17:31] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (OVERLAPS) 179/306 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 58/187 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (OVERLAPS) 0/306 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 187 constraints, problems are : Problem set: 0 solved, 178 unsolved in 4449 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 127/127 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 178 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (OVERLAPS) 179/306 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 58/187 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 178/365 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 8 (OVERLAPS) 0/306 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 365 constraints, problems are : Problem set: 0 solved, 178 unsolved in 10385 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 127/127 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 0/0 constraints]
After SMT, in 15108ms problems are : Problem set: 0 solved, 178 unsolved
Search for dead transitions found 0 dead transitions in 15110ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15547 ms. Remains : 127/127 places, 179/179 transitions.
[2024-05-21 22:17:46] [INFO ] Flatten gal took : 12 ms
[2024-05-21 22:17:46] [INFO ] Flatten gal took : 12 ms
[2024-05-21 22:17:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1938828705431440723.gal : 4 ms
[2024-05-21 22:17:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8064817740659218290.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/ReachabilityCardinality1938828705431440723.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8064817740659218290.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/ReachabilityCardinality8064817740659218290.prop.
RANDOM walk for 40000 steps (9269 resets) in 298 ms. (133 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 30
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :30 after 68
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :68 after 106
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :106 after 182
BEST_FIRST walk for 40004 steps (3827 resets) in 92 ms. (430 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :182 after 294
BEST_FIRST walk for 40002 steps (3877 resets) in 51 ms. (769 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :294 after 498
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :498 after 878
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :878 after 4886
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :4886 after 12984
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :12984 after 131600
Interrupted probabilistic random walk after 1991625 steps, run timeout after 3001 ms. (steps per millisecond=663 ) properties seen :1 out of 2
Probabilistic random walk after 1991625 steps, saw 822933 distinct states, run finished after 3009 ms. (steps per millisecond=661 ) properties seen :1
[2024-05-21 22:17:49] [INFO ] Invariant cache hit.
[2024-05-21 22:17:49] [INFO ] State equation strengthened by 58 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) 75/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/91 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
At refinement iteration 5 (OVERLAPS) 131/222 variables, 91/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD size :131600 after 355385
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 297/306 variables, and 124 constraints, problems are : Problem set: 1 solved, 0 unsolved in 150 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 122/127 constraints, ReadFeed: 0/58 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 171ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[8]
Ending property specific reduction for DBSingleClientW-PT-d2m08-UpperBounds-13 in 21993 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m08-UpperBounds-14
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[2887]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[2887]
// Phase 1: matrix 204 rows 135 cols
[2024-05-21 22:17:50] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[2887]
RANDOM walk for 10000 steps (2294 resets) in 14 ms. (666 steps per ms)
BEST_FIRST walk for 10001 steps (919 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[2887]
[2024-05-21 22:17:50] [INFO ] Invariant cache hit.
[2024-05-21 22:17:50] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 22:17:50] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2024-05-21 22:17:50] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-21 22:17:50] [INFO ] [Real]Added 77 Read/Feed constraints in 12 ms returned sat
[2024-05-21 22:17:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:17:50] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 22:17:50] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2024-05-21 22:17:50] [INFO ] [Nat]Added 77 Read/Feed constraints in 13 ms returned sat
[2024-05-21 22:17:50] [INFO ] Computed and/alt/rep : 52/125/52 causal constraints (skipped 151 transitions) in 12 ms.
[2024-05-21 22:17:50] [INFO ] Added : 10 causal constraints over 3 iterations in 62 ms. Result :sat
Minimization took 92 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[2887]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[2887]
Support contains 1 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 204/204 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 132 transition count 201
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 132 transition count 201
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 129 transition count 197
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 129 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 129 transition count 196
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 16 place count 126 transition count 186
Iterating global reduction 1 with 3 rules applied. Total rules applied 19 place count 126 transition count 186
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 21 place count 126 transition count 184
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 125 transition count 177
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 125 transition count 177
Applied a total of 23 rules in 12 ms. Remains 125 /135 variables (removed 10) and now considering 177/204 (removed 27) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 125/135 places, 177/204 transitions.
// Phase 1: matrix 177 rows 125 cols
[2024-05-21 22:17:50] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[2887]
RANDOM walk for 1000000 steps (230277 resets) in 1140 ms. (876 steps per ms)
BEST_FIRST walk for 1000000 steps (95628 resets) in 513 ms. (1945 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[2887]
[2024-05-21 22:17:52] [INFO ] Invariant cache hit.
[2024-05-21 22:17:52] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 22:17:52] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2024-05-21 22:17:52] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-21 22:17:52] [INFO ] [Real]Added 57 Read/Feed constraints in 13 ms returned sat
[2024-05-21 22:17:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:17:52] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 22:17:52] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2024-05-21 22:17:52] [INFO ] [Nat]Added 57 Read/Feed constraints in 11 ms returned sat
[2024-05-21 22:17:52] [INFO ] Computed and/alt/rep : 49/117/49 causal constraints (skipped 127 transitions) in 10 ms.
[2024-05-21 22:17:52] [INFO ] Added : 13 causal constraints over 3 iterations in 52 ms. Result :sat
Minimization took 88 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[2887]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[2887]
Support contains 1 out of 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 177/177 transitions.
Applied a total of 0 rules in 4 ms. Remains 125 /125 variables (removed 0) and now considering 177/177 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 125/125 places, 177/177 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 177/177 transitions.
Applied a total of 0 rules in 3 ms. Remains 125 /125 variables (removed 0) and now considering 177/177 (removed 0) transitions.
[2024-05-21 22:17:52] [INFO ] Invariant cache hit.
[2024-05-21 22:17:52] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-21 22:17:52] [INFO ] Invariant cache hit.
[2024-05-21 22:17:52] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-21 22:17:52] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 366 ms to find 0 implicit places.
[2024-05-21 22:17:52] [INFO ] Redundant transitions in 2 ms returned []
Running 176 sub problems to find dead transitions.
[2024-05-21 22:17:52] [INFO ] Invariant cache hit.
[2024-05-21 22:17:52] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (OVERLAPS) 177/302 variables, 125/127 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 57/184 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 7 (OVERLAPS) 0/302 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Real declared 302/302 variables, and 184 constraints, problems are : Problem set: 0 solved, 176 unsolved in 6107 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 125/125 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 176 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (OVERLAPS) 177/302 variables, 125/127 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 57/184 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 176/360 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/302 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 8 (OVERLAPS) 0/302 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Int declared 302/302 variables, and 360 constraints, problems are : Problem set: 0 solved, 176 unsolved in 10276 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 125/125 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 0/0 constraints]
After SMT, in 16609ms problems are : Problem set: 0 solved, 176 unsolved
Search for dead transitions found 0 dead transitions in 16619ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16997 ms. Remains : 125/125 places, 177/177 transitions.
[2024-05-21 22:18:09] [INFO ] Flatten gal took : 10 ms
[2024-05-21 22:18:09] [INFO ] Flatten gal took : 13 ms
[2024-05-21 22:18:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13375736199225085211.gal : 16 ms
[2024-05-21 22:18:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12366500911556021197.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/ReachabilityCardinality13375736199225085211.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12366500911556021197.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :
RANDOM walk for 40000 steps (9206 resets) in 210 ms. (189 steps per ms) remains 2/2 properties

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality12366500911556021197.prop.
BEST_FIRST walk for 40002 steps (3872 resets) in 48 ms. (816 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 30
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :30 after 68
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :68 after 106
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :106 after 182
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :182 after 294
BEST_FIRST walk for 40002 steps (3883 resets) in 126 ms. (314 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :294 after 528
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :528 after 924
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :924 after 5273
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :5273 after 15585
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :15585 after 141139
Interrupted probabilistic random walk after 2376315 steps, run timeout after 3001 ms. (steps per millisecond=791 ) properties seen :1 out of 2
Probabilistic random walk after 2376315 steps, saw 967190 distinct states, run finished after 3001 ms. (steps per millisecond=791 ) properties seen :1
[2024-05-21 22:18:12] [INFO ] Invariant cache hit.
[2024-05-21 22:18:12] [INFO ] State equation strengthened by 57 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :141139 after 362794
At refinement iteration 3 (OVERLAPS) 130/133 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 72/205 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 53/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 15/220 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/220 variables, 11/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/220 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 302/302 variables, and 135 constraints, problems are : Problem set: 1 solved, 0 unsolved in 181 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 125/125 constraints, ReadFeed: 8/57 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 189ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[2887]
Ending property specific reduction for DBSingleClientW-PT-d2m08-UpperBounds-14 in 22952 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m08-UpperBounds-15
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[7]
// Phase 1: matrix 204 rows 135 cols
[2024-05-21 22:18:12] [INFO ] Computed 2 invariants in 9 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 10000 steps (2286 resets) in 17 ms. (555 steps per ms)
BEST_FIRST walk for 10001 steps (986 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2024-05-21 22:18:13] [INFO ] Invariant cache hit.
[2024-05-21 22:18:13] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 22:18:13] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2024-05-21 22:18:13] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-21 22:18:13] [INFO ] [Real]Added 77 Read/Feed constraints in 13 ms returned sat
[2024-05-21 22:18:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:18:13] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 22:18:13] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2024-05-21 22:18:13] [INFO ] [Nat]Added 77 Read/Feed constraints in 16 ms returned sat
[2024-05-21 22:18:13] [INFO ] Computed and/alt/rep : 52/125/52 causal constraints (skipped 151 transitions) in 13 ms.
[2024-05-21 22:18:13] [INFO ] Added : 15 causal constraints over 4 iterations in 93 ms. Result :sat
Minimization took 106 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[7]
Support contains 1 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 204/204 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 132 transition count 201
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 132 transition count 201
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 132 transition count 200
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 130 transition count 198
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 130 transition count 198
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 13 place count 128 transition count 196
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 128 transition count 196
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 17 place count 128 transition count 194
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 19 place count 126 transition count 180
Iterating global reduction 2 with 2 rules applied. Total rules applied 21 place count 126 transition count 180
Applied a total of 21 rules in 40 ms. Remains 126 /135 variables (removed 9) and now considering 180/204 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 126/135 places, 180/204 transitions.
// Phase 1: matrix 180 rows 126 cols
[2024-05-21 22:18:13] [INFO ] Computed 2 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 1000000 steps (229625 resets) in 1211 ms. (825 steps per ms)
BEST_FIRST walk for 1000000 steps (95865 resets) in 548 ms. (1821 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2024-05-21 22:18:15] [INFO ] Invariant cache hit.
[2024-05-21 22:18:15] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 22:18:15] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2024-05-21 22:18:15] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-21 22:18:15] [INFO ] [Real]Added 58 Read/Feed constraints in 9 ms returned sat
[2024-05-21 22:18:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:18:15] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 22:18:15] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2024-05-21 22:18:15] [INFO ] [Nat]Added 58 Read/Feed constraints in 11 ms returned sat
[2024-05-21 22:18:15] [INFO ] Computed and/alt/rep : 50/119/50 causal constraints (skipped 129 transitions) in 12 ms.
[2024-05-21 22:18:15] [INFO ] Added : 29 causal constraints over 7 iterations in 109 ms. Result :sat
Minimization took 95 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[7]
Support contains 1 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 180/180 transitions.
Applied a total of 0 rules in 3 ms. Remains 126 /126 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 126/126 places, 180/180 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 180/180 transitions.
Applied a total of 0 rules in 3 ms. Remains 126 /126 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2024-05-21 22:18:15] [INFO ] Invariant cache hit.
[2024-05-21 22:18:15] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-21 22:18:15] [INFO ] Invariant cache hit.
[2024-05-21 22:18:15] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-21 22:18:16] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
[2024-05-21 22:18:16] [INFO ] Redundant transitions in 2 ms returned []
Running 179 sub problems to find dead transitions.
[2024-05-21 22:18:16] [INFO ] Invariant cache hit.
[2024-05-21 22:18:16] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (OVERLAPS) 180/306 variables, 126/128 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 58/186 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (OVERLAPS) 0/306 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 186 constraints, problems are : Problem set: 0 solved, 179 unsolved in 4495 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 126/126 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 179 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (OVERLAPS) 180/306 variables, 126/128 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 58/186 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 179/365 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 8 (OVERLAPS) 0/306 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 365 constraints, problems are : Problem set: 0 solved, 179 unsolved in 10049 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 126/126 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 0/0 constraints]
After SMT, in 14795ms problems are : Problem set: 0 solved, 179 unsolved
Search for dead transitions found 0 dead transitions in 14798ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15106 ms. Remains : 126/126 places, 180/180 transitions.
[2024-05-21 22:18:30] [INFO ] Flatten gal took : 9 ms
RANDOM walk for 40000 steps (9145 resets) in 116 ms. (341 steps per ms) remains 2/2 properties
[2024-05-21 22:18:30] [INFO ] Flatten gal took : 9 ms
[2024-05-21 22:18:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14077277459190870508.gal : 1 ms
[2024-05-21 22:18:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5749453801186309245.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/ReachabilityCardinality14077277459190870508.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5749453801186309245.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality5749453801186309245.prop.
BEST_FIRST walk for 40003 steps (3800 resets) in 125 ms. (317 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 30
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :30 after 68
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :68 after 106
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :106 after 182
BEST_FIRST walk for 40001 steps (3809 resets) in 54 ms. (727 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :182 after 294
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :294 after 528
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :528 after 924
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :924 after 6864
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :6864 after 15991
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :15991 after 133144
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :133144 after 334782
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :334782 after 3.49717e+06
Interrupted probabilistic random walk after 2342041 steps, run timeout after 3001 ms. (steps per millisecond=780 ) properties seen :1 out of 2
Probabilistic random walk after 2342041 steps, saw 952488 distinct states, run finished after 3001 ms. (steps per millisecond=780 ) properties seen :1
[2024-05-21 22:18:33] [INFO ] Invariant cache hit.
[2024-05-21 22:18:33] [INFO ] State equation strengthened by 58 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) 74/75 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 131/221 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 297/306 variables, and 123 constraints, problems are : Problem set: 1 solved, 0 unsolved in 139 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 121/126 constraints, ReadFeed: 0/58 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 149ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[7]
Ending property specific reduction for DBSingleClientW-PT-d2m08-UpperBounds-15 in 21145 ms.
[2024-05-21 22:18:34] [INFO ] Flatten gal took : 9 ms
[2024-05-21 22:18:34] [INFO ] Applying decomposition
[2024-05-21 22:18:34] [INFO ] Flatten gal took : 26 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/graph15246113706494183481.txt' '-o' '/tmp/graph15246113706494183481.bin' '-w' '/tmp/graph15246113706494183481.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15246113706494183481.bin' '-l' '-1' '-v' '-w' '/tmp/graph15246113706494183481.weights' '-q' '0' '-e' '0.001'
[2024-05-21 22:18:34] [INFO ] Decomposing Gal with order
[2024-05-21 22:18:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 22:18:34] [INFO ] Removed a total of 243 redundant transitions.
[2024-05-21 22:18:34] [INFO ] Flatten gal took : 379 ms
[2024-05-21 22:18:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 163 labels/synchronizations in 90 ms.
[2024-05-21 22:18:34] [INFO ] Time to serialize gal into /tmp/UpperBounds5014641673114625504.gal : 8 ms
[2024-05-21 22:18:34] [INFO ] Time to serialize properties into /tmp/UpperBounds11086368015489482433.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/UpperBounds5014641673114625504.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds11086368015489482433.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/UpperBounds11086368015489482433.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,6.08322e+07,17.7387,490512,4542,2613,471598,148382,621,2.87275e+06,176,1.28576e+06,0
Total reachable state count : 60832160

Verifying 4 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d2m08-UpperBounds-05 :0 <= i4.u13.l2567 <= 1
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-05 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DBSingleClientW-PT-d2m08-UpperBounds-05,0,18.1899,490512,1,0,471598,148382,750,2.87275e+06,205,1.28576e+06,1506
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d2m08-UpperBounds-13 :0 <= i4.u13.l2529 <= 1
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-13 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DBSingleClientW-PT-d2m08-UpperBounds-13,0,18.1947,490512,1,0,471598,148382,768,2.87275e+06,210,1.28576e+06,1536
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d2m08-UpperBounds-14 :0 <= i1.u6.l1678 <= 1
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-14 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DBSingleClientW-PT-d2m08-UpperBounds-14,0,18.1954,490512,1,0,471598,148382,796,2.87275e+06,219,1.28576e+06,1585
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d2m08-UpperBounds-15 :0 <= i6.i1.u9.p153 <= 1
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-15 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DBSingleClientW-PT-d2m08-UpperBounds-15,0,18.2262,490512,1,0,471598,148382,824,2.87275e+06,229,1.28576e+06,1741
Total runtime 169833 ms.

BK_STOP 1716329933237

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is DBSingleClientW-PT-d2m08, 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 r092-tall-171624189600581"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d2m08.tgz
mv DBSingleClientW-PT-d2m08 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;