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.r083-tall-174860079700059.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 DoubleExponent-PT-002, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r083-tall-174860079700059
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K 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 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 174K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 129K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 33K 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 DoubleExponent-PT-002-UpperBounds-00
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-01
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-02
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-03
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-04
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-05
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-06
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-07
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-08
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-09
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-10
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-11
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-12
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-13
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-14
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748730965184

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-002
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-31 22:36:06] [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-31 22:36:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 22:36:06] [INFO ] Load time of PNML (sax parser for PT used): 51 ms
[2025-05-31 22:36:06] [INFO ] Transformed 110 places.
[2025-05-31 22:36:06] [INFO ] Transformed 98 transitions.
[2025-05-31 22:36:06] [INFO ] Parsed PT model containing 110 places and 98 transitions and 276 arcs in 153 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 98 rows 110 cols
[2025-05-31 22:36:06] [INFO ] Computed 14 invariants in 17 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, 6, +inf, 1, 1, 1, 1, 1, 2, +inf, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (324 resets) in 34 ms. (285 steps per ms)
FORMULA DoubleExponent-PT-002-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-002-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-002-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-002-UpperBounds-08 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-002-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-002-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-002-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90000 steps (2567 resets) in 111 ms. (803 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 4, 0, 0, 0, 0, 0, 0] Max Struct:[1, 6, +inf, 1, 1, +inf, 1, 1, 1]
[2025-05-31 22:36:06] [INFO ] Invariant cache hit.
[2025-05-31 22:36:07] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2025-05-31 22:36:07] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 5 ms returned sat
[2025-05-31 22:36:07] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2025-05-31 22:36:07] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 8 ms to minimize.
[2025-05-31 22:36:07] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:36:07] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2025-05-31 22:36:07] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 2 ms returned sat
[2025-05-31 22:36:07] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2025-05-31 22:36:07] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
[2025-05-31 22:36:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2025-05-31 22:36:07] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints (skipped 0 transitions) in 9 ms.
[2025-05-31 22:36:07] [INFO ] Added : 87 causal constraints over 18 iterations in 384 ms. Result :sat
Minimization took 155 ms.
[2025-05-31 22:36:07] [INFO ] [Real]Absence check using 5 positive place invariants in 22 ms returned sat
[2025-05-31 22:36:07] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 13 ms returned sat
[2025-05-31 22:36:08] [INFO ] [Real]Absence check using state equation in 103 ms returned sat
[2025-05-31 22:36:08] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 1 ms to minimize.
[2025-05-31 22:36:08] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:36:08] [INFO ] [Nat]Absence check using 5 positive place invariants in 45 ms returned sat
[2025-05-31 22:36:08] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 9 ms returned sat
[2025-05-31 22:36:08] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2025-05-31 22:36:08] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2025-05-31 22:36:08] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2025-05-31 22:36:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 126 ms
[2025-05-31 22:36:08] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints (skipped 0 transitions) in 6 ms.
[2025-05-31 22:36:08] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 1 ms to minimize.
[2025-05-31 22:36:08] [INFO ] Deduced a trap composed of 44 places in 61 ms of which 1 ms to minimize.
[2025-05-31 22:36:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 146 ms
[2025-05-31 22:36:08] [INFO ] Added : 94 causal constraints over 19 iterations in 359 ms. Result :sat
Minimization took 72 ms.
[2025-05-31 22:36:08] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-05-31 22:36:08] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 2 ms returned sat
[2025-05-31 22:36:09] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2025-05-31 22:36:09] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:36:09] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2025-05-31 22:36:09] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 5 ms returned sat
[2025-05-31 22:36:09] [INFO ] [Nat]Absence check using state equation in 309 ms returned sat
[2025-05-31 22:36:09] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 2 ms to minimize.
[2025-05-31 22:36:09] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2025-05-31 22:36:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 109 ms
[2025-05-31 22:36:09] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints (skipped 0 transitions) in 6 ms.
[2025-05-31 22:36:09] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2025-05-31 22:36:09] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 1 ms to minimize.
[2025-05-31 22:36:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 137 ms
[2025-05-31 22:36:09] [INFO ] Added : 94 causal constraints over 20 iterations in 434 ms. Result :sat
Minimization took 83 ms.
[2025-05-31 22:36:10] [INFO ] [Real]Absence check using 5 positive place invariants in 11 ms returned sat
[2025-05-31 22:36:10] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 2 ms returned sat
[2025-05-31 22:36:10] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2025-05-31 22:36:10] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
[2025-05-31 22:36:10] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:36:10] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2025-05-31 22:36:10] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 2 ms returned sat
[2025-05-31 22:36:10] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2025-05-31 22:36:10] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2025-05-31 22:36:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2025-05-31 22:36:10] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints (skipped 0 transitions) in 7 ms.
[2025-05-31 22:36:10] [INFO ] Added : 96 causal constraints over 20 iterations in 198 ms. Result :sat
Minimization took 71 ms.
[2025-05-31 22:36:10] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2025-05-31 22:36:10] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 6 ms returned sat
[2025-05-31 22:36:10] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2025-05-31 22:36:10] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 0 ms to minimize.
[2025-05-31 22:36:10] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:36:10] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2025-05-31 22:36:10] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 2 ms returned sat
[2025-05-31 22:36:10] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2025-05-31 22:36:10] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2025-05-31 22:36:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2025-05-31 22:36:10] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints (skipped 0 transitions) in 5 ms.
[2025-05-31 22:36:10] [INFO ] Added : 95 causal constraints over 20 iterations in 179 ms. Result :sat
Minimization took 78 ms.
[2025-05-31 22:36:11] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-05-31 22:36:11] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 2 ms returned sat
[2025-05-31 22:36:11] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2025-05-31 22:36:11] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2025-05-31 22:36:11] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:36:11] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-05-31 22:36:11] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 2 ms returned sat
[2025-05-31 22:36:11] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2025-05-31 22:36:11] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2025-05-31 22:36:11] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
[2025-05-31 22:36:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 105 ms
[2025-05-31 22:36:11] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints (skipped 0 transitions) in 8 ms.
[2025-05-31 22:36:11] [INFO ] Deduced a trap composed of 41 places in 46 ms of which 1 ms to minimize.
[2025-05-31 22:36:11] [INFO ] Deduced a trap composed of 61 places in 40 ms of which 1 ms to minimize.
[2025-05-31 22:36:11] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 1 ms to minimize.
[2025-05-31 22:36:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 179 ms
[2025-05-31 22:36:11] [INFO ] Added : 93 causal constraints over 19 iterations in 349 ms. Result :sat
Minimization took 91 ms.
[2025-05-31 22:36:11] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-05-31 22:36:11] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 3 ms returned sat
[2025-05-31 22:36:11] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2025-05-31 22:36:11] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2025-05-31 22:36:11] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:36:11] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-05-31 22:36:11] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 2 ms returned sat
[2025-05-31 22:36:12] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2025-05-31 22:36:12] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2025-05-31 22:36:12] [INFO ] Deduced a trap composed of 54 places in 36 ms of which 1 ms to minimize.
[2025-05-31 22:36:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 85 ms
[2025-05-31 22:36:12] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints (skipped 0 transitions) in 5 ms.
[2025-05-31 22:36:12] [INFO ] Added : 81 causal constraints over 17 iterations in 143 ms. Result :sat
Minimization took 66 ms.
[2025-05-31 22:36:12] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-05-31 22:36:12] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 3 ms returned sat
[2025-05-31 22:36:12] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2025-05-31 22:36:12] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2025-05-31 22:36:12] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:36:12] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-05-31 22:36:12] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 2 ms returned sat
[2025-05-31 22:36:12] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2025-05-31 22:36:12] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 0 ms to minimize.
[2025-05-31 22:36:12] [INFO ] Deduced a trap composed of 44 places in 34 ms of which 1 ms to minimize.
[2025-05-31 22:36:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 90 ms
[2025-05-31 22:36:12] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints (skipped 0 transitions) in 5 ms.
[2025-05-31 22:36:12] [INFO ] Added : 90 causal constraints over 19 iterations in 160 ms. Result :sat
Minimization took 76 ms.
[2025-05-31 22:36:12] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-05-31 22:36:12] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned sat
[2025-05-31 22:36:12] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2025-05-31 22:36:12] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 1 ms to minimize.
[2025-05-31 22:36:12] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:36:13] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-05-31 22:36:13] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 2 ms returned sat
[2025-05-31 22:36:13] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2025-05-31 22:36:13] [INFO ] Deduced a trap composed of 30 places in 28 ms of which 1 ms to minimize.
[2025-05-31 22:36:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2025-05-31 22:36:13] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints (skipped 0 transitions) in 7 ms.
[2025-05-31 22:36:13] [INFO ] Added : 91 causal constraints over 19 iterations in 176 ms. Result :sat
Minimization took 73 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 4, 0, 0, 0, 0, 0, 0] Max Struct:[1, 6, +inf, 1, 1, +inf, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 4, 0, 0, 0, 0, 0, 0] Max Struct:[1, 6, +inf, 1, 1, +inf, 1, 1, 1]
Support contains 9 out of 110 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 110/110 places, 98/98 transitions.
Graph (complete) has 178 edges and 110 vertex of which 107 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 107 transition count 83
Reduce places removed 15 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 17 rules applied. Total rules applied 33 place count 92 transition count 81
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 35 place count 90 transition count 81
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 35 place count 90 transition count 76
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 45 place count 85 transition count 76
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 85 place count 65 transition count 56
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 89 place count 63 transition count 56
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 95 place count 63 transition count 50
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 101 place count 57 transition count 50
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 105 place count 57 transition count 50
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 106 place count 56 transition count 49
Applied a total of 106 rules in 66 ms. Remains 56 /110 variables (removed 54) and now considering 49/98 (removed 49) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 56/110 places, 49/98 transitions.
Found an invariant !
This invariant on transitions {1=1, 2=1, 3=1, 19=1, 20=1, 21=1, 36=1, 37=1, 46=1, 47=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {1=1, 2=1, 3=1, 19=1, 20=1, 21=1, 36=1, 37=1, 46=1, 47=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1125 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 9) seen :[1, 0, 4, 0, 0, 1, 1, 1, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[1, 0, 4, 0, 0, 1, 1, 1, 0] Max Struct:[1, 6, +inf, 1, 1, +inf, 1, 1, 1]
// Phase 1: matrix 49 rows 56 cols
[2025-05-31 22:36:13] [INFO ] Computed 11 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 4, 0, 0, 1, 1, 1, 0] Max Struct:[1, 6, +inf, 1, 1, +inf, 1, 1, 1]
FORMULA DoubleExponent-PT-002-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (112670 resets) in 681 ms. (1466 steps per ms)
BEST_FIRST walk for 6000003 steps (465978 resets) in 2741 ms. (2188 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 4, 0, 0, 4, 0] Max Struct:[6, +inf, 1, 1, +inf, 1]
[2025-05-31 22:36:17] [INFO ] Invariant cache hit.
[2025-05-31 22:36:17] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-05-31 22:36:17] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 1 ms returned sat
[2025-05-31 22:36:17] [INFO ] [Real]Absence check using state equation in 11 ms returned unsat
[2025-05-31 22:36:17] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-05-31 22:36:17] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2025-05-31 22:36:17] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2025-05-31 22:36:17] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:36:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-05-31 22:36:17] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2025-05-31 22:36:17] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2025-05-31 22:36:17] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-31 22:36:17] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2025-05-31 22:36:17] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2025-05-31 22:36:17] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
[2025-05-31 22:36:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 73 ms
[2025-05-31 22:36:17] [INFO ] Computed and/alt/rep : 48/159/48 causal constraints (skipped 0 transitions) in 4 ms.
[2025-05-31 22:36:17] [INFO ] Added : 14 causal constraints over 4 iterations in 27 ms. Result :sat
Minimization took 15 ms.
[2025-05-31 22:36:17] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-05-31 22:36:17] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2025-05-31 22:36:17] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-05-31 22:36:17] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-05-31 22:36:17] [INFO ] Computed and/alt/rep : 48/159/48 causal constraints (skipped 0 transitions) in 4 ms.
[2025-05-31 22:36:17] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:36:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-05-31 22:36:17] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 1 ms returned sat
[2025-05-31 22:36:17] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-05-31 22:36:17] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-05-31 22:36:17] [INFO ] Computed and/alt/rep : 48/159/48 causal constraints (skipped 0 transitions) in 4 ms.
[2025-05-31 22:36:17] [INFO ] Added : 46 causal constraints over 10 iterations in 78 ms. Result :sat
Minimization took 28 ms.
[2025-05-31 22:36:17] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2025-05-31 22:36:17] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2025-05-31 22:36:17] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2025-05-31 22:36:17] [INFO ] [Real]Added 3 Read/Feed constraints in 4 ms returned sat
[2025-05-31 22:36:17] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:36:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-05-31 22:36:17] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2025-05-31 22:36:17] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2025-05-31 22:36:17] [INFO ] [Nat]Added 3 Read/Feed constraints in 4 ms returned sat
[2025-05-31 22:36:17] [INFO ] Computed and/alt/rep : 48/159/48 causal constraints (skipped 0 transitions) in 7 ms.
[2025-05-31 22:36:18] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2025-05-31 22:36:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2025-05-31 22:36:18] [INFO ] Added : 41 causal constraints over 9 iterations in 95 ms. Result :sat
Minimization took 22 ms.
[2025-05-31 22:36:18] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-05-31 22:36:18] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 1 ms returned sat
[2025-05-31 22:36:18] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2025-05-31 22:36:18] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:36:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-05-31 22:36:18] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2025-05-31 22:36:18] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2025-05-31 22:36:18] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2025-05-31 22:36:18] [INFO ] Computed and/alt/rep : 48/159/48 causal constraints (skipped 0 transitions) in 3 ms.
[2025-05-31 22:36:18] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2025-05-31 22:36:18] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2025-05-31 22:36:18] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 8 ms to minimize.
[2025-05-31 22:36:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 137 ms
[2025-05-31 22:36:18] [INFO ] Added : 43 causal constraints over 9 iterations in 186 ms. Result :sat
Minimization took 20 ms.
[2025-05-31 22:36:18] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-05-31 22:36:18] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2025-05-31 22:36:18] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2025-05-31 22:36:18] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-05-31 22:36:18] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:36:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-05-31 22:36:18] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 1 ms returned sat
[2025-05-31 22:36:18] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-05-31 22:36:18] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2025-05-31 22:36:18] [INFO ] Computed and/alt/rep : 48/159/48 causal constraints (skipped 0 transitions) in 3 ms.
[2025-05-31 22:36:18] [INFO ] Added : 40 causal constraints over 8 iterations in 45 ms. Result :sat
Minimization took 21 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 4, 0, 0, 4, 0] Max Struct:[1, +inf, 1, 1, +inf, 1]
FORMULA DoubleExponent-PT-002-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4, 0, 0, 4, 0] Max Struct:[+inf, 1, 1, +inf, 1]
Support contains 5 out of 56 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 56/56 places, 49/49 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 56 transition count 48
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 55 transition count 48
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 54 transition count 47
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 54 transition count 47
Applied a total of 7 rules in 18 ms. Remains 54 /56 variables (removed 2) and now considering 47/49 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 54/56 places, 47/49 transitions.
Found an invariant !
This invariant on transitions {1=1, 2=1, 3=1, 13=1, 14=1, 15=1, 29=1, 30=1, 39=1, 40=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {1=1, 2=1, 3=1, 13=1, 14=1, 15=1, 29=1, 30=1, 39=1, 40=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1132 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :[4, 0, 0, 4, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[4, 0, 0, 4, 0] Max Struct:[+inf, 1, 1, +inf, 1]
// Phase 1: matrix 47 rows 54 cols
[2025-05-31 22:36:18] [INFO ] Computed 11 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[4, 0, 0, 4, 0] Max Struct:[+inf, 1, 1, +inf, 1]
RANDOM walk for 1000000 steps (112783 resets) in 589 ms. (1694 steps per ms)
BEST_FIRST walk for 5000003 steps (388686 resets) in 2176 ms. (2296 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 0, 0, 4, 0] Max Struct:[+inf, 1, 1, +inf, 1]
[2025-05-31 22:36:21] [INFO ] Invariant cache hit.
[2025-05-31 22:36:21] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-05-31 22:36:21] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 1 ms returned sat
[2025-05-31 22:36:21] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2025-05-31 22:36:21] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-31 22:36:21] [INFO ] [Real]Added 3 Read/Feed constraints in 3 ms returned sat
[2025-05-31 22:36:21] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:36:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-05-31 22:36:21] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2025-05-31 22:36:21] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2025-05-31 22:36:21] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2025-05-31 22:36:21] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2025-05-31 22:36:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2025-05-31 22:36:21] [INFO ] Computed and/alt/rep : 46/170/46 causal constraints (skipped 0 transitions) in 3 ms.
[2025-05-31 22:36:21] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2025-05-31 22:36:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2025-05-31 22:36:21] [INFO ] Added : 39 causal constraints over 8 iterations in 95 ms. Result :sat
Minimization took 18 ms.
[2025-05-31 22:36:21] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-05-31 22:36:21] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2025-05-31 22:36:21] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2025-05-31 22:36:21] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-05-31 22:36:21] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:36:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-05-31 22:36:21] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 3 ms returned sat
[2025-05-31 22:36:21] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2025-05-31 22:36:21] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-05-31 22:36:21] [INFO ] Computed and/alt/rep : 46/170/46 causal constraints (skipped 0 transitions) in 3 ms.
[2025-05-31 22:36:21] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2025-05-31 22:36:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2025-05-31 22:36:21] [INFO ] Added : 44 causal constraints over 10 iterations in 111 ms. Result :sat
Minimization took 25 ms.
[2025-05-31 22:36:22] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-05-31 22:36:22] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2025-05-31 22:36:22] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2025-05-31 22:36:22] [INFO ] [Real]Added 3 Read/Feed constraints in 2 ms returned sat
[2025-05-31 22:36:22] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:36:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-05-31 22:36:22] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2025-05-31 22:36:22] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2025-05-31 22:36:22] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2025-05-31 22:36:22] [INFO ] Computed and/alt/rep : 46/170/46 causal constraints (skipped 0 transitions) in 3 ms.
[2025-05-31 22:36:22] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2025-05-31 22:36:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2025-05-31 22:36:22] [INFO ] Added : 39 causal constraints over 10 iterations in 108 ms. Result :sat
Minimization took 24 ms.
[2025-05-31 22:36:22] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-05-31 22:36:22] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 4 ms returned sat
[2025-05-31 22:36:22] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-05-31 22:36:22] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:36:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-05-31 22:36:22] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 1 ms returned sat
[2025-05-31 22:36:22] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2025-05-31 22:36:22] [INFO ] [Nat]Added 3 Read/Feed constraints in 4 ms returned sat
[2025-05-31 22:36:22] [INFO ] Computed and/alt/rep : 46/170/46 causal constraints (skipped 0 transitions) in 2 ms.
[2025-05-31 22:36:22] [INFO ] Added : 39 causal constraints over 8 iterations in 42 ms. Result :sat
Minimization took 47 ms.
[2025-05-31 22:36:22] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-05-31 22:36:22] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2025-05-31 22:36:22] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2025-05-31 22:36:22] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-05-31 22:36:22] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:36:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-05-31 22:36:22] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2025-05-31 22:36:22] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-05-31 22:36:22] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-05-31 22:36:22] [INFO ] Computed and/alt/rep : 46/170/46 causal constraints (skipped 0 transitions) in 3 ms.
[2025-05-31 22:36:22] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2025-05-31 22:36:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2025-05-31 22:36:22] [INFO ] Added : 41 causal constraints over 9 iterations in 96 ms. Result :sat
Minimization took 22 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4, 0, 0, 4, 0] Max Struct:[+inf, 1, 1, +inf, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4, 0, 0, 4, 0] Max Struct:[+inf, 1, 1, +inf, 1]
Support contains 5 out of 54 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 47/47 transitions.
Applied a total of 0 rules in 2 ms. Remains 54 /54 variables (removed 0) and now considering 47/47 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 54/54 places, 47/47 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 47/47 transitions.
Applied a total of 0 rules in 2 ms. Remains 54 /54 variables (removed 0) and now considering 47/47 (removed 0) transitions.
[2025-05-31 22:36:22] [INFO ] Invariant cache hit.
[2025-05-31 22:36:22] [INFO ] Implicit Places using invariants in 47 ms returned [35, 36]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 49 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 52/54 places, 47/47 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 51 transition count 46
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 51 transition count 46
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 50 transition count 45
Applied a total of 4 rules in 5 ms. Remains 50 /52 variables (removed 2) and now considering 45/47 (removed 2) transitions.
// Phase 1: matrix 45 rows 50 cols
[2025-05-31 22:36:22] [INFO ] Computed 9 invariants in 1 ms
[2025-05-31 22:36:22] [INFO ] Implicit Places using invariants in 38 ms returned []
[2025-05-31 22:36:22] [INFO ] Invariant cache hit.
[2025-05-31 22:36:22] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-31 22:36:22] [INFO ] Implicit Places using invariants and state equation in 67 ms returned [18, 23]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 108 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 48/54 places, 45/47 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 48 transition count 44
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 47 transition count 44
Applied a total of 2 rules in 4 ms. Remains 47 /48 variables (removed 1) and now considering 44/45 (removed 1) transitions.
// Phase 1: matrix 44 rows 47 cols
[2025-05-31 22:36:22] [INFO ] Computed 7 invariants in 0 ms
[2025-05-31 22:36:22] [INFO ] Implicit Places using invariants in 33 ms returned []
[2025-05-31 22:36:22] [INFO ] Invariant cache hit.
[2025-05-31 22:36:22] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-31 22:36:22] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 47/54 places, 44/47 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 264 ms. Remains : 47/54 places, 44/47 transitions.
Found an invariant !
This invariant on transitions {1=1, 2=1, 4=1, 10=1, 11=1, 12=1, 23=1, 24=1, 33=1, 34=1, 36=1, 42=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {1=1, 2=1, 11=1, 12=1, 23=1, 24=1, 33=1, 34=1, 42=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1247 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :[4, 0, 0, 4, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[4, 0, 0, 4, 0] Max Struct:[+inf, 1, 1, +inf, 1]
[2025-05-31 22:36:23] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[4, 0, 0, 4, 0] Max Struct:[+inf, 1, 1, +inf, 1]
RANDOM walk for 1000000 steps (125218 resets) in 594 ms. (1680 steps per ms)
BEST_FIRST walk for 5000001 steps (416561 resets) in 2135 ms. (2340 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 0, 0, 4, 0] Max Struct:[+inf, 1, 1, +inf, 1]
[2025-05-31 22:36:25] [INFO ] Invariant cache hit.
[2025-05-31 22:36:25] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-05-31 22:36:25] [INFO ] [Real]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2025-05-31 22:36:25] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2025-05-31 22:36:25] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:36:25] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2025-05-31 22:36:25] [INFO ] [Nat]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2025-05-31 22:36:25] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2025-05-31 22:36:25] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-31 22:36:25] [INFO ] [Nat]Added 3 Read/Feed constraints in 3 ms returned sat
[2025-05-31 22:36:25] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2025-05-31 22:36:25] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2025-05-31 22:36:25] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
[2025-05-31 22:36:25] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 74 ms
[2025-05-31 22:36:25] [INFO ] Computed and/alt/rep : 43/151/43 causal constraints (skipped 0 transitions) in 2 ms.
[2025-05-31 22:36:26] [INFO ] Added : 18 causal constraints over 4 iterations in 32 ms. Result :sat
Minimization took 28 ms.
[2025-05-31 22:36:26] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-05-31 22:36:26] [INFO ] [Real]Absence check using 2 positive and 5 generalized place invariants in 2 ms returned sat
[2025-05-31 22:36:26] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-05-31 22:36:26] [INFO ] [Real]Added 3 Read/Feed constraints in 0 ms returned sat
[2025-05-31 22:36:26] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:36:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-05-31 22:36:26] [INFO ] [Nat]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2025-05-31 22:36:26] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2025-05-31 22:36:26] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-05-31 22:36:26] [INFO ] Computed and/alt/rep : 43/151/43 causal constraints (skipped 0 transitions) in 3 ms.
[2025-05-31 22:36:26] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2025-05-31 22:36:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2025-05-31 22:36:26] [INFO ] Added : 42 causal constraints over 9 iterations in 105 ms. Result :sat
Minimization took 23 ms.
[2025-05-31 22:36:26] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-05-31 22:36:26] [INFO ] [Real]Absence check using 2 positive and 5 generalized place invariants in 2 ms returned sat
[2025-05-31 22:36:26] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2025-05-31 22:36:26] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-05-31 22:36:26] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:36:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-05-31 22:36:26] [INFO ] [Nat]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2025-05-31 22:36:26] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2025-05-31 22:36:26] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2025-05-31 22:36:26] [INFO ] Computed and/alt/rep : 43/151/43 causal constraints (skipped 0 transitions) in 3 ms.
[2025-05-31 22:36:26] [INFO ] Added : 40 causal constraints over 8 iterations in 43 ms. Result :sat
Minimization took 22 ms.
[2025-05-31 22:36:26] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-05-31 22:36:26] [INFO ] [Real]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2025-05-31 22:36:26] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2025-05-31 22:36:26] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:36:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-05-31 22:36:26] [INFO ] [Nat]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2025-05-31 22:36:26] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2025-05-31 22:36:26] [INFO ] [Nat]Added 3 Read/Feed constraints in 3 ms returned sat
[2025-05-31 22:36:26] [INFO ] Computed and/alt/rep : 43/151/43 causal constraints (skipped 0 transitions) in 2 ms.
[2025-05-31 22:36:26] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
[2025-05-31 22:36:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2025-05-31 22:36:26] [INFO ] Added : 36 causal constraints over 8 iterations in 85 ms. Result :sat
Minimization took 17 ms.
[2025-05-31 22:36:26] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-05-31 22:36:26] [INFO ] [Real]Absence check using 2 positive and 5 generalized place invariants in 0 ms returned sat
[2025-05-31 22:36:26] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-05-31 22:36:26] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-05-31 22:36:26] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:36:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2025-05-31 22:36:26] [INFO ] [Nat]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2025-05-31 22:36:26] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-05-31 22:36:26] [INFO ] [Nat]Added 3 Read/Feed constraints in 3 ms returned sat
[2025-05-31 22:36:26] [INFO ] Computed and/alt/rep : 43/151/43 causal constraints (skipped 0 transitions) in 4 ms.
[2025-05-31 22:36:26] [INFO ] Added : 39 causal constraints over 8 iterations in 44 ms. Result :sat
Minimization took 21 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4, 0, 0, 4, 0] Max Struct:[+inf, 1, 1, +inf, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4, 0, 0, 4, 0] Max Struct:[+inf, 1, 1, +inf, 1]
Support contains 5 out of 47 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 47/47 places, 44/44 transitions.
Applied a total of 0 rules in 1 ms. Remains 47 /47 variables (removed 0) and now considering 44/44 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 47/47 places, 44/44 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 47/47 places, 44/44 transitions.
Applied a total of 0 rules in 2 ms. Remains 47 /47 variables (removed 0) and now considering 44/44 (removed 0) transitions.
[2025-05-31 22:36:26] [INFO ] Invariant cache hit.
[2025-05-31 22:36:26] [INFO ] Implicit Places using invariants in 47 ms returned []
[2025-05-31 22:36:26] [INFO ] Invariant cache hit.
[2025-05-31 22:36:26] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-31 22:36:26] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2025-05-31 22:36:26] [INFO ] Redundant transitions in 0 ms returned []
Running 43 sub problems to find dead transitions.
[2025-05-31 22:36:26] [INFO ] Invariant cache hit.
[2025-05-31 22:36:26] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (OVERLAPS) 44/89 variables, 45/52 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (OVERLAPS) 2/91 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (OVERLAPS) 0/91 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Real declared 91/91 variables, and 57 constraints, problems are : Problem set: 0 solved, 43 unsolved in 576 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 47/47 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 43 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (OVERLAPS) 44/89 variables, 45/52 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 39/94 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (OVERLAPS) 2/91 variables, 2/96 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/91 variables, 4/100 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/91 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 43 unsolved
[2025-05-31 22:36:28] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/91 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/91 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 12 (OVERLAPS) 0/91 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Int declared 91/91 variables, and 101 constraints, problems are : Problem set: 0 solved, 43 unsolved in 1564 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 47/47 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 1/1 constraints]
After SMT, in 2173ms problems are : Problem set: 0 solved, 43 unsolved
Search for dead transitions found 0 dead transitions in 2180ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2295 ms. Remains : 47/47 places, 44/44 transitions.
Found an invariant !
This invariant on transitions {1=1, 2=1, 4=1, 10=1, 11=1, 12=1, 23=1, 24=1, 33=1, 34=1, 36=1, 42=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {1=1, 2=1, 11=1, 12=1, 23=1, 24=1, 33=1, 34=1, 42=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1269 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :[4, 0, 0, 3, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[4, 0, 0, 4, 0] Max Struct:[+inf, 1, 1, +inf, 1]
[2025-05-31 22:36:29] [INFO ] Flatten gal took : 47 ms
[2025-05-31 22:36:29] [INFO ] Flatten gal took : 19 ms
[2025-05-31 22:36:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8753724837287489727.gal : 20 ms
[2025-05-31 22:36:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13854200632136999470.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/ReachabilityCardinality8753724837287489727.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13854200632136999470.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/ReachabilityCardinality13854200632136999470.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :2 after 5
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :5 after 7
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :7 after 16
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :16 after 27
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :27 after 54
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :54 after 171
RANDOM walk for 40000 steps (4975 resets) in 1417 ms. (28 steps per ms) remains 8/8 properties
Invariant property MIN4 does not hold.
Reachability property MAX4 is true.
Invariant property MIN3 does not hold.
Invariant property MIN2 does not hold.
Reachability property MAX2 is true.
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :171 after 526
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :526 after 813
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,1258,0.057316,5244,2,2083,17,7574,9,0,233,5286,0
Total reachable state count : 1258

Verifying 8 reachability properties.
Invariant property MIN0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,0,0.057833,5244,1,0,17,7574,9,0,234,5286,0
Reachability property MAX1 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX1,1,0.058322,5504,2,48,17,7574,9,0,235,5286,0
Invariant property MIN1 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN1,1,0.058498,5504,2,48,17,7574,9,0,235,5286,0
Reachability property MAX2 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX2,1,0.058668,5504,2,48,17,7574,10,0,237,5286,0
Invariant property MIN2 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN2,1,0.059092,5504,2,48,17,7574,11,0,238,5286,0
Invariant property MIN3 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN3,15,0.05943,5504,2,183,17,7574,12,0,240,5286,0
Reachability property MAX4 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX4,1,0.059686,5504,2,48,17,7574,13,0,242,5286,0
Invariant property MIN4 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN4,1,0.06013,5504,2,48,17,7574,14,0,243,5286,0
BEST_FIRST walk for 40001 steps (3322 resets) in 713 ms. (56 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (3357 resets) in 276 ms. (144 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (3365 resets) in 221 ms. (180 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (3388 resets) in 118 ms. (336 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (3290 resets) in 139 ms. (285 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (3325 resets) in 153 ms. (259 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (3267 resets) in 175 ms. (227 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (3286 resets) in 114 ms. (347 steps per ms) remains 8/8 properties
Probably explored full state space saw : 1258 states, properties seen :7
Probabilistic random walk after 2515 steps, saw 1258 distinct states, run finished after 36 ms. (steps per millisecond=69 ) properties seen :7
Explored full state space saw : 1258 states, properties seen :0
Exhaustive walk after 2515 steps, saw 1258 distinct states, run finished after 6 ms. (steps per millisecond=419 ) properties seen :0
FORMULA DoubleExponent-PT-002-UpperBounds-15 1 TECHNIQUES REACHABILITY_MAX
FORMULA DoubleExponent-PT-002-UpperBounds-05 1 TECHNIQUES REACHABILITY_MAX
FORMULA DoubleExponent-PT-002-UpperBounds-03 1 TECHNIQUES REACHABILITY_MAX
FORMULA DoubleExponent-PT-002-UpperBounds-02 4 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 4 queries.) : Max Seen:[4] Max Struct:[+inf]
Starting property specific reduction for DoubleExponent-PT-002-UpperBounds-09
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:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2025-05-31 22:36:30] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (1244 resets) in 7 ms. (1250 steps per ms)
BEST_FIRST walk for 10001 steps (816 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2025-05-31 22:36:30] [INFO ] Invariant cache hit.
[2025-05-31 22:36:30] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-05-31 22:36:30] [INFO ] [Real]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2025-05-31 22:36:30] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2025-05-31 22:36:30] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:36:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-05-31 22:36:30] [INFO ] [Nat]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2025-05-31 22:36:30] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2025-05-31 22:36:30] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-31 22:36:30] [INFO ] [Nat]Added 3 Read/Feed constraints in 3 ms returned sat
[2025-05-31 22:36:30] [INFO ] Computed and/alt/rep : 43/151/43 causal constraints (skipped 0 transitions) in 3 ms.
[2025-05-31 22:36:30] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2025-05-31 22:36:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2025-05-31 22:36:30] [INFO ] Added : 35 causal constraints over 9 iterations in 78 ms. Result :sat
Minimization took 18 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[+inf]
Support contains 1 out of 47 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 47/47 places, 44/44 transitions.
Graph (complete) has 141 edges and 47 vertex of which 45 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 45 transition count 41
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 44 transition count 41
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 43 transition count 41
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 9 place count 43 transition count 38
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 12 place count 40 transition count 38
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 14 place count 40 transition count 38
Applied a total of 14 rules in 9 ms. Remains 40 /47 variables (removed 7) and now considering 38/44 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 40/47 places, 38/44 transitions.
Found an invariant !
This invariant on transitions {1=1, 2=1, 7=1, 13=1, 21=1, 22=1, 27=1, 30=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {1=1, 2=1, 7=1, 13=1, 21=1, 22=1, 27=1, 30=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1530 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
// Phase 1: matrix 38 rows 40 cols
[2025-05-31 22:36:30] [INFO ] Computed 7 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 1000000 steps (156320 resets) in 601 ms. (1661 steps per ms)
BEST_FIRST walk for 1000001 steps (96315 resets) in 397 ms. (2512 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4] Max Struct:[+inf]
[2025-05-31 22:36:31] [INFO ] Invariant cache hit.
[2025-05-31 22:36:31] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-05-31 22:36:31] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 0 ms returned sat
[2025-05-31 22:36:31] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2025-05-31 22:36:31] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-05-31 22:36:31] [INFO ] [Real]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-05-31 22:36:31] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:36:31] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-05-31 22:36:31] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 1 ms returned sat
[2025-05-31 22:36:31] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2025-05-31 22:36:31] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-05-31 22:36:31] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2025-05-31 22:36:32] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2025-05-31 22:36:32] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 1 ms to minimize.
[2025-05-31 22:36:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 87 ms
[2025-05-31 22:36:32] [INFO ] Computed and/alt/rep : 36/170/36 causal constraints (skipped 1 transitions) in 3 ms.
[2025-05-31 22:36:32] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 2 ms to minimize.
[2025-05-31 22:36:32] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 0 ms to minimize.
[2025-05-31 22:36:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 71 ms
[2025-05-31 22:36:32] [INFO ] Added : 34 causal constraints over 9 iterations in 121 ms. Result :sat
Minimization took 39 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4] Max Struct:[+inf]
Support contains 1 out of 40 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 38/38 transitions.
Applied a total of 0 rules in 2 ms. Remains 40 /40 variables (removed 0) and now considering 38/38 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 40/40 places, 38/38 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 38/38 transitions.
Applied a total of 0 rules in 1 ms. Remains 40 /40 variables (removed 0) and now considering 38/38 (removed 0) transitions.
[2025-05-31 22:36:32] [INFO ] Invariant cache hit.
[2025-05-31 22:36:32] [INFO ] Implicit Places using invariants in 44 ms returned []
[2025-05-31 22:36:32] [INFO ] Invariant cache hit.
[2025-05-31 22:36:32] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-05-31 22:36:32] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
[2025-05-31 22:36:32] [INFO ] Redundant transitions in 0 ms returned []
Running 37 sub problems to find dead transitions.
[2025-05-31 22:36:32] [INFO ] Invariant cache hit.
[2025-05-31 22:36:32] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (OVERLAPS) 1/39 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2025-05-31 22:36:32] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (OVERLAPS) 38/77 variables, 39/47 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 8/55 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/77 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 37 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/78 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/78 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 11 (OVERLAPS) 0/78 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Real declared 78/78 variables, and 56 constraints, problems are : Problem set: 0 solved, 37 unsolved in 598 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 40/40 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 37 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (OVERLAPS) 1/39 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (OVERLAPS) 38/77 variables, 39/47 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 8/55 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/77 variables, 33/88 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2025-05-31 22:36:33] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2025-05-31 22:36:33] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
[2025-05-31 22:36:33] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 5 ms to minimize.
[2025-05-31 22:36:33] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2025-05-31 22:36:33] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 0 ms to minimize.
[2025-05-31 22:36:33] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/77 variables, 6/94 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/77 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 11 (OVERLAPS) 1/78 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/78 variables, 4/99 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/78 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 14 (OVERLAPS) 0/78 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Int declared 78/78 variables, and 99 constraints, problems are : Problem set: 0 solved, 37 unsolved in 1275 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 40/40 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 7/7 constraints]
After SMT, in 1893ms problems are : Problem set: 0 solved, 37 unsolved
Search for dead transitions found 0 dead transitions in 1896ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2005 ms. Remains : 40/40 places, 38/38 transitions.
Found an invariant !
This invariant on transitions {1=1, 2=1, 7=1, 13=1, 21=1, 22=1, 27=1, 30=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {1=1, 2=1, 7=1, 13=1, 21=1, 22=1, 27=1, 30=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1541 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[4] Max Struct:[+inf]
[2025-05-31 22:36:34] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[4] Max Struct:[+inf]
RANDOM walk for 1000000 steps (156035 resets) in 563 ms. (1773 steps per ms)
BEST_FIRST walk for 1000000 steps (96214 resets) in 396 ms. (2518 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4] Max Struct:[+inf]
[2025-05-31 22:36:35] [INFO ] Invariant cache hit.
[2025-05-31 22:36:35] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-05-31 22:36:35] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 1 ms returned sat
[2025-05-31 22:36:35] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-05-31 22:36:35] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-05-31 22:36:35] [INFO ] [Real]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-05-31 22:36:35] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:36:35] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-05-31 22:36:35] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 1 ms returned sat
[2025-05-31 22:36:35] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2025-05-31 22:36:35] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-05-31 22:36:35] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2025-05-31 22:36:35] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 1 ms to minimize.
[2025-05-31 22:36:35] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 0 ms to minimize.
[2025-05-31 22:36:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 83 ms
[2025-05-31 22:36:35] [INFO ] Computed and/alt/rep : 36/170/36 causal constraints (skipped 1 transitions) in 3 ms.
[2025-05-31 22:36:35] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2025-05-31 22:36:35] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2025-05-31 22:36:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 76 ms
[2025-05-31 22:36:35] [INFO ] Added : 34 causal constraints over 9 iterations in 127 ms. Result :sat
Minimization took 36 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4] Max Struct:[+inf]
Support contains 1 out of 40 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 38/38 transitions.
Applied a total of 0 rules in 1 ms. Remains 40 /40 variables (removed 0) and now considering 38/38 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 40/40 places, 38/38 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 38/38 transitions.
Applied a total of 0 rules in 1 ms. Remains 40 /40 variables (removed 0) and now considering 38/38 (removed 0) transitions.
[2025-05-31 22:36:35] [INFO ] Invariant cache hit.
[2025-05-31 22:36:35] [INFO ] Implicit Places using invariants in 43 ms returned []
[2025-05-31 22:36:35] [INFO ] Invariant cache hit.
[2025-05-31 22:36:35] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-05-31 22:36:35] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
[2025-05-31 22:36:35] [INFO ] Redundant transitions in 1 ms returned []
Running 37 sub problems to find dead transitions.
[2025-05-31 22:36:35] [INFO ] Invariant cache hit.
[2025-05-31 22:36:35] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (OVERLAPS) 1/39 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2025-05-31 22:36:35] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (OVERLAPS) 38/77 variables, 39/47 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 8/55 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/77 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 37 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/78 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/78 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 11 (OVERLAPS) 0/78 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Real declared 78/78 variables, and 56 constraints, problems are : Problem set: 0 solved, 37 unsolved in 581 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 40/40 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 37 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (OVERLAPS) 1/39 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (OVERLAPS) 38/77 variables, 39/47 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 8/55 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/77 variables, 33/88 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2025-05-31 22:36:36] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2025-05-31 22:36:36] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 1 ms to minimize.
[2025-05-31 22:36:36] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2025-05-31 22:36:36] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2025-05-31 22:36:36] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2025-05-31 22:36:36] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/77 variables, 6/94 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/77 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 11 (OVERLAPS) 1/78 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/78 variables, 4/99 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/78 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 14 (OVERLAPS) 0/78 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Int declared 78/78 variables, and 99 constraints, problems are : Problem set: 0 solved, 37 unsolved in 1264 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 40/40 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 7/7 constraints]
After SMT, in 1856ms problems are : Problem set: 0 solved, 37 unsolved
Search for dead transitions found 0 dead transitions in 1858ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1983 ms. Remains : 40/40 places, 38/38 transitions.
Found an invariant !
This invariant on transitions {1=1, 2=1, 7=1, 13=1, 21=1, 22=1, 27=1, 30=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {1=1, 2=1, 7=1, 13=1, 21=1, 22=1, 27=1, 30=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1560 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[4] Max Struct:[+inf]
RANDOM walk for 40000 steps (6237 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
[2025-05-31 22:36:37] [INFO ] Flatten gal took : 7 ms
[2025-05-31 22:36:37] [INFO ] Flatten gal took : 7 ms
[2025-05-31 22:36:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6103172385965747516.gal : 2 ms
[2025-05-31 22:36:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7603613648313194095.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/ReachabilityCardinality6103172385965747516.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7603613648313194095.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

BEST_FIRST walk for 40002 steps (3781 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
/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/ReachabilityCardinality7603613648313194095.prop.
Finished probabilistic random walk after 438 steps, run visited all 1 properties in 4 ms. (steps per millisecond=109 )
Probabilistic random walk after 438 steps, saw 226 distinct states, run finished after 8 ms. (steps per millisecond=54 ) properties seen :1
ITS runner timed out or was interrupted.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6 after 11
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :11 after 18
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :18 after 31
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :43 after 54
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :163 after 175
Invariant property MIN0 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 257 fixpoint passes
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,569,0.019478,4332,2,937,16,3307,6,0,197,2078,0
Total reachable state count : 569

Verifying 1 reachability properties.
Invariant property MIN0 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,14,0.019743,4596,2,140,16,3307,7,0,200,2078,0
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[4] Max Struct:[+inf]
Ending property specific reduction for DoubleExponent-PT-002-UpperBounds-09 in 7299 ms.
[2025-05-31 22:36:37] [INFO ] Flatten gal took : 6 ms
[2025-05-31 22:36:37] [INFO ] Applying decomposition
[2025-05-31 22:36:37] [INFO ] Flatten gal took : 5 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/graph836123589183411473.txt' '-o' '/tmp/graph836123589183411473.bin' '-w' '/tmp/graph836123589183411473.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph836123589183411473.bin' '-l' '-1' '-v' '-w' '/tmp/graph836123589183411473.weights' '-q' '0' '-e' '0.001'
[2025-05-31 22:36:37] [INFO ] Decomposing Gal with order
[2025-05-31 22:36:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 22:36:37] [INFO ] Removed a total of 14 redundant transitions.
[2025-05-31 22:36:38] [INFO ] Flatten gal took : 54 ms
[2025-05-31 22:36:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 4 ms.
[2025-05-31 22:36:38] [INFO ] Time to serialize gal into /tmp/UpperBounds8837808008329540467.gal : 3 ms
[2025-05-31 22:36:38] [INFO ] Time to serialize properties into /tmp/UpperBounds7365358792885346524.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/UpperBounds8837808008329540467.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds7365358792885346524.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...283
Loading property file /tmp/UpperBounds7365358792885346524.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,1258,0.028986,4996,381,189,2822,509,217,2617,69,1422,0
Total reachable state count : 1258

Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 16
Bounds property DoubleExponent-PT-002-UpperBounds-09 :0 <= i5.u2.p110 <= 16
FORMULA DoubleExponent-PT-002-UpperBounds-09 16 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
DoubleExponent-PT-002-UpperBounds-09,0,0.033954,4996,1,0,2822,509,296,2871,97,1766,384
Total runtime 31620 ms.

BK_STOP 1748730998112

--------------------
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="DoubleExponent-PT-002"
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 DoubleExponent-PT-002, 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 r083-tall-174860079700059"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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