Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 8.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 110K May 29 14:32 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1748604616680

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-60a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-30 11:30:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-30 11:30:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 11:30:19] [INFO ] Load time of PNML (sax parser for PT used): 189 ms
[2025-05-30 11:30:19] [INFO ] Transformed 354 places.
[2025-05-30 11:30:19] [INFO ] Transformed 311 transitions.
[2025-05-30 11:30:19] [INFO ] Found NUPN structural information;
[2025-05-30 11:30:19] [INFO ] Parsed PT model containing 354 places and 311 transitions and 1496 arcs in 436 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 17 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 297 rows 354 cols
[2025-05-30 11:30:19] [INFO ] Computed 59 invariants in 50 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (227 resets) in 115 ms. (86 steps per ms)
FORMULA DES-PT-60a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-60a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-60a-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 130011 steps (569 resets) in 425 ms. (305 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-30 11:30:20] [INFO ] Invariant cache hit.
[2025-05-30 11:30:20] [INFO ] [Real]Absence check using 34 positive place invariants in 44 ms returned sat
[2025-05-30 11:30:20] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 57 ms returned sat
[2025-05-30 11:30:21] [INFO ] [Real]Absence check using state equation in 664 ms returned sat
[2025-05-30 11:30:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 11:30:21] [INFO ] [Real]Added 1 Read/Feed constraints in 119 ms returned sat
[2025-05-30 11:30:21] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:30:22] [INFO ] [Nat]Absence check using 34 positive place invariants in 19 ms returned sat
[2025-05-30 11:30:22] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 40 ms returned sat
[2025-05-30 11:30:22] [INFO ] [Nat]Absence check using state equation in 458 ms returned sat
[2025-05-30 11:30:22] [INFO ] [Nat]Added 1 Read/Feed constraints in 95 ms returned sat
[2025-05-30 11:30:22] [INFO ] Computed and/alt/rep : 289/870/289 causal constraints (skipped 7 transitions) in 56 ms.
[2025-05-30 11:30:24] [INFO ] Added : 183 causal constraints over 38 iterations in 1961 ms. Result :sat
Minimization took 541 ms.
[2025-05-30 11:30:25] [INFO ] [Real]Absence check using 34 positive place invariants in 31 ms returned sat
[2025-05-30 11:30:25] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 35 ms returned sat
[2025-05-30 11:30:25] [INFO ] [Real]Absence check using state equation in 284 ms returned sat
[2025-05-30 11:30:25] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:30:25] [INFO ] [Nat]Absence check using 34 positive place invariants in 25 ms returned sat
[2025-05-30 11:30:25] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 33 ms returned sat
[2025-05-30 11:30:26] [INFO ] [Nat]Absence check using state equation in 236 ms returned sat
[2025-05-30 11:30:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 190 ms returned sat
[2025-05-30 11:30:26] [INFO ] Deduced a trap composed of 9 places in 235 ms of which 35 ms to minimize.
[2025-05-30 11:30:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 331 ms
[2025-05-30 11:30:26] [INFO ] Computed and/alt/rep : 289/870/289 causal constraints (skipped 7 transitions) in 135 ms.
[2025-05-30 11:30:29] [INFO ] Added : 211 causal constraints over 43 iterations in 2570 ms. Result :sat
Minimization took 522 ms.
[2025-05-30 11:30:30] [INFO ] [Real]Absence check using 34 positive place invariants in 33 ms returned sat
[2025-05-30 11:30:30] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 35 ms returned sat
[2025-05-30 11:30:30] [INFO ] [Real]Absence check using state equation in 442 ms returned sat
[2025-05-30 11:30:30] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:30:30] [INFO ] [Nat]Absence check using 34 positive place invariants in 23 ms returned sat
[2025-05-30 11:30:30] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 37 ms returned sat
[2025-05-30 11:30:31] [INFO ] [Nat]Absence check using state equation in 794 ms returned sat
[2025-05-30 11:30:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 106 ms returned sat
[2025-05-30 11:30:31] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 3 ms to minimize.
[2025-05-30 11:30:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 133 ms
[2025-05-30 11:30:31] [INFO ] Computed and/alt/rep : 289/870/289 causal constraints (skipped 7 transitions) in 62 ms.
[2025-05-30 11:30:32] [INFO ] Added : 58 causal constraints over 12 iterations in 935 ms. Result :sat
Minimization took 505 ms.
[2025-05-30 11:30:33] [INFO ] [Real]Absence check using 34 positive place invariants in 16 ms returned sat
[2025-05-30 11:30:33] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 22 ms returned sat
[2025-05-30 11:30:33] [INFO ] [Real]Absence check using state equation in 178 ms returned sat
[2025-05-30 11:30:33] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:30:33] [INFO ] [Nat]Absence check using 34 positive place invariants in 15 ms returned sat
[2025-05-30 11:30:33] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 21 ms returned sat
[2025-05-30 11:30:34] [INFO ] [Nat]Absence check using state equation in 823 ms returned sat
[2025-05-30 11:30:34] [INFO ] [Nat]Added 1 Read/Feed constraints in 158 ms returned sat
[2025-05-30 11:30:34] [INFO ] Computed and/alt/rep : 289/870/289 causal constraints (skipped 7 transitions) in 32 ms.
[2025-05-30 11:30:36] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 3 ms to minimize.
[2025-05-30 11:30:37] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 3 ms to minimize.
[2025-05-30 11:30:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 362 ms
[2025-05-30 11:30:37] [INFO ] Added : 139 causal constraints over 29 iterations in 2386 ms. Result :sat
Minimization took 513 ms.
[2025-05-30 11:30:37] [INFO ] [Real]Absence check using 34 positive place invariants in 27 ms returned sat
[2025-05-30 11:30:38] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 44 ms returned sat
[2025-05-30 11:30:38] [INFO ] [Real]Absence check using state equation in 230 ms returned sat
[2025-05-30 11:30:38] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:30:38] [INFO ] [Nat]Absence check using 34 positive place invariants in 15 ms returned sat
[2025-05-30 11:30:38] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 54 ms returned sat
[2025-05-30 11:30:38] [INFO ] [Nat]Absence check using state equation in 410 ms returned sat
[2025-05-30 11:30:38] [INFO ] [Nat]Added 1 Read/Feed constraints in 107 ms returned sat
[2025-05-30 11:30:39] [INFO ] Computed and/alt/rep : 289/870/289 causal constraints (skipped 7 transitions) in 59 ms.
[2025-05-30 11:30:40] [INFO ] Added : 210 causal constraints over 43 iterations in 1956 ms. Result :sat
Minimization took 381 ms.
[2025-05-30 11:30:41] [INFO ] [Real]Absence check using 34 positive place invariants in 14 ms returned sat
[2025-05-30 11:30:41] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 23 ms returned sat
[2025-05-30 11:30:41] [INFO ] [Real]Absence check using state equation in 200 ms returned sat
[2025-05-30 11:30:41] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:30:41] [INFO ] [Nat]Absence check using 34 positive place invariants in 17 ms returned sat
[2025-05-30 11:30:41] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 24 ms returned sat
[2025-05-30 11:30:42] [INFO ] [Nat]Absence check using state equation in 205 ms returned sat
[2025-05-30 11:30:42] [INFO ] [Nat]Added 1 Read/Feed constraints in 171 ms returned sat
[2025-05-30 11:30:42] [INFO ] Computed and/alt/rep : 289/870/289 causal constraints (skipped 7 transitions) in 33 ms.
[2025-05-30 11:30:43] [INFO ] Added : 183 causal constraints over 37 iterations in 1585 ms. Result :sat
Minimization took 409 ms.
[2025-05-30 11:30:44] [INFO ] [Real]Absence check using 34 positive place invariants in 16 ms returned sat
[2025-05-30 11:30:44] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 23 ms returned sat
[2025-05-30 11:30:44] [INFO ] [Real]Absence check using state equation in 256 ms returned sat
[2025-05-30 11:30:44] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:30:44] [INFO ] [Nat]Absence check using 34 positive place invariants in 15 ms returned sat
[2025-05-30 11:30:44] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 22 ms returned sat
[2025-05-30 11:30:45] [INFO ] [Nat]Absence check using state equation in 229 ms returned sat
[2025-05-30 11:30:45] [INFO ] [Nat]Added 1 Read/Feed constraints in 147 ms returned sat
[2025-05-30 11:30:45] [INFO ] Computed and/alt/rep : 289/870/289 causal constraints (skipped 7 transitions) in 22 ms.
[2025-05-30 11:30:46] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 2 ms to minimize.
[2025-05-30 11:30:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2025-05-30 11:30:46] [INFO ] Added : 95 causal constraints over 19 iterations in 1207 ms. Result :sat
Minimization took 327 ms.
[2025-05-30 11:30:46] [INFO ] [Real]Absence check using 34 positive place invariants in 16 ms returned sat
[2025-05-30 11:30:46] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 24 ms returned sat
[2025-05-30 11:30:47] [INFO ] [Real]Absence check using state equation in 204 ms returned sat
[2025-05-30 11:30:47] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:30:47] [INFO ] [Nat]Absence check using 34 positive place invariants in 17 ms returned sat
[2025-05-30 11:30:47] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 28 ms returned sat
[2025-05-30 11:30:47] [INFO ] [Nat]Absence check using state equation in 615 ms returned sat
[2025-05-30 11:30:48] [INFO ] [Nat]Added 1 Read/Feed constraints in 164 ms returned sat
[2025-05-30 11:30:48] [INFO ] Computed and/alt/rep : 289/870/289 causal constraints (skipped 7 transitions) in 23 ms.
[2025-05-30 11:30:48] [INFO ] Added : 76 causal constraints over 16 iterations in 647 ms. Result :sat
Minimization took 481 ms.
[2025-05-30 11:30:49] [INFO ] [Real]Absence check using 34 positive place invariants in 16 ms returned sat
[2025-05-30 11:30:49] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 24 ms returned sat
[2025-05-30 11:30:49] [INFO ] [Real]Absence check using state equation in 218 ms returned sat
[2025-05-30 11:30:49] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:30:49] [INFO ] [Nat]Absence check using 34 positive place invariants in 16 ms returned sat
[2025-05-30 11:30:49] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 23 ms returned sat
[2025-05-30 11:30:49] [INFO ] [Nat]Absence check using state equation in 202 ms returned sat
[2025-05-30 11:30:50] [INFO ] [Nat]Added 1 Read/Feed constraints in 142 ms returned sat
[2025-05-30 11:30:50] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 2 ms to minimize.
[2025-05-30 11:30:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2025-05-30 11:30:50] [INFO ] Computed and/alt/rep : 289/870/289 causal constraints (skipped 7 transitions) in 21 ms.
[2025-05-30 11:30:51] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 2 ms to minimize.
[2025-05-30 11:30:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
[2025-05-30 11:30:52] [INFO ] Added : 190 causal constraints over 38 iterations in 1798 ms. Result :sat
Minimization took 395 ms.
[2025-05-30 11:30:52] [INFO ] [Real]Absence check using 34 positive place invariants in 15 ms returned sat
[2025-05-30 11:30:52] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 25 ms returned sat
[2025-05-30 11:30:52] [INFO ] [Real]Absence check using state equation in 205 ms returned sat
[2025-05-30 11:30:52] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:30:52] [INFO ] [Nat]Absence check using 34 positive place invariants in 17 ms returned sat
[2025-05-30 11:30:52] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 26 ms returned sat
[2025-05-30 11:30:53] [INFO ] [Nat]Absence check using state equation in 202 ms returned sat
[2025-05-30 11:30:53] [INFO ] [Nat]Added 1 Read/Feed constraints in 77 ms returned sat
[2025-05-30 11:30:53] [INFO ] Computed and/alt/rep : 289/870/289 causal constraints (skipped 7 transitions) in 21 ms.
[2025-05-30 11:30:55] [INFO ] Added : 217 causal constraints over 45 iterations in 2191 ms. Result :sat
Minimization took 387 ms.
[2025-05-30 11:30:56] [INFO ] [Real]Absence check using 34 positive place invariants in 15 ms returned sat
[2025-05-30 11:30:56] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 23 ms returned sat
[2025-05-30 11:30:56] [INFO ] [Real]Absence check using state equation in 225 ms returned sat
[2025-05-30 11:30:56] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:30:56] [INFO ] [Nat]Absence check using 34 positive place invariants in 15 ms returned sat
[2025-05-30 11:30:56] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 27 ms returned sat
[2025-05-30 11:30:57] [INFO ] [Nat]Absence check using state equation in 597 ms returned sat
[2025-05-30 11:30:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 164 ms returned sat
[2025-05-30 11:30:57] [INFO ] Computed and/alt/rep : 289/870/289 causal constraints (skipped 7 transitions) in 21 ms.
[2025-05-30 11:30:57] [INFO ] Added : 62 causal constraints over 13 iterations in 619 ms. Result :sat
Minimization took 378 ms.
[2025-05-30 11:30:58] [INFO ] [Real]Absence check using 34 positive place invariants in 15 ms returned sat
[2025-05-30 11:30:58] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 23 ms returned sat
[2025-05-30 11:30:58] [INFO ] [Real]Absence check using state equation in 219 ms returned sat
[2025-05-30 11:30:58] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:30:58] [INFO ] [Nat]Absence check using 34 positive place invariants in 17 ms returned sat
[2025-05-30 11:30:58] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 27 ms returned sat
[2025-05-30 11:30:59] [INFO ] [Nat]Absence check using state equation in 613 ms returned sat
[2025-05-30 11:30:59] [INFO ] [Nat]Added 1 Read/Feed constraints in 117 ms returned sat
[2025-05-30 11:30:59] [INFO ] Computed and/alt/rep : 289/870/289 causal constraints (skipped 7 transitions) in 22 ms.
[2025-05-30 11:31:00] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 5 ms to minimize.
[2025-05-30 11:31:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
[2025-05-30 11:31:00] [INFO ] Added : 123 causal constraints over 25 iterations in 1370 ms. Result :sat
Minimization took 501 ms.
[2025-05-30 11:31:01] [INFO ] [Real]Absence check using 34 positive place invariants in 17 ms returned sat
[2025-05-30 11:31:01] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 21 ms returned sat
[2025-05-30 11:31:01] [INFO ] [Real]Absence check using state equation in 258 ms returned sat
[2025-05-30 11:31:01] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:31:01] [INFO ] [Nat]Absence check using 34 positive place invariants in 21 ms returned sat
[2025-05-30 11:31:01] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 27 ms returned sat
[2025-05-30 11:31:02] [INFO ] [Nat]Absence check using state equation in 361 ms returned sat
[2025-05-30 11:31:02] [INFO ] [Nat]Added 1 Read/Feed constraints in 32 ms returned sat
[2025-05-30 11:31:02] [INFO ] Deduced a trap composed of 12 places in 188 ms of which 8 ms to minimize.
[2025-05-30 11:31:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 229 ms
[2025-05-30 11:31:02] [INFO ] Computed and/alt/rep : 289/870/289 causal constraints (skipped 7 transitions) in 30 ms.
[2025-05-30 11:31:04] [INFO ] Added : 173 causal constraints over 35 iterations in 1784 ms. Result :sat
Minimization took 501 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA DES-PT-60a-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-60a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-60a-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-60a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-60a-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-60a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-60a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-60a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 354 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 354/354 places, 297/297 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 354 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 353 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 353 transition count 294
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 10 place count 353 transition count 294
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 352 transition count 293
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 351 transition count 293
Applied a total of 12 rules in 198 ms. Remains 351 /354 variables (removed 3) and now considering 293/297 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 217 ms. Remains : 351/354 places, 293/297 transitions.
// Phase 1: matrix 293 rows 351 cols
[2025-05-30 11:31:09] [INFO ] Computed 60 invariants in 30 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (13733 resets) in 2390 ms. (418 steps per ms)
BEST_FIRST walk for 5000005 steps (11383 resets) in 5457 ms. (916 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
[2025-05-30 11:31:16] [INFO ] Invariant cache hit.
[2025-05-30 11:31:16] [INFO ] [Real]Absence check using 35 positive place invariants in 12 ms returned sat
[2025-05-30 11:31:16] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 24 ms returned sat
[2025-05-30 11:31:17] [INFO ] [Real]Absence check using state equation in 192 ms returned sat
[2025-05-30 11:31:17] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:31:17] [INFO ] [Nat]Absence check using 35 positive place invariants in 11 ms returned sat
[2025-05-30 11:31:17] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 58 ms returned sat
[2025-05-30 11:31:17] [INFO ] [Nat]Absence check using state equation in 198 ms returned sat
[2025-05-30 11:31:17] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-30 11:31:17] [INFO ] [Nat]Added 2 Read/Feed constraints in 18 ms returned sat
[2025-05-30 11:31:17] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 31 ms.
[2025-05-30 11:31:18] [INFO ] Added : 207 causal constraints over 42 iterations in 1194 ms. Result :sat
Minimization took 250 ms.
[2025-05-30 11:31:19] [INFO ] [Real]Absence check using 35 positive place invariants in 12 ms returned sat
[2025-05-30 11:31:19] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 27 ms returned sat
[2025-05-30 11:31:19] [INFO ] [Real]Absence check using state equation in 235 ms returned sat
[2025-05-30 11:31:19] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:31:19] [INFO ] [Nat]Absence check using 35 positive place invariants in 13 ms returned sat
[2025-05-30 11:31:19] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 24 ms returned sat
[2025-05-30 11:31:19] [INFO ] [Nat]Absence check using state equation in 212 ms returned sat
[2025-05-30 11:31:19] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2025-05-30 11:31:19] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 23 ms.
[2025-05-30 11:31:21] [INFO ] Deduced a trap composed of 10 places in 127 ms of which 7 ms to minimize.
[2025-05-30 11:31:21] [INFO ] Deduced a trap composed of 60 places in 123 ms of which 5 ms to minimize.
[2025-05-30 11:31:21] [INFO ] Deduced a trap composed of 15 places in 144 ms of which 3 ms to minimize.
[2025-05-30 11:31:21] [INFO ] Deduced a trap composed of 17 places in 134 ms of which 2 ms to minimize.
[2025-05-30 11:31:21] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 688 ms
[2025-05-30 11:31:21] [INFO ] Added : 263 causal constraints over 53 iterations in 2150 ms. Result :sat
Minimization took 304 ms.
[2025-05-30 11:31:22] [INFO ] [Real]Absence check using 35 positive place invariants in 19 ms returned sat
[2025-05-30 11:31:22] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 42 ms returned sat
[2025-05-30 11:31:22] [INFO ] [Real]Absence check using state equation in 450 ms returned sat
[2025-05-30 11:31:22] [INFO ] [Real]Added 2 Read/Feed constraints in 42 ms returned sat
[2025-05-30 11:31:22] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:31:23] [INFO ] [Nat]Absence check using 35 positive place invariants in 21 ms returned sat
[2025-05-30 11:31:23] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 78 ms returned sat
[2025-05-30 11:31:23] [INFO ] [Nat]Absence check using state equation in 262 ms returned sat
[2025-05-30 11:31:23] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2025-05-30 11:31:23] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 48 ms.
[2025-05-30 11:31:25] [INFO ] Deduced a trap composed of 60 places in 56 ms of which 2 ms to minimize.
[2025-05-30 11:31:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2025-05-30 11:31:25] [INFO ] Added : 268 causal constraints over 55 iterations in 2145 ms. Result :sat
Minimization took 240 ms.
[2025-05-30 11:31:26] [INFO ] [Real]Absence check using 35 positive place invariants in 12 ms returned sat
[2025-05-30 11:31:26] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 24 ms returned sat
[2025-05-30 11:31:26] [INFO ] [Real]Absence check using state equation in 213 ms returned sat
[2025-05-30 11:31:26] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:31:26] [INFO ] [Nat]Absence check using 35 positive place invariants in 12 ms returned sat
[2025-05-30 11:31:26] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 111 ms returned sat
[2025-05-30 11:31:26] [INFO ] [Nat]Absence check using state equation in 269 ms returned sat
[2025-05-30 11:31:26] [INFO ] [Nat]Added 2 Read/Feed constraints in 14 ms returned sat
[2025-05-30 11:31:26] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 31 ms.
[2025-05-30 11:31:28] [INFO ] Deduced a trap composed of 10 places in 231 ms of which 5 ms to minimize.
[2025-05-30 11:31:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 298 ms
[2025-05-30 11:31:28] [INFO ] Added : 224 causal constraints over 45 iterations in 1885 ms. Result :sat
Minimization took 384 ms.
[2025-05-30 11:31:29] [INFO ] [Real]Absence check using 35 positive place invariants in 19 ms returned sat
[2025-05-30 11:31:29] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 40 ms returned sat
[2025-05-30 11:31:29] [INFO ] [Real]Absence check using state equation in 355 ms returned sat
[2025-05-30 11:31:29] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:31:29] [INFO ] [Nat]Absence check using 35 positive place invariants in 19 ms returned sat
[2025-05-30 11:31:29] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 81 ms returned sat
[2025-05-30 11:31:30] [INFO ] [Nat]Absence check using state equation in 338 ms returned sat
[2025-05-30 11:31:30] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2025-05-30 11:31:30] [INFO ] Computed and/alt/rep : 284/470/284 causal constraints (skipped 6 transitions) in 41 ms.
[2025-05-30 11:31:31] [INFO ] Added : 170 causal constraints over 34 iterations in 1448 ms. Result :sat
Minimization took 409 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 27 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 351/351 places, 293/293 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 31 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2025-05-30 11:31:35] [INFO ] Invariant cache hit.
[2025-05-30 11:31:36] [INFO ] Implicit Places using invariants in 599 ms returned []
[2025-05-30 11:31:36] [INFO ] Invariant cache hit.
[2025-05-30 11:31:36] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-30 11:31:37] [INFO ] Implicit Places using invariants and state equation in 1304 ms returned []
Implicit Place search using SMT with State Equation took 1906 ms to find 0 implicit places.
[2025-05-30 11:31:37] [INFO ] Redundant transitions in 19 ms returned []
Running 290 sub problems to find dead transitions.
[2025-05-30 11:31:37] [INFO ] Invariant cache hit.
[2025-05-30 11:31:37] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/348 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/348 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/348 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 290 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/350 variables, 8/60 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/350 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (OVERLAPS) 293/643 variables, 350/410 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/643 variables, 2/412 constraints. Problems are: Problem set: 0 solved, 290 unsolved
[2025-05-30 11:31:49] [INFO ] Deduced a trap composed of 12 places in 110 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/643 variables, 1/413 constraints. Problems are: Problem set: 0 solved, 290 unsolved
[2025-05-30 11:31:56] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/643 variables, 1/414 constraints. Problems are: Problem set: 0 solved, 290 unsolved
[2025-05-30 11:32:00] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 2 ms to minimize.
[2025-05-30 11:32:04] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/643 variables, 2/416 constraints. Problems are: Problem set: 0 solved, 290 unsolved
[2025-05-30 11:32:07] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 643/644 variables, and 417 constraints, problems are : Problem set: 0 solved, 290 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 350/351 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 290 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/348 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/348 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/348 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/348 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (OVERLAPS) 2/350 variables, 8/63 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/350 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/350 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 7 (OVERLAPS) 293/643 variables, 350/415 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/643 variables, 2/417 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/643 variables, 290/707 constraints. Problems are: Problem set: 0 solved, 290 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 643/644 variables, and 707 constraints, problems are : Problem set: 0 solved, 290 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 350/351 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 5/5 constraints]
After SMT, in 60602ms problems are : Problem set: 0 solved, 290 unsolved
Search for dead transitions found 0 dead transitions in 60625ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62609 ms. Remains : 351/351 places, 293/293 transitions.
RANDOM walk for 40000 steps (554 resets) in 2652 ms. (15 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (92 resets) in 279 ms. (142 steps per ms) remains 10/10 properties
[2025-05-30 11:32:39] [INFO ] Flatten gal took : 274 ms
BEST_FIRST walk for 40003 steps (88 resets) in 244 ms. (163 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (93 resets) in 191 ms. (208 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (94 resets) in 173 ms. (229 steps per ms) remains 10/10 properties
[2025-05-30 11:32:39] [INFO ] Flatten gal took : 179 ms
BEST_FIRST walk for 40002 steps (92 resets) in 250 ms. (159 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (78 resets) in 219 ms. (181 steps per ms) remains 10/10 properties
[2025-05-30 11:32:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16902504696316139732.gal : 71 ms
[2025-05-30 11:32:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3996352664243549076.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/ReachabilityCardinality16902504696316139732.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3996352664243549076.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40001 steps (80 resets) in 189 ms. (210 steps per ms) remains 10/10 properties

BEST_FIRST walk for 40003 steps (86 resets) in 133 ms. (298 steps per ms) remains 10/10 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 (101 resets) in 170 ms. (233 steps per ms) remains 10/10 properties
Loading property file /tmp/ReachabilityCardinality3996352664243549076.prop.
BEST_FIRST walk for 40004 steps (94 resets) in 139 ms. (285 steps per ms) remains 10/10 properties
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :4 after 8
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :8 after 20
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :20 after 36
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :36 after 44
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :44 after 624
SDD proceeding with computation,10 properties remain. new max is 512
SDD size :624 after 676
SDD proceeding with computation,10 properties remain. new max is 1024
SDD size :676 after 3028
SDD proceeding with computation,10 properties remain. new max is 2048
SDD size :3028 after 19204
SDD proceeding with computation,10 properties remain. new max is 4096
SDD size :19204 after 78688
SDD proceeding with computation,10 properties remain. new max is 8192
SDD size :78688 after 84712
Interrupted probabilistic random walk after 400482 steps, run timeout after 3001 ms. (steps per millisecond=133 ) properties seen :0 out of 10
Probabilistic random walk after 400482 steps, saw 59075 distinct states, run finished after 3006 ms. (steps per millisecond=133 ) properties seen :0
[2025-05-30 11:32:42] [INFO ] Invariant cache hit.
[2025-05-30 11:32:42] [INFO ] State equation strengthened by 2 read => feed constraints.
SDD proceeding with computation,10 properties remain. new max is 16384
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
SDD size :364744 after 1.60049e+08
At refinement iteration 1 (OVERLAPS) 210/215 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 33/248 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/248 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 25/273 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 7/280 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/280 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 230/510 variables, 280/335 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/510 variables, 2/337 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2025-05-30 11:32:44] [INFO ] Deduced a trap composed of 8 places in 339 ms of which 3 ms to minimize.
[2025-05-30 11:32:44] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 2 ms to minimize.
[2025-05-30 11:32:44] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/510 variables, 3/340 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2025-05-30 11:32:44] [INFO ] Deduced a trap composed of 16 places in 144 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/510 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/510 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 12/522 variables, 8/349 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/522 variables, 3/352 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/522 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (OVERLAPS) 1/523 variables, 1/353 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/523 variables, 1/354 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/523 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 20 (OVERLAPS) 62/585 variables, 3/357 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/585 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/585 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 23 (OVERLAPS) 59/644 variables, 59/417 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/644 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 25 (OVERLAPS) 0/644 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 644/644 variables, and 417 constraints, problems are : Problem set: 0 solved, 10 unsolved in 4120 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 351/351 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 210/215 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 33/248 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/248 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 25/273 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 7/280 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/280 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 230/510 variables, 280/339 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/510 variables, 2/341 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/510 variables, 10/351 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/510 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 12/522 variables, 8/359 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/522 variables, 3/362 constraints. Problems are: Problem set: 0 solved, 10 unsolved
SDD proceeding with computation,10 properties remain. new max is 32768
At refinement iteration 16 (INCLUDED_ONLY) 0/522 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 10 unsolved
SDD size :1.60049e+08 after 2.41645e+08
At refinement iteration 17 (OVERLAPS) 1/523 variables, 1/363 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/523 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2025-05-30 11:32:49] [INFO ] Deduced a trap composed of 22 places in 219 ms of which 3 ms to minimize.
[2025-05-30 11:32:49] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/523 variables, 2/366 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2025-05-30 11:32:50] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/523 variables, 1/367 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/523 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 22 (OVERLAPS) 62/585 variables, 3/370 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/585 variables, 1/371 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 585/644 variables, and 371 constraints, problems are : Problem set: 0 solved, 10 unsolved in 5014 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 292/351 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 7/7 constraints]
After SMT, in 9146ms problems are : Problem set: 0 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 27 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 351/351 places, 293/293 transitions.
RANDOM walk for 40000 steps (547 resets) in 993 ms. (40 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (91 resets) in 205 ms. (194 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (92 resets) in 136 ms. (291 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (91 resets) in 109 ms. (363 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (96 resets) in 95 ms. (416 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (88 resets) in 80 ms. (493 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (83 resets) in 114 ms. (347 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (77 resets) in 129 ms. (307 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (93 resets) in 118 ms. (336 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (94 resets) in 116 ms. (341 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (87 resets) in 118 ms. (336 steps per ms) remains 10/10 properties
SDD proceeding with computation,10 properties remain. new max is 65536
SDD size :2.41645e+08 after 6.78415e+08
Interrupted probabilistic random walk after 347098 steps, run timeout after 3001 ms. (steps per millisecond=115 ) properties seen :0 out of 10
Probabilistic random walk after 347098 steps, saw 51843 distinct states, run finished after 3002 ms. (steps per millisecond=115 ) properties seen :0
[2025-05-30 11:32:56] [INFO ] Invariant cache hit.
[2025-05-30 11:32:56] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 210/215 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 33/248 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/248 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 25/273 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 7/280 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/280 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 230/510 variables, 280/335 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/510 variables, 2/337 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2025-05-30 11:32:56] [INFO ] Deduced a trap composed of 8 places in 99 ms of which 2 ms to minimize.
[2025-05-30 11:32:57] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 2 ms to minimize.
[2025-05-30 11:32:57] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/510 variables, 3/340 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2025-05-30 11:32:57] [INFO ] Deduced a trap composed of 16 places in 124 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/510 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/510 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 12/522 variables, 8/349 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/522 variables, 3/352 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/522 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (OVERLAPS) 1/523 variables, 1/353 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/523 variables, 1/354 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/523 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 20 (OVERLAPS) 62/585 variables, 3/357 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/585 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/585 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 23 (OVERLAPS) 59/644 variables, 59/417 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/644 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 25 (OVERLAPS) 0/644 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 644/644 variables, and 417 constraints, problems are : Problem set: 0 solved, 10 unsolved in 3978 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 351/351 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 210/215 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 33/248 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/248 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 25/273 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 7/280 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/280 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 230/510 variables, 280/339 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/510 variables, 2/341 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/510 variables, 10/351 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/510 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 12/522 variables, 8/359 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/522 variables, 3/362 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/522 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (OVERLAPS) 1/523 variables, 1/363 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/523 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2025-05-30 11:33:02] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 2 ms to minimize.
[2025-05-30 11:33:02] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/523 variables, 2/366 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2025-05-30 11:33:03] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/523 variables, 1/367 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/523 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 22 (OVERLAPS) 62/585 variables, 3/370 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/585 variables, 1/371 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/585 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 25 (OVERLAPS) 59/644 variables, 59/430 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/644 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 27 (OVERLAPS) 0/644 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 644/644 variables, and 430 constraints, problems are : Problem set: 0 solved, 10 unsolved in 5864 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 351/351 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 7/7 constraints]
After SMT, in 9863ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 5 different solutions.
SDD proceeding with computation,10 properties remain. new max is 131072
SDD size :7.29588e+08 after 7.96509e+09
Finished Parikh walk after 77770 steps, including 220 resets, run visited all 2 properties in 799 ms. (steps per millisecond=97 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 10 properties in 10703 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA DES-PT-60a-UpperBounds-11 1 TECHNIQUES REACHABILITY_MAX
FORMULA DES-PT-60a-UpperBounds-08 1 TECHNIQUES REACHABILITY_MAX
FORMULA DES-PT-60a-UpperBounds-05 1 TECHNIQUES REACHABILITY_MAX
FORMULA DES-PT-60a-UpperBounds-01 1 TECHNIQUES REACHABILITY_MAX
FORMULA DES-PT-60a-UpperBounds-00 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 5 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 177805 ms.

BK_STOP 1748604796732

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool gold2024"
echo " Input is DES-PT-60a, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r069-smll-174854075900046"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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