About the Execution of ITS-Tools for DoubleExponent-PT-002
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 36586.00 | 0.00 | 0.00 | 1 1 4 1 1 1 1 1 2 16 1 1 1 1 1 1 | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r072-tall-174860067500469.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 itstools
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 r072-tall-174860067500469
=====================================================================
--------------------
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 1748727892067
Invoking MCC driver with
BK_TOOL=itstools
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 202505121319
[2025-05-31 21:44:53] [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 21:44:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 21:44:53] [INFO ] Load time of PNML (sax parser for PT used): 50 ms
[2025-05-31 21:44:53] [INFO ] Transformed 110 places.
[2025-05-31 21:44:53] [INFO ] Transformed 98 transitions.
[2025-05-31 21:44:53] [INFO ] Parsed PT model containing 110 places and 98 transitions and 276 arcs in 133 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 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 21:44:53] [INFO ] Computed 14 invariants in 14 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 (326 resets) in 24 ms. (400 steps per ms)
FORMULA DoubleExponent-PT-002-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
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-10 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
FORMULA DoubleExponent-PT-002-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 60002 steps (1719 resets) in 113 ms. (526 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 4, 0, 0, 1, 0] Max Struct:[6, +inf, 1, 1, +inf, 1]
[2025-05-31 21:44:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-31 21:44:53] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2025-05-31 21:44:53] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 5 ms returned sat
[2025-05-31 21:44:53] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:44:53] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 9 ms to minimize.
[2025-05-31 21:44:53] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-31 21:44:53] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2025-05-31 21:44:53] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 2 ms returned sat
[2025-05-31 21:44:54] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:44:54] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:44:54] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 2 ms to minimize.
[2025-05-31 21:44:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 109 ms
[2025-05-31 21:44:54] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints (skipped 0 transitions) in 14 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:44:54] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 4 ms to minimize.
[2025-05-31 21:44:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2025-05-31 21:44:54] [INFO ] Added : 94 causal constraints over 19 iterations in 314 ms. Result :sat
Minimization took 69 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-31 21:44:54] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2025-05-31 21:44:54] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned sat
[2025-05-31 21:44:54] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2025-05-31 21:44:54] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-31 21:44:54] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2025-05-31 21:44:54] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 2 ms returned sat
[2025-05-31 21:44:54] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:44:54] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:44:54] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 3 ms to minimize.
[2025-05-31 21:44:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 107 ms
[2025-05-31 21:44:54] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints (skipped 0 transitions) in 5 ms.
[2025-05-31 21:44:55] [INFO ] Added : 95 causal constraints over 20 iterations in 245 ms. Result :sat
Minimization took 77 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-31 21:44:55] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2025-05-31 21:44:55] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 2 ms returned sat
[2025-05-31 21:44:55] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:44:55] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 3 ms to minimize.
[2025-05-31 21:44:55] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-31 21:44:55] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2025-05-31 21:44:55] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 2 ms returned sat
[2025-05-31 21:44:55] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:44:55] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 3 ms to minimize.
[2025-05-31 21:44:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2025-05-31 21:44:55] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints (skipped 0 transitions) in 4 ms.
[2025-05-31 21:44:55] [INFO ] Added : 93 causal constraints over 19 iterations in 188 ms. Result :sat
Minimization took 68 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-31 21:44:55] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2025-05-31 21:44:55] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 2 ms returned sat
[2025-05-31 21:44:55] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:44:55] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 7 ms to minimize.
[2025-05-31 21:44:55] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-31 21:44:55] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-05-31 21:44:55] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 2 ms returned sat
[2025-05-31 21:44:55] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:44:55] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 3 ms to minimize.
[2025-05-31 21:44:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2025-05-31 21:44:55] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints (skipped 0 transitions) in 11 ms.
[2025-05-31 21:44:56] [INFO ] Added : 93 causal constraints over 20 iterations in 217 ms. Result :sat
Minimization took 89 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-31 21:44:56] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2025-05-31 21:44:56] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 2 ms returned sat
[2025-05-31 21:44:56] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:44:56] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 4 ms to minimize.
[2025-05-31 21:44:56] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-31 21:44:56] [INFO ] [Nat]Absence check using 5 positive place invariants in 7 ms returned sat
[2025-05-31 21:44:56] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned sat
[2025-05-31 21:44:56] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:44:56] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:44:56] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 6 ms to minimize.
[2025-05-31 21:44:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 114 ms
[2025-05-31 21:44:56] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints (skipped 0 transitions) in 6 ms.
[2025-05-31 21:44:56] [INFO ] Added : 93 causal constraints over 19 iterations in 204 ms. Result :sat
Minimization took 68 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-31 21:44:56] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2025-05-31 21:44:56] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 2 ms returned sat
[2025-05-31 21:44:56] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:44:56] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 2 ms to minimize.
[2025-05-31 21:44:56] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-31 21:44:56] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2025-05-31 21:44:56] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 2 ms returned sat
[2025-05-31 21:44:56] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:44:57] [INFO ] Deduced a trap composed of 30 places in 29 ms of which 2 ms to minimize.
[2025-05-31 21:44:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2025-05-31 21:44:57] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints (skipped 0 transitions) in 9 ms.
[2025-05-31 21:44:57] [INFO ] Added : 89 causal constraints over 18 iterations in 182 ms. Result :sat
Minimization took 83 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 4, 0, 0, 1, 0] Max Struct:[6, +inf, 1, 1, +inf, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 4, 0, 0, 1, 0] Max Struct:[6, +inf, 1, 1, +inf, 1]
Support contains 6 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.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 107 transition count 79
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 39 place count 88 transition count 79
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 39 place count 88 transition count 73
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 51 place count 82 transition count 73
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 93 place count 61 transition count 52
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 97 place count 59 transition count 52
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 101 place count 59 transition count 48
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 105 place count 55 transition count 48
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 111 place count 55 transition count 48
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 112 place count 54 transition count 47
Applied a total of 112 rules in 43 ms. Remains 54 /110 variables (removed 56) and now considering 47/98 (removed 51) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 54/110 places, 47/98 transitions.
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {1=1, 2=1, 3=1, 6=2, 15=1, 16=1, 17=1, 20=2, 22=1, 23=1, 33=1, 34=1, 42=2, 44=1, 45=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, 15=1, 16=1, 17=1, 33=1, 34=1, 44=1, 45=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1136 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :[0, 4, 0, 0, 3, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 4, 0, 0, 3, 0] Max Struct:[6, +inf, 1, 1, +inf, 1]
// Phase 1: matrix 47 rows 54 cols
[2025-05-31 21:44:57] [INFO ] Computed 11 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 4, 0, 0, 3, 0] Max Struct:[6, +inf, 1, 1, +inf, 1]
RANDOM walk for 1000000 steps (112883 resets) in 683 ms. (1461 steps per ms)
BEST_FIRST walk for 6000003 steps (466240 resets) in 2828 ms. (2120 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 21:45:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-31 21:45:01] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-05-31 21:45:01] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2025-05-31 21:45:01] [INFO ] [Real]Absence check using state equation in 10 ms returned unsat
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-31 21:45:01] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-05-31 21:45:01] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2025-05-31 21:45:01] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2025-05-31 21:45:01] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-31 21:45:01] [INFO ] [Real]Added 3 Read/Feed constraints in 2 ms returned sat
[2025-05-31 21:45:01] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-31 21:45:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-05-31 21:45:01] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 1 ms returned sat
[2025-05-31 21:45:01] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2025-05-31 21:45:01] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:45:01] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:45:01] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
[2025-05-31 21:45:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 86 ms
[2025-05-31 21:45:01] [INFO ] Computed and/alt/rep : 46/168/46 causal constraints (skipped 0 transitions) in 3 ms.
[2025-05-31 21:45:01] [INFO ] Added : 23 causal constraints over 6 iterations in 43 ms. Result :sat
Minimization took 17 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-31 21:45:01] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-05-31 21:45:01] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2025-05-31 21:45:01] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2025-05-31 21:45:01] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-05-31 21:45:01] [INFO ] Computed and/alt/rep : 46/168/46 causal constraints (skipped 0 transitions) in 3 ms.
[2025-05-31 21:45:01] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-31 21:45:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-05-31 21:45:01] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 1 ms returned sat
[2025-05-31 21:45:01] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2025-05-31 21:45:01] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-05-31 21:45:01] [INFO ] Computed and/alt/rep : 46/168/46 causal constraints (skipped 0 transitions) in 2 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:45:01] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:45:01] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 3 ms to minimize.
[2025-05-31 21:45:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 96 ms
[2025-05-31 21:45:01] [INFO ] Added : 44 causal constraints over 9 iterations in 157 ms. Result :sat
Minimization took 29 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-31 21:45:01] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-05-31 21:45:01] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2025-05-31 21:45:01] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-05-31 21:45:01] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-05-31 21:45:01] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-31 21:45:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-05-31 21:45:01] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2025-05-31 21:45:01] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2025-05-31 21:45:01] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2025-05-31 21:45:01] [INFO ] Computed and/alt/rep : 46/168/46 causal constraints (skipped 0 transitions) in 3 ms.
[2025-05-31 21:45:01] [INFO ] Added : 38 causal constraints over 8 iterations in 56 ms. Result :sat
Minimization took 20 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-31 21:45:01] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-05-31 21:45:01] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 1 ms returned sat
[2025-05-31 21:45:01] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-05-31 21:45:02] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-31 21:45:02] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-05-31 21:45:02] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2025-05-31 21:45:02] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2025-05-31 21:45:02] [INFO ] [Nat]Added 3 Read/Feed constraints in 3 ms returned sat
[2025-05-31 21:45:02] [INFO ] Computed and/alt/rep : 46/168/46 causal constraints (skipped 0 transitions) in 4 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:45:02] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2025-05-31 21:45:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2025-05-31 21:45:02] [INFO ] Added : 42 causal constraints over 9 iterations in 97 ms. Result :sat
Minimization took 36 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-31 21:45:02] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-05-31 21:45:02] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2025-05-31 21:45:02] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2025-05-31 21:45:02] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-05-31 21:45:02] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-31 21:45:02] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-05-31 21:45:02] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2025-05-31 21:45:02] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-05-31 21:45:02] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-05-31 21:45:02] [INFO ] Computed and/alt/rep : 46/168/46 causal constraints (skipped 0 transitions) in 2 ms.
[2025-05-31 21:45:02] [INFO ] Added : 42 causal constraints over 9 iterations in 51 ms. Result :sat
Minimization took 23 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 54 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 47/47 transitions.
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 1 place count 54 transition count 47
Applied a total of 1 rules in 4 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 4 ms. Remains : 54/54 places, 47/47 transitions.
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {1=1, 2=1, 3=1, 6=2, 14=1, 15=1, 16=1, 19=2, 21=1, 22=1, 32=1, 33=1, 41=2, 43=1, 44=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, 14=1, 15=1, 16=1, 32=1, 33=1, 43=1, 44=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1150 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :[4, 0, 0, 2, 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 21:45:02] [INFO ] Computed 11 invariants in 5 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 (112846 resets) in 585 ms. (1706 steps per ms)
BEST_FIRST walk for 5000001 steps (389232 resets) in 2215 ms. (2256 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 21:45:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-31 21:45:05] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-05-31 21:45:05] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2025-05-31 21:45:05] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2025-05-31 21:45:05] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-31 21:45:05] [INFO ] [Real]Added 3 Read/Feed constraints in 2 ms returned sat
[2025-05-31 21:45:05] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-31 21:45:05] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-05-31 21:45:05] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2025-05-31 21:45:05] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2025-05-31 21:45:05] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:45:05] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 2 ms to minimize.
[2025-05-31 21:45:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2025-05-31 21:45:05] [INFO ] Computed and/alt/rep : 46/170/46 causal constraints (skipped 0 transitions) in 3 ms.
[2025-05-31 21:45:05] [INFO ] Added : 21 causal constraints over 5 iterations in 35 ms. Result :sat
Minimization took 16 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-31 21:45:05] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-05-31 21:45:05] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2025-05-31 21:45:05] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2025-05-31 21:45:05] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-05-31 21:45:05] [INFO ] Computed and/alt/rep : 46/170/46 causal constraints (skipped 0 transitions) in 3 ms.
[2025-05-31 21:45:05] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-31 21:45:05] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-05-31 21:45:05] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 1 ms returned sat
[2025-05-31 21:45:05] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-05-31 21:45:05] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-05-31 21:45:05] [INFO ] Computed and/alt/rep : 46/170/46 causal constraints (skipped 0 transitions) in 3 ms.
[2025-05-31 21:45:05] [INFO ] Added : 45 causal constraints over 9 iterations in 56 ms. Result :sat
Minimization took 25 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-31 21:45:05] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-05-31 21:45:05] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 1 ms returned sat
[2025-05-31 21:45:05] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2025-05-31 21:45:05] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-05-31 21:45:05] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-31 21:45:05] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-05-31 21:45:05] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2025-05-31 21:45:05] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-05-31 21:45:05] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2025-05-31 21:45:05] [INFO ] Computed and/alt/rep : 46/170/46 causal constraints (skipped 0 transitions) in 4 ms.
[2025-05-31 21:45:05] [INFO ] Added : 43 causal constraints over 9 iterations in 63 ms. Result :sat
Minimization took 25 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-31 21:45:05] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-05-31 21:45:05] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2025-05-31 21:45:05] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2025-05-31 21:45:05] [INFO ] [Real]Added 3 Read/Feed constraints in 4 ms returned sat
[2025-05-31 21:45:05] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-31 21:45:05] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-05-31 21:45:05] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2025-05-31 21:45:06] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-05-31 21:45:06] [INFO ] [Nat]Added 3 Read/Feed constraints in 3 ms returned sat
[2025-05-31 21:45:06] [INFO ] Computed and/alt/rep : 46/170/46 causal constraints (skipped 0 transitions) in 2 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:45:06] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 3 ms to minimize.
[2025-05-31 21:45:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2025-05-31 21:45:06] [INFO ] Added : 40 causal constraints over 9 iterations in 110 ms. Result :sat
Minimization took 66 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-31 21:45:06] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-05-31 21:45:06] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 1 ms returned sat
[2025-05-31 21:45:06] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-05-31 21:45:06] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-05-31 21:45:06] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-31 21:45:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-05-31 21:45:06] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 1 ms returned sat
[2025-05-31 21:45:06] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2025-05-31 21:45:06] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-05-31 21:45:06] [INFO ] Computed and/alt/rep : 46/170/46 causal constraints (skipped 0 transitions) in 2 ms.
[2025-05-31 21:45:06] [INFO ] Added : 39 causal constraints over 8 iterations in 45 ms. Result :sat
Minimization took 23 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 3 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 21:45:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:45:06] [INFO ] Implicit Places using invariants in 55 ms returned [35, 36]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 57 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 21:45:06] [INFO ] Computed 9 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:45:06] [INFO ] Implicit Places using invariants in 38 ms returned []
[2025-05-31 21:45:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:45:06] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-31 21:45:06] [INFO ] Implicit Places using invariants and state equation in 65 ms returned [18, 23]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 104 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 5 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 21:45:06] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:45:06] [INFO ] Implicit Places using invariants in 34 ms returned []
[2025-05-31 21:45:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:45:06] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-31 21:45:06] [INFO ] Implicit Places using invariants and state equation in 57 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 269 ms. Remains : 47/54 places, 44/47 transitions.
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {1=1, 2=1, 3=1, 5=1, 11=1, 13=1, 15=1, 17=1, 18=1, 24=1, 29=1, 36=1, 39=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, 12=1, 13=1, 26=1, 27=1, 36=1, 37=1, 42=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1240 resets, run finished after 21 ms. (steps per millisecond=476 ) 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 21:45:06] [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 (125182 resets) in 588 ms. (1697 steps per ms)
BEST_FIRST walk for 5000002 steps (417358 resets) in 2063 ms. (2422 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 21:45:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-31 21:45:09] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2025-05-31 21:45:09] [INFO ] [Real]Absence check using 2 positive and 5 generalized place invariants in 2 ms returned sat
[2025-05-31 21:45:09] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-05-31 21:45:09] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-31 21:45:09] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-05-31 21:45:09] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-31 21:45:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-05-31 21:45:09] [INFO ] [Nat]Absence check using 2 positive and 5 generalized place invariants in 2 ms returned sat
[2025-05-31 21:45:09] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2025-05-31 21:45:09] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:45:09] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 2 ms to minimize.
[2025-05-31 21:45:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2025-05-31 21:45:09] [INFO ] Computed and/alt/rep : 43/151/43 causal constraints (skipped 0 transitions) in 3 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:45:09] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 2 ms to minimize.
[2025-05-31 21:45:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2025-05-31 21:45:09] [INFO ] Added : 22 causal constraints over 5 iterations in 98 ms. Result :sat
Minimization took 29 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-31 21:45:09] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-05-31 21:45:09] [INFO ] [Real]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2025-05-31 21:45:09] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2025-05-31 21:45:09] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-05-31 21:45:09] [INFO ] Computed and/alt/rep : 43/151/43 causal constraints (skipped 0 transitions) in 2 ms.
[2025-05-31 21:45:09] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-31 21:45:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-05-31 21:45:09] [INFO ] [Nat]Absence check using 2 positive and 5 generalized place invariants in 2 ms returned sat
[2025-05-31 21:45:09] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2025-05-31 21:45:09] [INFO ] [Nat]Added 3 Read/Feed constraints in 3 ms returned sat
[2025-05-31 21:45:09] [INFO ] Computed and/alt/rep : 43/151/43 causal constraints (skipped 0 transitions) in 3 ms.
[2025-05-31 21:45:09] [INFO ] Added : 39 causal constraints over 8 iterations in 46 ms. Result :sat
Minimization took 23 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-31 21:45:09] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-05-31 21:45:09] [INFO ] [Real]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2025-05-31 21:45:09] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2025-05-31 21:45:09] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-05-31 21:45:09] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-31 21:45:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-05-31 21:45:09] [INFO ] [Nat]Absence check using 2 positive and 5 generalized place invariants in 2 ms returned sat
[2025-05-31 21:45:09] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2025-05-31 21:45:09] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-05-31 21:45:09] [INFO ] Computed and/alt/rep : 43/151/43 causal constraints (skipped 0 transitions) in 2 ms.
[2025-05-31 21:45:10] [INFO ] Added : 41 causal constraints over 9 iterations in 47 ms. Result :sat
Minimization took 26 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-31 21:45:10] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-05-31 21:45:10] [INFO ] [Real]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2025-05-31 21:45:10] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2025-05-31 21:45:10] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-05-31 21:45:10] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-31 21:45:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2025-05-31 21:45:10] [INFO ] [Nat]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2025-05-31 21:45:10] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2025-05-31 21:45:10] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2025-05-31 21:45:10] [INFO ] Computed and/alt/rep : 43/151/43 causal constraints (skipped 0 transitions) in 4 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:45:10] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 3 ms to minimize.
[2025-05-31 21:45:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2025-05-31 21:45:10] [INFO ] Added : 38 causal constraints over 8 iterations in 112 ms. Result :sat
Minimization took 39 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-31 21:45:10] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-05-31 21:45:10] [INFO ] [Real]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2025-05-31 21:45:10] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-05-31 21:45:10] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-05-31 21:45:10] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-31 21:45:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-05-31 21:45:10] [INFO ] [Nat]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2025-05-31 21:45:10] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2025-05-31 21:45:10] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2025-05-31 21:45:10] [INFO ] Computed and/alt/rep : 43/151/43 causal constraints (skipped 0 transitions) in 2 ms.
[2025-05-31 21:45:10] [INFO ] Added : 37 causal constraints over 8 iterations in 40 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 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 2 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 1 ms. Remains 47 /47 variables (removed 0) and now considering 44/44 (removed 0) transitions.
[2025-05-31 21:45:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:45:10] [INFO ] Implicit Places using invariants in 44 ms returned []
[2025-05-31 21:45:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:45:10] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-31 21:45:10] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 21:45:10] [INFO ] Redundant transitions in 1 ms returned []
Running 43 sub problems to find dead transitions.
[2025-05-31 21:45:10] [INFO ] Invariant cache hit.
[2025-05-31 21:45:10] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 842 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, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 43 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:45:12] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:45:12] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/91 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 43 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:45:13] [INFO ] Deduced a trap along path composed of 8 places in 28 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/91 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/91 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 43 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:45:14] [INFO ] Deduced a trap along path composed of 10 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:45:14] [INFO ] Deduced a trap along path composed of 4 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:45:14] [INFO ] Deduced a trap along path composed of 10 places in 25 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/91 variables, 3/106 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/91 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 43 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:45:15] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/91 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/91 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 16 (OVERLAPS) 0/91 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Int declared 91/91 variables, and 107 constraints, problems are : Problem set: 0 solved, 43 unsolved in 5228 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: 3/3 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 6099ms problems are : Problem set: 0 solved, 43 unsolved
Search for dead transitions found 0 dead transitions in 6104ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6228 ms. Remains : 47/47 places, 44/44 transitions.
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {1=1, 2=1, 3=1, 5=1, 11=1, 13=1, 15=1, 17=1, 18=1, 24=1, 29=1, 36=1, 39=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, 12=1, 13=1, 26=1, 27=1, 36=1, 37=1, 42=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1257 resets, run finished after 16 ms. (steps per millisecond=625 ) 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 21:45:17] [INFO ] Flatten gal took : 23 ms
[2025-05-31 21:45:17] [INFO ] Flatten gal took : 11 ms
[2025-05-31 21:45:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10008566951485450102.gal : 4 ms
[2025-05-31 21:45:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14717559806119569311.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10008566951485450102.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14717559806119569311.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality14717559806119569311.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 (4982 resets) in 826 ms. (48 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.046623,5524,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.047112,5652,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.047403,5780,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.047514,5780,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.04762,5780,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.047723,5780,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.047851,5780,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.048031,5780,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.048192,5780,2,48,17,7574,14,0,243,5286,0
BEST_FIRST walk for 40001 steps (3369 resets) in 406 ms. (98 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (3330 resets) in 182 ms. (218 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (3279 resets) in 139 ms. (285 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (3326 resets) in 96 ms. (412 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (3324 resets) in 118 ms. (336 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (3239 resets) in 108 ms. (367 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (3334 resets) in 103 ms. (384 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (3351 resets) in 140 ms. (283 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 28 ms. (steps per millisecond=89 ) 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 7 ms. (steps per millisecond=359 ) 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 21:45:17] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (1238 resets) in 7 ms. (1250 steps per ms)
BEST_FIRST walk for 10001 steps (819 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2025-05-31 21:45:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-31 21:45:17] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-05-31 21:45:17] [INFO ] [Real]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2025-05-31 21:45:17] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2025-05-31 21:45:17] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-31 21:45:17] [INFO ] [Real]Added 3 Read/Feed constraints in 4 ms returned sat
[2025-05-31 21:45:17] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-31 21:45:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-05-31 21:45:17] [INFO ] [Nat]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2025-05-31 21:45:17] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2025-05-31 21:45:17] [INFO ] [Nat]Added 3 Read/Feed constraints in 6 ms returned sat
[2025-05-31 21:45:17] [INFO ] Computed and/alt/rep : 43/151/43 causal constraints (skipped 0 transitions) in 3 ms.
[2025-05-31 21:45:17] [INFO ] Added : 40 causal constraints over 10 iterations in 64 ms. Result :sat
Minimization took 21 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.1 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 1 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 7 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 7 ms. Remains : 40/47 places, 38/44 transitions.
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {1=1, 2=1, 3=1, 4=1, 8=1, 10=1, 16=1, 24=1, 25=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, 8=1, 16=1, 24=1, 25=1, 27=1, 30=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1548 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
// Phase 1: matrix 38 rows 40 cols
[2025-05-31 21:45:17] [INFO ] Computed 7 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 1000000 steps (156378 resets) in 607 ms. (1644 steps per ms)
BEST_FIRST walk for 1000000 steps (95931 resets) in 402 ms. (2481 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4] Max Struct:[+inf]
[2025-05-31 21:45:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-31 21:45:18] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-05-31 21:45:18] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 1 ms returned sat
[2025-05-31 21:45:18] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-05-31 21:45:18] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-05-31 21:45:18] [INFO ] [Real]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-05-31 21:45:18] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-31 21:45:18] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-05-31 21:45:18] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-31 21:45:18] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2025-05-31 21:45:18] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:45:19] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:45:19] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:45:19] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 2 ms to minimize.
[2025-05-31 21:45:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 117 ms
[2025-05-31 21:45:19] [INFO ] Computed and/alt/rep : 36/170/36 causal constraints (skipped 1 transitions) in 2 ms.
[2025-05-31 21:45:19] [INFO ] Added : 35 causal constraints over 9 iterations in 49 ms. Result :sat
Minimization took 25 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 21:45:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:45:19] [INFO ] Implicit Places using invariants in 50 ms returned []
[2025-05-31 21:45:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:45:19] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-05-31 21:45:19] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 21:45:19] [INFO ] Redundant transitions in 0 ms returned []
Running 37 sub problems to find dead transitions.
[2025-05-31 21:45:19] [INFO ] Invariant cache hit.
[2025-05-31 21:45:19] [INFO ] State equation strengthened by 8 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:45:19] [INFO ] Deduced a trap composed of 20 places in 35 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
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 628 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, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 37 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:45:20] [INFO ] Deduced a trap along path composed of 10 places in 24 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/77 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/77 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 11 (OVERLAPS) 1/78 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/78 variables, 4/94 constraints. Problems are: Problem set: 0 solved, 37 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:45:20] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/78 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 37 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:45:21] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/78 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 37 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:45:21] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:45:21] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:45:21] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:45:21] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:45:21] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/78 variables, 5/101 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/78 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 17 (OVERLAPS) 0/78 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Int declared 78/78 variables, and 101 constraints, problems are : Problem set: 0 solved, 37 unsolved in 3032 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: 8/8 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 3671ms problems are : Problem set: 0 solved, 37 unsolved
Search for dead transitions found 0 dead transitions in 3672ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3799 ms. Remains : 40/40 places, 38/38 transitions.
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {1=1, 2=1, 3=1, 4=1, 8=1, 10=1, 16=1, 24=1, 25=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, 8=1, 16=1, 24=1, 25=1, 27=1, 30=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1539 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :[4]
Current structural bounds on expressions (after cover walk) : Max Seen:[4] Max Struct:[+inf]
[2025-05-31 21:45:23] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[4] Max Struct:[+inf]
RANDOM walk for 1000000 steps (156078 resets) in 556 ms. (1795 steps per ms)
BEST_FIRST walk for 1000000 steps (96065 resets) in 388 ms. (2570 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4] Max Struct:[+inf]
[2025-05-31 21:45:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-31 21:45:24] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-05-31 21:45:24] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 1 ms returned sat
[2025-05-31 21:45:24] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2025-05-31 21:45:24] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-05-31 21:45:24] [INFO ] [Real]Added 8 Read/Feed constraints in 3 ms returned sat
[2025-05-31 21:45:24] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-31 21:45:24] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-05-31 21:45:24] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 1 ms returned sat
[2025-05-31 21:45:24] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2025-05-31 21:45:24] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:45:24] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:45:24] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:45:24] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 2 ms to minimize.
[2025-05-31 21:45:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 136 ms
[2025-05-31 21:45:24] [INFO ] Computed and/alt/rep : 36/170/36 causal constraints (skipped 1 transitions) in 2 ms.
[2025-05-31 21:45:24] [INFO ] Added : 35 causal constraints over 9 iterations in 80 ms. Result :sat
Minimization took 40 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 21:45:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:45:24] [INFO ] Implicit Places using invariants in 43 ms returned []
[2025-05-31 21:45:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 21:45:24] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-05-31 21:45:24] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 21:45:24] [INFO ] Redundant transitions in 1 ms returned []
Running 37 sub problems to find dead transitions.
[2025-05-31 21:45:24] [INFO ] Invariant cache hit.
[2025-05-31 21:45:24] [INFO ] State equation strengthened by 8 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:45:24] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 2 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
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 648 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, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 37 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:45:25] [INFO ] Deduced a trap along path composed of 10 places in 23 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/77 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/77 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 11 (OVERLAPS) 1/78 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/78 variables, 4/94 constraints. Problems are: Problem set: 0 solved, 37 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:45:26] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/78 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 37 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:45:26] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/78 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 37 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:45:26] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:45:26] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:45:26] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:45:26] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 21:45:26] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/78 variables, 5/101 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/78 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 17 (OVERLAPS) 0/78 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Int declared 78/78 variables, and 101 constraints, problems are : Problem set: 0 solved, 37 unsolved in 3052 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: 8/8 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 3713ms problems are : Problem set: 0 solved, 37 unsolved
Search for dead transitions found 0 dead transitions in 3713ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3843 ms. Remains : 40/40 places, 38/38 transitions.
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {1=1, 2=1, 3=1, 4=1, 8=1, 10=1, 16=1, 24=1, 25=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, 8=1, 16=1, 24=1, 25=1, 27=1, 30=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1556 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 21:45:28] [INFO ] Flatten gal took : 12 ms
[2025-05-31 21:45:28] [INFO ] Flatten gal took : 7 ms
[2025-05-31 21:45:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7915937880703401117.gal : 2 ms
[2025-05-31 21:45:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13978611055173848204.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7915937880703401117.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13978611055173848204.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
RANDOM walk for 40000 steps (6255 resets) in 81 ms. (487 steps per ms) remains 1/1 properties
Loading property file /tmp/ReachabilityCardinality13978611055173848204.prop.
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.019283,4748,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.019551,4876,2,140,16,3307,7,0,200,2078,0
BEST_FIRST walk for 40001 steps (3837 resets) in 82 ms. (481 steps per ms) remains 1/1 properties
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 7 ms. (steps per millisecond=62 ) properties seen :1
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 10743 ms.
[2025-05-31 21:45:28] [INFO ] Flatten gal took : 7 ms
[2025-05-31 21:45:28] [INFO ] Applying decomposition
[2025-05-31 21:45:28] [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.202505121319/bin/convert-linux64' '-i' '/tmp/graph7996452199582902222.txt' '-o' '/tmp/graph7996452199582902222.bin' '-w' '/tmp/graph7996452199582902222.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7996452199582902222.bin' '-l' '-1' '-v' '-w' '/tmp/graph7996452199582902222.weights' '-q' '0' '-e' '0.001'
[2025-05-31 21:45:28] [INFO ] Decomposing Gal with order
[2025-05-31 21:45:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 21:45:28] [INFO ] Removed a total of 14 redundant transitions.
[2025-05-31 21:45:28] [INFO ] Flatten gal took : 35 ms
[2025-05-31 21:45:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2025-05-31 21:45:28] [INFO ] Time to serialize gal into /tmp/UpperBounds7189386589067692353.gal : 3 ms
[2025-05-31 21:45:28] [INFO ] Time to serialize properties into /tmp/UpperBounds13156597206466697626.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds7189386589067692353.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds13156597206466697626.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds13156597206466697626.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.033564,5384,381,189,2836,519,217,2635,70,1433,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 <= i4.u5.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.038361,5384,1,0,2836,519,296,2866,98,1779,384
Total runtime 35352 ms.
BK_STOP 1748727928653
--------------------
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
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
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 r072-tall-174860067500469"
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 '
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 ;