About the Execution of 2024-gold for DoubleExponent-PT-003
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15686.040 | 26826.00 | 45933.00 | 177.20 | 1 1 1 1 1 1 1 1 1 1 1 1 1 1 2 1 | normal |
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-174860079700060.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-003, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r083-tall-174860079700060
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 7.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K 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.7K 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 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 173K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K 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 50K 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-003-UpperBounds-00
FORMULA_NAME DoubleExponent-PT-003-UpperBounds-01
FORMULA_NAME DoubleExponent-PT-003-UpperBounds-02
FORMULA_NAME DoubleExponent-PT-003-UpperBounds-03
FORMULA_NAME DoubleExponent-PT-003-UpperBounds-04
FORMULA_NAME DoubleExponent-PT-003-UpperBounds-05
FORMULA_NAME DoubleExponent-PT-003-UpperBounds-06
FORMULA_NAME DoubleExponent-PT-003-UpperBounds-07
FORMULA_NAME DoubleExponent-PT-003-UpperBounds-08
FORMULA_NAME DoubleExponent-PT-003-UpperBounds-09
FORMULA_NAME DoubleExponent-PT-003-UpperBounds-10
FORMULA_NAME DoubleExponent-PT-003-UpperBounds-11
FORMULA_NAME DoubleExponent-PT-003-UpperBounds-12
FORMULA_NAME DoubleExponent-PT-003-UpperBounds-13
FORMULA_NAME DoubleExponent-PT-003-UpperBounds-14
FORMULA_NAME DoubleExponent-PT-003-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1748730974140
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-003
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-31 22:36:15] [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:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 22:36:15] [INFO ] Load time of PNML (sax parser for PT used): 57 ms
[2025-05-31 22:36:15] [INFO ] Transformed 163 places.
[2025-05-31 22:36:15] [INFO ] Transformed 148 transitions.
[2025-05-31 22:36:15] [INFO ] Parsed PT model containing 163 places and 148 transitions and 417 arcs in 147 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 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 148 rows 163 cols
[2025-05-31 22:36:15] [INFO ] Computed 19 invariants in 34 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1]
RANDOM walk for 10000 steps (320 resets) in 24 ms. (400 steps per ms)
FORMULA DoubleExponent-PT-003-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-003-UpperBounds-14 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-003-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-003-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-003-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-003-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-003-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-003-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-003-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-003-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 60001 steps (1687 resets) in 85 ms. (697 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
[2025-05-31 22:36:15] [INFO ] Invariant cache hit.
[2025-05-31 22:36:15] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2025-05-31 22:36:15] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 11 ms returned sat
[2025-05-31 22:36:15] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2025-05-31 22:36:16] [INFO ] Deduced a trap composed of 60 places in 98 ms of which 12 ms to minimize.
[2025-05-31 22:36:16] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:36:16] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2025-05-31 22:36:16] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned sat
[2025-05-31 22:36:16] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2025-05-31 22:36:16] [INFO ] Deduced a trap composed of 60 places in 72 ms of which 2 ms to minimize.
[2025-05-31 22:36:16] [INFO ] Deduced a trap composed of 60 places in 54 ms of which 2 ms to minimize.
[2025-05-31 22:36:16] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2025-05-31 22:36:16] [INFO ] Deduced a trap composed of 54 places in 50 ms of which 1 ms to minimize.
[2025-05-31 22:36:16] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 264 ms
[2025-05-31 22:36:16] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 9 ms.
[2025-05-31 22:36:16] [INFO ] Added : 143 causal constraints over 29 iterations in 462 ms. Result :sat
Minimization took 210 ms.
[2025-05-31 22:36:17] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2025-05-31 22:36:17] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned sat
[2025-05-31 22:36:17] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2025-05-31 22:36:17] [INFO ] Deduced a trap composed of 37 places in 39 ms of which 1 ms to minimize.
[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 5 positive place invariants in 3 ms returned sat
[2025-05-31 22:36:17] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned sat
[2025-05-31 22:36:17] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2025-05-31 22:36:17] [INFO ] Deduced a trap composed of 37 places in 27 ms of which 1 ms to minimize.
[2025-05-31 22:36:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2025-05-31 22:36:17] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 14 ms.
[2025-05-31 22:36:17] [INFO ] Added : 138 causal constraints over 28 iterations in 418 ms. Result :sat
Minimization took 133 ms.
[2025-05-31 22:36:18] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2025-05-31 22:36:18] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 4 ms returned sat
[2025-05-31 22:36:18] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2025-05-31 22:36:18] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 15 ms.
[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 5 positive place invariants in 4 ms returned sat
[2025-05-31 22:36:18] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 4 ms returned sat
[2025-05-31 22:36:18] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2025-05-31 22:36:18] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 10 ms.
[2025-05-31 22:36:18] [INFO ] Added : 103 causal constraints over 21 iterations in 306 ms. Result :sat
Minimization took 117 ms.
[2025-05-31 22:36:18] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-05-31 22:36:18] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned sat
[2025-05-31 22:36:18] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2025-05-31 22:36:18] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 12 ms.
[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 5 positive place invariants in 3 ms returned sat
[2025-05-31 22:36:18] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned sat
[2025-05-31 22:36:18] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2025-05-31 22:36:19] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 8 ms.
[2025-05-31 22:36:19] [INFO ] Added : 144 causal constraints over 30 iterations in 379 ms. Result :sat
Minimization took 147 ms.
[2025-05-31 22:36:19] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-05-31 22:36:19] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 2 ms returned sat
[2025-05-31 22:36:19] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2025-05-31 22:36:19] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 15 ms.
[2025-05-31 22:36:19] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:36:19] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2025-05-31 22:36:19] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned sat
[2025-05-31 22:36:19] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2025-05-31 22:36:19] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 10 ms.
[2025-05-31 22:36:20] [INFO ] Added : 143 causal constraints over 30 iterations in 402 ms. Result :sat
Minimization took 134 ms.
[2025-05-31 22:36:20] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2025-05-31 22:36:20] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 2 ms returned sat
[2025-05-31 22:36:20] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2025-05-31 22:36:20] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 2 ms to minimize.
[2025-05-31 22:36:20] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:36:20] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2025-05-31 22:36:20] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned sat
[2025-05-31 22:36:20] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2025-05-31 22:36:20] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 1 ms to minimize.
[2025-05-31 22:36:20] [INFO ] Deduced a trap composed of 66 places in 55 ms of which 2 ms to minimize.
[2025-05-31 22:36:20] [INFO ] Deduced a trap composed of 65 places in 51 ms of which 1 ms to minimize.
[2025-05-31 22:36:20] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
[2025-05-31 22:36:20] [INFO ] Deduced a trap composed of 47 places in 56 ms of which 1 ms to minimize.
[2025-05-31 22:36:20] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 318 ms
[2025-05-31 22:36:20] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 9 ms.
[2025-05-31 22:36:21] [INFO ] Added : 117 causal constraints over 24 iterations in 328 ms. Result :sat
Minimization took 138 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Support contains 6 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 148/148 transitions.
Graph (complete) has 269 edges and 163 vertex of which 157 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 156 transition count 116
Reduce places removed 30 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 33 rules applied. Total rules applied 67 place count 126 transition count 113
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 70 place count 123 transition count 113
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 70 place count 123 transition count 106
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 84 place count 116 transition count 106
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 136 place count 90 transition count 80
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 144 place count 86 transition count 80
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 145 place count 86 transition count 79
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 146 place count 85 transition count 79
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 4 with 10 rules applied. Total rules applied 156 place count 85 transition count 69
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 166 place count 75 transition count 69
Partial Free-agglomeration rule applied 12 times.
Drop transitions (Partial Free agglomeration) removed 12 transitions
Iterating global reduction 5 with 12 rules applied. Total rules applied 178 place count 75 transition count 69
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 179 place count 74 transition count 68
Applied a total of 179 rules in 59 ms. Remains 74 /163 variables (removed 89) and now considering 68/148 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 74/163 places, 68/148 transitions.
// Phase 1: matrix 68 rows 74 cols
[2025-05-31 22:36:21] [INFO ] Computed 15 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (128283 resets) in 806 ms. (1239 steps per ms)
BEST_FIRST walk for 6000002 steps (507823 resets) in 2982 ms. (2011 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
[2025-05-31 22:36:25] [INFO ] Invariant cache hit.
[2025-05-31 22:36:25] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-05-31 22:36:25] [INFO ] [Real]Absence check using 4 positive and 11 generalized place invariants in 2 ms returned sat
[2025-05-31 22:36:25] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-05-31 22:36:25] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-05-31 22:36:25] [INFO ] [Real]Added 8 Read/Feed constraints in 4 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 4 positive place invariants in 2 ms returned sat
[2025-05-31 22:36:25] [INFO ] [Nat]Absence check using 4 positive and 11 generalized place invariants in 5 ms returned sat
[2025-05-31 22:36:25] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2025-05-31 22:36:25] [INFO ] [Nat]Added 8 Read/Feed constraints in 8 ms returned sat
[2025-05-31 22:36:25] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2025-05-31 22:36:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2025-05-31 22:36:25] [INFO ] Computed and/alt/rep : 65/303/65 causal constraints (skipped 2 transitions) in 7 ms.
[2025-05-31 22:36:26] [INFO ] Added : 45 causal constraints over 9 iterations in 84 ms. Result :sat
Minimization took 50 ms.
[2025-05-31 22:36:26] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-05-31 22:36:26] [INFO ] [Real]Absence check using 4 positive and 11 generalized place invariants in 4 ms returned sat
[2025-05-31 22:36:26] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2025-05-31 22:36:26] [INFO ] [Real]Added 8 Read/Feed constraints in 5 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 4 positive place invariants in 2 ms returned sat
[2025-05-31 22:36:26] [INFO ] [Nat]Absence check using 4 positive and 11 generalized place invariants in 2 ms returned sat
[2025-05-31 22:36:26] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2025-05-31 22:36:26] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-05-31 22:36:26] [INFO ] Computed and/alt/rep : 65/303/65 causal constraints (skipped 2 transitions) in 5 ms.
[2025-05-31 22:36:26] [INFO ] Added : 63 causal constraints over 13 iterations in 114 ms. Result :sat
Minimization took 55 ms.
[2025-05-31 22:36:26] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-05-31 22:36:26] [INFO ] [Real]Absence check using 4 positive and 11 generalized place invariants in 2 ms returned sat
[2025-05-31 22:36:26] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-05-31 22:36:26] [INFO ] [Real]Added 8 Read/Feed constraints in 7 ms returned sat
[2025-05-31 22:36:26] [INFO ] Computed and/alt/rep : 65/303/65 causal constraints (skipped 2 transitions) in 5 ms.
[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 4 positive place invariants in 2 ms returned sat
[2025-05-31 22:36:26] [INFO ] [Nat]Absence check using 4 positive and 11 generalized place invariants in 2 ms returned sat
[2025-05-31 22:36:26] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2025-05-31 22:36:26] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2025-05-31 22:36:26] [INFO ] Computed and/alt/rep : 65/303/65 causal constraints (skipped 2 transitions) in 4 ms.
[2025-05-31 22:36:26] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2025-05-31 22:36:26] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2025-05-31 22:36:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 76 ms
[2025-05-31 22:36:26] [INFO ] Added : 63 causal constraints over 13 iterations in 192 ms. Result :sat
Minimization took 66 ms.
[2025-05-31 22:36:26] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-05-31 22:36:26] [INFO ] [Real]Absence check using 4 positive and 11 generalized place invariants in 2 ms returned sat
[2025-05-31 22:36:26] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-05-31 22:36:26] [INFO ] [Real]Added 8 Read/Feed constraints in 11 ms returned sat
[2025-05-31 22:36:26] [INFO ] Computed and/alt/rep : 65/303/65 causal constraints (skipped 2 transitions) in 5 ms.
[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 4 positive place invariants in 1 ms returned sat
[2025-05-31 22:36:26] [INFO ] [Nat]Absence check using 4 positive and 11 generalized place invariants in 3 ms returned sat
[2025-05-31 22:36:26] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2025-05-31 22:36:26] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-05-31 22:36:26] [INFO ] Computed and/alt/rep : 65/303/65 causal constraints (skipped 2 transitions) in 6 ms.
[2025-05-31 22:36:27] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2025-05-31 22:36:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2025-05-31 22:36:27] [INFO ] Added : 64 causal constraints over 13 iterations in 266 ms. Result :sat
Minimization took 61 ms.
[2025-05-31 22:36:27] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-05-31 22:36:27] [INFO ] [Real]Absence check using 4 positive and 11 generalized place invariants in 2 ms returned sat
[2025-05-31 22:36:27] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-05-31 22:36:27] [INFO ] [Real]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-05-31 22:36:27] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:36:27] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-05-31 22:36:27] [INFO ] [Nat]Absence check using 4 positive and 11 generalized place invariants in 1 ms returned sat
[2025-05-31 22:36:27] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2025-05-31 22:36:27] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-05-31 22:36:27] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2025-05-31 22:36:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2025-05-31 22:36:27] [INFO ] Computed and/alt/rep : 65/303/65 causal constraints (skipped 2 transitions) in 4 ms.
[2025-05-31 22:36:27] [INFO ] Added : 57 causal constraints over 12 iterations in 94 ms. Result :sat
Minimization took 57 ms.
[2025-05-31 22:36:27] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-05-31 22:36:27] [INFO ] [Real]Absence check using 4 positive and 11 generalized place invariants in 2 ms returned sat
[2025-05-31 22:36:27] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-05-31 22:36:27] [INFO ] [Real]Added 8 Read/Feed constraints in 5 ms returned sat
[2025-05-31 22:36:27] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:36:27] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-05-31 22:36:27] [INFO ] [Nat]Absence check using 4 positive and 11 generalized place invariants in 2 ms returned sat
[2025-05-31 22:36:27] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-05-31 22:36:27] [INFO ] [Nat]Added 8 Read/Feed constraints in 9 ms returned sat
[2025-05-31 22:36:27] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2025-05-31 22:36:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2025-05-31 22:36:27] [INFO ] Computed and/alt/rep : 65/303/65 causal constraints (skipped 2 transitions) in 4 ms.
[2025-05-31 22:36:27] [INFO ] Added : 31 causal constraints over 7 iterations in 63 ms. Result :sat
Minimization took 44 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Support contains 6 out of 74 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 68/68 transitions.
Applied a total of 0 rules in 3 ms. Remains 74 /74 variables (removed 0) and now considering 68/68 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 74/74 places, 68/68 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 68/68 transitions.
Applied a total of 0 rules in 3 ms. Remains 74 /74 variables (removed 0) and now considering 68/68 (removed 0) transitions.
[2025-05-31 22:36:28] [INFO ] Invariant cache hit.
[2025-05-31 22:36:28] [INFO ] Implicit Places using invariants in 79 ms returned [15, 22, 41, 46, 64, 71]
[2025-05-31 22:36:28] [INFO ] Actually due to overlaps returned [46, 41]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 80 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 72/74 places, 68/68 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 72 transition count 67
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 71 transition count 67
Applied a total of 2 rules in 6 ms. Remains 71 /72 variables (removed 1) and now considering 67/68 (removed 1) transitions.
// Phase 1: matrix 67 rows 71 cols
[2025-05-31 22:36:28] [INFO ] Computed 13 invariants in 2 ms
[2025-05-31 22:36:28] [INFO ] Implicit Places using invariants in 67 ms returned [15, 22, 61, 68]
[2025-05-31 22:36:28] [INFO ] Actually due to overlaps returned [61, 15]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 70 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 69/74 places, 67/68 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 68 transition count 66
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 68 transition count 66
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 68 transition count 66
Applied a total of 3 rules in 12 ms. Remains 68 /69 variables (removed 1) and now considering 66/67 (removed 1) transitions.
// Phase 1: matrix 66 rows 68 cols
[2025-05-31 22:36:28] [INFO ] Computed 11 invariants in 3 ms
[2025-05-31 22:36:28] [INFO ] Implicit Places using invariants in 49 ms returned [65]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 50 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 67/74 places, 66/68 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 67 transition count 65
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 66 transition count 65
Applied a total of 2 rules in 11 ms. Remains 66 /67 variables (removed 1) and now considering 65/66 (removed 1) transitions.
// Phase 1: matrix 65 rows 66 cols
[2025-05-31 22:36:28] [INFO ] Computed 10 invariants in 1 ms
[2025-05-31 22:36:28] [INFO ] Implicit Places using invariants in 50 ms returned []
[2025-05-31 22:36:28] [INFO ] Invariant cache hit.
[2025-05-31 22:36:28] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-05-31 22:36:28] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 66/74 places, 65/68 transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 386 ms. Remains : 66/74 places, 65/68 transitions.
[2025-05-31 22:36:28] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (144422 resets) in 650 ms. (1536 steps per ms)
BEST_FIRST walk for 6000001 steps (548768 resets) in 2727 ms. (2199 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
[2025-05-31 22:36:31] [INFO ] Invariant cache hit.
[2025-05-31 22:36:31] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-05-31 22:36:31] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2025-05-31 22:36:31] [INFO ] [Real]Absence check using state equation in 16 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 6 positive place invariants in 2 ms returned sat
[2025-05-31 22:36:31] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 0 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 6 ms returned sat
[2025-05-31 22:36:31] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 0 ms to minimize.
[2025-05-31 22:36:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2025-05-31 22:36:31] [INFO ] Computed and/alt/rep : 63/291/63 causal constraints (skipped 1 transitions) in 4 ms.
[2025-05-31 22:36:32] [INFO ] Added : 60 causal constraints over 12 iterations in 105 ms. Result :sat
Minimization took 51 ms.
[2025-05-31 22:36:32] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-05-31 22:36:32] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2025-05-31 22:36:32] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2025-05-31 22:36:32] [INFO ] [Real]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-05-31 22:36:32] [INFO ] Computed and/alt/rep : 63/291/63 causal constraints (skipped 1 transitions) in 3 ms.
[2025-05-31 22:36:32] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:36:32] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-05-31 22:36:32] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2025-05-31 22:36:32] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2025-05-31 22:36:32] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-05-31 22:36:32] [INFO ] Computed and/alt/rep : 63/291/63 causal constraints (skipped 1 transitions) in 4 ms.
[2025-05-31 22:36:32] [INFO ] Added : 57 causal constraints over 12 iterations in 103 ms. Result :sat
Minimization took 44 ms.
[2025-05-31 22:36:32] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-05-31 22:36:32] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 0 ms returned sat
[2025-05-31 22:36:32] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2025-05-31 22:36:32] [INFO ] [Real]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-05-31 22:36:32] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:36:32] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-05-31 22:36:32] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 0 ms returned sat
[2025-05-31 22:36:32] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2025-05-31 22:36:32] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2025-05-31 22:36:32] [INFO ] Computed and/alt/rep : 63/291/63 causal constraints (skipped 1 transitions) in 5 ms.
[2025-05-31 22:36:32] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2025-05-31 22:36:32] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2025-05-31 22:36:32] [INFO ] Deduced a trap composed of 31 places in 30 ms of which 1 ms to minimize.
[2025-05-31 22:36:32] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 1 ms to minimize.
[2025-05-31 22:36:32] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 186 ms
[2025-05-31 22:36:32] [INFO ] Added : 62 causal constraints over 13 iterations in 308 ms. Result :sat
Minimization took 55 ms.
[2025-05-31 22:36:32] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-05-31 22:36:32] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2025-05-31 22:36:32] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2025-05-31 22:36:32] [INFO ] [Real]Added 8 Read/Feed constraints in 1 ms returned sat
[2025-05-31 22:36:32] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:36:32] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2025-05-31 22:36:32] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2025-05-31 22:36:32] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2025-05-31 22:36:32] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-05-31 22:36:32] [INFO ] Computed and/alt/rep : 63/291/63 causal constraints (skipped 1 transitions) in 7 ms.
[2025-05-31 22:36:33] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2025-05-31 22:36:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2025-05-31 22:36:33] [INFO ] Added : 57 causal constraints over 12 iterations in 135 ms. Result :sat
Minimization took 44 ms.
[2025-05-31 22:36:33] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-05-31 22:36:33] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2025-05-31 22:36:33] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2025-05-31 22:36:33] [INFO ] [Real]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-05-31 22:36:33] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:36:33] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-05-31 22:36:33] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2025-05-31 22:36:33] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2025-05-31 22:36:33] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-05-31 22:36:33] [INFO ] Computed and/alt/rep : 63/291/63 causal constraints (skipped 1 transitions) in 4 ms.
[2025-05-31 22:36:33] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2025-05-31 22:36:33] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2025-05-31 22:36:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 74 ms
[2025-05-31 22:36:33] [INFO ] Added : 61 causal constraints over 13 iterations in 186 ms. Result :sat
Minimization took 48 ms.
[2025-05-31 22:36:33] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-05-31 22:36:33] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2025-05-31 22:36:33] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-05-31 22:36:33] [INFO ] [Real]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-05-31 22:36:33] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:36:33] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2025-05-31 22:36:33] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 0 ms returned sat
[2025-05-31 22:36:33] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2025-05-31 22:36:33] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-05-31 22:36:33] [INFO ] Computed and/alt/rep : 63/291/63 causal constraints (skipped 1 transitions) in 4 ms.
[2025-05-31 22:36:33] [INFO ] Added : 43 causal constraints over 9 iterations in 65 ms. Result :sat
Minimization took 38 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Support contains 6 out of 66 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 65/65 transitions.
Applied a total of 0 rules in 3 ms. Remains 66 /66 variables (removed 0) and now considering 65/65 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 66/66 places, 65/65 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 65/65 transitions.
Applied a total of 0 rules in 2 ms. Remains 66 /66 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2025-05-31 22:36:33] [INFO ] Invariant cache hit.
[2025-05-31 22:36:33] [INFO ] Implicit Places using invariants in 48 ms returned []
[2025-05-31 22:36:33] [INFO ] Invariant cache hit.
[2025-05-31 22:36:33] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-05-31 22:36:33] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
[2025-05-31 22:36:33] [INFO ] Redundant transitions in 1 ms returned []
Running 64 sub problems to find dead transitions.
[2025-05-31 22:36:33] [INFO ] Invariant cache hit.
[2025-05-31 22:36:33] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (OVERLAPS) 1/66 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2025-05-31 22:36:34] [INFO ] Deduced a trap composed of 37 places in 33 ms of which 1 ms to minimize.
[2025-05-31 22:36:34] [INFO ] Deduced a trap composed of 34 places in 26 ms of which 0 ms to minimize.
[2025-05-31 22:36:34] [INFO ] Deduced a trap composed of 35 places in 32 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 65/131 variables, 66/79 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 8/87 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2025-05-31 22:36:34] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2025-05-31 22:36:35] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 1 ms to minimize.
[2025-05-31 22:36:35] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 3/90 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/131 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2025-05-31 22:36:35] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/131 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/131 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 12 (OVERLAPS) 0/131 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 131/131 variables, and 91 constraints, problems are : Problem set: 0 solved, 64 unsolved in 2198 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 66/66 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (OVERLAPS) 1/66 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 65/131 variables, 66/83 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 8/91 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 64/155 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2025-05-31 22:36:36] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 3 ms to minimize.
[2025-05-31 22:36:36] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/131 variables, 2/157 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/131 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 11 (OVERLAPS) 0/131 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 131/131 variables, and 157 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1666 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 66/66 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 9/9 constraints]
After SMT, in 3921ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 3929ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4087 ms. Remains : 66/66 places, 65/65 transitions.
[2025-05-31 22:36:38] [INFO ] Flatten gal took : 56 ms
[2025-05-31 22:36:38] [INFO ] Flatten gal took : 36 ms
[2025-05-31 22:36:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4409614182692599689.gal : 6 ms
RANDOM walk for 40000 steps (5799 resets) in 1677 ms. (23 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (3710 resets) in 257 ms. (155 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (3678 resets) in 187 ms. (212 steps per ms) remains 12/12 properties
[2025-05-31 22:36:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14301480502585263406.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/ReachabilityCardinality4409614182692599689.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14301480502585263406.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/ReachabilityCardinality14301480502585263406.prop.
SDD proceeding with computation,12 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,12 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,12 properties remain. new max is 16
SDD size :6 after 8
SDD proceeding with computation,12 properties remain. new max is 32
SDD size :8 after 14
SDD proceeding with computation,12 properties remain. new max is 64
SDD size :14 after 26
SDD proceeding with computation,12 properties remain. new max is 128
SDD size :26 after 42
SDD proceeding with computation,12 properties remain. new max is 256
SDD size :42 after 128
Invariant property MIN2 does not hold.
Reachability property MAX2 is true.
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :128 after 390
SDD proceeding with computation,10 properties remain. new max is 512
SDD size :390 after 871
BEST_FIRST walk for 40000 steps (3721 resets) in 248 ms. (160 steps per ms) remains 12/12 properties
Invariant property MIN5 does not hold.
Reachability property MAX5 is true.
Invariant property MIN0 does not hold.
Reachability property MAX0 is true.
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :1444 after 1855
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :4853 after 5279
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :15380 after 16938
BEST_FIRST walk for 40001 steps (3588 resets) in 342 ms. (116 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (3676 resets) in 149 ms. (266 steps per ms) remains 12/12 properties
Invariant property MIN4 does not hold.
Reachability property MAX4 is true.
Invariant property MIN3 does not hold.
Reachability property MAX3 is true.
Invariant property MIN1 does not hold.
Reachability property MAX1 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 2049 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,45732,0.212884,10220,2,4084,27,31215,6,0,331,26604,0
Total reachable state count : 45732
Verifying 12 reachability properties.
Reachability property MAX0 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
MAX0,20,0.213404,10220,2,146,27,31215,7,0,334,26604,0
Invariant property MIN0 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,20,0.213847,10480,2,146,27,31215,8,0,335,26604,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.214032,10480,2,67,27,31215,9,0,337,26604,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.214146,10480,2,67,27,31215,10,0,338,26604,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.214324,10480,2,67,27,31215,11,0,340,26604,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.214489,10480,2,67,27,31215,12,0,341,26604,0
Reachability property MAX3 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
MAX3,2,0.21461,10480,2,73,27,31215,13,0,343,26604,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,2,0.214717,10480,2,73,27,31215,14,0,344,26604,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.214854,10480,2,67,27,31215,15,0,346,26604,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.21499,10480,2,67,27,31215,16,0,347,26604,0
Reachability property MAX5 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
MAX5,20,0.215131,10480,2,146,27,31215,17,0,349,26604,0
Invariant property MIN5 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
MIN5,20,0.21528,10480,2,146,27,31215,18,0,350,26604,0
BEST_FIRST walk for 40002 steps (3707 resets) in 183 ms. (217 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (3654 resets) in 93 ms. (425 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (3632 resets) in 131 ms. (303 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (3707 resets) in 123 ms. (322 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (3627 resets) in 134 ms. (296 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (3652 resets) in 135 ms. (294 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (3657 resets) in 130 ms. (305 steps per ms) remains 12/12 properties
Finished probabilistic random walk after 126912 steps, run visited all 12 properties in 1438 ms. (steps per millisecond=88 )
Probabilistic random walk after 126912 steps, saw 63463 distinct states, run finished after 1441 ms. (steps per millisecond=88 ) properties seen :12
FORMULA DoubleExponent-PT-003-UpperBounds-13 1 TECHNIQUES REACHABILITY_MAX
FORMULA DoubleExponent-PT-003-UpperBounds-10 1 TECHNIQUES REACHABILITY_MAX
FORMULA DoubleExponent-PT-003-UpperBounds-08 1 TECHNIQUES REACHABILITY_MAX
FORMULA DoubleExponent-PT-003-UpperBounds-06 1 TECHNIQUES REACHABILITY_MAX
FORMULA DoubleExponent-PT-003-UpperBounds-05 1 TECHNIQUES REACHABILITY_MAX
FORMULA DoubleExponent-PT-003-UpperBounds-01 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 6 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 25562 ms.
BK_STOP 1748731000966
--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-003"
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-003, 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-174860079700060"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-003.tgz
mv DoubleExponent-PT-003 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 '
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 ;