MCC'2025- Execution of r072-tall-174860067500477

About the Execution of ITS-Tools for DoubleExponent-PT-003

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
0.000	40941.00	0.00	0.00	1 1 1 1 1 1 1 1 1 1 1 1 1 1 2 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-174860067500477.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-003, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r072-tall-174860067500477
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 7.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 173K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 50K May 29 14:32 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1748729929169

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-003
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2025-05-31 22:18:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-31 22:18:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 22:18:50] [INFO ] Load time of PNML (sax parser for PT used): 59 ms
[2025-05-31 22:18:50] [INFO ] Transformed 163 places.
[2025-05-31 22:18:50] [INFO ] Transformed 148 transitions.
[2025-05-31 22:18:50] [INFO ] Parsed PT model containing 163 places and 148 transitions and 417 arcs in 146 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 148 rows 163 cols
[2025-05-31 22:18:50] [INFO ] Computed 19 invariants in 19 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1]
RANDOM walk for 10000 steps (329 resets) in 36 ms. (270 steps per ms)
FORMULA DoubleExponent-PT-003-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-003-UpperBounds-14 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-003-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-003-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-003-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-003-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 100002 steps (2827 resets) in 199 ms. (500 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-31 22:18:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-31 22:18:51] [INFO ] [Real]Absence check using 5 positive place invariants in 9 ms returned sat
[2025-05-31 22:18:51] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 6 ms returned sat
[2025-05-31 22:18:51] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:18:51] [INFO ] Deduced a trap composed of 18 places in 93 ms of which 16 ms to minimize.
[2025-05-31 22:18:51] [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 22:18:51] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2025-05-31 22:18:51] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned sat
[2025-05-31 22:18:51] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:18:51] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:18:51] [INFO ] Deduced a trap composed of 42 places in 74 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:18:51] [INFO ] Deduced a trap composed of 41 places in 74 ms of which 14 ms to minimize.
[2025-05-31 22:18:51] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 277 ms
[2025-05-31 22:18:51] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 9 ms.
[2025-05-31 22:18:52] [INFO ] Added : 119 causal constraints over 24 iterations in 479 ms. Result :sat
Minimization took 135 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-31 22:18:52] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2025-05-31 22:18:52] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 4 ms returned sat
[2025-05-31 22:18:52] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2025-05-31 22:18:52] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 7 ms.
[2025-05-31 22:18:52] [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 22:18:52] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2025-05-31 22:18:52] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned sat
[2025-05-31 22:18:52] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2025-05-31 22:18:52] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 10 ms.
[2025-05-31 22:18:52] [INFO ] Added : 81 causal constraints over 17 iterations in 261 ms. Result :sat
Minimization took 118 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-31 22:18:53] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2025-05-31 22:18:53] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned sat
[2025-05-31 22:18:53] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:18:53] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 3 ms to minimize.
[2025-05-31 22:18: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 22:18:53] [INFO ] [Nat]Absence check using 5 positive place invariants in 6 ms returned sat
[2025-05-31 22:18:53] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned sat
[2025-05-31 22:18:53] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:18:53] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 2 ms to minimize.
[2025-05-31 22:18:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2025-05-31 22:18:53] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 9 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:18:53] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 3 ms to minimize.
[2025-05-31 22:18:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2025-05-31 22:18:53] [INFO ] Added : 140 causal constraints over 29 iterations in 577 ms. Result :sat
Minimization took 144 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-31 22:18:54] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2025-05-31 22:18:54] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned sat
[2025-05-31 22:18:54] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2025-05-31 22:18:54] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 8 ms.
[2025-05-31 22:18: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 22:18:54] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2025-05-31 22:18:54] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned sat
[2025-05-31 22:18:54] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2025-05-31 22:18:54] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 7 ms.
[2025-05-31 22:18:54] [INFO ] Added : 112 causal constraints over 23 iterations in 355 ms. Result :sat
Minimization took 130 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-31 22:18:54] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2025-05-31 22:18:54] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned sat
[2025-05-31 22:18:54] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2025-05-31 22:18:54] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 10 ms.
[2025-05-31 22:18: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 22:18:55] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2025-05-31 22:18:55] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned sat
[2025-05-31 22:18:55] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2025-05-31 22:18:55] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 9 ms.
[2025-05-31 22:18:55] [INFO ] Added : 63 causal constraints over 13 iterations in 268 ms. Result :sat
Minimization took 112 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-31 22:18:55] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2025-05-31 22:18:55] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned sat
[2025-05-31 22:18:55] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2025-05-31 22:18:55] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 13 ms.
[2025-05-31 22:18: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 22:18:55] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2025-05-31 22:18:55] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned sat
[2025-05-31 22:18:55] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2025-05-31 22:18:55] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 9 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:18:56] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 2 ms to minimize.
[2025-05-31 22:18:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2025-05-31 22:18:56] [INFO ] Added : 144 causal constraints over 29 iterations in 541 ms. Result :sat
Minimization took 146 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-31 22:18:56] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2025-05-31 22:18:56] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned sat
[2025-05-31 22:18:56] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2025-05-31 22:18:56] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 7 ms.
[2025-05-31 22:18: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 22:18:56] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2025-05-31 22:18:56] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned sat
[2025-05-31 22:18:56] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2025-05-31 22:18:56] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 9 ms.
[2025-05-31 22:18:57] [INFO ] Added : 139 causal constraints over 28 iterations in 462 ms. Result :sat
Minimization took 137 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-31 22:18:57] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2025-05-31 22:18:57] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 4 ms returned sat
[2025-05-31 22:18:57] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:18:57] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 7 ms to minimize.
[2025-05-31 22:18:57] [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 22:18:57] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2025-05-31 22:18:57] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 4 ms returned sat
[2025-05-31 22:18:57] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:18:57] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:18:57] [INFO ] Deduced a trap composed of 50 places in 47 ms of which 7 ms to minimize.
[2025-05-31 22:18:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 127 ms
[2025-05-31 22:18:57] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 8 ms.
[2025-05-31 22:18:58] [INFO ] Added : 100 causal constraints over 20 iterations in 337 ms. Result :sat
Minimization took 132 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-31 22:18:58] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2025-05-31 22:18:58] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned sat
[2025-05-31 22:18:58] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:18:58] [INFO ] Deduced a trap composed of 42 places in 77 ms of which 15 ms to minimize.
[2025-05-31 22:18:58] [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 22:18:58] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2025-05-31 22:18:58] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned sat
[2025-05-31 22:18:58] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:18:58] [INFO ] Deduced a trap composed of 42 places in 72 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:18:58] [INFO ] Deduced a trap composed of 52 places in 75 ms of which 18 ms to minimize.
[2025-05-31 22:18:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 175 ms
[2025-05-31 22:18:58] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 9 ms.
[2025-05-31 22:18:58] [INFO ] Added : 66 causal constraints over 14 iterations in 250 ms. Result :sat
Minimization took 107 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-31 22:18:59] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2025-05-31 22:18:59] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 2 ms returned sat
[2025-05-31 22:18:59] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:18:59] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 8 ms to minimize.
[2025-05-31 22:18:59] [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 22:18:59] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2025-05-31 22:18:59] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 3 ms returned sat
[2025-05-31 22:18:59] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:18:59] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:18:59] [INFO ] Deduced a trap composed of 42 places in 64 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:18:59] [INFO ] Deduced a trap composed of 46 places in 70 ms of which 15 ms to minimize.
[2025-05-31 22:18:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 239 ms
[2025-05-31 22:18:59] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints (skipped 0 transitions) in 8 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:18:59] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:00] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 9 ms to minimize.
[2025-05-31 22:19:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 156 ms
[2025-05-31 22:19:00] [INFO ] Added : 112 causal constraints over 23 iterations in 514 ms. Result :sat
Minimization took 114 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Support contains 10 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 148/148 transitions.
Graph (complete) has 269 edges and 163 vertex of which 157 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 156 transition count 121
Reduce places removed 25 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 30 rules applied. Total rules applied 59 place count 131 transition count 116
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 64 place count 126 transition count 116
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 64 place count 126 transition count 108
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 80 place count 118 transition count 108
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 124 place count 96 transition count 86
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 132 place count 92 transition count 86
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 133 place count 92 transition count 85
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 134 place count 91 transition count 85
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 4 with 13 rules applied. Total rules applied 147 place count 91 transition count 72
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 4 with 13 rules applied. Total rules applied 160 place count 78 transition count 72
Partial Free-agglomeration rule applied 12 times.
Drop transitions (Partial Free agglomeration) removed 12 transitions
Iterating global reduction 5 with 12 rules applied. Total rules applied 172 place count 78 transition count 72
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 173 place count 77 transition count 71
Applied a total of 173 rules in 63 ms. Remains 77 /163 variables (removed 86) and now considering 71/148 (removed 77) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 77/163 places, 71/148 transitions.
// Phase 1: matrix 71 rows 77 cols
[2025-05-31 22:19:00] [INFO ] Computed 15 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (128041 resets) in 767 ms. (1302 steps per ms)
FORMULA DoubleExponent-PT-003-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-003-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-003-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleExponent-PT-003-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 6000002 steps (508189 resets) in 2899 ms. (2068 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
[2025-05-31 22:19:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-31 22:19:04] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-05-31 22:19:04] [INFO ] [Real]Absence check using 2 positive and 13 generalized place invariants in 3 ms returned sat
[2025-05-31 22:19:04] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-05-31 22:19:04] [INFO ] State equation strengthened by 7 read => feed constraints.
[2025-05-31 22:19:04] [INFO ] [Real]Added 7 Read/Feed constraints in 3 ms returned sat
[2025-05-31 22:19:04] [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 22:19:04] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-05-31 22:19:04] [INFO ] [Nat]Absence check using 2 positive and 13 generalized place invariants in 2 ms returned sat
[2025-05-31 22:19:04] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2025-05-31 22:19:04] [INFO ] [Nat]Added 7 Read/Feed constraints in 4 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:04] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 5 ms to minimize.
[2025-05-31 22:19:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2025-05-31 22:19:04] [INFO ] Computed and/alt/rep : 69/306/69 causal constraints (skipped 1 transitions) in 3 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:05] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:05] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 2 ms to minimize.
[2025-05-31 22:19:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 105 ms
[2025-05-31 22:19:05] [INFO ] Added : 67 causal constraints over 15 iterations in 288 ms. Result :sat
Minimization took 61 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-31 22:19:05] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-05-31 22:19:05] [INFO ] [Real]Absence check using 2 positive and 13 generalized place invariants in 3 ms returned sat
[2025-05-31 22:19:05] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-05-31 22:19:05] [INFO ] [Real]Added 7 Read/Feed constraints in 4 ms returned sat
[2025-05-31 22:19:05] [INFO ] Computed and/alt/rep : 69/306/69 causal constraints (skipped 1 transitions) in 4 ms.
[2025-05-31 22:19: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 22:19:05] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-05-31 22:19:05] [INFO ] [Nat]Absence check using 2 positive and 13 generalized place invariants in 3 ms returned sat
[2025-05-31 22:19:05] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-05-31 22:19:05] [INFO ] [Nat]Added 7 Read/Feed constraints in 9 ms returned sat
[2025-05-31 22:19:05] [INFO ] Computed and/alt/rep : 69/306/69 causal constraints (skipped 1 transitions) in 3 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:05] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 4 ms to minimize.
[2025-05-31 22:19:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2025-05-31 22:19:05] [INFO ] Added : 68 causal constraints over 14 iterations in 217 ms. Result :sat
Minimization took 69 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-31 22:19:05] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-05-31 22:19:05] [INFO ] [Real]Absence check using 2 positive and 13 generalized place invariants in 4 ms returned sat
[2025-05-31 22:19:05] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-05-31 22:19:05] [INFO ] [Real]Added 7 Read/Feed constraints in 4 ms returned sat
[2025-05-31 22:19: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 22:19:05] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-05-31 22:19:05] [INFO ] [Nat]Absence check using 2 positive and 13 generalized place invariants in 3 ms returned sat
[2025-05-31 22:19:05] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2025-05-31 22:19:05] [INFO ] [Nat]Added 7 Read/Feed constraints in 4 ms returned sat
[2025-05-31 22:19:05] [INFO ] Computed and/alt/rep : 69/306/69 causal constraints (skipped 1 transitions) in 4 ms.
[2025-05-31 22:19:05] [INFO ] Added : 60 causal constraints over 12 iterations in 142 ms. Result :sat
Minimization took 64 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-31 22:19:05] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-05-31 22:19:05] [INFO ] [Real]Absence check using 2 positive and 13 generalized place invariants in 2 ms returned sat
[2025-05-31 22:19:05] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-05-31 22:19:06] [INFO ] [Real]Added 7 Read/Feed constraints in 4 ms returned sat
[2025-05-31 22:19: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 22:19:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-05-31 22:19:06] [INFO ] [Nat]Absence check using 2 positive and 13 generalized place invariants in 2 ms returned sat
[2025-05-31 22:19:06] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2025-05-31 22:19:06] [INFO ] [Nat]Added 7 Read/Feed constraints in 9 ms returned sat
[2025-05-31 22:19:06] [INFO ] Computed and/alt/rep : 69/306/69 causal constraints (skipped 1 transitions) in 5 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:06] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:06] [INFO ] Deduced a trap composed of 4 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 22:19:06] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 4 ms to minimize.
[2025-05-31 22:19:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 167 ms
[2025-05-31 22:19:06] [INFO ] Added : 58 causal constraints over 13 iterations in 298 ms. Result :sat
Minimization took 59 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-31 22:19:06] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-05-31 22:19:06] [INFO ] [Real]Absence check using 2 positive and 13 generalized place invariants in 12 ms returned sat
[2025-05-31 22:19:06] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-05-31 22:19:06] [INFO ] [Real]Added 7 Read/Feed constraints in 4 ms returned sat
[2025-05-31 22:19: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 22:19:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-05-31 22:19:06] [INFO ] [Nat]Absence check using 2 positive and 13 generalized place invariants in 2 ms returned sat
[2025-05-31 22:19:06] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2025-05-31 22:19:06] [INFO ] [Nat]Added 7 Read/Feed constraints in 4 ms returned sat
[2025-05-31 22:19:06] [INFO ] Computed and/alt/rep : 69/306/69 causal constraints (skipped 1 transitions) in 4 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:06] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 4 ms to minimize.
[2025-05-31 22:19:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2025-05-31 22:19:06] [INFO ] Added : 67 causal constraints over 15 iterations in 239 ms. Result :sat
Minimization took 86 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-31 22:19:06] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-05-31 22:19:06] [INFO ] [Real]Absence check using 2 positive and 13 generalized place invariants in 2 ms returned sat
[2025-05-31 22:19:06] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-05-31 22:19:06] [INFO ] [Real]Added 7 Read/Feed constraints in 4 ms returned sat
[2025-05-31 22:19: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 22:19:07] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-05-31 22:19:07] [INFO ] [Nat]Absence check using 2 positive and 13 generalized place invariants in 3 ms returned sat
[2025-05-31 22:19:07] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2025-05-31 22:19:07] [INFO ] [Nat]Added 7 Read/Feed constraints in 4 ms returned sat
[2025-05-31 22:19:07] [INFO ] Computed and/alt/rep : 69/306/69 causal constraints (skipped 1 transitions) in 5 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:07] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 2 ms to minimize.
[2025-05-31 22:19:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2025-05-31 22:19:07] [INFO ] Added : 67 causal constraints over 14 iterations in 246 ms. Result :sat
Minimization took 76 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Support contains 6 out of 77 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 71/71 transitions.
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 2 place count 76 transition count 70
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 75 transition count 70
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 75 transition count 69
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 6 place count 74 transition count 69
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 74 transition count 69
Applied a total of 7 rules in 13 ms. Remains 74 /77 variables (removed 3) and now considering 69/71 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 74/77 places, 69/71 transitions.
// Phase 1: matrix 69 rows 74 cols
[2025-05-31 22:19:07] [INFO ] Computed 15 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (127773 resets) in 695 ms. (1436 steps per ms)
BEST_FIRST walk for 6000002 steps (508806 resets) in 2935 ms. (2043 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
[2025-05-31 22:19:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-31 22:19:11] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-05-31 22:19:11] [INFO ] [Real]Absence check using 6 positive and 9 generalized place invariants in 2 ms returned sat
[2025-05-31 22:19:11] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-05-31 22:19:11] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-05-31 22:19:11] [INFO ] [Real]Added 10 Read/Feed constraints in 4 ms returned sat
[2025-05-31 22:19:11] [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 22:19:11] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-05-31 22:19:11] [INFO ] [Nat]Absence check using 6 positive and 9 generalized place invariants in 3 ms returned sat
[2025-05-31 22:19:11] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2025-05-31 22:19:11] [INFO ] [Nat]Added 10 Read/Feed constraints in 5 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:11] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 6 ms to minimize.
[2025-05-31 22:19:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2025-05-31 22:19:11] [INFO ] Computed and/alt/rep : 64/314/64 causal constraints (skipped 4 transitions) in 4 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:11] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 3 ms to minimize.
[2025-05-31 22:19:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2025-05-31 22:19:11] [INFO ] Added : 46 causal constraints over 10 iterations in 165 ms. Result :sat
Minimization took 44 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-31 22:19:11] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-05-31 22:19:11] [INFO ] [Real]Absence check using 6 positive and 9 generalized place invariants in 2 ms returned sat
[2025-05-31 22:19:11] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-05-31 22:19:11] [INFO ] [Real]Added 10 Read/Feed constraints in 3 ms returned sat
[2025-05-31 22:19:11] [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 22:19:11] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-05-31 22:19:11] [INFO ] [Nat]Absence check using 6 positive and 9 generalized place invariants in 2 ms returned sat
[2025-05-31 22:19:11] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-05-31 22:19:11] [INFO ] [Nat]Added 10 Read/Feed constraints in 3 ms returned sat
[2025-05-31 22:19:11] [INFO ] Computed and/alt/rep : 64/314/64 causal constraints (skipped 4 transitions) in 4 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:11] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2025-05-31 22:19:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2025-05-31 22:19:11] [INFO ] Added : 51 causal constraints over 11 iterations in 152 ms. Result :sat
Minimization took 45 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-31 22:19:11] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-05-31 22:19:11] [INFO ] [Real]Absence check using 6 positive and 9 generalized place invariants in 2 ms returned sat
[2025-05-31 22:19:11] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-05-31 22:19:11] [INFO ] [Real]Added 10 Read/Feed constraints in 4 ms returned sat
[2025-05-31 22:19:11] [INFO ] Computed and/alt/rep : 64/314/64 causal constraints (skipped 4 transitions) in 4 ms.
[2025-05-31 22:19:11] [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 22:19:11] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-05-31 22:19:11] [INFO ] [Nat]Absence check using 6 positive and 9 generalized place invariants in 2 ms returned sat
[2025-05-31 22:19:11] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-05-31 22:19:11] [INFO ] [Nat]Added 10 Read/Feed constraints in 7 ms returned sat
[2025-05-31 22:19:11] [INFO ] Computed and/alt/rep : 64/314/64 causal constraints (skipped 4 transitions) in 4 ms.
[2025-05-31 22:19:12] [INFO ] Added : 27 causal constraints over 7 iterations in 77 ms. Result :sat
Minimization took 40 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-31 22:19:12] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2025-05-31 22:19:12] [INFO ] [Real]Absence check using 6 positive and 9 generalized place invariants in 2 ms returned sat
[2025-05-31 22:19:12] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-05-31 22:19:12] [INFO ] [Real]Added 10 Read/Feed constraints in 6 ms returned sat
[2025-05-31 22:19:12] [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 22:19:12] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-05-31 22:19:12] [INFO ] [Nat]Absence check using 6 positive and 9 generalized place invariants in 2 ms returned sat
[2025-05-31 22:19:12] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2025-05-31 22:19:12] [INFO ] [Nat]Added 10 Read/Feed constraints in 5 ms returned sat
[2025-05-31 22:19:12] [INFO ] Computed and/alt/rep : 64/314/64 causal constraints (skipped 4 transitions) in 4 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:12] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:12] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 4 ms to minimize.
[2025-05-31 22:19:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 125 ms
[2025-05-31 22:19:12] [INFO ] Added : 64 causal constraints over 16 iterations in 304 ms. Result :sat
Minimization took 74 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-31 22:19:12] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-05-31 22:19:12] [INFO ] [Real]Absence check using 6 positive and 9 generalized place invariants in 2 ms returned sat
[2025-05-31 22:19:12] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-05-31 22:19:12] [INFO ] [Real]Added 10 Read/Feed constraints in 5 ms returned sat
[2025-05-31 22:19:12] [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 22:19:12] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-05-31 22:19:12] [INFO ] [Nat]Absence check using 6 positive and 9 generalized place invariants in 2 ms returned sat
[2025-05-31 22:19:12] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2025-05-31 22:19:12] [INFO ] [Nat]Added 10 Read/Feed constraints in 6 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:12] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 3 ms to minimize.
[2025-05-31 22:19:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2025-05-31 22:19:12] [INFO ] Computed and/alt/rep : 64/314/64 causal constraints (skipped 4 transitions) in 5 ms.
[2025-05-31 22:19:12] [INFO ] Added : 61 causal constraints over 13 iterations in 127 ms. Result :sat
Minimization took 57 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-31 22:19:12] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-05-31 22:19:12] [INFO ] [Real]Absence check using 6 positive and 9 generalized place invariants in 3 ms returned sat
[2025-05-31 22:19:12] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-05-31 22:19:12] [INFO ] [Real]Added 10 Read/Feed constraints in 4 ms returned sat
[2025-05-31 22:19:12] [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 22:19:12] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-05-31 22:19:12] [INFO ] [Nat]Absence check using 6 positive and 9 generalized place invariants in 2 ms returned sat
[2025-05-31 22:19:13] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-05-31 22:19:13] [INFO ] [Nat]Added 10 Read/Feed constraints in 4 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:13] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 6 ms to minimize.
[2025-05-31 22:19:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2025-05-31 22:19:13] [INFO ] Computed and/alt/rep : 64/314/64 causal constraints (skipped 4 transitions) in 7 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:13] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:13] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 2 ms to minimize.
[2025-05-31 22:19:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 112 ms
[2025-05-31 22:19:13] [INFO ] Added : 46 causal constraints over 10 iterations in 213 ms. Result :sat
Minimization took 50 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Support contains 6 out of 74 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 69/69 transitions.
Applied a total of 0 rules in 3 ms. Remains 74 /74 variables (removed 0) and now considering 69/69 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 74/74 places, 69/69 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 69/69 transitions.
Applied a total of 0 rules in 3 ms. Remains 74 /74 variables (removed 0) and now considering 69/69 (removed 0) transitions.
[2025-05-31 22:19:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:19:13] [INFO ] Implicit Places using invariants in 74 ms returned [15, 22, 41, 46, 64, 71]
[2025-05-31 22:19:13] [INFO ] Actually due to overlaps returned [46, 41]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 76 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 72/74 places, 69/69 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 72 transition count 68
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 71 transition count 68
Applied a total of 2 rules in 5 ms. Remains 71 /72 variables (removed 1) and now considering 68/69 (removed 1) transitions.
// Phase 1: matrix 68 rows 71 cols
[2025-05-31 22:19:13] [INFO ] Computed 13 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:19:13] [INFO ] Implicit Places using invariants in 59 ms returned [15, 22, 61, 68]
[2025-05-31 22:19:13] [INFO ] Actually due to overlaps returned [61, 15]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 61 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 69/74 places, 68/69 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 68 transition count 67
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 68 transition count 67
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 68 transition count 67
Applied a total of 3 rules in 12 ms. Remains 68 /69 variables (removed 1) and now considering 67/68 (removed 1) transitions.
// Phase 1: matrix 67 rows 68 cols
[2025-05-31 22:19:13] [INFO ] Computed 11 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:19:13] [INFO ] Implicit Places using invariants in 60 ms returned [65]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 61 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 67/74 places, 67/69 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 67 transition count 66
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 66 transition count 66
Applied a total of 2 rules in 15 ms. Remains 66 /67 variables (removed 1) and now considering 66/67 (removed 1) transitions.
// Phase 1: matrix 66 rows 66 cols
[2025-05-31 22:19:13] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:19:13] [INFO ] Implicit Places using invariants in 59 ms returned []
[2025-05-31 22:19:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:19:13] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-05-31 22:19:13] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 66/74 places, 66/69 transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 437 ms. Remains : 66/74 places, 66/69 transitions.
[2025-05-31 22:19:13] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (144464 resets) in 652 ms. (1531 steps per ms)
BEST_FIRST walk for 6000004 steps (548431 resets) in 2847 ms. (2106 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
[2025-05-31 22:19:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-31 22:19:17] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-05-31 22:19:17] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2025-05-31 22:19:17] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-05-31 22:19:17] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-05-31 22:19:17] [INFO ] [Real]Added 10 Read/Feed constraints in 3 ms returned sat
[2025-05-31 22:19:17] [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 22:19:17] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-05-31 22:19:17] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2025-05-31 22:19:17] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-05-31 22:19:17] [INFO ] [Nat]Added 10 Read/Feed constraints in 7 ms returned sat
[2025-05-31 22:19:17] [INFO ] Computed and/alt/rep : 61/292/61 causal constraints (skipped 4 transitions) in 5 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:17] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 3 ms to minimize.
[2025-05-31 22:19:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2025-05-31 22:19:17] [INFO ] Added : 51 causal constraints over 11 iterations in 170 ms. Result :sat
Minimization took 47 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-31 22:19:17] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-05-31 22:19:17] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2025-05-31 22:19:17] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2025-05-31 22:19:17] [INFO ] [Real]Added 10 Read/Feed constraints in 9 ms returned sat
[2025-05-31 22:19:17] [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 22:19:17] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-05-31 22:19:17] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2025-05-31 22:19:17] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-05-31 22:19:17] [INFO ] [Nat]Added 10 Read/Feed constraints in 4 ms returned sat
[2025-05-31 22:19:17] [INFO ] Computed and/alt/rep : 61/292/61 causal constraints (skipped 4 transitions) in 5 ms.
[2025-05-31 22:19:17] [INFO ] Added : 56 causal constraints over 12 iterations in 115 ms. Result :sat
Minimization took 46 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-31 22:19:18] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2025-05-31 22:19:18] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 0 ms returned sat
[2025-05-31 22:19:18] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2025-05-31 22:19:18] [INFO ] [Real]Added 10 Read/Feed constraints in 4 ms returned sat
[2025-05-31 22:19:18] [INFO ] Computed and/alt/rep : 61/292/61 causal constraints (skipped 4 transitions) in 4 ms.
[2025-05-31 22:19: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 22:19:18] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-05-31 22:19:18] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2025-05-31 22:19:18] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2025-05-31 22:19:18] [INFO ] [Nat]Added 10 Read/Feed constraints in 5 ms returned sat
[2025-05-31 22:19:18] [INFO ] Computed and/alt/rep : 61/292/61 causal constraints (skipped 4 transitions) in 4 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:18] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:18] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 5 ms to minimize.
[2025-05-31 22:19:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 115 ms
[2025-05-31 22:19:18] [INFO ] Added : 55 causal constraints over 11 iterations in 220 ms. Result :sat
Minimization took 54 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-31 22:19:18] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-05-31 22:19:18] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2025-05-31 22:19:18] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2025-05-31 22:19:18] [INFO ] [Real]Added 10 Read/Feed constraints in 5 ms returned sat
[2025-05-31 22:19: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 22:19:18] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2025-05-31 22:19:18] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 0 ms returned sat
[2025-05-31 22:19:18] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2025-05-31 22:19:18] [INFO ] [Nat]Added 10 Read/Feed constraints in 6 ms returned sat
[2025-05-31 22:19:18] [INFO ] Computed and/alt/rep : 61/292/61 causal constraints (skipped 4 transitions) in 3 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:18] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 3 ms to minimize.
[2025-05-31 22:19:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2025-05-31 22:19:18] [INFO ] Added : 58 causal constraints over 12 iterations in 181 ms. Result :sat
Minimization took 49 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-31 22:19:18] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-05-31 22:19:18] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 0 ms returned sat
[2025-05-31 22:19:18] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-05-31 22:19:18] [INFO ] [Real]Added 10 Read/Feed constraints in 3 ms returned sat
[2025-05-31 22:19: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 22:19:18] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-05-31 22:19:18] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 0 ms returned sat
[2025-05-31 22:19:18] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2025-05-31 22:19:18] [INFO ] [Nat]Added 10 Read/Feed constraints in 4 ms returned sat
[2025-05-31 22:19:18] [INFO ] Computed and/alt/rep : 61/292/61 causal constraints (skipped 4 transitions) in 3 ms.
[2025-05-31 22:19:19] [INFO ] Added : 50 causal constraints over 11 iterations in 99 ms. Result :sat
Minimization took 41 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-31 22:19:19] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-05-31 22:19:19] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2025-05-31 22:19:19] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2025-05-31 22:19:19] [INFO ] [Real]Added 10 Read/Feed constraints in 2 ms returned sat
[2025-05-31 22:19:19] [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 22:19:19] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-05-31 22:19:19] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2025-05-31 22:19:19] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2025-05-31 22:19:19] [INFO ] [Nat]Added 10 Read/Feed constraints in 4 ms returned sat
[2025-05-31 22:19:19] [INFO ] Computed and/alt/rep : 61/292/61 causal constraints (skipped 4 transitions) in 3 ms.
[2025-05-31 22:19:19] [INFO ] Added : 41 causal constraints over 9 iterations in 75 ms. Result :sat
Minimization took 42 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Support contains 6 out of 66 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 66/66 transitions.
Applied a total of 0 rules in 3 ms. Remains 66 /66 variables (removed 0) and now considering 66/66 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 66/66 places, 66/66 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 66/66 transitions.
Applied a total of 0 rules in 2 ms. Remains 66 /66 variables (removed 0) and now considering 66/66 (removed 0) transitions.
[2025-05-31 22:19:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:19:19] [INFO ] Implicit Places using invariants in 54 ms returned []
[2025-05-31 22:19:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 22:19:19] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-05-31 22:19:19] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 22:19:19] [INFO ] Redundant transitions in 0 ms returned []
Running 65 sub problems to find dead transitions.
[2025-05-31 22:19:19] [INFO ] Invariant cache hit.
[2025-05-31 22:19:19] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (OVERLAPS) 1/66 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 65 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:20] [INFO ] Deduced a trap composed of 32 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 22:19:20] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (OVERLAPS) 66/132 variables, 66/78 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 65 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:20] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:20] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:20] [INFO ] Deduced a trap composed of 26 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 22:19:20] [INFO ] Deduced a trap composed of 29 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 22:19:21] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:21] [INFO ] Deduced a trap composed of 26 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 22:19:21] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 7/95 constraints. Problems are: Problem set: 0 solved, 65 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:21] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 65 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:21] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/132 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/132 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 65 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 0/132 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 97 constraints, problems are : Problem set: 0 solved, 65 unsolved in 2734 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 66/66 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (OVERLAPS) 1/66 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (OVERLAPS) 66/132 variables, 66/87 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 10/97 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 65/162 constraints. Problems are: Problem set: 0 solved, 65 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:23] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:23] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:23] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:23] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:23] [INFO ] Deduced a trap composed of 34 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 22:19:23] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 6/168 constraints. Problems are: Problem set: 0 solved, 65 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:23] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/132 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 65 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 22:19:24] [INFO ] Deduced a trap along path composed of 17 places in 36 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/132 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/132 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 13 (OVERLAPS) 0/132 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 170 constraints, problems are : Problem set: 0 solved, 65 unsolved in 5589 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 66/66 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 8367ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 8372ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8569 ms. Remains : 66/66 places, 66/66 transitions.
RANDOM walk for 40000 steps (5749 resets) in 989 ms. (40 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (3700 resets) in 294 ms. (135 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (3687 resets) in 341 ms. (116 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (3680 resets) in 223 ms. (178 steps per ms) remains 12/12 properties
[2025-05-31 22:19:28] [INFO ] Flatten gal took : 87 ms
BEST_FIRST walk for 40003 steps (3678 resets) in 210 ms. (189 steps per ms) remains 12/12 properties
[2025-05-31 22:19:28] [INFO ] Flatten gal took : 31 ms
[2025-05-31 22:19:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6839836320604416854.gal : 12 ms
[2025-05-31 22:19:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16042125726883706931.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/ReachabilityCardinality6839836320604416854.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16042125726883706931.prop' '--nowitness' '--gen-order' 'FOLLOW'

BEST_FIRST walk for 40003 steps (3624 resets) in 202 ms. (197 steps per ms) remains 12/12 properties
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
Loading property file /tmp/ReachabilityCardinality16042125726883706931.prop.
SDD proceeding with computation,12 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,12 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,12 properties remain. new max is 16
SDD size :6 after 8
SDD proceeding with computation,12 properties remain. new max is 32
SDD size :8 after 14
SDD proceeding with computation,12 properties remain. new max is 64
SDD size :14 after 26
SDD proceeding with computation,12 properties remain. new max is 128
SDD size :26 after 42
SDD proceeding with computation,12 properties remain. new max is 256
SDD size :42 after 144
Invariant property MIN2 does not hold.
Reachability property MAX2 is true.
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :144 after 539
BEST_FIRST walk for 40001 steps (3628 resets) in 181 ms. (219 steps per ms) remains 12/12 properties
SDD proceeding with computation,10 properties remain. new max is 512
SDD size :539 after 1141
Invariant property MIN5 does not hold.
Reachability property MAX5 is true.
Invariant property MIN0 does not hold.
Reachability property MAX0 is true.
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :1863 after 2306
SDD proceeding with computation,6 properties remain. new max is 1024
BEST_FIRST walk for 40001 steps (3585 resets) in 188 ms. (211 steps per ms) remains 12/12 properties
SDD size :4841 after 5771
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :11876 after 15361
BEST_FIRST walk for 40002 steps (3664 resets) in 196 ms. (203 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (3692 resets) in 167 ms. (238 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (3654 resets) in 148 ms. (268 steps per ms) remains 12/12 properties
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :37457 after 38776
BEST_FIRST walk for 40002 steps (3715 resets) in 174 ms. (228 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (3653 resets) in 141 ms. (281 steps per ms) remains 12/12 properties
Invariant property MIN4 does not hold.
Reachability property MAX4 is true.
Invariant property MIN3 does not hold.
Reachability property MAX3 is true.
Invariant property MIN1 does not hold.
Reachability property MAX1 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 4097 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,85723,0.414146,16544,2,4805,29,60722,6,0,332,49278,0
Total reachable state count : 85723

Verifying 12 reachability properties.
Reachability property MAX0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,32,0.414881,16672,2,190,29,60722,7,0,335,49278,0
Invariant property MIN0 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,32,0.415247,16800,2,190,29,60722,8,0,336,49278,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.415391,16800,2,67,29,60722,9,0,338,49278,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.415501,16800,2,67,29,60722,10,0,339,49278,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.415679,16800,2,67,29,60722,11,0,341,49278,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.415911,16800,2,67,29,60722,12,0,342,49278,0
Reachability property MAX3 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX3,2,0.41604,16800,2,73,29,60722,13,0,344,49278,0
Invariant property MIN3 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN3,2,0.416159,16800,2,73,29,60722,14,0,345,49278,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.416343,16800,2,67,29,60722,15,0,347,49278,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.416481,16800,2,67,29,60722,16,0,348,49278,0
Reachability property MAX5 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX5,32,0.416622,16800,2,190,29,60722,17,0,350,49278,0
Invariant property MIN5 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN5,32,0.416755,16800,2,190,29,60722,18,0,351,49278,0
Finished probabilistic random walk after 126888 steps, run visited all 12 properties in 913 ms. (steps per millisecond=138 )
Probabilistic random walk after 126888 steps, saw 63451 distinct states, run finished after 917 ms. (steps per millisecond=138 ) properties seen :12
FORMULA DoubleExponent-PT-003-UpperBounds-13 1 TECHNIQUES REACHABILITY_MAX
FORMULA DoubleExponent-PT-003-UpperBounds-10 1 TECHNIQUES REACHABILITY_MAX
FORMULA DoubleExponent-PT-003-UpperBounds-08 1 TECHNIQUES REACHABILITY_MAX
FORMULA DoubleExponent-PT-003-UpperBounds-06 1 TECHNIQUES REACHABILITY_MAX
FORMULA DoubleExponent-PT-003-UpperBounds-05 1 TECHNIQUES REACHABILITY_MAX
FORMULA DoubleExponent-PT-003-UpperBounds-01 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 6 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 39670 ms.

BK_STOP 1748729970110

--------------------
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-003"
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-003, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r072-tall-174860067500477"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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