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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 792K
-rw-r--r-- 1 mcc users 8.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 45K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 37K 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-d1m06-UpperBounds-00
FORMULA_NAME DBSingleClientW-PT-d1m06-UpperBounds-01
FORMULA_NAME DBSingleClientW-PT-d1m06-UpperBounds-02
FORMULA_NAME DBSingleClientW-PT-d1m06-UpperBounds-03
FORMULA_NAME DBSingleClientW-PT-d1m06-UpperBounds-04
FORMULA_NAME DBSingleClientW-PT-d1m06-UpperBounds-05
FORMULA_NAME DBSingleClientW-PT-d1m06-UpperBounds-06
FORMULA_NAME DBSingleClientW-PT-d1m06-UpperBounds-07
FORMULA_NAME DBSingleClientW-PT-d1m06-UpperBounds-08
FORMULA_NAME DBSingleClientW-PT-d1m06-UpperBounds-09
FORMULA_NAME DBSingleClientW-PT-d1m06-UpperBounds-10
FORMULA_NAME DBSingleClientW-PT-d1m06-UpperBounds-11
FORMULA_NAME DBSingleClientW-PT-d1m06-UpperBounds-12
FORMULA_NAME DBSingleClientW-PT-d1m06-UpperBounds-13
FORMULA_NAME DBSingleClientW-PT-d1m06-UpperBounds-14
FORMULA_NAME DBSingleClientW-PT-d1m06-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748601796346

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-d1m06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-30 10:43:19] [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:43:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 10:43:20] [INFO ] Load time of PNML (sax parser for PT used): 333 ms
[2025-05-30 10:43:20] [INFO ] Transformed 1440 places.
[2025-05-30 10:43:20] [INFO ] Transformed 672 transitions.
[2025-05-30 10:43:20] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 587 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 18 ms.
Deduced a syphon composed of 1093 places in 12 ms
Reduce places removed 1093 places and 0 transitions.
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf]
// Phase 1: matrix 672 rows 347 cols
[2025-05-30 10:43:20] [INFO ] Computed 6 invariants in 122 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[6, 6, 3, 6]
RANDOM walk for 10000 steps (2289 resets) in 472 ms. (21 steps per ms)
BEST_FIRST walk for 40001 steps (3803 resets) in 403 ms. (99 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[6, 6, 3, 6]
[2025-05-30 10:43:21] [INFO ] Invariant cache hit.
[2025-05-30 10:43:21] [INFO ] [Real]Absence check using 2 positive place invariants in 17 ms returned sat
[2025-05-30 10:43:21] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 14 ms returned sat
[2025-05-30 10:43:22] [INFO ] [Real]Absence check using state equation in 537 ms returned sat
[2025-05-30 10:43:22] [INFO ] State equation strengthened by 418 read => feed constraints.
[2025-05-30 10:43:22] [INFO ] [Real]Added 418 Read/Feed constraints in 223 ms returned sat
[2025-05-30 10:43:22] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:43:23] [INFO ] [Nat]Absence check using 2 positive place invariants in 8 ms returned sat
[2025-05-30 10:43:23] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2025-05-30 10:43:23] [INFO ] [Nat]Absence check using state equation in 398 ms returned sat
[2025-05-30 10:43:23] [INFO ] [Nat]Added 418 Read/Feed constraints in 180 ms returned sat
[2025-05-30 10:43:24] [INFO ] Deduced a trap composed of 97 places in 477 ms of which 86 ms to minimize.
[2025-05-30 10:43:24] [INFO ] Deduced a trap composed of 104 places in 512 ms of which 8 ms to minimize.
[2025-05-30 10:43:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1187 ms
[2025-05-30 10:43:25] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 270 ms.
[2025-05-30 10:43:25] [INFO ] Added : 13 causal constraints over 3 iterations in 705 ms. Result :sat
Minimization took 664 ms.
[2025-05-30 10:43:26] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2025-05-30 10:43:26] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 7 ms returned sat
[2025-05-30 10:43:26] [INFO ] [Real]Absence check using state equation in 371 ms returned sat
[2025-05-30 10:43:27] [INFO ] [Real]Added 418 Read/Feed constraints in 225 ms returned sat
[2025-05-30 10:43:27] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:43:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 9 ms returned sat
[2025-05-30 10:43:27] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2025-05-30 10:43:27] [INFO ] [Nat]Absence check using state equation in 345 ms returned sat
[2025-05-30 10:43:27] [INFO ] [Nat]Added 418 Read/Feed constraints in 162 ms returned sat
[2025-05-30 10:43:27] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 100 ms.
[2025-05-30 10:43:28] [INFO ] Added : 2 causal constraints over 1 iterations in 266 ms. Result :sat
Minimization took 630 ms.
[2025-05-30 10:43:28] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2025-05-30 10:43:28] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 7 ms returned sat
[2025-05-30 10:43:29] [INFO ] [Real]Absence check using state equation in 262 ms returned sat
[2025-05-30 10:43:29] [INFO ] [Real]Added 418 Read/Feed constraints in 158 ms returned sat
[2025-05-30 10:43:29] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:43:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 7 ms returned sat
[2025-05-30 10:43:29] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 8 ms returned sat
[2025-05-30 10:43:29] [INFO ] [Nat]Absence check using state equation in 303 ms returned sat
[2025-05-30 10:43:29] [INFO ] [Nat]Added 418 Read/Feed constraints in 149 ms returned sat
[2025-05-30 10:43:29] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 87 ms.
[2025-05-30 10:43:30] [INFO ] Added : 2 causal constraints over 1 iterations in 233 ms. Result :sat
Minimization took 714 ms.
[2025-05-30 10:43:30] [INFO ] [Real]Absence check using 2 positive place invariants in 9 ms returned sat
[2025-05-30 10:43:30] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 8 ms returned sat
[2025-05-30 10:43:31] [INFO ] [Real]Absence check using state equation in 369 ms returned sat
[2025-05-30 10:43:31] [INFO ] [Real]Added 418 Read/Feed constraints in 158 ms returned sat
[2025-05-30 10:43:31] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:43:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 9 ms returned sat
[2025-05-30 10:43:31] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 8 ms returned sat
[2025-05-30 10:43:31] [INFO ] [Nat]Absence check using state equation in 373 ms returned sat
[2025-05-30 10:43:32] [INFO ] [Nat]Added 418 Read/Feed constraints in 188 ms returned sat
[2025-05-30 10:43:32] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 116 ms.
[2025-05-30 10:43:32] [INFO ] Added : 6 causal constraints over 2 iterations in 343 ms. Result :sat
Minimization took 691 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[6, 6, 3, 6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[6, 6, 3, 6]
Support contains 4 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 94 places :
Symmetric choice reduction at 1 with 94 rule applications. Total rules 183 place count 231 transition count 329
Iterating global reduction 1 with 94 rules applied. Total rules applied 277 place count 231 transition count 329
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 281 place count 231 transition count 325
Discarding 71 places :
Symmetric choice reduction at 2 with 71 rule applications. Total rules 352 place count 160 transition count 254
Iterating global reduction 2 with 71 rules applied. Total rules applied 423 place count 160 transition count 254
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 429 place count 160 transition count 248
Discarding 40 places :
Symmetric choice reduction at 3 with 40 rule applications. Total rules 469 place count 120 transition count 187
Iterating global reduction 3 with 40 rules applied. Total rules applied 509 place count 120 transition count 187
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 3 with 22 rules applied. Total rules applied 531 place count 120 transition count 165
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 541 place count 110 transition count 149
Iterating global reduction 4 with 10 rules applied. Total rules applied 551 place count 110 transition count 149
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 553 place count 110 transition count 147
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 559 place count 104 transition count 141
Iterating global reduction 5 with 6 rules applied. Total rules applied 565 place count 104 transition count 141
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 567 place count 104 transition count 139
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 572 place count 99 transition count 134
Iterating global reduction 6 with 5 rules applied. Total rules applied 577 place count 99 transition count 134
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 578 place count 98 transition count 132
Iterating global reduction 6 with 1 rules applied. Total rules applied 579 place count 98 transition count 132
Applied a total of 579 rules in 231 ms. Remains 98 /347 variables (removed 249) and now considering 132/672 (removed 540) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 255 ms. Remains : 98/347 places, 132/672 transitions.
// Phase 1: matrix 132 rows 98 cols
[2025-05-30 10:43:33] [INFO ] Computed 2 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[6, 6, 3, 6]
RANDOM walk for 1000000 steps (229165 resets) in 1467 ms. (681 steps per ms)
BEST_FIRST walk for 4000003 steps (392539 resets) in 2772 ms. (1442 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 1, 2, 0] Max Struct:[6, 6, 3, 6]
[2025-05-30 10:43:37] [INFO ] Invariant cache hit.
[2025-05-30 10:43:37] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2025-05-30 10:43:37] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2025-05-30 10:43:37] [INFO ] State equation strengthened by 42 read => feed constraints.
[2025-05-30 10:43:37] [INFO ] [Real]Added 42 Read/Feed constraints in 9 ms returned sat
[2025-05-30 10:43:37] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:43:37] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 10:43:37] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2025-05-30 10:43:37] [INFO ] [Nat]Added 42 Read/Feed constraints in 12 ms returned sat
[2025-05-30 10:43:38] [INFO ] Computed and/alt/rep : 35/88/35 causal constraints (skipped 96 transitions) in 12 ms.
[2025-05-30 10:43:38] [INFO ] Added : 13 causal constraints over 4 iterations in 71 ms. Result :sat
Minimization took 83 ms.
[2025-05-30 10:43:38] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 10:43:38] [INFO ] [Real]Absence check using state equation in 31 ms returned unsat
[2025-05-30 10:43:38] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 10:43:38] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2025-05-30 10:43:38] [INFO ] [Real]Added 42 Read/Feed constraints in 9 ms returned sat
[2025-05-30 10:43:38] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:43:38] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 10:43:38] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2025-05-30 10:43:38] [INFO ] [Nat]Added 42 Read/Feed constraints in 14 ms returned sat
[2025-05-30 10:43:38] [INFO ] Deduced a trap composed of 14 places in 133 ms of which 3 ms to minimize.
[2025-05-30 10:43:38] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 2 ms to minimize.
[2025-05-30 10:43:38] [INFO ] Deduced a trap composed of 14 places in 121 ms of which 3 ms to minimize.
[2025-05-30 10:43:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 396 ms
[2025-05-30 10:43:38] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2025-05-30 10:43:38] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2025-05-30 10:43:38] [INFO ] [Real]Added 42 Read/Feed constraints in 12 ms returned sat
[2025-05-30 10:43:39] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:43:39] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 10:43:39] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2025-05-30 10:43:39] [INFO ] [Nat]Added 42 Read/Feed constraints in 14 ms returned sat
[2025-05-30 10:43:39] [INFO ] Computed and/alt/rep : 35/88/35 causal constraints (skipped 96 transitions) in 21 ms.
[2025-05-30 10:43:39] [INFO ] Added : 6 causal constraints over 2 iterations in 80 ms. Result :sat
Minimization took 167 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 1, 2, 0] Max Struct:[6, 1, 2, 6]
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-09 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[6, 6]
Support contains 2 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 132/132 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 96 transition count 129
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 96 transition count 129
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 96 transition count 128
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 7 place count 94 transition count 125
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 94 transition count 125
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 92 transition count 123
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 92 transition count 123
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 14 place count 92 transition count 122
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 91 transition count 121
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 91 transition count 121
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 18 place count 91 transition count 119
Applied a total of 18 rules in 45 ms. Remains 91 /98 variables (removed 7) and now considering 119/132 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 91/98 places, 119/132 transitions.
// Phase 1: matrix 119 rows 91 cols
[2025-05-30 10:43:39] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[6, 6]
RANDOM walk for 1000000 steps (229599 resets) in 1241 ms. (805 steps per ms)
BEST_FIRST walk for 2000001 steps (196731 resets) in 1057 ms. (1890 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[6, 6]
[2025-05-30 10:43:41] [INFO ] Invariant cache hit.
[2025-05-30 10:43:41] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 10:43:41] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2025-05-30 10:43:41] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-05-30 10:43:41] [INFO ] [Real]Added 39 Read/Feed constraints in 10 ms returned sat
[2025-05-30 10:43:41] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:43:41] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 10:43:42] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2025-05-30 10:43:42] [INFO ] [Nat]Added 39 Read/Feed constraints in 16 ms returned sat
[2025-05-30 10:43:42] [INFO ] Computed and/alt/rep : 32/74/32 causal constraints (skipped 86 transitions) in 14 ms.
[2025-05-30 10:43:42] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 2 ms to minimize.
[2025-05-30 10:43:42] [INFO ] Deduced a trap composed of 16 places in 127 ms of which 2 ms to minimize.
[2025-05-30 10:43:42] [INFO ] Deduced a trap composed of 12 places in 113 ms of which 2 ms to minimize.
[2025-05-30 10:43:42] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 2 ms to minimize.
[2025-05-30 10:43:42] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 552 ms
[2025-05-30 10:43:42] [INFO ] Added : 23 causal constraints over 7 iterations in 722 ms. Result :sat
Minimization took 117 ms.
[2025-05-30 10:43:42] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 10:43:43] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2025-05-30 10:43:43] [INFO ] [Real]Added 39 Read/Feed constraints in 9 ms returned sat
[2025-05-30 10:43:43] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:43:43] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 10:43:43] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2025-05-30 10:43:43] [INFO ] [Nat]Added 39 Read/Feed constraints in 16 ms returned sat
[2025-05-30 10:43:43] [INFO ] Computed and/alt/rep : 32/74/32 causal constraints (skipped 86 transitions) in 14 ms.
[2025-05-30 10:43:43] [INFO ] Added : 5 causal constraints over 1 iterations in 50 ms. Result :sat
Minimization took 81 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[6, 6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[6, 6]
Support contains 2 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 119/119 transitions.
Applied a total of 0 rules in 13 ms. Remains 91 /91 variables (removed 0) and now considering 119/119 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 91/91 places, 119/119 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 119/119 transitions.
Applied a total of 0 rules in 13 ms. Remains 91 /91 variables (removed 0) and now considering 119/119 (removed 0) transitions.
[2025-05-30 10:43:43] [INFO ] Invariant cache hit.
[2025-05-30 10:43:43] [INFO ] Implicit Places using invariants in 114 ms returned []
[2025-05-30 10:43:43] [INFO ] Invariant cache hit.
[2025-05-30 10:43:43] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-05-30 10:43:43] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 412 ms to find 0 implicit places.
[2025-05-30 10:43:43] [INFO ] Redundant transitions in 3 ms returned []
Running 118 sub problems to find dead transitions.
[2025-05-30 10:43:43] [INFO ] Invariant cache hit.
[2025-05-30 10:43:43] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (OVERLAPS) 119/210 variables, 91/93 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 39/132 constraints. Problems are: Problem set: 0 solved, 118 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (OVERLAPS) 0/210 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 132 constraints, problems are : Problem set: 0 solved, 118 unsolved in 5007 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 91/91 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 118 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (OVERLAPS) 119/210 variables, 91/93 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 39/132 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 118/250 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 8 (OVERLAPS) 0/210 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 250 constraints, problems are : Problem set: 0 solved, 118 unsolved in 7877 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 91/91 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 0/0 constraints]
After SMT, in 13260ms problems are : Problem set: 0 solved, 118 unsolved
Search for dead transitions found 0 dead transitions in 13273ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13725 ms. Remains : 91/91 places, 119/119 transitions.
RANDOM walk for 40000 steps (9278 resets) in 1400 ms. (28 steps per ms) remains 4/4 properties
[2025-05-30 10:43:57] [INFO ] Flatten gal took : 147 ms
BEST_FIRST walk for 40002 steps (3916 resets) in 826 ms. (48 steps per ms) remains 4/4 properties
[2025-05-30 10:43:57] [INFO ] Flatten gal took : 90 ms
[2025-05-30 10:43:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1188098566708925196.gal : 12 ms
[2025-05-30 10:43:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14459334397737835453.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/ReachabilityCardinality1188098566708925196.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14459334397737835453.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/ReachabilityCardinality14459334397737835453.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :7 after 26
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :26 after 58
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :58 after 120
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :120 after 224
BEST_FIRST walk for 40004 steps (3873 resets) in 826 ms. (48 steps per ms) remains 4/4 properties
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :224 after 390
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :390 after 1000
BEST_FIRST walk for 40001 steps (3982 resets) in 381 ms. (104 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (4021 resets) in 218 ms. (182 steps per ms) remains 4/4 properties
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :1000 after 2227
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :2227 after 4232
Invariant property MIN1 does not hold.
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :4232 after 24676
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :24676 after 36597
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :36597 after 67534
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :67534 after 190129
Interrupted probabilistic random walk after 477123 steps, run timeout after 3001 ms. (steps per millisecond=158 ) properties seen :2 out of 4
Probabilistic random walk after 477123 steps, saw 190712 distinct states, run finished after 3006 ms. (steps per millisecond=158 ) properties seen :2
[2025-05-30 10:44:01] [INFO ] Invariant cache hit.
[2025-05-30 10:44:01] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 57/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 7/66 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 88/154 variables, 66/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 7 (OVERLAPS) 49/203 variables, 21/89 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 36/125 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 0/125 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 7/210 variables, 4/129 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/210 variables, 3/132 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Invariant property MIN0 does not hold.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :190129 after 388403
[2025-05-30 10:44:01] [INFO ] Deduced a trap composed of 12 places in 107 ms of which 4 ms to minimize.
Problem MAX1 is UNSAT
After SMT solving in domain Real declared 210/210 variables, and 133 constraints, problems are : Problem set: 2 solved, 0 unsolved in 314 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 91/91 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 324ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0, 0] Max Struct:[6, 6]
Starting property specific reduction for DBSingleClientW-PT-d1m06-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:[6]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[6]
[2025-05-30 10:44:01] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[6]
RANDOM walk for 10000 steps (2304 resets) in 12 ms. (769 steps per ms)
BEST_FIRST walk for 10000 steps (1009 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:44:01] [INFO ] Invariant cache hit.
[2025-05-30 10:44:01] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 10:44:01] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2025-05-30 10:44:01] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-05-30 10:44:01] [INFO ] [Real]Added 39 Read/Feed constraints in 11 ms returned sat
[2025-05-30 10:44:01] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:44:01] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 10:44:01] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2025-05-30 10:44:01] [INFO ] [Nat]Added 39 Read/Feed constraints in 13 ms returned sat
[2025-05-30 10:44:01] [INFO ] Computed and/alt/rep : 32/74/32 causal constraints (skipped 86 transitions) in 20 ms.
[2025-05-30 10:44:02] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 2 ms to minimize.
[2025-05-30 10:44:02] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 2 ms to minimize.
[2025-05-30 10:44:02] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2025-05-30 10:44:02] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 2 ms to minimize.
[2025-05-30 10:44:02] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 299 ms
[2025-05-30 10:44:02] [INFO ] Added : 23 causal constraints over 7 iterations in 420 ms. Result :sat
Minimization took 85 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 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 119/119 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 90 transition count 118
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 90 transition count 118
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 89 transition count 117
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 89 transition count 117
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 88 transition count 113
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 88 transition count 113
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 87 transition count 112
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 87 transition count 112
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 86 transition count 111
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 86 transition count 111
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 86 transition count 110
Applied a total of 11 rules in 32 ms. Remains 86 /91 variables (removed 5) and now considering 110/119 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 86/91 places, 110/119 transitions.
// Phase 1: matrix 110 rows 86 cols
[2025-05-30 10:44:02] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[6]
RANDOM walk for 1000000 steps (229974 resets) in 1483 ms. (673 steps per ms)
BEST_FIRST walk for 1000001 steps (98509 resets) in 484 ms. (2061 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[6]
[2025-05-30 10:44:04] [INFO ] Invariant cache hit.
[2025-05-30 10:44:04] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 10:44:04] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2025-05-30 10:44:04] [INFO ] State equation strengthened by 37 read => feed constraints.
[2025-05-30 10:44:04] [INFO ] [Real]Added 37 Read/Feed constraints in 8 ms returned sat
[2025-05-30 10:44:04] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:44:04] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2025-05-30 10:44:04] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2025-05-30 10:44:04] [INFO ] [Nat]Added 37 Read/Feed constraints in 10 ms returned sat
[2025-05-30 10:44:04] [INFO ] Computed and/alt/rep : 30/65/30 causal constraints (skipped 79 transitions) in 9 ms.
[2025-05-30 10:44:04] [INFO ] Added : 12 causal constraints over 3 iterations in 45 ms. Result :sat
Minimization took 52 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 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 110/110 transitions.
Applied a total of 0 rules in 9 ms. Remains 86 /86 variables (removed 0) and now considering 110/110 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 86/86 places, 110/110 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 110/110 transitions.
Applied a total of 0 rules in 5 ms. Remains 86 /86 variables (removed 0) and now considering 110/110 (removed 0) transitions.
[2025-05-30 10:44:04] [INFO ] Invariant cache hit.
[2025-05-30 10:44:04] [INFO ] Implicit Places using invariants in 97 ms returned []
[2025-05-30 10:44:04] [INFO ] Invariant cache hit.
[2025-05-30 10:44:04] [INFO ] State equation strengthened by 37 read => feed constraints.
[2025-05-30 10:44:05] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
[2025-05-30 10:44:05] [INFO ] Redundant transitions in 3 ms returned []
Running 109 sub problems to find dead transitions.
[2025-05-30 10:44:05] [INFO ] Invariant cache hit.
[2025-05-30 10:44:05] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 110/196 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 37/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (OVERLAPS) 0/196 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 125 constraints, problems are : Problem set: 0 solved, 109 unsolved in 4084 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 86/86 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 110/196 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 37/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 109/234 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (OVERLAPS) 0/196 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 234 constraints, problems are : Problem set: 0 solved, 109 unsolved in 5712 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 86/86 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints]
After SMT, in 9969ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 9972ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10296 ms. Remains : 86/86 places, 110/110 transitions.
[2025-05-30 10:44:15] [INFO ] Flatten gal took : 22 ms
[2025-05-30 10:44:15] [INFO ] Flatten gal took : 36 ms
RANDOM walk for 40000 steps (9189 resets) in 135 ms. (294 steps per ms) remains 2/2 properties
[2025-05-30 10:44:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8823724201738701257.gal : 5 ms
[2025-05-30 10:44:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12793474936322237268.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/ReachabilityCardinality8823724201738701257.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12793474936322237268.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40000 steps (3905 resets) in 82 ms. (481 steps per ms) remains 2/2 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality12793474936322237268.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 120
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :120 after 224
BEST_FIRST walk for 40000 steps (4050 resets) in 106 ms. (373 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :224 after 390
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :390 after 1000
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1000 after 2227
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :2227 after 4922
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :4922 after 14962
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :14962 after 84209
Invariant property MIN0 does not hold.
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :84209 after 149802
Probably explored full state space saw : 509827 states, properties seen :1
Probabilistic random walk after 1287162 steps, saw 509827 distinct states, run finished after 1692 ms. (steps per millisecond=760 ) properties seen :1
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :149802 after 240124
Explored full state space saw : 511611 states, properties seen :0
Exhaustive walk after 1291375 steps, saw 511611 distinct states, run finished after 1384 ms. (steps per millisecond=933 ) 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-d1m06-UpperBounds-06 in 16712 ms.
Starting property specific reduction for DBSingleClientW-PT-d1m06-UpperBounds-15
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[6]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[6]
// Phase 1: matrix 119 rows 91 cols
[2025-05-30 10:44:18] [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 (2295 resets) in 14 ms. (666 steps per ms)
BEST_FIRST walk for 10000 steps (989 resets) in 8 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[6]
[2025-05-30 10:44:18] [INFO ] Invariant cache hit.
[2025-05-30 10:44:18] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 10:44:18] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2025-05-30 10:44:18] [INFO ] State equation strengthened by 39 read => feed constraints.
[2025-05-30 10:44:18] [INFO ] [Real]Added 39 Read/Feed constraints in 7 ms returned sat
[2025-05-30 10:44:18] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:44:18] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 10:44:18] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2025-05-30 10:44:18] [INFO ] [Nat]Added 39 Read/Feed constraints in 7 ms returned sat
[2025-05-30 10:44:18] [INFO ] Computed and/alt/rep : 32/74/32 causal constraints (skipped 86 transitions) in 12 ms.
[2025-05-30 10:44:18] [INFO ] Added : 5 causal constraints over 1 iterations in 35 ms. Result :sat
Minimization took 80 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 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 119/119 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 90 transition count 118
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 90 transition count 118
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 89 transition count 117
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 89 transition count 117
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 88 transition count 115
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 88 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 7 place count 88 transition count 114
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 87 transition count 108
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 87 transition count 108
Applied a total of 9 rules in 14 ms. Remains 87 /91 variables (removed 4) and now considering 108/119 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 87/91 places, 108/119 transitions.
// Phase 1: matrix 108 rows 87 cols
[2025-05-30 10:44:18] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[6]
RANDOM walk for 1000000 steps (229897 resets) in 1247 ms. (801 steps per ms)
BEST_FIRST walk for 1000001 steps (98830 resets) in 489 ms. (2040 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[6]
[2025-05-30 10:44:20] [INFO ] Invariant cache hit.
[2025-05-30 10:44:20] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 10:44:20] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2025-05-30 10:44:20] [INFO ] State equation strengthened by 31 read => feed constraints.
[2025-05-30 10:44:20] [INFO ] [Real]Added 31 Read/Feed constraints in 6 ms returned sat
[2025-05-30 10:44:20] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:44:20] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 10:44:20] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2025-05-30 10:44:20] [INFO ] [Nat]Added 31 Read/Feed constraints in 7 ms returned sat
[2025-05-30 10:44:20] [INFO ] Computed and/alt/rep : 31/70/31 causal constraints (skipped 76 transitions) in 8 ms.
[2025-05-30 10:44:20] [INFO ] Added : 6 causal constraints over 2 iterations in 37 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 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 108/108 transitions.
Applied a total of 0 rules in 5 ms. Remains 87 /87 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 87/87 places, 108/108 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 108/108 transitions.
Applied a total of 0 rules in 4 ms. Remains 87 /87 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2025-05-30 10:44:20] [INFO ] Invariant cache hit.
[2025-05-30 10:44:20] [INFO ] Implicit Places using invariants in 91 ms returned []
[2025-05-30 10:44:20] [INFO ] Invariant cache hit.
[2025-05-30 10:44:20] [INFO ] State equation strengthened by 31 read => feed constraints.
[2025-05-30 10:44:21] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
[2025-05-30 10:44:21] [INFO ] Redundant transitions in 2 ms returned []
Running 107 sub problems to find dead transitions.
[2025-05-30 10:44:21] [INFO ] Invariant cache hit.
[2025-05-30 10:44:21] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (OVERLAPS) 1/87 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 108/195 variables, 87/89 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 31/120 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (OVERLAPS) 0/195 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 120 constraints, problems are : Problem set: 0 solved, 107 unsolved in 3022 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 31/31 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/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (OVERLAPS) 1/87 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 108/195 variables, 87/89 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 31/120 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 107/227 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (OVERLAPS) 0/195 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 227 constraints, problems are : Problem set: 0 solved, 107 unsolved in 6754 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 0/0 constraints]
After SMT, in 9914ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 9918ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10230 ms. Remains : 87/87 places, 108/108 transitions.
RANDOM walk for 40000 steps (9259 resets) in 71 ms. (555 steps per ms) remains 2/2 properties
[2025-05-30 10:44:31] [INFO ] Flatten gal took : 23 ms
[2025-05-30 10:44:31] [INFO ] Flatten gal took : 15 ms
[2025-05-30 10:44:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13553930008289356884.gal : 6 ms
[2025-05-30 10:44:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6537750407646077000.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/ReachabilityCardinality13553930008289356884.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6537750407646077000.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/ReachabilityCardinality6537750407646077000.prop.
BEST_FIRST walk for 40003 steps (3874 resets) in 109 ms. (363 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 120
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :120 after 224
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :224 after 400
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :400 after 1000
BEST_FIRST walk for 40003 steps (3929 resets) in 156 ms. (254 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1000 after 2322
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :2322 after 5815
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :5815 after 26731
Invariant property MIN0 does not hold.
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :26731 after 82868
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :82868 after 111668
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :111668 after 202404
Probably explored full state space saw : 783441 states, properties seen :1
Probabilistic random walk after 2032077 steps, saw 783441 distinct states, run finished after 2387 ms. (steps per millisecond=851 ) properties seen :1
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :202404 after 529006
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,785829,3.9773,89408,2,12836,20,278744,7,0,459,298504,0
Total reachable state count : 785829

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,3.98043,89408,1,0,20,278744,7,0,460,298504,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,1077,3.98154,89408,2,593,20,278744,8,0,462,298504,0
Explored full state space saw : 785829 states, properties seen :0
Exhaustive walk after 2038598 steps, saw 785829 distinct states, run finished after 2324 ms. (steps per millisecond=877 ) properties seen :0
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[6]
Ending property specific reduction for DBSingleClientW-PT-d1m06-UpperBounds-15 in 17508 ms.
[2025-05-30 10:44:35] [INFO ] Flatten gal took : 19 ms
[2025-05-30 10:44:35] [INFO ] Applying decomposition
[2025-05-30 10:44:35] [INFO ] Flatten gal took : 15 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/graph12491710001285160697.txt' '-o' '/tmp/graph12491710001285160697.bin' '-w' '/tmp/graph12491710001285160697.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12491710001285160697.bin' '-l' '-1' '-v' '-w' '/tmp/graph12491710001285160697.weights' '-q' '0' '-e' '0.001'
[2025-05-30 10:44:36] [INFO ] Decomposing Gal with order
[2025-05-30 10:44:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 10:44:36] [INFO ] Removed a total of 125 redundant transitions.
[2025-05-30 10:44:36] [INFO ] Flatten gal took : 72 ms
[2025-05-30 10:44:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 103 labels/synchronizations in 16 ms.
[2025-05-30 10:44:36] [INFO ] Time to serialize gal into /tmp/UpperBounds12033206007563131221.gal : 7 ms
[2025-05-30 10:44:36] [INFO ] Time to serialize properties into /tmp/UpperBounds17098820956307124247.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/UpperBounds12033206007563131221.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds17098820956307124247.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...285
Loading property file /tmp/UpperBounds17098820956307124247.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,918686,1.59775,38748,1872,579,59024,5646,359,146725,99,32155,0
Total reachable state count : 918686

Verifying 2 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d1m06-UpperBounds-06 :0 <= i5.u8.l546 <= 1
FORMULA DBSingleClientW-PT-d1m06-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-d1m06-UpperBounds-06,0,1.73985,38748,1,0,59024,5646,461,146725,115,32155,884
Min sum of variable value : 0
Maximum sum along a path : 3
Bounds property DBSingleClientW-PT-d1m06-UpperBounds-15 :0 <= i1.u6.l1225 <= 3
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-15 3 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DBSingleClientW-PT-d1m06-UpperBounds-15,0,1.76324,38748,1,0,59024,5646,490,146725,130,32429,1212
Total runtime 78763 ms.

BK_STOP 1748601878150

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

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