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-174854075800008.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-d1m04, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r069-smll-174854075800008
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 832K
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K 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 3.8K 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 432K 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-d1m04-UpperBounds-00
FORMULA_NAME DBSingleClientW-PT-d1m04-UpperBounds-01
FORMULA_NAME DBSingleClientW-PT-d1m04-UpperBounds-02
FORMULA_NAME DBSingleClientW-PT-d1m04-UpperBounds-03
FORMULA_NAME DBSingleClientW-PT-d1m04-UpperBounds-04
FORMULA_NAME DBSingleClientW-PT-d1m04-UpperBounds-05
FORMULA_NAME DBSingleClientW-PT-d1m04-UpperBounds-06
FORMULA_NAME DBSingleClientW-PT-d1m04-UpperBounds-07
FORMULA_NAME DBSingleClientW-PT-d1m04-UpperBounds-08
FORMULA_NAME DBSingleClientW-PT-d1m04-UpperBounds-09
FORMULA_NAME DBSingleClientW-PT-d1m04-UpperBounds-10
FORMULA_NAME DBSingleClientW-PT-d1m04-UpperBounds-11
FORMULA_NAME DBSingleClientW-PT-d1m04-UpperBounds-12
FORMULA_NAME DBSingleClientW-PT-d1m04-UpperBounds-13
FORMULA_NAME DBSingleClientW-PT-d1m04-UpperBounds-14
FORMULA_NAME DBSingleClientW-PT-d1m04-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748601667222

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-d1m04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-30 10:41:09] [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:41:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 10:41:10] [INFO ] Load time of PNML (sax parser for PT used): 332 ms
[2025-05-30 10:41:10] [INFO ] Transformed 1440 places.
[2025-05-30 10:41:10] [INFO ] Transformed 672 transitions.
[2025-05-30 10:41:10] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 611 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 19 ms.
Deduced a syphon composed of 1093 places in 13 ms
Reduce places removed 1093 places and 0 transitions.
FORMULA DBSingleClientW-PT-d1m04-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m04-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m04-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m04-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m04-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m04-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m04-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m04-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 672 rows 347 cols
[2025-05-30 10:41:10] [INFO ] Computed 6 invariants in 95 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[7, 2, 857, 7, 4, 6, 857, 7]
RANDOM walk for 10000 steps (2312 resets) in 218 ms. (45 steps per ms)
BEST_FIRST walk for 80003 steps (7633 resets) in 444 ms. (179 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 1, 0, 0, 0, 0, 0, 1] Max Struct:[7, 2, 857, 7, 4, 6, 857, 7]
[2025-05-30 10:41:11] [INFO ] Invariant cache hit.
[2025-05-30 10:41:12] [INFO ] [Real]Absence check using 2 positive place invariants in 13 ms returned sat
[2025-05-30 10:41:12] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 15 ms returned sat
[2025-05-30 10:41:12] [INFO ] [Real]Absence check using state equation in 404 ms returned sat
[2025-05-30 10:41:12] [INFO ] State equation strengthened by 418 read => feed constraints.
[2025-05-30 10:41:12] [INFO ] [Real]Added 418 Read/Feed constraints in 122 ms returned sat
[2025-05-30 10:41:12] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:41:12] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2025-05-30 10:41:12] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 6 ms returned sat
[2025-05-30 10:41:13] [INFO ] [Nat]Absence check using state equation in 258 ms returned sat
[2025-05-30 10:41:13] [INFO ] [Nat]Added 418 Read/Feed constraints in 141 ms returned sat
[2025-05-30 10:41:13] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 181 ms.
[2025-05-30 10:41:13] [INFO ] Added : 11 causal constraints over 3 iterations in 467 ms. Result :sat
Minimization took 644 ms.
[2025-05-30 10:41:14] [INFO ] [Real]Absence check using 2 positive place invariants in 30 ms returned sat
[2025-05-30 10:41:14] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 5 ms returned sat
[2025-05-30 10:41:14] [INFO ] [Real]Absence check using state equation in 255 ms returned sat
[2025-05-30 10:41:15] [INFO ] [Real]Added 418 Read/Feed constraints in 166 ms returned sat
[2025-05-30 10:41:15] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:41:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 9 ms returned sat
[2025-05-30 10:41:15] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2025-05-30 10:41:15] [INFO ] [Nat]Absence check using state equation in 340 ms returned sat
[2025-05-30 10:41:15] [INFO ] [Nat]Added 418 Read/Feed constraints in 178 ms returned sat
[2025-05-30 10:41:16] [INFO ] Deduced a trap composed of 27 places in 540 ms of which 68 ms to minimize.
[2025-05-30 10:41:16] [INFO ] Deduced a trap composed of 31 places in 376 ms of which 7 ms to minimize.
[2025-05-30 10:41:17] [INFO ] Deduced a trap composed of 35 places in 425 ms of which 6 ms to minimize.
[2025-05-30 10:41:17] [INFO ] Deduced a trap composed of 38 places in 433 ms of which 19 ms to minimize.
[2025-05-30 10:41:18] [INFO ] Deduced a trap composed of 35 places in 310 ms of which 5 ms to minimize.
[2025-05-30 10:41:18] [INFO ] Deduced a trap composed of 45 places in 308 ms of which 6 ms to minimize.
[2025-05-30 10:41:19] [INFO ] Deduced a trap composed of 45 places in 278 ms of which 4 ms to minimize.
[2025-05-30 10:41:19] [INFO ] Deduced a trap composed of 42 places in 246 ms of which 4 ms to minimize.
[2025-05-30 10:41:20] [INFO ] Trap strengthening (SAT) tested/added 8/8 trap constraints in 4354 ms
[2025-05-30 10:41:20] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2025-05-30 10:41:20] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 6 ms returned sat
[2025-05-30 10:41:20] [INFO ] [Real]Absence check using state equation in 242 ms returned sat
[2025-05-30 10:41:20] [INFO ] [Real]Added 418 Read/Feed constraints in 127 ms returned sat
[2025-05-30 10:41:20] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:41:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 6 ms returned sat
[2025-05-30 10:41:20] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 6 ms returned sat
[2025-05-30 10:41:20] [INFO ] [Nat]Absence check using state equation in 228 ms returned sat
[2025-05-30 10:41:21] [INFO ] [Nat]Added 418 Read/Feed constraints in 125 ms returned sat
[2025-05-30 10:41:21] [INFO ] Deduced a trap composed of 99 places in 271 ms of which 4 ms to minimize.
[2025-05-30 10:41:21] [INFO ] Deduced a trap composed of 113 places in 297 ms of which 5 ms to minimize.
[2025-05-30 10:41:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 679 ms
[2025-05-30 10:41:21] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 103 ms.
[2025-05-30 10:41:22] [INFO ] Added : 4 causal constraints over 1 iterations in 291 ms. Result :sat
Minimization took 587 ms.
[2025-05-30 10:41:22] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2025-05-30 10:41:22] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 7 ms returned sat
[2025-05-30 10:41:22] [INFO ] [Real]Absence check using state equation in 246 ms returned sat
[2025-05-30 10:41:23] [INFO ] [Real]Added 418 Read/Feed constraints in 107 ms returned sat
[2025-05-30 10:41:23] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:41:23] [INFO ] [Nat]Absence check using 2 positive place invariants in 6 ms returned sat
[2025-05-30 10:41:23] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 6 ms returned sat
[2025-05-30 10:41:23] [INFO ] [Nat]Absence check using state equation in 233 ms returned sat
[2025-05-30 10:41:23] [INFO ] [Nat]Added 418 Read/Feed constraints in 114 ms returned sat
[2025-05-30 10:41:23] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 72 ms.
[2025-05-30 10:41:23] [INFO ] Added : 10 causal constraints over 2 iterations in 245 ms. Result :sat
Minimization took 683 ms.
[2025-05-30 10:41:24] [INFO ] [Real]Absence check using 2 positive place invariants in 8 ms returned sat
[2025-05-30 10:41:24] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2025-05-30 10:41:24] [INFO ] [Real]Absence check using state equation in 318 ms returned sat
[2025-05-30 10:41:25] [INFO ] [Real]Added 418 Read/Feed constraints in 107 ms returned sat
[2025-05-30 10:41:25] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:41:25] [INFO ] [Nat]Absence check using 2 positive place invariants in 6 ms returned sat
[2025-05-30 10:41:25] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 8 ms returned sat
[2025-05-30 10:41:25] [INFO ] [Nat]Absence check using state equation in 283 ms returned sat
[2025-05-30 10:41:25] [INFO ] [Nat]Added 418 Read/Feed constraints in 112 ms returned sat
[2025-05-30 10:41:25] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 97 ms.
[2025-05-30 10:41:25] [INFO ] Added : 6 causal constraints over 2 iterations in 271 ms. Result :sat
Minimization took 584 ms.
[2025-05-30 10:41:26] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2025-05-30 10:41:26] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 5 ms returned sat
[2025-05-30 10:41:26] [INFO ] [Real]Absence check using state equation in 207 ms returned sat
[2025-05-30 10:41:26] [INFO ] [Real]Added 418 Read/Feed constraints in 143 ms returned sat
[2025-05-30 10:41:26] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:41:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 6 ms returned sat
[2025-05-30 10:41:27] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2025-05-30 10:41:27] [INFO ] [Nat]Absence check using state equation in 267 ms returned sat
[2025-05-30 10:41:27] [INFO ] [Nat]Added 418 Read/Feed constraints in 124 ms returned sat
[2025-05-30 10:41:27] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 104 ms.
[2025-05-30 10:41:28] [INFO ] Deduced a trap composed of 30 places in 426 ms of which 6 ms to minimize.
[2025-05-30 10:41:28] [INFO ] Deduced a trap composed of 33 places in 350 ms of which 7 ms to minimize.
[2025-05-30 10:41:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 957 ms
[2025-05-30 10:41:28] [INFO ] Added : 5 causal constraints over 2 iterations in 1253 ms. Result :sat
Minimization took 545 ms.
[2025-05-30 10:41:29] [INFO ] [Real]Absence check using 2 positive place invariants in 8 ms returned sat
[2025-05-30 10:41:29] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2025-05-30 10:41:29] [INFO ] [Real]Absence check using state equation in 332 ms returned sat
[2025-05-30 10:41:29] [INFO ] [Real]Added 418 Read/Feed constraints in 199 ms returned sat
[2025-05-30 10:41:30] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:41:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 8 ms returned sat
[2025-05-30 10:41:30] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 8 ms returned sat
[2025-05-30 10:41:30] [INFO ] [Nat]Absence check using state equation in 353 ms returned sat
[2025-05-30 10:41:30] [INFO ] [Nat]Added 418 Read/Feed constraints in 277 ms returned sat
[2025-05-30 10:41:31] [INFO ] Deduced a trap composed of 103 places in 371 ms of which 5 ms to minimize.
[2025-05-30 10:41:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 447 ms
[2025-05-30 10:41:31] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 80 ms.
[2025-05-30 10:41:31] [INFO ] Deduced a trap composed of 26 places in 374 ms of which 6 ms to minimize.
[2025-05-30 10:41:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 646 ms
[2025-05-30 10:41:32] [INFO ] Added : 13 causal constraints over 3 iterations in 1049 ms. Result :sat
Minimization took 580 ms.
[2025-05-30 10:41:32] [INFO ] [Real]Absence check using 2 positive place invariants in 8 ms returned sat
[2025-05-30 10:41:32] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[0, 1, 0, 0, 0, 0, 0, 1] Max Struct:[7, 2, 857, 7, 4, 6, 857, 1]
FORMULA DBSingleClientW-PT-d1m04-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 1, 0, 0, 0, 0, 0] Max Struct:[7, 2, 857, 7, 4, 6, 857]
Support contains 7 out of 347 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 347/347 places, 672/672 transitions.
Graph (complete) has 1246 edges and 347 vertex of which 325 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.8 ms
Discarding 22 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 0 with 88 rules applied. Total rules applied 89 place count 325 transition count 584
Discarding 95 places :
Symmetric choice reduction at 1 with 95 rule applications. Total rules 184 place count 230 transition count 328
Iterating global reduction 1 with 95 rules applied. Total rules applied 279 place count 230 transition count 328
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 283 place count 230 transition count 324
Discarding 71 places :
Symmetric choice reduction at 2 with 71 rule applications. Total rules 354 place count 159 transition count 253
Iterating global reduction 2 with 71 rules applied. Total rules applied 425 place count 159 transition count 253
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 431 place count 159 transition count 247
Discarding 40 places :
Symmetric choice reduction at 3 with 40 rule applications. Total rules 471 place count 119 transition count 184
Iterating global reduction 3 with 40 rules applied. Total rules applied 511 place count 119 transition count 184
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 3 with 22 rules applied. Total rules applied 533 place count 119 transition count 162
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 544 place count 108 transition count 144
Iterating global reduction 4 with 11 rules applied. Total rules applied 555 place count 108 transition count 144
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 557 place count 108 transition count 142
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 564 place count 101 transition count 135
Iterating global reduction 5 with 7 rules applied. Total rules applied 571 place count 101 transition count 135
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 573 place count 101 transition count 133
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 578 place count 96 transition count 128
Iterating global reduction 6 with 5 rules applied. Total rules applied 583 place count 96 transition count 128
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 584 place count 96 transition count 127
Applied a total of 584 rules in 207 ms. Remains 96 /347 variables (removed 251) and now considering 127/672 (removed 545) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 230 ms. Remains : 96/347 places, 127/672 transitions.
// Phase 1: matrix 127 rows 96 cols
[2025-05-30 10:41:33] [INFO ] Computed 2 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 1, 0, 0, 0, 0, 0] Max Struct:[7, 2, 857, 7, 4, 6, 857]
RANDOM walk for 1000000 steps (229509 resets) in 1489 ms. (671 steps per ms)
BEST_FIRST walk for 7000005 steps (690393 resets) in 4591 ms. (1524 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 1, 1, 0, 1, 0, 0] Max Struct:[7, 2, 857, 7, 4, 6, 857]
[2025-05-30 10:41:39] [INFO ] Invariant cache hit.
[2025-05-30 10:41:39] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 10:41:39] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2025-05-30 10:41:39] [INFO ] State equation strengthened by 42 read => feed constraints.
[2025-05-30 10:41:39] [INFO ] [Real]Added 42 Read/Feed constraints in 13 ms returned sat
[2025-05-30 10:41:39] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:41:39] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 10:41:39] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2025-05-30 10:41:39] [INFO ] [Nat]Added 42 Read/Feed constraints in 16 ms returned sat
[2025-05-30 10:41:39] [INFO ] Computed and/alt/rep : 34/82/34 causal constraints (skipped 92 transitions) in 17 ms.
[2025-05-30 10:41:39] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 2 ms to minimize.
[2025-05-30 10:41:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 134 ms
[2025-05-30 10:41:39] [INFO ] Added : 18 causal constraints over 5 iterations in 278 ms. Result :sat
Minimization took 118 ms.
[2025-05-30 10:41:40] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 10:41:40] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2025-05-30 10:41:40] [INFO ] [Real]Added 42 Read/Feed constraints in 10 ms returned sat
[2025-05-30 10:41:40] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:41:40] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 10:41:40] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2025-05-30 10:41:40] [INFO ] [Nat]Added 42 Read/Feed constraints in 11 ms returned sat
[2025-05-30 10:41:40] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 2 ms to minimize.
[2025-05-30 10:41:40] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 2 ms to minimize.
[2025-05-30 10:41:40] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 2 ms to minimize.
[2025-05-30 10:41:40] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 2 ms to minimize.
[2025-05-30 10:41:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 427 ms
[2025-05-30 10:41:40] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 10:41:40] [INFO ] [Real]Absence check using state equation in 57 ms returned unsat
[2025-05-30 10:41:40] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 10:41:40] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2025-05-30 10:41:40] [INFO ] [Real]Added 42 Read/Feed constraints in 13 ms returned sat
[2025-05-30 10:41:40] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:41:41] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 10:41:41] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2025-05-30 10:41:41] [INFO ] [Nat]Added 42 Read/Feed constraints in 25 ms returned sat
[2025-05-30 10:41:41] [INFO ] Computed and/alt/rep : 34/82/34 causal constraints (skipped 92 transitions) in 18 ms.
[2025-05-30 10:41:41] [INFO ] Added : 14 causal constraints over 3 iterations in 90 ms. Result :sat
Minimization took 107 ms.
[2025-05-30 10:41:41] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 10:41:41] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2025-05-30 10:41:41] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:41:41] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 10:41:41] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2025-05-30 10:41:41] [INFO ] [Nat]Added 42 Read/Feed constraints in 15 ms returned sat
[2025-05-30 10:41:41] [INFO ] Computed and/alt/rep : 34/82/34 causal constraints (skipped 92 transitions) in 17 ms.
[2025-05-30 10:41:41] [INFO ] Added : 5 causal constraints over 1 iterations in 58 ms. Result :sat
Minimization took 117 ms.
[2025-05-30 10:41:41] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 10:41:41] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2025-05-30 10:41:41] [INFO ] [Real]Added 42 Read/Feed constraints in 15 ms returned sat
[2025-05-30 10:41:42] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:41:42] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 10:41:42] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2025-05-30 10:41:42] [INFO ] [Nat]Added 42 Read/Feed constraints in 14 ms returned sat
[2025-05-30 10:41:42] [INFO ] Computed and/alt/rep : 34/82/34 causal constraints (skipped 92 transitions) in 17 ms.
[2025-05-30 10:41:42] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 2 ms to minimize.
[2025-05-30 10:41:42] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 3 ms to minimize.
[2025-05-30 10:41:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 220 ms
[2025-05-30 10:41:42] [INFO ] Added : 4 causal constraints over 2 iterations in 297 ms. Result :sat
Minimization took 106 ms.
[2025-05-30 10:41:42] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 10:41:42] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2025-05-30 10:41:42] [INFO ] [Real]Added 42 Read/Feed constraints in 14 ms returned sat
[2025-05-30 10:41:42] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:41:42] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2025-05-30 10:41:42] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2025-05-30 10:41:42] [INFO ] [Nat]Added 42 Read/Feed constraints in 17 ms returned sat
[2025-05-30 10:41:42] [INFO ] Computed and/alt/rep : 34/82/34 causal constraints (skipped 92 transitions) in 16 ms.
[2025-05-30 10:41:42] [INFO ] Added : 13 causal constraints over 3 iterations in 88 ms. Result :sat
Minimization took 103 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 1, 1, 0, 1, 0, 0] Max Struct:[7, 1, 1, 7, 4, 6, 857]
FORMULA DBSingleClientW-PT-d1m04-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DBSingleClientW-PT-d1m04-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 1, 0, 0] Max Struct:[7, 7, 4, 6, 857]
Support contains 5 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 127/127 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 94 transition count 125
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 94 transition count 125
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 92 transition count 122
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 92 transition count 122
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 92 transition count 120
Applied a total of 10 rules in 23 ms. Remains 92 /96 variables (removed 4) and now considering 120/127 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 92/96 places, 120/127 transitions.
// Phase 1: matrix 120 rows 92 cols
[2025-05-30 10:41:43] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 1, 0, 0] Max Struct:[7, 7, 4, 6, 857]
RANDOM walk for 1000000 steps (229868 resets) in 1356 ms. (736 steps per ms)
BEST_FIRST walk for 5000001 steps (493430 resets) in 2760 ms. (1810 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 1, 0, 0] Max Struct:[7, 7, 4, 6, 857]
[2025-05-30 10:41:47] [INFO ] Invariant cache hit.
[2025-05-30 10:41:47] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2025-05-30 10:41:47] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2025-05-30 10:41:47] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-05-30 10:41:47] [INFO ] [Real]Added 39 Read/Feed constraints in 14 ms returned sat
[2025-05-30 10:41:47] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:41:47] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 10:41:47] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2025-05-30 10:41:47] [INFO ] [Nat]Added 39 Read/Feed constraints in 10 ms returned sat
[2025-05-30 10:41:47] [INFO ] Computed and/alt/rep : 33/74/33 causal constraints (skipped 86 transitions) in 12 ms.
[2025-05-30 10:41:47] [INFO ] Added : 10 causal constraints over 3 iterations in 67 ms. Result :sat
Minimization took 87 ms.
[2025-05-30 10:41:47] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 10:41:47] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2025-05-30 10:41:47] [INFO ] [Real]Added 39 Read/Feed constraints in 10 ms returned sat
[2025-05-30 10:41:47] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:41:48] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 10:41:48] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2025-05-30 10:41:48] [INFO ] [Nat]Added 39 Read/Feed constraints in 14 ms returned sat
[2025-05-30 10:41:48] [INFO ] Computed and/alt/rep : 33/74/33 causal constraints (skipped 86 transitions) in 9 ms.
[2025-05-30 10:41:48] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 3 ms to minimize.
[2025-05-30 10:41:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 104 ms
[2025-05-30 10:41:48] [INFO ] Added : 17 causal constraints over 4 iterations in 182 ms. Result :sat
Minimization took 68 ms.
[2025-05-30 10:41:48] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 10:41:48] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2025-05-30 10:41:48] [INFO ] [Real]Added 39 Read/Feed constraints in 10 ms returned sat
[2025-05-30 10:41:48] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:41:48] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 10:41:48] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2025-05-30 10:41:48] [INFO ] [Nat]Added 39 Read/Feed constraints in 12 ms returned sat
[2025-05-30 10:41:48] [INFO ] Computed and/alt/rep : 33/74/33 causal constraints (skipped 86 transitions) in 14 ms.
[2025-05-30 10:41:48] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 2 ms to minimize.
[2025-05-30 10:41:48] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 2 ms to minimize.
[2025-05-30 10:41:49] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 2 ms to minimize.
[2025-05-30 10:41:49] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 3 ms to minimize.
[2025-05-30 10:41:49] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 514 ms
[2025-05-30 10:41:49] [INFO ] Added : 12 causal constraints over 3 iterations in 610 ms. Result :sat
Minimization took 138 ms.
[2025-05-30 10:41:49] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 10:41:49] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2025-05-30 10:41:49] [INFO ] [Real]Added 39 Read/Feed constraints in 11 ms returned sat
[2025-05-30 10:41:49] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:41:49] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2025-05-30 10:41:49] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2025-05-30 10:41:49] [INFO ] [Nat]Added 39 Read/Feed constraints in 13 ms returned sat
[2025-05-30 10:41:49] [INFO ] Computed and/alt/rep : 33/74/33 causal constraints (skipped 86 transitions) in 14 ms.
[2025-05-30 10:41:49] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 2 ms to minimize.
[2025-05-30 10:41:49] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 2 ms to minimize.
[2025-05-30 10:41:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 240 ms
[2025-05-30 10:41:49] [INFO ] Added : 9 causal constraints over 3 iterations in 339 ms. Result :sat
Minimization took 103 ms.
[2025-05-30 10:41:50] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 10:41:50] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2025-05-30 10:41:50] [INFO ] [Real]Added 39 Read/Feed constraints in 17 ms returned sat
[2025-05-30 10:41:50] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:41:50] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 10:41:50] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2025-05-30 10:41:50] [INFO ] [Nat]Added 39 Read/Feed constraints in 17 ms returned sat
[2025-05-30 10:41:50] [INFO ] Computed and/alt/rep : 33/74/33 causal constraints (skipped 86 transitions) in 14 ms.
[2025-05-30 10:41:50] [INFO ] Added : 11 causal constraints over 3 iterations in 78 ms. Result :sat
Minimization took 92 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 1, 0, 0] Max Struct:[7, 7, 4, 6, 857]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 1, 0, 0] Max Struct:[7, 7, 4, 6, 857]
Support contains 5 out of 92 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 120/120 transitions.
Applied a total of 0 rules in 14 ms. Remains 92 /92 variables (removed 0) and now considering 120/120 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 92/92 places, 120/120 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 120/120 transitions.
Applied a total of 0 rules in 13 ms. Remains 92 /92 variables (removed 0) and now considering 120/120 (removed 0) transitions.
[2025-05-30 10:41:50] [INFO ] Invariant cache hit.
[2025-05-30 10:41:50] [INFO ] Implicit Places using invariants in 186 ms returned []
[2025-05-30 10:41:50] [INFO ] Invariant cache hit.
[2025-05-30 10:41:51] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-05-30 10:41:51] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 468 ms to find 0 implicit places.
[2025-05-30 10:41:51] [INFO ] Redundant transitions in 3 ms returned []
Running 119 sub problems to find dead transitions.
[2025-05-30 10:41:51] [INFO ] Invariant cache hit.
[2025-05-30 10:41:51] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/92 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (OVERLAPS) 120/212 variables, 92/94 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 39/133 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (OVERLAPS) 0/212 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 212/212 variables, and 133 constraints, problems are : Problem set: 0 solved, 119 unsolved in 4137 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 92/92 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/92 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (OVERLAPS) 120/212 variables, 92/94 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 39/133 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 119/252 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (OVERLAPS) 0/212 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 212/212 variables, and 252 constraints, problems are : Problem set: 0 solved, 119 unsolved in 7648 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 92/92 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 0/0 constraints]
After SMT, in 12219ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 12242ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12760 ms. Remains : 92/92 places, 120/120 transitions.
[2025-05-30 10:42:04] [INFO ] Flatten gal took : 165 ms
[2025-05-30 10:42:04] [INFO ] Flatten gal took : 34 ms
RANDOM walk for 40000 steps (9234 resets) in 2418 ms. (16 steps per ms) remains 10/10 properties
[2025-05-30 10:42:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16572001495347597994.gal : 11 ms
[2025-05-30 10:42:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10056439679548841076.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/ReachabilityCardinality16572001495347597994.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10056439679548841076.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 ...330
Loading property file /tmp/ReachabilityCardinality10056439679548841076.prop.
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :7 after 26
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :26 after 58
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :58 after 114
BEST_FIRST walk for 40002 steps (3905 resets) in 571 ms. (69 steps per ms) remains 10/10 properties
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :114 after 170
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :170 after 304
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :304 after 503
BEST_FIRST walk for 40002 steps (3916 resets) in 252 ms. (158 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (4020 resets) in 211 ms. (188 steps per ms) remains 10/10 properties
SDD proceeding with computation,10 properties remain. new max is 512
SDD size :503 after 1743
BEST_FIRST walk for 40000 steps (3995 resets) in 224 ms. (177 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (3851 resets) in 214 ms. (186 steps per ms) remains 10/10 properties
SDD proceeding with computation,10 properties remain. new max is 1024
SDD size :1743 after 3767
BEST_FIRST walk for 40003 steps (3988 resets) in 201 ms. (198 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (3988 resets) in 221 ms. (180 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (4031 resets) in 222 ms. (179 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (4012 resets) in 206 ms. (193 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (3975 resets) in 174 ms. (228 steps per ms) remains 10/10 properties
Invariant property MIN4 does not hold.
Invariant property MIN3 does not hold.
Invariant property MIN1 does not hold.
Invariant property MIN0 does not hold.
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :3767 after 9189
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,12791,0.542677,17900,2,3997,19,46106,12,0,496,36297,0
Total reachable state count : 12791

Verifying 10 reachability properties.
Reachability property MAX0 does not hold.
No reachable states exhibit your property : MAX0

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,0,0.544345,17900,1,0,19,46106,12,0,497,36297,0
Invariant property MIN0 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,3,0.544968,17900,2,94,19,46106,13,0,499,36297,0
Reachability property MAX1 does not hold.
No reachable states exhibit your property : MAX1

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX1,0,0.546166,17900,1,0,19,46106,13,0,499,36297,0
Invariant property MIN1 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN1,3,0.546533,17900,2,94,19,46106,14,0,501,36297,0
Reachability property MAX2 does not hold.
No reachable states exhibit your property : MAX2

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX2,0,0.547102,17900,1,0,19,46106,14,0,501,36297,0
Invariant property MIN2 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN2,0,0.547776,17900,1,0,19,46106,14,0,501,36297,0
Reachability property MAX3 does not hold.
No reachable states exhibit your property : MAX3

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX3,0,0.548295,17900,1,0,19,46106,14,0,501,36297,0
Invariant property MIN3 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN3,186,0.548692,17900,2,286,19,46106,15,0,503,36297,0
Reachability property MAX4 does not hold.
No reachable states exhibit your property : MAX4

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX4,0,0.549825,17900,1,0,19,46106,15,0,503,36297,0
Invariant property MIN4 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN4,6,0.550251,17900,2,94,19,46106,16,0,505,36297,0
Probably explored full state space saw : 12734 states, properties seen :4
Probabilistic random walk after 31300 steps, saw 12734 distinct states, run finished after 432 ms. (steps per millisecond=72 ) properties seen :4
Explored full state space saw : 12791 states, properties seen :0
Exhaustive walk after 31394 steps, saw 12791 distinct states, run finished after 390 ms. (steps per millisecond=80 ) properties seen :0
FORMULA DBSingleClientW-PT-d1m04-UpperBounds-10 1 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[0, 0, 0, 0] Max Struct:[7, 7, 6, 857]
Starting property specific reduction for DBSingleClientW-PT-d1m04-UpperBounds-01
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:42:05] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 10000 steps (2290 resets) in 17 ms. (555 steps per ms)
BEST_FIRST walk for 10001 steps (1010 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:42:05] [INFO ] Invariant cache hit.
[2025-05-30 10:42:06] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 10:42:06] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2025-05-30 10:42:06] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-05-30 10:42:06] [INFO ] [Real]Added 39 Read/Feed constraints in 14 ms returned sat
[2025-05-30 10:42:06] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:42:06] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 10:42:06] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2025-05-30 10:42:06] [INFO ] [Nat]Added 39 Read/Feed constraints in 15 ms returned sat
[2025-05-30 10:42:06] [INFO ] Computed and/alt/rep : 33/74/33 causal constraints (skipped 86 transitions) in 16 ms.
[2025-05-30 10:42:06] [INFO ] Added : 10 causal constraints over 3 iterations in 74 ms. Result :sat
Minimization took 77 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 92 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 120/120 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 90 transition count 118
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 90 transition count 118
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 88 transition count 116
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 88 transition count 116
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 88 transition count 115
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 87 transition count 111
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 87 transition count 111
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 86 transition count 110
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 86 transition count 110
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 85 transition count 109
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 85 transition count 109
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 16 place count 85 transition count 108
Applied a total of 16 rules in 36 ms. Remains 85 /92 variables (removed 7) and now considering 108/120 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 85/92 places, 108/120 transitions.
// Phase 1: matrix 108 rows 85 cols
[2025-05-30 10:42:06] [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 (230001 resets) in 1604 ms. (623 steps per ms)
BEST_FIRST walk for 1000001 steps (98951 resets) in 492 ms. (2028 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2025-05-30 10:42:08] [INFO ] Invariant cache hit.
[2025-05-30 10:42:08] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 10:42:08] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2025-05-30 10:42:08] [INFO ] State equation strengthened by 36 read => feed constraints.
[2025-05-30 10:42:08] [INFO ] [Real]Added 36 Read/Feed constraints in 7 ms returned sat
[2025-05-30 10:42:08] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:42:08] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2025-05-30 10:42:08] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2025-05-30 10:42:08] [INFO ] [Nat]Added 36 Read/Feed constraints in 7 ms returned sat
[2025-05-30 10:42:08] [INFO ] Computed and/alt/rep : 30/63/30 causal constraints (skipped 77 transitions) in 9 ms.
[2025-05-30 10:42:08] [INFO ] Added : 11 causal constraints over 3 iterations in 46 ms. Result :sat
Minimization took 54 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 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 108/108 transitions.
Applied a total of 0 rules in 5 ms. Remains 85 /85 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 85/85 places, 108/108 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 108/108 transitions.
Applied a total of 0 rules in 6 ms. Remains 85 /85 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2025-05-30 10:42:08] [INFO ] Invariant cache hit.
[2025-05-30 10:42:09] [INFO ] Implicit Places using invariants in 119 ms returned []
[2025-05-30 10:42:09] [INFO ] Invariant cache hit.
[2025-05-30 10:42:09] [INFO ] State equation strengthened by 36 read => feed constraints.
[2025-05-30 10:42:09] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 432 ms to find 0 implicit places.
[2025-05-30 10:42:09] [INFO ] Redundant transitions in 2 ms returned []
Running 107 sub problems to find dead transitions.
[2025-05-30 10:42:09] [INFO ] Invariant cache hit.
[2025-05-30 10:42:09] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (OVERLAPS) 1/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 108/193 variables, 85/87 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 36/123 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (OVERLAPS) 0/193 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 123 constraints, problems are : Problem set: 0 solved, 107 unsolved in 3885 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 85/85 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 107 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (OVERLAPS) 1/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 108/193 variables, 85/87 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 36/123 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 107/230 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (OVERLAPS) 0/193 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 230 constraints, problems are : Problem set: 0 solved, 107 unsolved in 6408 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 85/85 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 0/0 constraints]
After SMT, in 10509ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 10512ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10962 ms. Remains : 85/85 places, 108/108 transitions.
[2025-05-30 10:42:19] [INFO ] Flatten gal took : 25 ms
[2025-05-30 10:42:19] [INFO ] Flatten gal took : 15 ms
[2025-05-30 10:42:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18190772128814440144.gal : 4 ms
[2025-05-30 10:42:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6970979543565342623.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/ReachabilityCardinality18190772128814440144.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6970979543565342623.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
RANDOM walk for 40000 steps (9187 resets) in 134 ms. (296 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality6970979543565342623.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 26
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :26 after 58
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :58 after 114
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :114 after 170
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :170 after 280
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :280 after 639
BEST_FIRST walk for 40002 steps (3862 resets) in 241 ms. (165 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :639 after 1530
BEST_FIRST walk for 40003 steps (3981 resets) in 167 ms. (238 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1530 after 3535
Invariant property MIN0 does not hold.
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :9074 after 9345
Probably explored full state space saw : 9537 states, properties seen :1
Probabilistic random walk after 22850 steps, saw 9537 distinct states, run finished after 140 ms. (steps per millisecond=163 ) properties seen :1
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,9553,0.2693,11096,2,2824,17,25310,7,0,451,19708,0
Total reachable state count : 9553

Verifying 2 reachability properties.
Reachability property MAX0 does not hold.
No reachable states exhibit your property : MAX0

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,0,0.27257,11360,1,0,17,25310,7,0,452,19708,0
Invariant property MIN0 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,6,0.273501,11360,2,87,17,25310,8,0,454,19708,0
Explored full state space saw : 9553 states, properties seen :0
Exhaustive walk after 22866 steps, saw 9553 distinct states, run finished after 36 ms. (steps per millisecond=635 ) properties seen :0
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[7]
Ending property specific reduction for DBSingleClientW-PT-d1m04-UpperBounds-01 in 14331 ms.
Starting property specific reduction for DBSingleClientW-PT-d1m04-UpperBounds-06
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[7]
// Phase 1: matrix 120 rows 92 cols
[2025-05-30 10:42:20] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 10000 steps (2326 resets) in 21 ms. (454 steps per ms)
BEST_FIRST walk for 10001 steps (969 resets) in 12 ms. (769 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2025-05-30 10:42:20] [INFO ] Invariant cache hit.
[2025-05-30 10:42:20] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 10:42:20] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2025-05-30 10:42:20] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-05-30 10:42:20] [INFO ] [Real]Added 39 Read/Feed constraints in 12 ms returned sat
[2025-05-30 10:42:20] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:42:20] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 10:42:20] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2025-05-30 10:42:20] [INFO ] [Nat]Added 39 Read/Feed constraints in 14 ms returned sat
[2025-05-30 10:42:20] [INFO ] Computed and/alt/rep : 33/74/33 causal constraints (skipped 86 transitions) in 12 ms.
[2025-05-30 10:42:20] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 2 ms to minimize.
[2025-05-30 10:42:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 95 ms
[2025-05-30 10:42:20] [INFO ] Added : 17 causal constraints over 4 iterations in 182 ms. Result :sat
Minimization took 64 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 92 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 120/120 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 90 transition count 118
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 90 transition count 118
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 88 transition count 116
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 88 transition count 116
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 88 transition count 115
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 87 transition count 111
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 87 transition count 111
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 86 transition count 110
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 86 transition count 110
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 85 transition count 109
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 85 transition count 109
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 16 place count 85 transition count 108
Applied a total of 16 rules in 31 ms. Remains 85 /92 variables (removed 7) and now considering 108/120 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 85/92 places, 108/120 transitions.
// Phase 1: matrix 108 rows 85 cols
[2025-05-30 10:42:20] [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 (229696 resets) in 1103 ms. (905 steps per ms)
BEST_FIRST walk for 1000001 steps (99124 resets) in 467 ms. (2136 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2025-05-30 10:42:22] [INFO ] Invariant cache hit.
[2025-05-30 10:42:22] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 10:42:22] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2025-05-30 10:42:22] [INFO ] State equation strengthened by 36 read => feed constraints.
[2025-05-30 10:42:22] [INFO ] [Real]Added 36 Read/Feed constraints in 9 ms returned sat
[2025-05-30 10:42:22] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:42:22] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 10:42:22] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2025-05-30 10:42:22] [INFO ] [Nat]Added 36 Read/Feed constraints in 15 ms returned sat
[2025-05-30 10:42:22] [INFO ] Computed and/alt/rep : 30/63/30 causal constraints (skipped 77 transitions) in 11 ms.
[2025-05-30 10:42:22] [INFO ] Added : 11 causal constraints over 3 iterations in 61 ms. Result :sat
Minimization took 55 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 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 108/108 transitions.
Applied a total of 0 rules in 4 ms. Remains 85 /85 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 85/85 places, 108/108 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 108/108 transitions.
Applied a total of 0 rules in 4 ms. Remains 85 /85 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2025-05-30 10:42:22] [INFO ] Invariant cache hit.
[2025-05-30 10:42:22] [INFO ] Implicit Places using invariants in 83 ms returned []
[2025-05-30 10:42:22] [INFO ] Invariant cache hit.
[2025-05-30 10:42:22] [INFO ] State equation strengthened by 36 read => feed constraints.
[2025-05-30 10:42:23] [INFO ] Implicit Places using invariants and state equation in 313 ms returned []
Implicit Place search using SMT with State Equation took 407 ms to find 0 implicit places.
[2025-05-30 10:42:23] [INFO ] Redundant transitions in 3 ms returned []
Running 107 sub problems to find dead transitions.
[2025-05-30 10:42:23] [INFO ] Invariant cache hit.
[2025-05-30 10:42:23] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (OVERLAPS) 1/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 108/193 variables, 85/87 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 36/123 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (OVERLAPS) 0/193 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 123 constraints, problems are : Problem set: 0 solved, 107 unsolved in 4029 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 85/85 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 107 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (OVERLAPS) 1/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 108/193 variables, 85/87 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 36/123 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 107/230 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (OVERLAPS) 0/193 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 230 constraints, problems are : Problem set: 0 solved, 107 unsolved in 6161 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 85/85 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 0/0 constraints]
After SMT, in 10385ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 10392ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10814 ms. Remains : 85/85 places, 108/108 transitions.
[2025-05-30 10:42:33] [INFO ] Flatten gal took : 24 ms
[2025-05-30 10:42:33] [INFO ] Flatten gal took : 11 ms
RANDOM walk for 40000 steps (9222 resets) in 146 ms. (272 steps per ms) remains 2/2 properties
[2025-05-30 10:42:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4554728516633308564.gal : 10 ms
[2025-05-30 10:42:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15233851376167416066.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/ReachabilityCardinality4554728516633308564.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15233851376167416066.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/ReachabilityCardinality15233851376167416066.prop.
BEST_FIRST walk for 40002 steps (3894 resets) in 123 ms. (322 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 26
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :26 after 58
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :58 after 114
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :114 after 170
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :170 after 280
BEST_FIRST walk for 40003 steps (3864 resets) in 53 ms. (740 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :280 after 645
Probably explored full state space saw : 9537 states, properties seen :1
Probabilistic random walk after 22850 steps, saw 9537 distinct states, run finished after 45 ms. (steps per millisecond=507 ) properties seen :1
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :645 after 1563
Explored full state space saw : 9553 states, properties seen :0
Exhaustive walk after 22866 steps, saw 9553 distinct states, run finished after 20 ms. (steps per millisecond=1143 ) properties seen :0
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-d1m04-UpperBounds-06 in 13597 ms.
Starting property specific reduction for DBSingleClientW-PT-d1m04-UpperBounds-11
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 120 rows 92 cols
[2025-05-30 10:42:33] [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 (2301 resets) in 12 ms. (769 steps per ms)
BEST_FIRST walk for 10001 steps (1000 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[6]
[2025-05-30 10:42:33] [INFO ] Invariant cache hit.
[2025-05-30 10:42:33] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2025-05-30 10:42:33] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2025-05-30 10:42:33] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-05-30 10:42:33] [INFO ] [Real]Added 39 Read/Feed constraints in 7 ms returned sat
[2025-05-30 10:42:34] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:42:34] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 10:42:34] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2025-05-30 10:42:34] [INFO ] [Nat]Added 39 Read/Feed constraints in 9 ms returned sat
[2025-05-30 10:42:34] [INFO ] Computed and/alt/rep : 33/74/33 causal constraints (skipped 86 transitions) in 11 ms.
[2025-05-30 10:42:34] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 2 ms to minimize.
[2025-05-30 10:42:34] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2025-05-30 10:42:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 178 ms
[2025-05-30 10:42:34] [INFO ] Added : 9 causal constraints over 3 iterations in 247 ms. Result :sat
Minimization took 71 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 92 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 120/120 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 89 transition count 117
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 89 transition count 117
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 86 transition count 114
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 86 transition count 114
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 86 transition count 112
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 16 place count 84 transition count 102
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 84 transition count 102
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 83 transition count 101
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 83 transition count 101
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 82 transition count 100
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 82 transition count 100
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 82 transition count 99
Applied a total of 23 rules in 16 ms. Remains 82 /92 variables (removed 10) and now considering 99/120 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 82/92 places, 99/120 transitions.
// Phase 1: matrix 99 rows 82 cols
[2025-05-30 10:42:34] [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 (230100 resets) in 893 ms. (1118 steps per ms)
BEST_FIRST walk for 1000001 steps (98830 resets) in 444 ms. (2247 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[6]
[2025-05-30 10:42:35] [INFO ] Invariant cache hit.
[2025-05-30 10:42:35] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 10:42:35] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2025-05-30 10:42:35] [INFO ] State equation strengthened by 29 read => feed constraints.
[2025-05-30 10:42:35] [INFO ] [Real]Added 29 Read/Feed constraints in 7 ms returned sat
[2025-05-30 10:42:35] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:42:35] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 10:42:35] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2025-05-30 10:42:35] [INFO ] [Nat]Added 29 Read/Feed constraints in 11 ms returned sat
[2025-05-30 10:42:36] [INFO ] Computed and/alt/rep : 29/61/29 causal constraints (skipped 69 transitions) in 14 ms.
[2025-05-30 10:42:36] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 2 ms to minimize.
[2025-05-30 10:42:36] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 2 ms to minimize.
[2025-05-30 10:42:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 203 ms
[2025-05-30 10:42:36] [INFO ] Added : 9 causal constraints over 3 iterations in 279 ms. Result :sat
Minimization took 79 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 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 99/99 transitions.
Applied a total of 0 rules in 5 ms. Remains 82 /82 variables (removed 0) and now considering 99/99 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 82/82 places, 99/99 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 99/99 transitions.
Applied a total of 0 rules in 5 ms. Remains 82 /82 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2025-05-30 10:42:36] [INFO ] Invariant cache hit.
[2025-05-30 10:42:36] [INFO ] Implicit Places using invariants in 134 ms returned []
[2025-05-30 10:42:36] [INFO ] Invariant cache hit.
[2025-05-30 10:42:36] [INFO ] State equation strengthened by 29 read => feed constraints.
[2025-05-30 10:42:36] [INFO ] Implicit Places using invariants and state equation in 370 ms returned []
Implicit Place search using SMT with State Equation took 506 ms to find 0 implicit places.
[2025-05-30 10:42:36] [INFO ] Redundant transitions in 3 ms returned []
Running 98 sub problems to find dead transitions.
[2025-05-30 10:42:36] [INFO ] Invariant cache hit.
[2025-05-30 10:42:36] [INFO ] State equation strengthened by 29 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/82 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 99/181 variables, 82/84 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 29/113 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (OVERLAPS) 0/181 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 181/181 variables, and 113 constraints, problems are : Problem set: 0 solved, 98 unsolved in 3989 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 82/82 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/82 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 99/181 variables, 82/84 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 29/113 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 98/211 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (OVERLAPS) 0/181 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 181/181 variables, and 211 constraints, problems are : Problem set: 0 solved, 98 unsolved in 6272 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 82/82 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 0/0 constraints]
After SMT, in 10455ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 10458ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10979 ms. Remains : 82/82 places, 99/99 transitions.
[2025-05-30 10:42:47] [INFO ] Flatten gal took : 18 ms
[2025-05-30 10:42:47] [INFO ] Flatten gal took : 17 ms
[2025-05-30 10:42:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15179030422134930568.gal : 4 ms
[2025-05-30 10:42:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8299996313650206091.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/ReachabilityCardinality15179030422134930568.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8299996313650206091.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/ReachabilityCardinality8299996313650206091.prop.
RANDOM walk for 40000 steps (9158 resets) in 172 ms. (231 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 26
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :26 after 58
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :58 after 114
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :114 after 170
BEST_FIRST walk for 40003 steps (3961 resets) in 99 ms. (400 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :170 after 373
BEST_FIRST walk for 40004 steps (3879 resets) in 64 ms. (615 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :373 after 624
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :624 after 1828
Probably explored full state space saw : 8794 states, properties seen :1
Probabilistic random walk after 20601 steps, saw 8794 distinct states, run finished after 86 ms. (steps per millisecond=239 ) properties seen :1
Explored full state space saw : 8825 states, properties seen :0
Exhaustive walk after 20654 steps, saw 8825 distinct states, run finished after 29 ms. (steps per millisecond=712 ) properties seen :0
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-d1m04-UpperBounds-11 in 13796 ms.
Starting property specific reduction for DBSingleClientW-PT-d1m04-UpperBounds-13
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[857]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[857]
// Phase 1: matrix 120 rows 92 cols
[2025-05-30 10:42:47] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[857]
RANDOM walk for 10000 steps (2278 resets) in 20 ms. (476 steps per ms)
BEST_FIRST walk for 10001 steps (977 resets) in 10 ms. (909 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[857]
[2025-05-30 10:42:47] [INFO ] Invariant cache hit.
[2025-05-30 10:42:47] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 10:42:47] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2025-05-30 10:42:47] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-05-30 10:42:47] [INFO ] [Real]Added 39 Read/Feed constraints in 16 ms returned sat
[2025-05-30 10:42:47] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:42:47] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 10:42:47] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2025-05-30 10:42:47] [INFO ] [Nat]Added 39 Read/Feed constraints in 12 ms returned sat
[2025-05-30 10:42:47] [INFO ] Computed and/alt/rep : 33/74/33 causal constraints (skipped 86 transitions) in 11 ms.
[2025-05-30 10:42:48] [INFO ] Added : 11 causal constraints over 3 iterations in 49 ms. Result :sat
Minimization took 52 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[857]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[857]
Support contains 1 out of 92 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 120/120 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 89 transition count 117
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 89 transition count 117
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 87 transition count 115
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 87 transition count 115
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 87 transition count 114
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 86 transition count 110
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 86 transition count 110
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 85 transition count 109
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 85 transition count 109
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 84 transition count 108
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 84 transition count 108
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 18 place count 84 transition count 107
Applied a total of 18 rules in 17 ms. Remains 84 /92 variables (removed 8) and now considering 107/120 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 84/92 places, 107/120 transitions.
// Phase 1: matrix 107 rows 84 cols
[2025-05-30 10:42:48] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[857]
RANDOM walk for 1000000 steps (229593 resets) in 938 ms. (1064 steps per ms)
BEST_FIRST walk for 1000001 steps (98102 resets) in 469 ms. (2127 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[857]
[2025-05-30 10:42:49] [INFO ] Invariant cache hit.
[2025-05-30 10:42:49] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2025-05-30 10:42:49] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2025-05-30 10:42:49] [INFO ] State equation strengthened by 36 read => feed constraints.
[2025-05-30 10:42:49] [INFO ] [Real]Added 36 Read/Feed constraints in 13 ms returned sat
[2025-05-30 10:42:49] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:42:49] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 10:42:49] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2025-05-30 10:42:49] [INFO ] [Nat]Added 36 Read/Feed constraints in 16 ms returned sat
[2025-05-30 10:42:49] [INFO ] Computed and/alt/rep : 29/63/29 causal constraints (skipped 77 transitions) in 10 ms.
[2025-05-30 10:42:49] [INFO ] Added : 11 causal constraints over 3 iterations in 66 ms. Result :sat
Minimization took 63 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[857]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[857]
Support contains 1 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 107/107 transitions.
Applied a total of 0 rules in 3 ms. Remains 84 /84 variables (removed 0) and now considering 107/107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 84/84 places, 107/107 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 107/107 transitions.
Applied a total of 0 rules in 3 ms. Remains 84 /84 variables (removed 0) and now considering 107/107 (removed 0) transitions.
[2025-05-30 10:42:49] [INFO ] Invariant cache hit.
[2025-05-30 10:42:50] [INFO ] Implicit Places using invariants in 160 ms returned []
[2025-05-30 10:42:50] [INFO ] Invariant cache hit.
[2025-05-30 10:42:50] [INFO ] State equation strengthened by 36 read => feed constraints.
[2025-05-30 10:42:50] [INFO ] Implicit Places using invariants and state equation in 363 ms returned []
Implicit Place search using SMT with State Equation took 526 ms to find 0 implicit places.
[2025-05-30 10:42:50] [INFO ] Redundant transitions in 4 ms returned []
Running 106 sub problems to find dead transitions.
[2025-05-30 10:42:50] [INFO ] Invariant cache hit.
[2025-05-30 10:42:50] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 1/84 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 107/191 variables, 84/86 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 36/122 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (OVERLAPS) 0/191 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 122 constraints, problems are : Problem set: 0 solved, 106 unsolved in 4579 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 84/84 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 1/84 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 107/191 variables, 84/86 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 36/122 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 106/228 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (OVERLAPS) 0/191 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/191 variables, and 228 constraints, problems are : Problem set: 0 solved, 106 unsolved in 7280 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 84/84 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints]
After SMT, in 12056ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 12059ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12600 ms. Remains : 84/84 places, 107/107 transitions.
[2025-05-30 10:43:02] [INFO ] Flatten gal took : 27 ms
[2025-05-30 10:43:02] [INFO ] Flatten gal took : 19 ms
RANDOM walk for 40000 steps (9203 resets) in 161 ms. (246 steps per ms) remains 2/2 properties
[2025-05-30 10:43:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality428939232316209287.gal : 8 ms
[2025-05-30 10:43:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5572445511049648171.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/ReachabilityCardinality428939232316209287.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5572445511049648171.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
Loading property file /tmp/ReachabilityCardinality5572445511049648171.prop.
BEST_FIRST walk for 40003 steps (3978 resets) in 96 ms. (412 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 26
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :26 after 58
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :58 after 114
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :114 after 230
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :230 after 390
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :390 after 685
BEST_FIRST walk for 40003 steps (4092 resets) in 94 ms. (421 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :685 after 1706
Probably explored full state space saw : 9453 states, properties seen :1
Probabilistic random walk after 22754 steps, saw 9453 distinct states, run finished after 53 ms. (steps per millisecond=429 ) properties seen :1
Explored full state space saw : 9469 states, properties seen :0
Exhaustive walk after 22770 steps, saw 9469 distinct states, run finished after 18 ms. (steps per millisecond=1265 ) properties seen :0
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:[857]
Ending property specific reduction for DBSingleClientW-PT-d1m04-UpperBounds-13 in 15136 ms.
[2025-05-30 10:43:02] [INFO ] Flatten gal took : 9 ms
[2025-05-30 10:43:02] [INFO ] Applying decomposition
[2025-05-30 10:43:02] [INFO ] Flatten gal took : 11 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/graph6663923216085711238.txt' '-o' '/tmp/graph6663923216085711238.bin' '-w' '/tmp/graph6663923216085711238.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6663923216085711238.bin' '-l' '-1' '-v' '-w' '/tmp/graph6663923216085711238.weights' '-q' '0' '-e' '0.001'
[2025-05-30 10:43:02] [INFO ] Decomposing Gal with order
[2025-05-30 10:43:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 10:43:03] [INFO ] Removed a total of 120 redundant transitions.
[2025-05-30 10:43:03] [INFO ] Flatten gal took : 105 ms
[2025-05-30 10:43:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 92 labels/synchronizations in 29 ms.
[2025-05-30 10:43:03] [INFO ] Time to serialize gal into /tmp/UpperBounds13957450022673732126.gal : 8 ms
[2025-05-30 10:43:03] [INFO ] Time to serialize properties into /tmp/UpperBounds185350823224431780.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/UpperBounds13957450022673732126.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds185350823224431780.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 ...283
Loading property file /tmp/UpperBounds185350823224431780.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,12791,0.206199,7892,549,375,6451,2402,353,11769,124,10134,0
Total reachable state count : 12791

Verifying 4 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d1m04-UpperBounds-01 :0 <= i3.u7.p11 <= 1
FORMULA DBSingleClientW-PT-d1m04-UpperBounds-01 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-d1m04-UpperBounds-01,0,0.223095,7892,1,0,6451,2402,464,11769,149,10134,489
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d1m04-UpperBounds-06 :0 <= i3.u7.p28 <= 1
FORMULA DBSingleClientW-PT-d1m04-UpperBounds-06 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-d1m04-UpperBounds-06,0,0.223671,7892,1,0,6451,2402,480,11769,158,10134,515
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d1m04-UpperBounds-11 :0 <= i4.u16.l405 <= 1
FORMULA DBSingleClientW-PT-d1m04-UpperBounds-11 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-d1m04-UpperBounds-11,0,0.22537,7892,1,0,6451,2402,502,11769,158,10134,586
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d1m04-UpperBounds-13 :0 <= i4.u10.l317 <= 1
FORMULA DBSingleClientW-PT-d1m04-UpperBounds-13 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DBSingleClientW-PT-d1m04-UpperBounds-13,0,0.225886,7892,1,0,6451,2402,520,11769,167,10134,648
Total runtime 113664 ms.

BK_STOP 1748601783596

--------------------
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-d1m04"
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-d1m04, 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-174854075800008"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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