Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 8.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 12:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Apr 12 12:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 12 12:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Apr 12 12:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.6M May 18 16:42 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716331764117

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d2m09
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-21 22:49:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 22:49:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 22:49:25] [INFO ] Load time of PNML (sax parser for PT used): 228 ms
[2024-05-21 22:49:25] [INFO ] Transformed 4763 places.
[2024-05-21 22:49:25] [INFO ] Transformed 2478 transitions.
[2024-05-21 22:49:25] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 341 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Deduced a syphon composed of 3580 places in 25 ms
Reduce places removed 3580 places and 0 transitions.
FORMULA DBSingleClientW-PT-d2m09-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m09-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m09-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m09-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m09-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m09-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m09-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m09-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m09-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 2478 rows 1183 cols
[2024-05-21 22:49:25] [INFO ] Computed 6 invariants in 172 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[9, 3032, 7, 7, 7, 7, 3032]
RANDOM walk for 10000 steps (2276 resets) in 338 ms. (29 steps per ms)
BEST_FIRST walk for 70005 steps (6320 resets) in 387 ms. (180 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 1, 0, 0, 0, 0] Max Struct:[9, 3032, 7, 7, 7, 7, 3032]
[2024-05-21 22:49:26] [INFO ] Invariant cache hit.
[2024-05-21 22:49:26] [INFO ] [Real]Absence check using 2 positive place invariants in 19 ms returned sat
[2024-05-21 22:49:26] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 16 ms returned sat
[2024-05-21 22:49:27] [INFO ] [Real]Absence check using state equation in 711 ms returned sat
[2024-05-21 22:49:28] [INFO ] State equation strengthened by 1588 read => feed constraints.
[2024-05-21 22:49:29] [INFO ] [Real]Added 1588 Read/Feed constraints in 881 ms returned sat
[2024-05-21 22:49:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:49:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 22 ms returned sat
[2024-05-21 22:49:29] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2024-05-21 22:49:29] [INFO ] [Nat]Absence check using state equation in 630 ms returned sat
[2024-05-21 22:49:30] [INFO ] [Nat]Added 1588 Read/Feed constraints in 971 ms returned sat
[2024-05-21 22:49:31] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 707 ms.
[2024-05-21 22:49:32] [INFO ] Added : 15 causal constraints over 3 iterations in 1882 ms. Result :sat
Minimization took 653 ms.
[2024-05-21 22:49:33] [INFO ] [Real]Absence check using 2 positive place invariants in 13 ms returned sat
[2024-05-21 22:49:33] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 10 ms returned sat
[2024-05-21 22:49:34] [INFO ] [Real]Absence check using state equation in 694 ms returned sat
[2024-05-21 22:49:35] [INFO ] [Real]Added 1588 Read/Feed constraints in 748 ms returned sat
[2024-05-21 22:49:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:49:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 14 ms returned sat
[2024-05-21 22:49:35] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2024-05-21 22:49:36] [INFO ] [Nat]Absence check using state equation in 674 ms returned sat
[2024-05-21 22:49:36] [INFO ] [Nat]Added 1588 Read/Feed constraints in 743 ms returned sat
[2024-05-21 22:49:37] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 687 ms.
[2024-05-21 22:49:38] [INFO ] Added : 13 causal constraints over 3 iterations in 1309 ms. Result :sat
Minimization took 646 ms.
[2024-05-21 22:49:39] [INFO ] [Real]Absence check using 2 positive place invariants in 11 ms returned sat
[2024-05-21 22:49:39] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 17 ms returned unsat
[2024-05-21 22:49:39] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2024-05-21 22:49:39] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 11 ms returned sat
[2024-05-21 22:49:39] [INFO ] [Real]Absence check using state equation in 603 ms returned sat
[2024-05-21 22:49:40] [INFO ] [Real]Added 1588 Read/Feed constraints in 685 ms returned sat
[2024-05-21 22:49:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:49:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 11 ms returned sat
[2024-05-21 22:49:40] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 8 ms returned sat
[2024-05-21 22:49:41] [INFO ] [Nat]Absence check using state equation in 598 ms returned sat
[2024-05-21 22:49:42] [INFO ] [Nat]Added 1588 Read/Feed constraints in 686 ms returned sat
[2024-05-21 22:49:42] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 426 ms.
[2024-05-21 22:49:42] [INFO ] Added : 2 causal constraints over 1 iterations in 697 ms. Result :sat
Minimization took 641 ms.
[2024-05-21 22:49:43] [INFO ] [Real]Absence check using 2 positive place invariants in 11 ms returned sat
[2024-05-21 22:49:43] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 18 ms returned sat
[2024-05-21 22:49:44] [INFO ] [Real]Absence check using state equation in 630 ms returned sat
[2024-05-21 22:49:45] [INFO ] [Real]Added 1588 Read/Feed constraints in 708 ms returned sat
[2024-05-21 22:49:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:49:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 11 ms returned sat
[2024-05-21 22:49:45] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 14 ms returned sat
[2024-05-21 22:49:45] [INFO ] [Nat]Absence check using state equation in 611 ms returned sat
[2024-05-21 22:49:46] [INFO ] [Nat]Added 1588 Read/Feed constraints in 881 ms returned sat
[2024-05-21 22:49:47] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 356 ms.
[2024-05-21 22:49:48] [INFO ] Deduced a trap composed of 51 places in 799 ms of which 67 ms to minimize.
[2024-05-21 22:49:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1084 ms
[2024-05-21 22:49:49] [INFO ] Added : 14 causal constraints over 3 iterations in 2282 ms. Result :sat
Minimization took 629 ms.
[2024-05-21 22:49:49] [INFO ] [Real]Absence check using 2 positive place invariants in 16 ms returned sat
[2024-05-21 22:49:49] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 18 ms returned sat
[2024-05-21 22:49:50] [INFO ] [Real]Absence check using state equation in 515 ms returned sat
[2024-05-21 22:49:51] [INFO ] [Real]Added 1588 Read/Feed constraints in 755 ms returned sat
[2024-05-21 22:49:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:49:51] [INFO ] [Nat]Absence check using 2 positive place invariants in 11 ms returned sat
[2024-05-21 22:49:51] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 12 ms returned sat
[2024-05-21 22:49:52] [INFO ] [Nat]Absence check using state equation in 591 ms returned sat
[2024-05-21 22:49:52] [INFO ] [Nat]Added 1588 Read/Feed constraints in 725 ms returned sat
[2024-05-21 22:49:53] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 600 ms.
[2024-05-21 22:49:53] [INFO ] Added : 2 causal constraints over 1 iterations in 863 ms. Result :sat
Minimization took 640 ms.
[2024-05-21 22:49:54] [INFO ] [Real]Absence check using 2 positive place invariants in 12 ms returned sat
[2024-05-21 22:49:54] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 10 ms returned sat
[2024-05-21 22:49:55] [INFO ] [Real]Absence check using state equation in 625 ms returned sat
[2024-05-21 22:49:55] [INFO ] [Real]Added 1588 Read/Feed constraints in 763 ms returned sat
[2024-05-21 22:49:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:49:56] [INFO ] [Nat]Absence check using 2 positive place invariants in 11 ms returned sat
[2024-05-21 22:49:56] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 13 ms returned sat
[2024-05-21 22:49:56] [INFO ] [Nat]Absence check using state equation in 605 ms returned sat
[2024-05-21 22:49:57] [INFO ] [Nat]Added 1588 Read/Feed constraints in 880 ms returned sat
[2024-05-21 22:49:58] [INFO ] Deduced a trap composed of 204 places in 638 ms of which 17 ms to minimize.
[2024-05-21 22:49:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 793 ms
[2024-05-21 22:49:58] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 381 ms.
[2024-05-21 22:49:59] [INFO ] Deduced a trap composed of 208 places in 663 ms of which 8 ms to minimize.
[2024-05-21 22:50:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 836 ms
[2024-05-21 22:50:00] [INFO ] Added : 13 causal constraints over 4 iterations in 2000 ms. Result :sat
Minimization took 577 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 1, 0, 0, 0, 0] Max Struct:[9, 3032, 1, 7, 7, 7, 3032]
FORMULA DBSingleClientW-PT-d2m09-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[9, 3032, 7, 7, 7, 3032]
Support contains 6 out of 1183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1183/1183 places, 2478/2478 transitions.
Graph (complete) has 4476 edges and 1183 vertex of which 1137 are kept as prefixes of interest. Removing 46 places using SCC suffix rule.9 ms
Discarding 46 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Ensure Unique test removed 196 transitions
Reduce isomorphic transitions removed 214 transitions.
Iterating post reduction 0 with 214 rules applied. Total rules applied 215 place count 1137 transition count 2264
Discarding 389 places :
Symmetric choice reduction at 1 with 389 rule applications. Total rules 604 place count 748 transition count 1204
Iterating global reduction 1 with 389 rules applied. Total rules applied 993 place count 748 transition count 1204
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 1002 place count 748 transition count 1195
Discarding 313 places :
Symmetric choice reduction at 2 with 313 rule applications. Total rules 1315 place count 435 transition count 882
Iterating global reduction 2 with 313 rules applied. Total rules applied 1628 place count 435 transition count 882
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1640 place count 435 transition count 870
Discarding 237 places :
Symmetric choice reduction at 3 with 237 rule applications. Total rules 1877 place count 198 transition count 534
Iterating global reduction 3 with 237 rules applied. Total rules applied 2114 place count 198 transition count 534
Ensure Unique test removed 208 transitions
Reduce isomorphic transitions removed 208 transitions.
Iterating post reduction 3 with 208 rules applied. Total rules applied 2322 place count 198 transition count 326
Discarding 25 places :
Symmetric choice reduction at 4 with 25 rule applications. Total rules 2347 place count 173 transition count 286
Iterating global reduction 4 with 25 rules applied. Total rules applied 2372 place count 173 transition count 286
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 2378 place count 173 transition count 280
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 2393 place count 158 transition count 265
Iterating global reduction 5 with 15 rules applied. Total rules applied 2408 place count 158 transition count 265
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 2412 place count 158 transition count 261
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 2424 place count 146 transition count 249
Iterating global reduction 6 with 12 rules applied. Total rules applied 2436 place count 146 transition count 249
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 2446 place count 146 transition count 239
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 2450 place count 142 transition count 223
Iterating global reduction 7 with 4 rules applied. Total rules applied 2454 place count 142 transition count 223
Applied a total of 2454 rules in 418 ms. Remains 142 /1183 variables (removed 1041) and now considering 223/2478 (removed 2255) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 432 ms. Remains : 142/1183 places, 223/2478 transitions.
// Phase 1: matrix 223 rows 142 cols
[2024-05-21 22:50:01] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[9, 3032, 7, 7, 7, 3032]
RANDOM walk for 1000000 steps (229670 resets) in 1465 ms. (682 steps per ms)
BEST_FIRST walk for 6000001 steps (570508 resets) in 3844 ms. (1560 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 1, 0, 1, 0] Max Struct:[9, 3032, 7, 7, 7, 3032]
[2024-05-21 22:50:06] [INFO ] Invariant cache hit.
[2024-05-21 22:50:06] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2024-05-21 22:50:06] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2024-05-21 22:50:06] [INFO ] State equation strengthened by 87 read => feed constraints.
[2024-05-21 22:50:06] [INFO ] [Real]Added 87 Read/Feed constraints in 20 ms returned sat
[2024-05-21 22:50:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:50:06] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 29 ms returned sat
[2024-05-21 22:50:07] [INFO ] [Nat]Absence check using state equation in 302 ms returned sat
[2024-05-21 22:50:07] [INFO ] [Nat]Added 87 Read/Feed constraints in 16 ms returned sat
[2024-05-21 22:50:07] [INFO ] Computed and/alt/rep : 55/143/55 causal constraints (skipped 167 transitions) in 17 ms.
[2024-05-21 22:50:07] [INFO ] Added : 11 causal constraints over 3 iterations in 86 ms. Result :sat
Minimization took 146 ms.
[2024-05-21 22:50:07] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 5 ms returned sat
[2024-05-21 22:50:07] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2024-05-21 22:50:07] [INFO ] [Real]Added 87 Read/Feed constraints in 14 ms returned sat
[2024-05-21 22:50:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:50:07] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 22:50:07] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2024-05-21 22:50:07] [INFO ] [Nat]Added 87 Read/Feed constraints in 18 ms returned sat
[2024-05-21 22:50:07] [INFO ] Computed and/alt/rep : 55/143/55 causal constraints (skipped 167 transitions) in 20 ms.
[2024-05-21 22:50:07] [INFO ] Added : 10 causal constraints over 2 iterations in 84 ms. Result :sat
Minimization took 142 ms.
[2024-05-21 22:50:08] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 22:50:08] [INFO ] [Real]Absence check using state equation in 27 ms returned unsat
[2024-05-21 22:50:08] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 22:50:08] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2024-05-21 22:50:08] [INFO ] [Real]Added 87 Read/Feed constraints in 13 ms returned sat
[2024-05-21 22:50:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:50:08] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 22:50:08] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2024-05-21 22:50:08] [INFO ] [Nat]Added 87 Read/Feed constraints in 17 ms returned sat
[2024-05-21 22:50:08] [INFO ] Computed and/alt/rep : 55/143/55 causal constraints (skipped 167 transitions) in 14 ms.
[2024-05-21 22:50:08] [INFO ] Added : 15 causal constraints over 3 iterations in 82 ms. Result :sat
Minimization took 141 ms.
[2024-05-21 22:50:08] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 22:50:08] [INFO ] [Real]Absence check using state equation in 27 ms returned unsat
[2024-05-21 22:50:08] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 22:50:08] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2024-05-21 22:50:08] [INFO ] [Real]Added 87 Read/Feed constraints in 14 ms returned sat
[2024-05-21 22:50:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:50:08] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-21 22:50:08] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2024-05-21 22:50:08] [INFO ] [Nat]Added 87 Read/Feed constraints in 17 ms returned sat
[2024-05-21 22:50:08] [INFO ] Computed and/alt/rep : 55/143/55 causal constraints (skipped 167 transitions) in 13 ms.
[2024-05-21 22:50:08] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 2 ms to minimize.
[2024-05-21 22:50:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2024-05-21 22:50:09] [INFO ] Added : 12 causal constraints over 3 iterations in 173 ms. Result :sat
Minimization took 136 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 1, 0, 1, 0] Max Struct:[9, 3032, 1, 7, 1, 3032]
FORMULA DBSingleClientW-PT-d2m09-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DBSingleClientW-PT-d2m09-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[9, 3032, 7, 3032]
Support contains 4 out of 142 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 142/142 places, 223/223 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 140 transition count 221
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 140 transition count 221
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 138 transition count 217
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 138 transition count 217
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 138 transition count 215
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 136 transition count 213
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 136 transition count 213
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 16 place count 134 transition count 211
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 134 transition count 211
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 21 place count 134 transition count 208
Applied a total of 21 rules in 28 ms. Remains 134 /142 variables (removed 8) and now considering 208/223 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 134/142 places, 208/223 transitions.
// Phase 1: matrix 208 rows 134 cols
[2024-05-21 22:50:09] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[9, 3032, 7, 3032]
RANDOM walk for 1000000 steps (229912 resets) in 1285 ms. (777 steps per ms)
BEST_FIRST walk for 4000003 steps (381868 resets) in 2319 ms. (1724 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[9, 3032, 7, 3032]
[2024-05-21 22:50:12] [INFO ] Invariant cache hit.
[2024-05-21 22:50:13] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 22:50:13] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2024-05-21 22:50:13] [INFO ] State equation strengthened by 83 read => feed constraints.
[2024-05-21 22:50:13] [INFO ] [Real]Added 83 Read/Feed constraints in 23 ms returned sat
[2024-05-21 22:50:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:50:13] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 22:50:13] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2024-05-21 22:50:13] [INFO ] [Nat]Added 83 Read/Feed constraints in 35 ms returned sat
[2024-05-21 22:50:13] [INFO ] Computed and/alt/rep : 51/123/51 causal constraints (skipped 156 transitions) in 18 ms.
[2024-05-21 22:50:13] [INFO ] Added : 13 causal constraints over 3 iterations in 87 ms. Result :sat
Minimization took 141 ms.
[2024-05-21 22:50:13] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 22:50:13] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2024-05-21 22:50:13] [INFO ] [Real]Added 83 Read/Feed constraints in 26 ms returned sat
[2024-05-21 22:50:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:50:13] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2024-05-21 22:50:13] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2024-05-21 22:50:13] [INFO ] [Nat]Added 83 Read/Feed constraints in 14 ms returned sat
[2024-05-21 22:50:13] [INFO ] Computed and/alt/rep : 51/123/51 causal constraints (skipped 156 transitions) in 15 ms.
[2024-05-21 22:50:13] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 1 ms to minimize.
[2024-05-21 22:50:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2024-05-21 22:50:13] [INFO ] Added : 9 causal constraints over 2 iterations in 153 ms. Result :sat
Minimization took 132 ms.
[2024-05-21 22:50:14] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 22:50:14] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2024-05-21 22:50:14] [INFO ] [Real]Added 83 Read/Feed constraints in 12 ms returned sat
[2024-05-21 22:50:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:50:14] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 22:50:14] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2024-05-21 22:50:14] [INFO ] [Nat]Added 83 Read/Feed constraints in 16 ms returned sat
[2024-05-21 22:50:14] [INFO ] Computed and/alt/rep : 51/123/51 causal constraints (skipped 156 transitions) in 16 ms.
[2024-05-21 22:50:14] [INFO ] Added : 13 causal constraints over 3 iterations in 75 ms. Result :sat
Minimization took 133 ms.
[2024-05-21 22:50:14] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 22:50:14] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2024-05-21 22:50:14] [INFO ] [Real]Added 83 Read/Feed constraints in 14 ms returned sat
[2024-05-21 22:50:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:50:14] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 22:50:14] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2024-05-21 22:50:14] [INFO ] [Nat]Added 83 Read/Feed constraints in 15 ms returned sat
[2024-05-21 22:50:14] [INFO ] Computed and/alt/rep : 51/123/51 causal constraints (skipped 156 transitions) in 14 ms.
[2024-05-21 22:50:14] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 2 ms to minimize.
[2024-05-21 22:50:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 102 ms
[2024-05-21 22:50:14] [INFO ] Added : 12 causal constraints over 3 iterations in 195 ms. Result :sat
Minimization took 134 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[9, 3032, 7, 3032]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[9, 3032, 7, 3032]
Support contains 4 out of 134 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 208/208 transitions.
Applied a total of 0 rules in 10 ms. Remains 134 /134 variables (removed 0) and now considering 208/208 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 134/134 places, 208/208 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 208/208 transitions.
Applied a total of 0 rules in 7 ms. Remains 134 /134 variables (removed 0) and now considering 208/208 (removed 0) transitions.
[2024-05-21 22:50:15] [INFO ] Invariant cache hit.
[2024-05-21 22:50:15] [INFO ] Implicit Places using invariants in 258 ms returned []
[2024-05-21 22:50:15] [INFO ] Invariant cache hit.
[2024-05-21 22:50:15] [INFO ] State equation strengthened by 83 read => feed constraints.
[2024-05-21 22:50:15] [INFO ] Implicit Places using invariants and state equation in 312 ms returned []
Implicit Place search using SMT with State Equation took 571 ms to find 0 implicit places.
[2024-05-21 22:50:15] [INFO ] Redundant transitions in 6 ms returned []
Running 207 sub problems to find dead transitions.
[2024-05-21 22:50:15] [INFO ] Invariant cache hit.
[2024-05-21 22:50:15] [INFO ] State equation strengthened by 83 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 2 (OVERLAPS) 1/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 4 (OVERLAPS) 208/341 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/341 variables, 83/218 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 7 (OVERLAPS) 1/342 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/342 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 9 (OVERLAPS) 0/342 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 207 unsolved
No progress, stopping.
After SMT solving in domain Real declared 342/342 variables, and 219 constraints, problems are : Problem set: 0 solved, 207 unsolved in 13486 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 134/134 constraints, ReadFeed: 83/83 constraints, PredecessorRefiner: 207/207 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 207 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 2 (OVERLAPS) 1/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 4 (OVERLAPS) 208/341 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/341 variables, 83/218 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 191/409 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 8 (OVERLAPS) 1/342 variables, 1/410 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/342 variables, 16/426 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/342 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 11 (OVERLAPS) 0/342 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 207 unsolved
No progress, stopping.
After SMT solving in domain Int declared 342/342 variables, and 426 constraints, problems are : Problem set: 0 solved, 207 unsolved in 23957 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 134/134 constraints, ReadFeed: 83/83 constraints, PredecessorRefiner: 207/207 constraints, Known Traps: 0/0 constraints]
After SMT, in 38138ms problems are : Problem set: 0 solved, 207 unsolved
Search for dead transitions found 0 dead transitions in 38149ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38775 ms. Remains : 134/134 places, 208/208 transitions.
RANDOM walk for 40000 steps (9137 resets) in 1251 ms. (31 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (3762 resets) in 400 ms. (99 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (3803 resets) in 491 ms. (81 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (3920 resets) in 251 ms. (158 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (3736 resets) in 173 ms. (229 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (3914 resets) in 197 ms. (202 steps per ms) remains 8/8 properties
[2024-05-21 22:50:55] [INFO ] Flatten gal took : 239 ms
[2024-05-21 22:50:55] [INFO ] Flatten gal took : 33 ms
BEST_FIRST walk for 40001 steps (3758 resets) in 185 ms. (215 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (3703 resets) in 153 ms. (259 steps per ms) remains 8/8 properties
[2024-05-21 22:50:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7931323969016892182.gal : 44 ms
[2024-05-21 22:50:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality392833888842673088.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/ReachabilityCardinality7931323969016892182.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality392833888842673088.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (3852 resets) in 117 ms. (339 steps per ms) remains 8/8 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 ...327
Loading property file /tmp/ReachabilityCardinality392833888842673088.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :7 after 30
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :30 after 68
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :68 after 106
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :106 after 182
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :182 after 330
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :330 after 650
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :650 after 1176
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :1176 after 57846
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :57846 after 173406
Interrupted probabilistic random walk after 535158 steps, run timeout after 3001 ms. (steps per millisecond=178 ) properties seen :4 out of 8
Probabilistic random walk after 535158 steps, saw 213899 distinct states, run finished after 3004 ms. (steps per millisecond=178 ) properties seen :4
[2024-05-21 22:50:58] [INFO ] Invariant cache hit.
[2024-05-21 22:50:58] [INFO ] State equation strengthened by 83 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 75/79 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 15/94 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 138/232 variables, 94/96 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem MAX0 is UNSAT
Problem MAX1 is UNSAT
Problem MAX2 is UNSAT
Problem MAX3 is UNSAT
After SMT solving in domain Real declared 333/342 variables, and 131 constraints, problems are : Problem set: 4 solved, 0 unsolved in 196 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 129/134 constraints, ReadFeed: 0/83 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 204ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0, 0, 0, 0] Max Struct:[9, 3032, 7, 3032]
Starting property specific reduction for DBSingleClientW-PT-d2m09-UpperBounds-00
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[9]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[9]
[2024-05-21 22:50:58] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[9]
RANDOM walk for 10000 steps (2321 resets) in 14 ms. (666 steps per ms)
BEST_FIRST walk for 10001 steps (947 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[9]
[2024-05-21 22:50:58] [INFO ] Invariant cache hit.
[2024-05-21 22:50:58] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 29 ms returned sat
[2024-05-21 22:50:59] [INFO ] [Real]Absence check using state equation in 387 ms returned sat
[2024-05-21 22:50:59] [INFO ] State equation strengthened by 83 read => feed constraints.
[2024-05-21 22:50:59] [INFO ] [Real]Added 83 Read/Feed constraints in 39 ms returned sat
[2024-05-21 22:50:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:50:59] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 22:50:59] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2024-05-21 22:50:59] [INFO ] [Nat]Added 83 Read/Feed constraints in 13 ms returned sat
[2024-05-21 22:50:59] [INFO ] Computed and/alt/rep : 51/123/51 causal constraints (skipped 156 transitions) in 33 ms.
[2024-05-21 22:50:59] [INFO ] Added : 13 causal constraints over 3 iterations in 97 ms. Result :sat
Minimization took 135 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[9]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[9]
Support contains 1 out of 134 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 208/208 transitions.
Graph (complete) has 465 edges and 134 vertex of which 133 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 133 transition count 206
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 6 place count 130 transition count 199
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 130 transition count 199
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 130 transition count 198
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 12 place count 128 transition count 188
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 128 transition count 188
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 15 place count 128 transition count 187
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 16 place count 127 transition count 179
Iterating global reduction 3 with 1 rules applied. Total rules applied 17 place count 127 transition count 179
Applied a total of 17 rules in 15 ms. Remains 127 /134 variables (removed 7) and now considering 179/208 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 127/134 places, 179/208 transitions.
// Phase 1: matrix 179 rows 127 cols
[2024-05-21 22:50:59] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[9]
RANDOM walk for 1000000 steps (229830 resets) in 1107 ms. (902 steps per ms)
BEST_FIRST walk for 1000001 steps (95721 resets) in 504 ms. (1980 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[9]
[2024-05-21 22:51:01] [INFO ] Invariant cache hit.
[2024-05-21 22:51:01] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 22:51:01] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2024-05-21 22:51:01] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-21 22:51:01] [INFO ] [Real]Added 58 Read/Feed constraints in 15 ms returned sat
[2024-05-21 22:51:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:51:01] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 22:51:01] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2024-05-21 22:51:01] [INFO ] [Nat]Added 58 Read/Feed constraints in 12 ms returned sat
[2024-05-21 22:51:01] [INFO ] Computed and/alt/rep : 50/117/50 causal constraints (skipped 128 transitions) in 21 ms.
[2024-05-21 22:51:01] [INFO ] Added : 11 causal constraints over 3 iterations in 66 ms. Result :sat
Minimization took 77 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[9]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[9]
Support contains 1 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 179/179 transitions.
Applied a total of 0 rules in 5 ms. Remains 127 /127 variables (removed 0) and now considering 179/179 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 127/127 places, 179/179 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 179/179 transitions.
Applied a total of 0 rules in 5 ms. Remains 127 /127 variables (removed 0) and now considering 179/179 (removed 0) transitions.
[2024-05-21 22:51:01] [INFO ] Invariant cache hit.
[2024-05-21 22:51:01] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-21 22:51:01] [INFO ] Invariant cache hit.
[2024-05-21 22:51:01] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-21 22:51:01] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
[2024-05-21 22:51:01] [INFO ] Redundant transitions in 6 ms returned []
Running 178 sub problems to find dead transitions.
[2024-05-21 22:51:01] [INFO ] Invariant cache hit.
[2024-05-21 22:51:01] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (OVERLAPS) 179/306 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 58/187 constraints. Problems are: Problem set: 0 solved, 178 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (OVERLAPS) 0/306 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 187 constraints, problems are : Problem set: 0 solved, 178 unsolved in 4717 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 127/127 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 178 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (OVERLAPS) 179/306 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 58/187 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 178/365 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 8 (OVERLAPS) 0/306 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 365 constraints, problems are : Problem set: 0 solved, 178 unsolved in 11605 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 127/127 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 0/0 constraints]
After SMT, in 16580ms problems are : Problem set: 0 solved, 178 unsolved
Search for dead transitions found 0 dead transitions in 16583ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16927 ms. Remains : 127/127 places, 179/179 transitions.
[2024-05-21 22:51:18] [INFO ] Flatten gal took : 26 ms
[2024-05-21 22:51:18] [INFO ] Flatten gal took : 34 ms
RANDOM walk for 40000 steps (9176 resets) in 147 ms. (270 steps per ms) remains 2/2 properties
[2024-05-21 22:51:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4457062449540379185.gal : 4 ms
[2024-05-21 22:51:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2931262609998498752.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/ReachabilityCardinality4457062449540379185.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2931262609998498752.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality2931262609998498752.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 30
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :30 after 68
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :68 after 106
BEST_FIRST walk for 40003 steps (3789 resets) in 149 ms. (266 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :106 after 182
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :182 after 294
BEST_FIRST walk for 40004 steps (3795 resets) in 68 ms. (579 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :294 after 528
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :528 after 942
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :942 after 4478
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :4478 after 13538
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :13538 after 75185
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :75185 after 421768
Interrupted probabilistic random walk after 2150614 steps, run timeout after 3001 ms. (steps per millisecond=716 ) properties seen :1 out of 2
Probabilistic random walk after 2150614 steps, saw 886316 distinct states, run finished after 3001 ms. (steps per millisecond=716 ) properties seen :1
[2024-05-21 22:51:21] [INFO ] Invariant cache hit.
[2024-05-21 22:51:21] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 75/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/91 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 131/222 variables, 91/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 297/306 variables, and 124 constraints, problems are : Problem set: 1 solved, 0 unsolved in 213 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 122/127 constraints, ReadFeed: 0/58 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 219ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[9]
Ending property specific reduction for DBSingleClientW-PT-d2m09-UpperBounds-00 in 23355 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m09-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:[3032]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[3032]
// Phase 1: matrix 208 rows 134 cols
[2024-05-21 22:51:21] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[3032]
RANDOM walk for 10000 steps (2278 resets) in 14 ms. (666 steps per ms)
BEST_FIRST walk for 10001 steps (908 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[3032]
[2024-05-21 22:51:21] [INFO ] Invariant cache hit.
[2024-05-21 22:51:21] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 22:51:21] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2024-05-21 22:51:21] [INFO ] State equation strengthened by 83 read => feed constraints.
[2024-05-21 22:51:21] [INFO ] [Real]Added 83 Read/Feed constraints in 11 ms returned sat
[2024-05-21 22:51:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:51:22] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 22:51:22] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2024-05-21 22:51:22] [INFO ] [Nat]Added 83 Read/Feed constraints in 14 ms returned sat
[2024-05-21 22:51:22] [INFO ] Computed and/alt/rep : 51/123/51 causal constraints (skipped 156 transitions) in 13 ms.
[2024-05-21 22:51:22] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2024-05-21 22:51:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2024-05-21 22:51:22] [INFO ] Added : 9 causal constraints over 2 iterations in 136 ms. Result :sat
Minimization took 136 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[3032]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[3032]
Support contains 1 out of 134 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 208/208 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 131 transition count 205
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 131 transition count 205
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 131 transition count 204
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 129 transition count 201
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 129 transition count 201
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 129 transition count 200
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 14 place count 127 transition count 191
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 127 transition count 191
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 17 place count 127 transition count 190
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 18 place count 126 transition count 183
Iterating global reduction 3 with 1 rules applied. Total rules applied 19 place count 126 transition count 183
Applied a total of 19 rules in 18 ms. Remains 126 /134 variables (removed 8) and now considering 183/208 (removed 25) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 126/134 places, 183/208 transitions.
// Phase 1: matrix 183 rows 126 cols
[2024-05-21 22:51:22] [INFO ] Computed 2 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[3032]
RANDOM walk for 1000000 steps (229848 resets) in 1126 ms. (887 steps per ms)
BEST_FIRST walk for 1000001 steps (94791 resets) in 535 ms. (1865 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[3032]
[2024-05-21 22:51:24] [INFO ] Invariant cache hit.
[2024-05-21 22:51:24] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 22:51:24] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2024-05-21 22:51:24] [INFO ] State equation strengthened by 64 read => feed constraints.
[2024-05-21 22:51:24] [INFO ] [Real]Added 64 Read/Feed constraints in 10 ms returned sat
[2024-05-21 22:51:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:51:24] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 22:51:24] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2024-05-21 22:51:24] [INFO ] [Nat]Added 64 Read/Feed constraints in 12 ms returned sat
[2024-05-21 22:51:24] [INFO ] Computed and/alt/rep : 49/115/49 causal constraints (skipped 133 transitions) in 12 ms.
[2024-05-21 22:51:24] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-05-21 22:51:24] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-05-21 22:51:24] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-21 22:51:24] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-21 22:51:24] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 324 ms
[2024-05-21 22:51:24] [INFO ] Added : 19 causal constraints over 5 iterations in 422 ms. Result :sat
Minimization took 97 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[3032]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[3032]
Support contains 1 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 183/183 transitions.
Applied a total of 0 rules in 15 ms. Remains 126 /126 variables (removed 0) and now considering 183/183 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 126/126 places, 183/183 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 183/183 transitions.
Applied a total of 0 rules in 7 ms. Remains 126 /126 variables (removed 0) and now considering 183/183 (removed 0) transitions.
[2024-05-21 22:51:24] [INFO ] Invariant cache hit.
[2024-05-21 22:51:24] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-21 22:51:24] [INFO ] Invariant cache hit.
[2024-05-21 22:51:25] [INFO ] State equation strengthened by 64 read => feed constraints.
[2024-05-21 22:51:25] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
[2024-05-21 22:51:25] [INFO ] Redundant transitions in 1 ms returned []
Running 182 sub problems to find dead transitions.
[2024-05-21 22:51:25] [INFO ] Invariant cache hit.
[2024-05-21 22:51:25] [INFO ] State equation strengthened by 64 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (OVERLAPS) 183/308 variables, 125/127 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 64/191 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (OVERLAPS) 1/309 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/309 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 182 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/309 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Real declared 309/309 variables, and 192 constraints, problems are : Problem set: 0 solved, 182 unsolved in 8068 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 126/126 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 182 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (OVERLAPS) 183/308 variables, 125/127 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 64/191 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 167/358 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 8 (OVERLAPS) 1/309 variables, 1/359 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/309 variables, 15/374 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/309 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 11 (OVERLAPS) 0/309 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Int declared 309/309 variables, and 374 constraints, problems are : Problem set: 0 solved, 182 unsolved in 19631 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 126/126 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 0/0 constraints]
After SMT, in 27921ms problems are : Problem set: 0 solved, 182 unsolved
Search for dead transitions found 0 dead transitions in 27923ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28302 ms. Remains : 126/126 places, 183/183 transitions.
[2024-05-21 22:51:53] [INFO ] Flatten gal took : 12 ms
[2024-05-21 22:51:53] [INFO ] Flatten gal took : 15 ms
RANDOM walk for 40000 steps (9139 resets) in 130 ms. (305 steps per ms) remains 2/2 properties
[2024-05-21 22:51:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16051013708735659673.gal : 8 ms
[2024-05-21 22:51:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality129260448664776091.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/ReachabilityCardinality16051013708735659673.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality129260448664776091.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality129260448664776091.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 30
BEST_FIRST walk for 40001 steps (3924 resets) in 61 ms. (645 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :30 after 68
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :68 after 106
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :106 after 182
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :182 after 310
BEST_FIRST walk for 40002 steps (3903 resets) in 82 ms. (481 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :310 after 558
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :558 after 1050
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1050 after 6515
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :6515 after 23358
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :23358 after 231240
Interrupted probabilistic random walk after 2151442 steps, run timeout after 3001 ms. (steps per millisecond=716 ) properties seen :1 out of 2
Probabilistic random walk after 2151442 steps, saw 883317 distinct states, run finished after 3010 ms. (steps per millisecond=714 ) properties seen :1
[2024-05-21 22:51:56] [INFO ] Invariant cache hit.
[2024-05-21 22:51:56] [INFO ] State equation strengthened by 64 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/21 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 144/165 variables, 14/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :231240 after 741310
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 29/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/165 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 69/234 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 50/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 15/249 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/249 variables, 11/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/249 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 309/309 variables, and 157 constraints, problems are : Problem set: 1 solved, 0 unsolved in 127 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 126/126 constraints, ReadFeed: 29/64 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 134ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[3032]
Ending property specific reduction for DBSingleClientW-PT-d2m09-UpperBounds-01 in 34586 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m09-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 208 rows 134 cols
[2024-05-21 22:51:56] [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 (2303 resets) in 19 ms. (500 steps per ms)
BEST_FIRST walk for 10001 steps (983 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2024-05-21 22:51:56] [INFO ] Invariant cache hit.
[2024-05-21 22:51:56] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 22:51:56] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2024-05-21 22:51:56] [INFO ] State equation strengthened by 83 read => feed constraints.
[2024-05-21 22:51:56] [INFO ] [Real]Added 83 Read/Feed constraints in 13 ms returned sat
[2024-05-21 22:51:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:51:56] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 22:51:56] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2024-05-21 22:51:56] [INFO ] [Nat]Added 83 Read/Feed constraints in 17 ms returned sat
[2024-05-21 22:51:56] [INFO ] Computed and/alt/rep : 51/123/51 causal constraints (skipped 156 transitions) in 14 ms.
[2024-05-21 22:51:56] [INFO ] Added : 13 causal constraints over 3 iterations in 72 ms. Result :sat
Minimization took 138 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 134 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 208/208 transitions.
Graph (complete) has 465 edges and 134 vertex of which 133 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 133 transition count 206
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 6 place count 130 transition count 199
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 130 transition count 199
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 130 transition count 198
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 12 place count 128 transition count 189
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 128 transition count 189
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 127 transition count 188
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 127 transition count 188
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 17 place count 127 transition count 187
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 18 place count 126 transition count 180
Iterating global reduction 3 with 1 rules applied. Total rules applied 19 place count 126 transition count 180
Applied a total of 19 rules in 22 ms. Remains 126 /134 variables (removed 8) and now considering 180/208 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 126/134 places, 180/208 transitions.
// Phase 1: matrix 180 rows 126 cols
[2024-05-21 22:51:57] [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 (230017 resets) in 1078 ms. (926 steps per ms)
BEST_FIRST walk for 1000000 steps (95782 resets) in 501 ms. (1992 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2024-05-21 22:51:58] [INFO ] Invariant cache hit.
[2024-05-21 22:51:58] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 22:51:58] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2024-05-21 22:51:58] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-21 22:51:58] [INFO ] [Real]Added 58 Read/Feed constraints in 9 ms returned sat
[2024-05-21 22:51:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:51:58] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 22:51:58] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2024-05-21 22:51:58] [INFO ] [Nat]Added 58 Read/Feed constraints in 12 ms returned sat
[2024-05-21 22:51:58] [INFO ] Computed and/alt/rep : 50/119/50 causal constraints (skipped 129 transitions) in 13 ms.
[2024-05-21 22:51:58] [INFO ] Added : 16 causal constraints over 4 iterations in 68 ms. Result :sat
Minimization took 66 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[7]
Support contains 1 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 180/180 transitions.
Applied a total of 0 rules in 4 ms. Remains 126 /126 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 126/126 places, 180/180 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 180/180 transitions.
Applied a total of 0 rules in 3 ms. Remains 126 /126 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2024-05-21 22:51:58] [INFO ] Invariant cache hit.
[2024-05-21 22:51:59] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-21 22:51:59] [INFO ] Invariant cache hit.
[2024-05-21 22:51:59] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-21 22:51:59] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
[2024-05-21 22:51:59] [INFO ] Redundant transitions in 1 ms returned []
Running 179 sub problems to find dead transitions.
[2024-05-21 22:51:59] [INFO ] Invariant cache hit.
[2024-05-21 22:51:59] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (OVERLAPS) 180/306 variables, 126/128 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 58/186 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (OVERLAPS) 0/306 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 186 constraints, problems are : Problem set: 0 solved, 179 unsolved in 5936 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 126/126 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 179 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (OVERLAPS) 180/306 variables, 126/128 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 58/186 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 179/365 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 8 (OVERLAPS) 0/306 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 365 constraints, problems are : Problem set: 0 solved, 179 unsolved in 12563 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 126/126 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 0/0 constraints]
After SMT, in 18724ms problems are : Problem set: 0 solved, 179 unsolved
Search for dead transitions found 0 dead transitions in 18726ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19030 ms. Remains : 126/126 places, 180/180 transitions.
[2024-05-21 22:52:17] [INFO ] Flatten gal took : 10 ms
[2024-05-21 22:52:18] [INFO ] Flatten gal took : 10 ms
[2024-05-21 22:52:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1409392346729616037.gal : 2 ms
[2024-05-21 22:52:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17159970319195522180.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/ReachabilityCardinality1409392346729616037.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17159970319195522180.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/ReachabilityCardinality17159970319195522180.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
RANDOM walk for 40000 steps (9182 resets) in 167 ms. (238 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 30
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :30 after 68
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :68 after 106
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :106 after 182
BEST_FIRST walk for 40003 steps (3888 resets) in 78 ms. (506 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :182 after 294
BEST_FIRST walk for 40003 steps (3841 resets) in 46 ms. (851 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :294 after 498
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :498 after 886
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :886 after 3098
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :3098 after 16934
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :16934 after 91455
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :91455 after 405104
Interrupted probabilistic random walk after 2498331 steps, run timeout after 3001 ms. (steps per millisecond=832 ) properties seen :1 out of 2
Probabilistic random walk after 2498331 steps, saw 1006079 distinct states, run finished after 3001 ms. (steps per millisecond=832 ) properties seen :1
[2024-05-21 22:52:21] [INFO ] Invariant cache hit.
[2024-05-21 22:52:21] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 74/75 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 131/221 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 297/306 variables, and 123 constraints, problems are : Problem set: 1 solved, 0 unsolved in 97 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 121/126 constraints, ReadFeed: 0/58 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 102ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[7]
Ending property specific reduction for DBSingleClientW-PT-d2m09-UpperBounds-06 in 24738 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m09-UpperBounds-14
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[3032]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[3032]
// Phase 1: matrix 208 rows 134 cols
[2024-05-21 22:52:21] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[3032]
RANDOM walk for 10000 steps (2292 resets) in 19 ms. (500 steps per ms)
BEST_FIRST walk for 10001 steps (915 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[3032]
[2024-05-21 22:52:21] [INFO ] Invariant cache hit.
[2024-05-21 22:52:21] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 22:52:21] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2024-05-21 22:52:21] [INFO ] State equation strengthened by 83 read => feed constraints.
[2024-05-21 22:52:21] [INFO ] [Real]Added 83 Read/Feed constraints in 14 ms returned sat
[2024-05-21 22:52:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:52:21] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 22:52:21] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2024-05-21 22:52:21] [INFO ] [Nat]Added 83 Read/Feed constraints in 15 ms returned sat
[2024-05-21 22:52:21] [INFO ] Computed and/alt/rep : 51/123/51 causal constraints (skipped 156 transitions) in 14 ms.
[2024-05-21 22:52:21] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2024-05-21 22:52:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2024-05-21 22:52:21] [INFO ] Added : 12 causal constraints over 3 iterations in 177 ms. Result :sat
Minimization took 141 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[3032]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[3032]
Support contains 1 out of 134 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 208/208 transitions.
Graph (complete) has 465 edges and 134 vertex of which 133 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 133 transition count 206
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 6 place count 130 transition count 199
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 130 transition count 199
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 128 transition count 196
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 128 transition count 196
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 128 transition count 195
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 16 place count 126 transition count 186
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 126 transition count 186
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 19 place count 126 transition count 185
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 20 place count 125 transition count 178
Iterating global reduction 3 with 1 rules applied. Total rules applied 21 place count 125 transition count 178
Applied a total of 21 rules in 16 ms. Remains 125 /134 variables (removed 9) and now considering 178/208 (removed 30) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 125/134 places, 178/208 transitions.
// Phase 1: matrix 178 rows 125 cols
[2024-05-21 22:52:21] [INFO ] Computed 2 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[3032]
RANDOM walk for 1000000 steps (229722 resets) in 1159 ms. (862 steps per ms)
BEST_FIRST walk for 1000001 steps (96045 resets) in 548 ms. (1821 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[3032]
[2024-05-21 22:52:23] [INFO ] Invariant cache hit.
[2024-05-21 22:52:23] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 22:52:23] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2024-05-21 22:52:23] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-21 22:52:23] [INFO ] [Real]Added 58 Read/Feed constraints in 12 ms returned sat
[2024-05-21 22:52:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:52:23] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 22:52:23] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2024-05-21 22:52:23] [INFO ] [Nat]Added 58 Read/Feed constraints in 16 ms returned sat
[2024-05-21 22:52:23] [INFO ] Computed and/alt/rep : 49/117/49 causal constraints (skipped 128 transitions) in 12 ms.
[2024-05-21 22:52:23] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2024-05-21 22:52:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2024-05-21 22:52:23] [INFO ] Added : 11 causal constraints over 3 iterations in 137 ms. Result :sat
Minimization took 85 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[3032]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[3032]
Support contains 1 out of 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 178/178 transitions.
Applied a total of 0 rules in 3 ms. Remains 125 /125 variables (removed 0) and now considering 178/178 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 125/125 places, 178/178 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 178/178 transitions.
Applied a total of 0 rules in 4 ms. Remains 125 /125 variables (removed 0) and now considering 178/178 (removed 0) transitions.
[2024-05-21 22:52:24] [INFO ] Invariant cache hit.
[2024-05-21 22:52:24] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-21 22:52:24] [INFO ] Invariant cache hit.
[2024-05-21 22:52:24] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-21 22:52:24] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
[2024-05-21 22:52:24] [INFO ] Redundant transitions in 1 ms returned []
Running 177 sub problems to find dead transitions.
[2024-05-21 22:52:24] [INFO ] Invariant cache hit.
[2024-05-21 22:52:24] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (OVERLAPS) 178/303 variables, 125/127 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/303 variables, 58/185 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (OVERLAPS) 0/303 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Real declared 303/303 variables, and 185 constraints, problems are : Problem set: 0 solved, 177 unsolved in 5051 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 125/125 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 177 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (OVERLAPS) 178/303 variables, 125/127 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/303 variables, 58/185 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 177/362 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (OVERLAPS) 0/303 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Int declared 303/303 variables, and 362 constraints, problems are : Problem set: 0 solved, 177 unsolved in 13547 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 125/125 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 0/0 constraints]
After SMT, in 18862ms problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 18865ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19176 ms. Remains : 125/125 places, 178/178 transitions.
[2024-05-21 22:52:43] [INFO ] Flatten gal took : 9 ms
[2024-05-21 22:52:43] [INFO ] Flatten gal took : 9 ms
[2024-05-21 22:52:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1363349240434625296.gal : 2 ms
[2024-05-21 22:52:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11242980045130865695.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/ReachabilityCardinality1363349240434625296.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11242980045130865695.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40000 steps (9220 resets) in 135 ms. (294 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
BEST_FIRST walk for 40003 steps (3803 resets) in 58 ms. (678 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality11242980045130865695.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 30
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :30 after 68
BEST_FIRST walk for 40004 steps (3789 resets) in 56 ms. (701 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :68 after 106
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :106 after 182
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :182 after 294
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :294 after 498
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :498 after 886
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :886 after 2336
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :2336 after 11864
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :11864 after 90951
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :90951 after 444415
Interrupted probabilistic random walk after 1903307 steps, run timeout after 3001 ms. (steps per millisecond=634 ) properties seen :1 out of 2
Probabilistic random walk after 1903307 steps, saw 787160 distinct states, run finished after 3001 ms. (steps per millisecond=634 ) properties seen :1
[2024-05-21 22:52:46] [INFO ] Invariant cache hit.
[2024-05-21 22:52:46] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 131/134 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 72/206 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 53/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 15/221 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/221 variables, 11/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/221 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 303/303 variables, and 136 constraints, problems are : Problem set: 1 solved, 0 unsolved in 179 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 125/125 constraints, ReadFeed: 9/58 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 188ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[3032]
Ending property specific reduction for DBSingleClientW-PT-d2m09-UpperBounds-14 in 25285 ms.
[2024-05-21 22:52:46] [INFO ] Flatten gal took : 9 ms
[2024-05-21 22:52:46] [INFO ] Applying decomposition
[2024-05-21 22:52:46] [INFO ] Flatten gal took : 10 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/graph10968980932203350166.txt' '-o' '/tmp/graph10968980932203350166.bin' '-w' '/tmp/graph10968980932203350166.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10968980932203350166.bin' '-l' '-1' '-v' '-w' '/tmp/graph10968980932203350166.weights' '-q' '0' '-e' '0.001'
[2024-05-21 22:52:46] [INFO ] Decomposing Gal with order
[2024-05-21 22:52:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 22:52:46] [INFO ] Removed a total of 211 redundant transitions.
[2024-05-21 22:52:46] [INFO ] Flatten gal took : 96 ms
[2024-05-21 22:52:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 152 labels/synchronizations in 21 ms.
[2024-05-21 22:52:46] [INFO ] Time to serialize gal into /tmp/UpperBounds11426047887514680415.gal : 4 ms
[2024-05-21 22:52:46] [INFO ] Time to serialize properties into /tmp/UpperBounds13826953991786470652.prop : 18 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/UpperBounds11426047887514680415.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds13826953991786470652.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/UpperBounds13826953991786470652.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,2.6631e+08,235.563,2524712,4176,9820,737646,1.4219e+06,551,1.29296e+07,282,3.2909e+07,0
Total reachable state count : 266309652

Verifying 4 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d2m09-UpperBounds-00 :0 <= i0.u0.l2704 <= 1
FORMULA DBSingleClientW-PT-d2m09-UpperBounds-00 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DBSingleClientW-PT-d2m09-UpperBounds-00,0,237.003,2524712,1,0,737646,1.4219e+06,666,1.29296e+07,377,3.2909e+07,1958
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d2m09-UpperBounds-01 :0 <= i3.u8.l3022 <= 1
FORMULA DBSingleClientW-PT-d2m09-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-d2m09-UpperBounds-01,0,237.172,2524712,1,0,737646,1.4219e+06,690,1.29296e+07,382,3.2909e+07,3080
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d2m09-UpperBounds-06 :0 <= u10.p242 <= 1
FORMULA DBSingleClientW-PT-d2m09-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-d2m09-UpperBounds-06,0,237.429,2524712,1,0,737646,1.4219e+06,709,1.29296e+07,402,3.2909e+07,3232
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d2m09-UpperBounds-14 :0 <= i3.u13.l1648 <= 1
FORMULA DBSingleClientW-PT-d2m09-UpperBounds-14 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DBSingleClientW-PT-d2m09-UpperBounds-14,0,237.43,2524712,1,0,737646,1.4219e+06,727,1.29296e+07,406,3.2909e+07,3253
Total runtime 439660 ms.

BK_STOP 1716332204959

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is DBSingleClientW-PT-d2m09, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r092-tall-171624189600589"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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