Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 8.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 143K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 6 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 1.6M May 29 14:32 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1748602627919

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d2m06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-30 10:57:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-30 10:57:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 10:57:11] [INFO ] Load time of PNML (sax parser for PT used): 424 ms
[2025-05-30 10:57:11] [INFO ] Transformed 4763 places.
[2025-05-30 10:57:11] [INFO ] Transformed 2478 transitions.
[2025-05-30 10:57:11] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 828 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 13 ms.
Deduced a syphon composed of 3580 places in 36 ms
Reduce places removed 3580 places and 0 transitions.
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 2478 rows 1183 cols
[2025-05-30 10:57:11] [INFO ] Computed 6 invariants in 230 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[7, 6, 6, 7, 3]
RANDOM walk for 10000 steps (2270 resets) in 655 ms. (15 steps per ms)
BEST_FIRST walk for 50001 steps (4709 resets) in 451 ms. (110 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 1] Max Struct:[7, 6, 6, 7, 3]
[2025-05-30 10:57:12] [INFO ] Invariant cache hit.
[2025-05-30 10:57:13] [INFO ] [Real]Absence check using 2 positive place invariants in 35 ms returned sat
[2025-05-30 10:57:13] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 27 ms returned sat
[2025-05-30 10:57:15] [INFO ] [Real]Absence check using state equation in 1812 ms returned sat
[2025-05-30 10:57:15] [INFO ] State equation strengthened by 1588 read => feed constraints.
[2025-05-30 10:57:17] [INFO ] [Real]Added 1588 Read/Feed constraints in 1419 ms returned sat
[2025-05-30 10:57:17] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:57:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 27 ms returned sat
[2025-05-30 10:57:17] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 22 ms returned sat
[2025-05-30 10:57:19] [INFO ] [Nat]Absence check using state equation in 1404 ms returned sat
[2025-05-30 10:57:21] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-30 10:57:21] [INFO ] [Nat]Added 1588 Read/Feed constraints in 2371 ms returned unknown
[2025-05-30 10:57:21] [INFO ] [Real]Absence check using 2 positive place invariants in 26 ms returned sat
[2025-05-30 10:57:21] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 14 ms returned sat
[2025-05-30 10:57:23] [INFO ] [Real]Absence check using state equation in 1352 ms returned sat
[2025-05-30 10:57:24] [INFO ] [Real]Added 1588 Read/Feed constraints in 1268 ms returned sat
[2025-05-30 10:57:24] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:57:25] [INFO ] [Nat]Absence check using 2 positive place invariants in 18 ms returned sat
[2025-05-30 10:57:25] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 19 ms returned sat
[2025-05-30 10:57:26] [INFO ] [Nat]Absence check using state equation in 1672 ms returned sat
[2025-05-30 10:57:28] [INFO ] [Nat]Added 1588 Read/Feed constraints in 1529 ms returned sat
[2025-05-30 10:57:29] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 1085 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2025-05-30 10:57:30] [INFO ] [Real]Absence check using 2 positive place invariants in 16 ms returned sat
[2025-05-30 10:57:30] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 13 ms returned sat
[2025-05-30 10:57:31] [INFO ] [Real]Absence check using state equation in 1195 ms returned sat
[2025-05-30 10:57:32] [INFO ] [Real]Added 1588 Read/Feed constraints in 1269 ms returned sat
[2025-05-30 10:57:32] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:57:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 26 ms returned sat
[2025-05-30 10:57:33] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 26 ms returned sat
[2025-05-30 10:57:34] [INFO ] [Nat]Absence check using state equation in 1206 ms returned sat
[2025-05-30 10:57:36] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-30 10:57:36] [INFO ] [Nat]Added 1588 Read/Feed constraints in 2149 ms returned unknown
[2025-05-30 10:57:36] [INFO ] [Real]Absence check using 2 positive place invariants in 23 ms returned sat
[2025-05-30 10:57:36] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 18 ms returned sat
[2025-05-30 10:57:38] [INFO ] [Real]Absence check using state equation in 1339 ms returned sat
[2025-05-30 10:57:39] [INFO ] [Real]Added 1588 Read/Feed constraints in 1530 ms returned sat
[2025-05-30 10:57:39] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:57:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 27 ms returned sat
[2025-05-30 10:57:40] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 13 ms returned sat
[2025-05-30 10:57:41] [INFO ] [Nat]Absence check using state equation in 1535 ms returned sat
[2025-05-30 10:57:43] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-30 10:57:43] [INFO ] [Nat]Added 1588 Read/Feed constraints in 2012 ms returned sat
[2025-05-30 10:57:44] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 738 ms.
[2025-05-30 10:57:44] [INFO ] Added : 5 causal constraints over 1 iterations in 949 ms. Result :unknown
[2025-05-30 10:57:45] [INFO ] [Real]Absence check using 2 positive place invariants in 17 ms returned sat
[2025-05-30 10:57:45] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 19 ms returned sat
[2025-05-30 10:57:46] [INFO ] [Real]Absence check using state equation in 1158 ms returned sat
[2025-05-30 10:57:48] [INFO ] [Real]Added 1588 Read/Feed constraints in 1625 ms returned sat
[2025-05-30 10:57:48] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:57:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 26 ms returned sat
[2025-05-30 10:57:48] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 20 ms returned sat
[2025-05-30 10:57:49] [INFO ] [Nat]Absence check using state equation in 1300 ms returned sat
[2025-05-30 10:57:51] [INFO ] [Nat]Added 1588 Read/Feed constraints in 1371 ms returned sat
[2025-05-30 10:57:51] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 472 ms.
[2025-05-30 10:57:52] [INFO ] Added : 2 causal constraints over 1 iterations in 906 ms. Result :sat
Minimization took 826 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 1] Max Struct:[7, 6, 6, 7, 3]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 1] Max Struct:[7, 6, 6, 7, 3]
Support contains 5 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.13 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 387 places :
Symmetric choice reduction at 1 with 387 rule applications. Total rules 605 place count 749 transition count 1204
Iterating global reduction 1 with 387 rules applied. Total rules applied 992 place count 749 transition count 1204
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 1001 place count 749 transition count 1195
Discarding 314 places :
Symmetric choice reduction at 2 with 314 rule applications. Total rules 1315 place count 435 transition count 881
Iterating global reduction 2 with 314 rules applied. Total rules applied 1629 place count 435 transition count 881
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1641 place count 435 transition count 869
Discarding 238 places :
Symmetric choice reduction at 3 with 238 rule applications. Total rules 1879 place count 197 transition count 535
Iterating global reduction 3 with 238 rules applied. Total rules applied 2117 place count 197 transition count 535
Ensure Unique test removed 208 transitions
Reduce isomorphic transitions removed 208 transitions.
Iterating post reduction 3 with 208 rules applied. Total rules applied 2325 place count 197 transition count 327
Discarding 24 places :
Symmetric choice reduction at 4 with 24 rule applications. Total rules 2349 place count 173 transition count 288
Iterating global reduction 4 with 24 rules applied. Total rules applied 2373 place count 173 transition count 288
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 2379 place count 173 transition count 282
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 2394 place count 158 transition count 267
Iterating global reduction 5 with 15 rules applied. Total rules applied 2409 place count 158 transition count 267
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 2412 place count 158 transition count 264
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 2425 place count 145 transition count 251
Iterating global reduction 6 with 13 rules applied. Total rules applied 2438 place count 145 transition count 251
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 2450 place count 145 transition count 239
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 2454 place count 141 transition count 223
Iterating global reduction 7 with 4 rules applied. Total rules applied 2458 place count 141 transition count 223
Applied a total of 2458 rules in 398 ms. Remains 141 /1183 variables (removed 1042) and now considering 223/2478 (removed 2255) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 415 ms. Remains : 141/1183 places, 223/2478 transitions.
// Phase 1: matrix 223 rows 141 cols
[2025-05-30 10:57:53] [INFO ] Computed 2 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 1] Max Struct:[7, 6, 6, 7, 3]
RANDOM walk for 1000000 steps (229569 resets) in 2228 ms. (448 steps per ms)
BEST_FIRST walk for 5000003 steps (476483 resets) in 4296 ms. (1163 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 2] Max Struct:[7, 6, 6, 7, 3]
[2025-05-30 10:58:00] [INFO ] Invariant cache hit.
[2025-05-30 10:58:00] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 10:58:00] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2025-05-30 10:58:00] [INFO ] State equation strengthened by 86 read => feed constraints.
[2025-05-30 10:58:00] [INFO ] [Real]Added 86 Read/Feed constraints in 22 ms returned sat
[2025-05-30 10:58:00] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:58:00] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 10:58:00] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2025-05-30 10:58:00] [INFO ] [Nat]Added 86 Read/Feed constraints in 28 ms returned sat
[2025-05-30 10:58:00] [INFO ] Computed and/alt/rep : 55/140/55 causal constraints (skipped 167 transitions) in 19 ms.
[2025-05-30 10:58:00] [INFO ] Deduced a trap composed of 18 places in 120 ms of which 24 ms to minimize.
[2025-05-30 10:58:00] [INFO ] Deduced a trap composed of 15 places in 173 ms of which 4 ms to minimize.
[2025-05-30 10:58:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 370 ms
[2025-05-30 10:58:01] [INFO ] Added : 18 causal constraints over 4 iterations in 526 ms. Result :sat
Minimization took 158 ms.
[2025-05-30 10:58:01] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 10:58:01] [INFO ] [Real]Absence check using state equation in 113 ms returned sat
[2025-05-30 10:58:01] [INFO ] [Real]Added 86 Read/Feed constraints in 21 ms returned sat
[2025-05-30 10:58:01] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:58:01] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 10:58:01] [INFO ] [Nat]Absence check using state equation in 111 ms returned sat
[2025-05-30 10:58:01] [INFO ] [Nat]Added 86 Read/Feed constraints in 24 ms returned sat
[2025-05-30 10:58:01] [INFO ] Computed and/alt/rep : 55/140/55 causal constraints (skipped 167 transitions) in 49 ms.
[2025-05-30 10:58:01] [INFO ] Added : 7 causal constraints over 3 iterations in 147 ms. Result :sat
Minimization took 172 ms.
[2025-05-30 10:58:01] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 10:58:02] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2025-05-30 10:58:02] [INFO ] [Real]Added 86 Read/Feed constraints in 19 ms returned sat
[2025-05-30 10:58:02] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:58:02] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 10:58:02] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2025-05-30 10:58:02] [INFO ] [Nat]Added 86 Read/Feed constraints in 38 ms returned sat
[2025-05-30 10:58:02] [INFO ] Computed and/alt/rep : 55/140/55 causal constraints (skipped 167 transitions) in 39 ms.
[2025-05-30 10:58:02] [INFO ] Added : 18 causal constraints over 4 iterations in 208 ms. Result :sat
Minimization took 274 ms.
[2025-05-30 10:58:02] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 5 ms returned sat
[2025-05-30 10:58:03] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2025-05-30 10:58:03] [INFO ] [Real]Added 86 Read/Feed constraints in 38 ms returned sat
[2025-05-30 10:58:03] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:58:03] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2025-05-30 10:58:03] [INFO ] [Nat]Absence check using state equation in 112 ms returned sat
[2025-05-30 10:58:03] [INFO ] [Nat]Added 86 Read/Feed constraints in 32 ms returned sat
[2025-05-30 10:58:03] [INFO ] Computed and/alt/rep : 55/140/55 causal constraints (skipped 167 transitions) in 24 ms.
[2025-05-30 10:58:03] [INFO ] Added : 17 causal constraints over 4 iterations in 143 ms. Result :sat
Minimization took 174 ms.
[2025-05-30 10:58:03] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 10:58:03] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2025-05-30 10:58:03] [INFO ] [Real]Added 86 Read/Feed constraints in 20 ms returned sat
[2025-05-30 10:58:03] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:58:03] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 10:58:03] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2025-05-30 10:58:03] [INFO ] [Nat]Added 86 Read/Feed constraints in 16 ms returned sat
[2025-05-30 10:58:04] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 3 ms to minimize.
[2025-05-30 10:58:04] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 3 ms to minimize.
[2025-05-30 10:58:04] [INFO ] Deduced a trap composed of 16 places in 126 ms of which 3 ms to minimize.
[2025-05-30 10:58:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 370 ms
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 2] Max Struct:[7, 6, 6, 7, 2]
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-13 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[7, 6, 6, 7]
Support contains 4 out of 141 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 141/141 places, 223/223 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 140 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 140 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 139 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 139 transition count 221
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 139 transition count 220
Applied a total of 5 rules in 53 ms. Remains 139 /141 variables (removed 2) and now considering 220/223 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 139/141 places, 220/223 transitions.
// Phase 1: matrix 220 rows 139 cols
[2025-05-30 10:58:04] [INFO ] Computed 2 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[7, 6, 6, 7]
RANDOM walk for 1000000 steps (230083 resets) in 2132 ms. (468 steps per ms)
BEST_FIRST walk for 4000004 steps (381076 resets) in 3258 ms. (1227 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[7, 6, 6, 7]
[2025-05-30 10:58:10] [INFO ] Invariant cache hit.
[2025-05-30 10:58:10] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 10:58:10] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2025-05-30 10:58:10] [INFO ] State equation strengthened by 85 read => feed constraints.
[2025-05-30 10:58:10] [INFO ] [Real]Added 85 Read/Feed constraints in 21 ms returned sat
[2025-05-30 10:58:10] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:58:10] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2025-05-30 10:58:10] [INFO ] [Nat]Absence check using state equation in 111 ms returned sat
[2025-05-30 10:58:10] [INFO ] [Nat]Added 85 Read/Feed constraints in 40 ms returned sat
[2025-05-30 10:58:10] [INFO ] Computed and/alt/rep : 54/136/54 causal constraints (skipped 165 transitions) in 21 ms.
[2025-05-30 10:58:10] [INFO ] Added : 15 causal constraints over 4 iterations in 163 ms. Result :sat
Minimization took 200 ms.
[2025-05-30 10:58:10] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 10:58:10] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2025-05-30 10:58:10] [INFO ] [Real]Added 85 Read/Feed constraints in 22 ms returned sat
[2025-05-30 10:58:10] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:58:10] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 10:58:11] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2025-05-30 10:58:11] [INFO ] [Nat]Added 85 Read/Feed constraints in 20 ms returned sat
[2025-05-30 10:58:11] [INFO ] Computed and/alt/rep : 54/136/54 causal constraints (skipped 165 transitions) in 19 ms.
[2025-05-30 10:58:11] [INFO ] Deduced a trap composed of 16 places in 187 ms of which 4 ms to minimize.
[2025-05-30 10:58:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 243 ms
[2025-05-30 10:58:11] [INFO ] Added : 15 causal constraints over 3 iterations in 371 ms. Result :sat
Minimization took 256 ms.
[2025-05-30 10:58:11] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 10:58:11] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2025-05-30 10:58:11] [INFO ] [Real]Added 85 Read/Feed constraints in 18 ms returned sat
[2025-05-30 10:58:11] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:58:11] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 10:58:12] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2025-05-30 10:58:12] [INFO ] [Nat]Added 85 Read/Feed constraints in 28 ms returned sat
[2025-05-30 10:58:12] [INFO ] Computed and/alt/rep : 54/136/54 causal constraints (skipped 165 transitions) in 19 ms.
[2025-05-30 10:58:12] [INFO ] Added : 11 causal constraints over 3 iterations in 87 ms. Result :sat
Minimization took 216 ms.
[2025-05-30 10:58:12] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 10:58:12] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2025-05-30 10:58:12] [INFO ] [Real]Added 85 Read/Feed constraints in 29 ms returned sat
[2025-05-30 10:58:12] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:58:12] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2025-05-30 10:58:12] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2025-05-30 10:58:12] [INFO ] [Nat]Added 85 Read/Feed constraints in 26 ms returned sat
[2025-05-30 10:58:12] [INFO ] Computed and/alt/rep : 54/136/54 causal constraints (skipped 165 transitions) in 20 ms.
[2025-05-30 10:58:12] [INFO ] Added : 12 causal constraints over 3 iterations in 98 ms. Result :sat
Minimization took 147 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[7, 6, 6, 7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[7, 6, 6, 7]
Support contains 4 out of 139 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 139/139 places, 220/220 transitions.
Applied a total of 0 rules in 21 ms. Remains 139 /139 variables (removed 0) and now considering 220/220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 139/139 places, 220/220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 139/139 places, 220/220 transitions.
Applied a total of 0 rules in 16 ms. Remains 139 /139 variables (removed 0) and now considering 220/220 (removed 0) transitions.
[2025-05-30 10:58:13] [INFO ] Invariant cache hit.
[2025-05-30 10:58:13] [INFO ] Implicit Places using invariants in 201 ms returned []
[2025-05-30 10:58:13] [INFO ] Invariant cache hit.
[2025-05-30 10:58:13] [INFO ] State equation strengthened by 85 read => feed constraints.
[2025-05-30 10:58:14] [INFO ] Implicit Places using invariants and state equation in 632 ms returned []
Implicit Place search using SMT with State Equation took 837 ms to find 0 implicit places.
[2025-05-30 10:58:14] [INFO ] Redundant transitions in 10 ms returned []
Running 219 sub problems to find dead transitions.
[2025-05-30 10:58:14] [INFO ] Invariant cache hit.
[2025-05-30 10:58:14] [INFO ] State equation strengthened by 85 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (OVERLAPS) 1/139 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (OVERLAPS) 220/359 variables, 139/141 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/359 variables, 85/226 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (OVERLAPS) 0/359 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Real declared 359/359 variables, and 226 constraints, problems are : Problem set: 0 solved, 219 unsolved in 13382 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 139/139 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 219 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (OVERLAPS) 1/139 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (OVERLAPS) 220/359 variables, 139/141 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/359 variables, 85/226 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 219/445 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/359 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (OVERLAPS) 0/359 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Int declared 359/359 variables, and 445 constraints, problems are : Problem set: 0 solved, 219 unsolved in 24212 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 139/139 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 0/0 constraints]
After SMT, in 38454ms problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 38471ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39354 ms. Remains : 139/139 places, 220/220 transitions.
RANDOM walk for 40000 steps (9200 resets) in 1784 ms. (22 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (3821 resets) in 502 ms. (79 steps per ms) remains 8/8 properties
[2025-05-30 10:58:53] [INFO ] Flatten gal took : 233 ms
BEST_FIRST walk for 40004 steps (3855 resets) in 320 ms. (124 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (3776 resets) in 239 ms. (166 steps per ms) remains 8/8 properties
[2025-05-30 10:58:53] [INFO ] Flatten gal took : 134 ms
[2025-05-30 10:58:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9087655207436449169.gal : 43 ms
BEST_FIRST walk for 40004 steps (3858 resets) in 363 ms. (109 steps per ms) remains 8/8 properties
[2025-05-30 10:58:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3869812918925466826.prop : 2 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/ReachabilityCardinality9087655207436449169.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3869812918925466826.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
BEST_FIRST walk for 40002 steps (3881 resets) in 191 ms. (208 steps per ms) remains 8/8 properties
Loading property file /tmp/ReachabilityCardinality3869812918925466826.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 7
BEST_FIRST walk for 40002 steps (3786 resets) in 126 ms. (314 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
BEST_FIRST walk for 40002 steps (3711 resets) in 194 ms. (205 steps per ms) remains 8/8 properties
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :182 after 294
BEST_FIRST walk for 40004 steps (3898 resets) in 145 ms. (274 steps per ms) remains 8/8 properties
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :294 after 500
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :500 after 2080
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :2080 after 3870
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :3870 after 23898
SDD proceeding with computation,8 properties remain. new max is 4096
SDD size :23898 after 46277
Interrupted probabilistic random walk after 495542 steps, run timeout after 3001 ms. (steps per millisecond=165 ) properties seen :4 out of 8
Probabilistic random walk after 495542 steps, saw 196022 distinct states, run finished after 3006 ms. (steps per millisecond=164 ) properties seen :4
[2025-05-30 10:58:56] [INFO ] Invariant cache hit.
[2025-05-30 10:58:56] [INFO ] State equation strengthened by 85 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) 79/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 15/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 147/245 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem MAX0 is UNSAT
Problem MAX2 is UNSAT
Problem MAX3 is UNSAT
At refinement iteration 7 (OVERLAPS) 107/352 variables, 37/137 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 82/219 constraints. Problems are: Problem set: 3 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/352 variables, 0/219 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 7/359 variables, 4/223 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/359 variables, 3/226 constraints. Problems are: Problem set: 3 solved, 1 unsolved
[2025-05-30 10:58:57] [INFO ] Deduced a trap composed of 16 places in 117 ms of which 2 ms to minimize.
Problem MAX1 is UNSAT
After SMT solving in domain Real declared 359/359 variables, and 227 constraints, problems are : Problem set: 4 solved, 0 unsolved in 415 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 139/139 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 430ms 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:[7, 6, 6, 7]
Starting property specific reduction for DBSingleClientW-PT-d2m06-UpperBounds-00
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]
[2025-05-30 10:58:57] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 10000 steps (2277 resets) in 19 ms. (500 steps per ms)
BEST_FIRST walk for 10001 steps (916 resets) in 9 ms. (1000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2025-05-30 10:58:57] [INFO ] Invariant cache hit.
[2025-05-30 10:58:57] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 10:58:57] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2025-05-30 10:58:57] [INFO ] State equation strengthened by 85 read => feed constraints.
[2025-05-30 10:58:57] [INFO ] [Real]Added 85 Read/Feed constraints in 20 ms returned sat
[2025-05-30 10:58:57] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:58:57] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 10:58:57] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2025-05-30 10:58:57] [INFO ] [Nat]Added 85 Read/Feed constraints in 44 ms returned sat
[2025-05-30 10:58:57] [INFO ] Computed and/alt/rep : 54/136/54 causal constraints (skipped 165 transitions) in 29 ms.
[2025-05-30 10:58:57] [INFO ] Added : 15 causal constraints over 4 iterations in 188 ms. Result :sat
Minimization took 228 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 139 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 139/139 places, 220/220 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 136 transition count 217
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 136 transition count 217
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 133 transition count 213
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 133 transition count 213
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 133 transition count 212
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 16 place count 130 transition count 198
Iterating global reduction 1 with 3 rules applied. Total rules applied 19 place count 130 transition count 198
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 22 place count 130 transition count 195
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 25 place count 127 transition count 182
Iterating global reduction 2 with 3 rules applied. Total rules applied 28 place count 127 transition count 182
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 126 transition count 181
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 126 transition count 181
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 31 place count 126 transition count 180
Applied a total of 31 rules in 32 ms. Remains 126 /139 variables (removed 13) and now considering 180/220 (removed 40) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 126/139 places, 180/220 transitions.
// Phase 1: matrix 180 rows 126 cols
[2025-05-30 10:58:58] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 1000000 steps (229881 resets) in 1400 ms. (713 steps per ms)
BEST_FIRST walk for 1000000 steps (95763 resets) in 649 ms. (1538 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2025-05-30 10:59:00] [INFO ] Invariant cache hit.
[2025-05-30 10:59:00] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 10:59:00] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2025-05-30 10:59:00] [INFO ] State equation strengthened by 58 read => feed constraints.
[2025-05-30 10:59:00] [INFO ] [Real]Added 58 Read/Feed constraints in 14 ms returned sat
[2025-05-30 10:59:00] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:59:00] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 10:59:00] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2025-05-30 10:59:00] [INFO ] [Nat]Added 58 Read/Feed constraints in 18 ms returned sat
[2025-05-30 10:59:00] [INFO ] Computed and/alt/rep : 50/119/50 causal constraints (skipped 129 transitions) in 15 ms.
[2025-05-30 10:59:00] [INFO ] Added : 16 causal constraints over 4 iterations in 97 ms. Result :sat
Minimization took 103 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 13 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 14 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 13 ms. Remains 126 /126 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2025-05-30 10:59:00] [INFO ] Invariant cache hit.
[2025-05-30 10:59:01] [INFO ] Implicit Places using invariants in 137 ms returned []
[2025-05-30 10:59:01] [INFO ] Invariant cache hit.
[2025-05-30 10:59:01] [INFO ] State equation strengthened by 58 read => feed constraints.
[2025-05-30 10:59:01] [INFO ] Implicit Places using invariants and state equation in 415 ms returned []
Implicit Place search using SMT with State Equation took 559 ms to find 0 implicit places.
[2025-05-30 10:59:01] [INFO ] Redundant transitions in 7 ms returned []
Running 179 sub problems to find dead transitions.
[2025-05-30 10:59:01] [INFO ] Invariant cache hit.
[2025-05-30 10:59:01] [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 8093 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 14296 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 22761ms problems are : Problem set: 0 solved, 179 unsolved
Search for dead transitions found 0 dead transitions in 22764ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23350 ms. Remains : 126/126 places, 180/180 transitions.
[2025-05-30 10:59:24] [INFO ] Flatten gal took : 64 ms
RANDOM walk for 40000 steps (9186 resets) in 319 ms. (125 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3792 resets) in 151 ms. (263 steps per ms) remains 2/2 properties
[2025-05-30 10:59:24] [INFO ] Flatten gal took : 114 ms
[2025-05-30 10:59:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1379846774260949794.gal : 7 ms
[2025-05-30 10:59:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4137616312626767780.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/ReachabilityCardinality1379846774260949794.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4137616312626767780.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40003 steps (3803 resets) in 110 ms. (360 steps per ms) remains 2/2 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality4137616312626767780.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
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 466
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :466 after 1951
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1951 after 3822
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :3822 after 20784
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :20784 after 55319
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :55319 after 226201
Interrupted probabilistic random walk after 1637054 steps, run timeout after 3001 ms. (steps per millisecond=545 ) properties seen :1 out of 2
Probabilistic random walk after 1637054 steps, saw 685291 distinct states, run finished after 3001 ms. (steps per millisecond=545 ) properties seen :1
[2025-05-30 10:59:27] [INFO ] Invariant cache hit.
[2025-05-30 10:59: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) 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 123 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 136ms 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-d2m06-UpperBounds-00 in 30234 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m06-UpperBounds-04
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:[6]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[6]
// Phase 1: matrix 220 rows 139 cols
[2025-05-30 10:59:27] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[6]
RANDOM walk for 10000 steps (2288 resets) in 19 ms. (500 steps per ms)
BEST_FIRST walk for 10000 steps (949 resets) in 10 ms. (909 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[6]
[2025-05-30 10:59:27] [INFO ] Invariant cache hit.
[2025-05-30 10:59:27] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 10:59:27] [INFO ] [Real]Absence check using state equation in 101 ms returned sat
[2025-05-30 10:59:27] [INFO ] State equation strengthened by 85 read => feed constraints.
[2025-05-30 10:59:27] [INFO ] [Real]Added 85 Read/Feed constraints in 25 ms returned sat
[2025-05-30 10:59:27] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:59:27] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 10:59:28] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2025-05-30 10:59:28] [INFO ] [Nat]Added 85 Read/Feed constraints in 22 ms returned sat
[2025-05-30 10:59:28] [INFO ] Computed and/alt/rep : 54/136/54 causal constraints (skipped 165 transitions) in 22 ms.
[2025-05-30 10:59:28] [INFO ] Deduced a trap composed of 16 places in 174 ms of which 6 ms to minimize.
[2025-05-30 10:59:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 218 ms
[2025-05-30 10:59:28] [INFO ] Added : 15 causal constraints over 3 iterations in 361 ms. Result :sat
Minimization took 225 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[6]
Support contains 1 out of 139 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 139/139 places, 220/220 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 136 transition count 217
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 136 transition count 217
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 133 transition count 212
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 133 transition count 212
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 133 transition count 210
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 16 place count 131 transition count 201
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 131 transition count 201
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 21 place count 131 transition count 198
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 24 place count 128 transition count 178
Iterating global reduction 2 with 3 rules applied. Total rules applied 27 place count 128 transition count 178
Applied a total of 27 rules in 41 ms. Remains 128 /139 variables (removed 11) and now considering 178/220 (removed 42) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 128/139 places, 178/220 transitions.
// Phase 1: matrix 178 rows 128 cols
[2025-05-30 10:59:28] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[6]
RANDOM walk for 1000000 steps (229726 resets) in 1599 ms. (625 steps per ms)
BEST_FIRST walk for 1000001 steps (95760 resets) in 654 ms. (1526 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[6]
[2025-05-30 10:59:31] [INFO ] Invariant cache hit.
[2025-05-30 10:59:31] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 10:59:31] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2025-05-30 10:59:31] [INFO ] State equation strengthened by 51 read => feed constraints.
[2025-05-30 10:59:31] [INFO ] [Real]Added 51 Read/Feed constraints in 15 ms returned sat
[2025-05-30 10:59:31] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:59:31] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 10:59:31] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2025-05-30 10:59:31] [INFO ] [Nat]Added 51 Read/Feed constraints in 13 ms returned sat
[2025-05-30 10:59:31] [INFO ] Computed and/alt/rep : 51/126/51 causal constraints (skipped 126 transitions) in 15 ms.
[2025-05-30 10:59:31] [INFO ] Added : 18 causal constraints over 4 iterations in 110 ms. Result :sat
Minimization took 140 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[6]
Support contains 1 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 178/178 transitions.
Applied a total of 0 rules in 8 ms. Remains 128 /128 variables (removed 0) and now considering 178/178 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 128/128 places, 178/178 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 178/178 transitions.
Applied a total of 0 rules in 7 ms. Remains 128 /128 variables (removed 0) and now considering 178/178 (removed 0) transitions.
[2025-05-30 10:59:31] [INFO ] Invariant cache hit.
[2025-05-30 10:59:31] [INFO ] Implicit Places using invariants in 145 ms returned []
[2025-05-30 10:59:31] [INFO ] Invariant cache hit.
[2025-05-30 10:59:31] [INFO ] State equation strengthened by 51 read => feed constraints.
[2025-05-30 10:59:32] [INFO ] Implicit Places using invariants and state equation in 618 ms returned []
Implicit Place search using SMT with State Equation took 766 ms to find 0 implicit places.
[2025-05-30 10:59:32] [INFO ] Redundant transitions in 2 ms returned []
Running 177 sub problems to find dead transitions.
[2025-05-30 10:59:32] [INFO ] Invariant cache hit.
[2025-05-30 10:59:32] [INFO ] State equation strengthened by 51 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (OVERLAPS) 178/306 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 51/181 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (OVERLAPS) 0/306 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 181 constraints, problems are : Problem set: 0 solved, 177 unsolved in 8228 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 177 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (OVERLAPS) 178/306 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 51/181 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 177/358 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (OVERLAPS) 0/306 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 358 constraints, problems are : Problem set: 0 solved, 177 unsolved in 19301 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 0/0 constraints]
After SMT, in 27855ms problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 27858ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28641 ms. Remains : 128/128 places, 178/178 transitions.
[2025-05-30 11:00:00] [INFO ] Flatten gal took : 30 ms
[2025-05-30 11:00:00] [INFO ] Flatten gal took : 17 ms
RANDOM walk for 40000 steps (9142 resets) in 181 ms. (219 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (3758 resets) in 96 ms. (412 steps per ms) remains 2/2 properties
[2025-05-30 11:00:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7597243506735369242.gal : 61 ms
BEST_FIRST walk for 40002 steps (3867 resets) in 67 ms. (588 steps per ms) remains 2/2 properties
[2025-05-30 11:00:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16025440829832928597.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/ReachabilityCardinality7597243506735369242.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16025440829832928597.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/ReachabilityCardinality16025440829832928597.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 142
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :142 after 218
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :218 after 372
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :372 after 792
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :792 after 2552
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :2552 after 9998
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :9998 after 35627
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :35627 after 131036
Interrupted probabilistic random walk after 1948071 steps, run timeout after 3001 ms. (steps per millisecond=649 ) properties seen :1 out of 2
Probabilistic random walk after 1948071 steps, saw 798220 distinct states, run finished after 3001 ms. (steps per millisecond=649 ) properties seen :1
[2025-05-30 11:00:03] [INFO ] Invariant cache hit.
[2025-05-30 11:00:03] [INFO ] State equation strengthened by 51 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
At refinement iteration 3 (OVERLAPS) 138/141 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 76/217 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/217 variables, 55/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/217 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 15/232 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/232 variables, 11/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/232 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 74/306 variables, 57/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/306 variables, 42/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-30 11:00:03] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 2 ms to minimize.
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 306/306 variables, and 182 constraints, problems are : Problem set: 1 solved, 0 unsolved in 248 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 256ms 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:[6]
Ending property specific reduction for DBSingleClientW-PT-d2m06-UpperBounds-04 in 36022 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m06-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:[6]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[6]
// Phase 1: matrix 220 rows 139 cols
[2025-05-30 11:00:03] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[6]
RANDOM walk for 10000 steps (2354 resets) in 19 ms. (500 steps per ms)
BEST_FIRST walk for 10000 steps (943 resets) in 9 ms. (1000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[6]
[2025-05-30 11:00:03] [INFO ] Invariant cache hit.
[2025-05-30 11:00:03] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 5 ms returned sat
[2025-05-30 11:00:03] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2025-05-30 11:00:03] [INFO ] State equation strengthened by 85 read => feed constraints.
[2025-05-30 11:00:03] [INFO ] [Real]Added 85 Read/Feed constraints in 29 ms returned sat
[2025-05-30 11:00:03] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:00:04] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2025-05-30 11:00:04] [INFO ] [Nat]Absence check using state equation in 125 ms returned sat
[2025-05-30 11:00:04] [INFO ] [Nat]Added 85 Read/Feed constraints in 32 ms returned sat
[2025-05-30 11:00:04] [INFO ] Computed and/alt/rep : 54/136/54 causal constraints (skipped 165 transitions) in 29 ms.
[2025-05-30 11:00:04] [INFO ] Added : 11 causal constraints over 3 iterations in 131 ms. Result :sat
Minimization took 231 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[6]
Support contains 1 out of 139 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 139/139 places, 220/220 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 136 transition count 217
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 136 transition count 217
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 133 transition count 212
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 133 transition count 212
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 133 transition count 210
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 16 place count 131 transition count 197
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 131 transition count 197
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 130 transition count 196
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 130 transition count 196
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 129 transition count 195
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 129 transition count 195
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 23 place count 129 transition count 194
Applied a total of 23 rules in 35 ms. Remains 129 /139 variables (removed 10) and now considering 194/220 (removed 26) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 129/139 places, 194/220 transitions.
// Phase 1: matrix 194 rows 129 cols
[2025-05-30 11:00:04] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[6]
RANDOM walk for 1000000 steps (230090 resets) in 1779 ms. (561 steps per ms)
BEST_FIRST walk for 1000000 steps (95783 resets) in 714 ms. (1398 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[6]
[2025-05-30 11:00:07] [INFO ] Invariant cache hit.
[2025-05-30 11:00:07] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 11:00:07] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2025-05-30 11:00:07] [INFO ] State equation strengthened by 73 read => feed constraints.
[2025-05-30 11:00:07] [INFO ] [Real]Added 73 Read/Feed constraints in 26 ms returned sat
[2025-05-30 11:00:07] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:00:07] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2025-05-30 11:00:07] [INFO ] [Nat]Absence check using state equation in 100 ms returned sat
[2025-05-30 11:00:07] [INFO ] [Nat]Added 73 Read/Feed constraints in 35 ms returned sat
[2025-05-30 11:00:07] [INFO ] Computed and/alt/rep : 50/117/50 causal constraints (skipped 143 transitions) in 23 ms.
[2025-05-30 11:00:07] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 2 ms to minimize.
[2025-05-30 11:00:07] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 2 ms to minimize.
[2025-05-30 11:00:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 320 ms
[2025-05-30 11:00:08] [INFO ] Added : 17 causal constraints over 4 iterations in 481 ms. Result :sat
Minimization took 198 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[6]
Support contains 1 out of 129 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 194/194 transitions.
Applied a total of 0 rules in 8 ms. Remains 129 /129 variables (removed 0) and now considering 194/194 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 129/129 places, 194/194 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 194/194 transitions.
Applied a total of 0 rules in 7 ms. Remains 129 /129 variables (removed 0) and now considering 194/194 (removed 0) transitions.
[2025-05-30 11:00:08] [INFO ] Invariant cache hit.
[2025-05-30 11:00:08] [INFO ] Implicit Places using invariants in 193 ms returned []
[2025-05-30 11:00:08] [INFO ] Invariant cache hit.
[2025-05-30 11:00:08] [INFO ] State equation strengthened by 73 read => feed constraints.
[2025-05-30 11:00:09] [INFO ] Implicit Places using invariants and state equation in 536 ms returned []
Implicit Place search using SMT with State Equation took 736 ms to find 0 implicit places.
[2025-05-30 11:00:09] [INFO ] Redundant transitions in 3 ms returned []
Running 193 sub problems to find dead transitions.
[2025-05-30 11:00:09] [INFO ] Invariant cache hit.
[2025-05-30 11:00:09] [INFO ] State equation strengthened by 73 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (OVERLAPS) 194/323 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/323 variables, 73/204 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 7 (OVERLAPS) 0/323 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Real declared 323/323 variables, and 204 constraints, problems are : Problem set: 0 solved, 193 unsolved in 10670 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 129/129 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 193 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (OVERLAPS) 194/323 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/323 variables, 73/204 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 193/397 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/323 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 8 (OVERLAPS) 0/323 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Int declared 323/323 variables, and 397 constraints, problems are : Problem set: 0 solved, 193 unsolved in 21284 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 129/129 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 0/0 constraints]
After SMT, in 32473ms problems are : Problem set: 0 solved, 193 unsolved
Search for dead transitions found 0 dead transitions in 32476ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33236 ms. Remains : 129/129 places, 194/194 transitions.
[2025-05-30 11:00:41] [INFO ] Flatten gal took : 34 ms
[2025-05-30 11:00:41] [INFO ] Flatten gal took : 15 ms
[2025-05-30 11:00:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6731911259470409490.gal : 3 ms
[2025-05-30 11:00:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7187854708949889797.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/ReachabilityCardinality6731911259470409490.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7187854708949889797.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
RANDOM walk for 40000 steps (9126 resets) in 182 ms. (218 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality7187854708949889797.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
BEST_FIRST walk for 40001 steps (3929 resets) in 73 ms. (540 steps per ms) remains 2/2 properties
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 40002 steps (3835 resets) in 91 ms. (434 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 500
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :500 after 2126
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :2126 after 4468
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :4468 after 16694
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :16694 after 117184
Interrupted probabilistic random walk after 1809197 steps, run timeout after 3001 ms. (steps per millisecond=602 ) properties seen :1 out of 2
Probabilistic random walk after 1809197 steps, saw 742730 distinct states, run finished after 3001 ms. (steps per millisecond=602 ) properties seen :1
[2025-05-30 11:00:44] [INFO ] Invariant cache hit.
[2025-05-30 11:00:44] [INFO ] State equation strengthened by 73 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 314/323 variables, and 126 constraints, problems are : Problem set: 1 solved, 0 unsolved in 119 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 124/129 constraints, ReadFeed: 0/73 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 128ms 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:[6]
Ending property specific reduction for DBSingleClientW-PT-d2m06-UpperBounds-05 in 41201 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m06-UpperBounds-12
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 220 rows 139 cols
[2025-05-30 11:00:44] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 10000 steps (2337 resets) in 18 ms. (526 steps per ms)
BEST_FIRST walk for 10000 steps (950 resets) in 9 ms. (1000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2025-05-30 11:00:44] [INFO ] Invariant cache hit.
[2025-05-30 11:00:44] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 11:00:45] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2025-05-30 11:00:45] [INFO ] State equation strengthened by 85 read => feed constraints.
[2025-05-30 11:00:45] [INFO ] [Real]Added 85 Read/Feed constraints in 19 ms returned sat
[2025-05-30 11:00:45] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:00:45] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 11:00:45] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2025-05-30 11:00:45] [INFO ] [Nat]Added 85 Read/Feed constraints in 24 ms returned sat
[2025-05-30 11:00:45] [INFO ] Computed and/alt/rep : 54/136/54 causal constraints (skipped 165 transitions) in 20 ms.
[2025-05-30 11:00:45] [INFO ] Added : 12 causal constraints over 3 iterations in 99 ms. Result :sat
Minimization took 173 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 139 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 139/139 places, 220/220 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 136 transition count 217
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 136 transition count 217
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 133 transition count 213
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 133 transition count 213
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 133 transition count 212
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 131 transition count 206
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 131 transition count 206
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 20 place count 131 transition count 203
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 24 place count 127 transition count 182
Iterating global reduction 2 with 4 rules applied. Total rules applied 28 place count 127 transition count 182
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 126 transition count 181
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 126 transition count 181
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 31 place count 126 transition count 180
Applied a total of 31 rules in 22 ms. Remains 126 /139 variables (removed 13) and now considering 180/220 (removed 40) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 126/139 places, 180/220 transitions.
// Phase 1: matrix 180 rows 126 cols
[2025-05-30 11:00:45] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 1000000 steps (230044 resets) in 1392 ms. (717 steps per ms)
BEST_FIRST walk for 1000000 steps (95687 resets) in 645 ms. (1547 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2025-05-30 11:00:47] [INFO ] Invariant cache hit.
[2025-05-30 11:00:47] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2025-05-30 11:00:47] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2025-05-30 11:00:47] [INFO ] State equation strengthened by 58 read => feed constraints.
[2025-05-30 11:00:47] [INFO ] [Real]Added 58 Read/Feed constraints in 18 ms returned sat
[2025-05-30 11:00:47] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:00:47] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2025-05-30 11:00:47] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2025-05-30 11:00:47] [INFO ] [Nat]Added 58 Read/Feed constraints in 28 ms returned sat
[2025-05-30 11:00:48] [INFO ] Computed and/alt/rep : 50/119/50 causal constraints (skipped 129 transitions) in 17 ms.
[2025-05-30 11:00:48] [INFO ] Added : 28 causal constraints over 6 iterations in 159 ms. Result :sat
Minimization took 184 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 4 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 5 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 5 ms. Remains 126 /126 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2025-05-30 11:00:48] [INFO ] Invariant cache hit.
[2025-05-30 11:00:48] [INFO ] Implicit Places using invariants in 187 ms returned []
[2025-05-30 11:00:48] [INFO ] Invariant cache hit.
[2025-05-30 11:00:48] [INFO ] State equation strengthened by 58 read => feed constraints.
[2025-05-30 11:00:49] [INFO ] Implicit Places using invariants and state equation in 580 ms returned []
Implicit Place search using SMT with State Equation took 770 ms to find 0 implicit places.
[2025-05-30 11:00:49] [INFO ] Redundant transitions in 4 ms returned []
Running 179 sub problems to find dead transitions.
[2025-05-30 11:00:49] [INFO ] Invariant cache hit.
[2025-05-30 11:00:49] [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
All remaining problems are real, not stopping.
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 8752 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 19789 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 28825ms problems are : Problem set: 0 solved, 179 unsolved
Search for dead transitions found 0 dead transitions in 28827ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29614 ms. Remains : 126/126 places, 180/180 transitions.
RANDOM walk for 40000 steps (9156 resets) in 200 ms. (199 steps per ms) remains 2/2 properties
[2025-05-30 11:01:18] [INFO ] Flatten gal took : 51 ms
[2025-05-30 11:01:18] [INFO ] Flatten gal took : 19 ms
[2025-05-30 11:01:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9854036299512970529.gal : 4 ms
[2025-05-30 11:01:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6824801817963776487.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/ReachabilityCardinality9854036299512970529.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6824801817963776487.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
BEST_FIRST walk for 40003 steps (3680 resets) in 94 ms. (421 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (3816 resets) in 87 ms. (454 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality6824801817963776487.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
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 466
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :466 after 1951
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1951 after 3816
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :3816 after 20550
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :20550 after 52169
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :52169 after 227381
Interrupted probabilistic random walk after 2004172 steps, run timeout after 3001 ms. (steps per millisecond=667 ) properties seen :1 out of 2
Probabilistic random walk after 2004172 steps, saw 825570 distinct states, run finished after 3001 ms. (steps per millisecond=667 ) properties seen :1
[2025-05-30 11:01:21] [INFO ] Invariant cache hit.
[2025-05-30 11:01:21] [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 147 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 159ms 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-d2m06-UpperBounds-12 in 36485 ms.
[2025-05-30 11:01:21] [INFO ] Flatten gal took : 29 ms
[2025-05-30 11:01:21] [INFO ] Applying decomposition
[2025-05-30 11:01:21] [INFO ] Flatten gal took : 16 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/graph5438591277623356877.txt' '-o' '/tmp/graph5438591277623356877.bin' '-w' '/tmp/graph5438591277623356877.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5438591277623356877.bin' '-l' '-1' '-v' '-w' '/tmp/graph5438591277623356877.weights' '-q' '0' '-e' '0.001'
[2025-05-30 11:01:21] [INFO ] Decomposing Gal with order
[2025-05-30 11:01:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 11:01:22] [INFO ] Removed a total of 268 redundant transitions.
[2025-05-30 11:01:22] [INFO ] Flatten gal took : 253 ms
[2025-05-30 11:01:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 203 labels/synchronizations in 41 ms.
[2025-05-30 11:01:22] [INFO ] Time to serialize gal into /tmp/UpperBounds10812800565683022200.gal : 8 ms
[2025-05-30 11:01:22] [INFO ] Time to serialize properties into /tmp/UpperBounds12491170275773500540.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/UpperBounds10812800565683022200.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds12491170275773500540.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 ...285
Loading property file /tmp/UpperBounds12491170275773500540.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,3.31319e+06,6.814,137704,3059,1134,122078,13092,607,1.02647e+06,154,116887,0
Total reachable state count : 3313194

Verifying 4 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d2m06-UpperBounds-00 :0 <= i6.i1.u10.p230 <= 1
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-00 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-d2m06-UpperBounds-00,0,7.00423,137704,1,0,122078,13092,742,1.02647e+06,188,116887,2872
Min sum of variable value : 0
Maximum sum along a path : 3
Bounds property DBSingleClientW-PT-d2m06-UpperBounds-04 :0 <= i1.u6.l4143 <= 3
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-04 3 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-d2m06-UpperBounds-04,0,7.02632,137704,1,0,122078,13092,777,1.02647e+06,197,116887,3284
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d2m06-UpperBounds-05 :0 <= i5.u3.l2256 <= 1
FORMULA DBSingleClientW-PT-d2m06-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-d2m06-UpperBounds-05,0,7.04924,137704,1,0,122078,13092,799,1.02647e+06,197,116887,4587
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d2m06-UpperBounds-12 :0 <= i6.i1.u10.p156 <= 1
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-12 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-d2m06-UpperBounds-12,0,7.06026,137704,1,0,122078,13092,821,1.02647e+06,217,116887,4862
Total runtime 259012 ms.

BK_STOP 1748602889536

--------------------
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-d2m06"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool gold2024"
echo " Input is DBSingleClientW-PT-d2m06, 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 r069-smll-174854075800017"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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