Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.5M
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 3.1M 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 Medical-PT-24-UpperBounds-00
FORMULA_NAME Medical-PT-24-UpperBounds-01
FORMULA_NAME Medical-PT-24-UpperBounds-02
FORMULA_NAME Medical-PT-24-UpperBounds-03
FORMULA_NAME Medical-PT-24-UpperBounds-04
FORMULA_NAME Medical-PT-24-UpperBounds-05
FORMULA_NAME Medical-PT-24-UpperBounds-06
FORMULA_NAME Medical-PT-24-UpperBounds-07
FORMULA_NAME Medical-PT-24-UpperBounds-08
FORMULA_NAME Medical-PT-24-UpperBounds-09
FORMULA_NAME Medical-PT-24-UpperBounds-10
FORMULA_NAME Medical-PT-24-UpperBounds-11
FORMULA_NAME Medical-PT-24-UpperBounds-12
FORMULA_NAME Medical-PT-24-UpperBounds-13
FORMULA_NAME Medical-PT-24-UpperBounds-14
FORMULA_NAME Medical-PT-24-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748895498904

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Medical-PT-24
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-02 20:18:21] [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-06-02 20:18:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 20:18:22] [INFO ] Load time of PNML (sax parser for PT used): 981 ms
[2025-06-02 20:18:22] [INFO ] Transformed 312 places.
[2025-06-02 20:18:22] [INFO ] Transformed 5431 transitions.
[2025-06-02 20:18:22] [INFO ] Parsed PT model containing 312 places and 5431 transitions and 28790 arcs in 1275 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
Deduced a syphon composed of 242 places in 30 ms
Reduce places removed 242 places and 5204 transitions.
Reduce places removed 1 places and 0 transitions.
FORMULA Medical-PT-24-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-24-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-24-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-24-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-24-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-24-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-24-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-24-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-24-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-24-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-24-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
[2025-06-02 20:18:22] [INFO ] Flow matrix only has 182 transitions (discarded 45 similar events)
// Phase 1: matrix 182 rows 69 cols
[2025-06-02 20:18:23] [INFO ] Computed 10 invariants in 25 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, +inf, 1]
RANDOM walk for 10000 steps (43 resets) in 34 ms. (285 steps per ms)
FORMULA Medical-PT-24-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Medical-PT-24-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 30003 steps (21 resets) in 51 ms. (576 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 6] Max Struct:[+inf, +inf, +inf]
[2025-06-02 20:18:23] [INFO ] Flow matrix only has 182 transitions (discarded 45 similar events)
[2025-06-02 20:18:23] [INFO ] Invariant cache hit.
[2025-06-02 20:18:23] [INFO ] [Real]Absence check using 10 positive place invariants in 19 ms returned sat
[2025-06-02 20:18:23] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2025-06-02 20:18:23] [INFO ] State equation strengthened by 56 read => feed constraints.
[2025-06-02 20:18:23] [INFO ] [Real]Added 56 Read/Feed constraints in 21 ms returned sat
[2025-06-02 20:18:23] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:18:23] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-06-02 20:18:23] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2025-06-02 20:18:23] [INFO ] [Nat]Added 56 Read/Feed constraints in 25 ms returned sat
[2025-06-02 20:18:23] [INFO ] Deduced a trap composed of 4 places in 144 ms of which 11 ms to minimize.
[2025-06-02 20:18:24] [INFO ] Deduced a trap composed of 6 places in 114 ms of which 3 ms to minimize.
[2025-06-02 20:18:24] [INFO ] Deduced a trap composed of 5 places in 103 ms of which 2 ms to minimize.
[2025-06-02 20:18:24] [INFO ] Deduced a trap composed of 34 places in 98 ms of which 2 ms to minimize.
[2025-06-02 20:18:24] [INFO ] Deduced a trap composed of 28 places in 93 ms of which 1 ms to minimize.
[2025-06-02 20:18:24] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 2 ms to minimize.
[2025-06-02 20:18:24] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 2 ms to minimize.
[2025-06-02 20:18:24] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 2 ms to minimize.
[2025-06-02 20:18:24] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 1 ms to minimize.
[2025-06-02 20:18:24] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 1 ms to minimize.
[2025-06-02 20:18:25] [INFO ] Deduced a trap composed of 34 places in 88 ms of which 2 ms to minimize.
[2025-06-02 20:18:25] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 1 ms to minimize.
[2025-06-02 20:18:25] [INFO ] Deduced a trap composed of 35 places in 87 ms of which 1 ms to minimize.
[2025-06-02 20:18:25] [INFO ] Deduced a trap composed of 30 places in 88 ms of which 2 ms to minimize.
[2025-06-02 20:18:25] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 2 ms to minimize.
[2025-06-02 20:18:25] [INFO ] Deduced a trap composed of 21 places in 122 ms of which 2 ms to minimize.
[2025-06-02 20:18:25] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 1 ms to minimize.
[2025-06-02 20:18:25] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 2 ms to minimize.
[2025-06-02 20:18:25] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 2102 ms
[2025-06-02 20:18:25] [INFO ] Computed and/alt/rep : 122/716/121 causal constraints (skipped 56 transitions) in 41 ms.
[2025-06-02 20:18:26] [INFO ] Added : 46 causal constraints over 10 iterations in 347 ms. Result :sat
Minimization took 112 ms.
[2025-06-02 20:18:26] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2025-06-02 20:18:26] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2025-06-02 20:18:26] [INFO ] [Real]Added 56 Read/Feed constraints in 19 ms returned sat
[2025-06-02 20:18:26] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:18:26] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-06-02 20:18:26] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2025-06-02 20:18:26] [INFO ] [Nat]Added 56 Read/Feed constraints in 20 ms returned sat
[2025-06-02 20:18:26] [INFO ] Deduced a trap composed of 5 places in 116 ms of which 3 ms to minimize.
[2025-06-02 20:18:26] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 2 ms to minimize.
[2025-06-02 20:18:27] [INFO ] Deduced a trap composed of 4 places in 119 ms of which 2 ms to minimize.
[2025-06-02 20:18:27] [INFO ] Deduced a trap composed of 12 places in 121 ms of which 2 ms to minimize.
[2025-06-02 20:18:27] [INFO ] Deduced a trap composed of 33 places in 121 ms of which 2 ms to minimize.
[2025-06-02 20:18:27] [INFO ] Deduced a trap composed of 16 places in 120 ms of which 2 ms to minimize.
[2025-06-02 20:18:27] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 2 ms to minimize.
[2025-06-02 20:18:27] [INFO ] Deduced a trap composed of 33 places in 123 ms of which 2 ms to minimize.
[2025-06-02 20:18:27] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 2 ms to minimize.
[2025-06-02 20:18:28] [INFO ] Deduced a trap composed of 30 places in 130 ms of which 1 ms to minimize.
[2025-06-02 20:18:28] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1341 ms
[2025-06-02 20:18:28] [INFO ] Computed and/alt/rep : 122/716/121 causal constraints (skipped 56 transitions) in 39 ms.
[2025-06-02 20:18:28] [INFO ] Added : 47 causal constraints over 12 iterations in 341 ms. Result :sat
Minimization took 99 ms.
[2025-06-02 20:18:28] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-06-02 20:18:28] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2025-06-02 20:18:28] [INFO ] [Real]Added 56 Read/Feed constraints in 16 ms returned sat
[2025-06-02 20:18:28] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:18:28] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-06-02 20:18:28] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2025-06-02 20:18:28] [INFO ] [Nat]Added 56 Read/Feed constraints in 20 ms returned sat
[2025-06-02 20:18:28] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 2 ms to minimize.
[2025-06-02 20:18:29] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 2 ms to minimize.
[2025-06-02 20:18:29] [INFO ] Deduced a trap composed of 10 places in 123 ms of which 2 ms to minimize.
[2025-06-02 20:18:29] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 2 ms to minimize.
[2025-06-02 20:18:29] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 487 ms
[2025-06-02 20:18:29] [INFO ] Computed and/alt/rep : 122/716/121 causal constraints (skipped 56 transitions) in 36 ms.
[2025-06-02 20:18:29] [INFO ] Added : 39 causal constraints over 8 iterations in 256 ms. Result :sat
Minimization took 101 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 6] Max Struct:[+inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 6] Max Struct:[+inf, +inf, +inf]
Support contains 3 out of 69 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 227/227 transitions.
Graph (complete) has 347 edges and 69 vertex of which 67 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 1 place count 67 transition count 224
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 64 transition count 224
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 9 place count 63 transition count 224
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 11 place count 63 transition count 222
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 13 place count 61 transition count 222
Applied a total of 13 rules in 103 ms. Remains 61 /69 variables (removed 8) and now considering 222/227 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 124 ms. Remains : 61/69 places, 222/227 transitions.
[2025-06-02 20:18:30] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
Found an invariant !
This invariant on transitions {1=1, 151=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {3=1, 151=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 3) seen :[0, 0, 1]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 6] Max Struct:[+inf, +inf, +inf]
[2025-06-02 20:18:30] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
// Phase 1: matrix 176 rows 61 cols
[2025-06-02 20:18:30] [INFO ] Computed 8 invariants in 14 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 6] Max Struct:[+inf, +inf, +inf]
RANDOM walk for 1000010 steps (2 resets) in 755 ms. (1322 steps per ms)
BEST_FIRST walk for 3000002 steps (6 resets) in 1894 ms. (1583 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 8] Max Struct:[+inf, +inf, +inf]
[2025-06-02 20:18:33] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
[2025-06-02 20:18:33] [INFO ] Invariant cache hit.
[2025-06-02 20:18:33] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-06-02 20:18:33] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2025-06-02 20:18:33] [INFO ] State equation strengthened by 57 read => feed constraints.
[2025-06-02 20:18:33] [INFO ] [Real]Added 57 Read/Feed constraints in 11 ms returned sat
[2025-06-02 20:18:33] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:18:33] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-06-02 20:18:33] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2025-06-02 20:18:33] [INFO ] [Nat]Added 57 Read/Feed constraints in 16 ms returned sat
[2025-06-02 20:18:33] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 2 ms to minimize.
[2025-06-02 20:18:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2025-06-02 20:18:33] [INFO ] Computed and/alt/rep : 119/604/118 causal constraints (skipped 57 transitions) in 22 ms.
[2025-06-02 20:18:33] [INFO ] Added : 5 causal constraints over 1 iterations in 48 ms. Result :sat
Minimization took 42 ms.
[2025-06-02 20:18:33] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-06-02 20:18:33] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2025-06-02 20:18:33] [INFO ] [Real]Added 57 Read/Feed constraints in 11 ms returned sat
[2025-06-02 20:18:33] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:18:33] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-06-02 20:18:33] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2025-06-02 20:18:33] [INFO ] [Nat]Added 57 Read/Feed constraints in 11 ms returned sat
[2025-06-02 20:18:33] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2025-06-02 20:18:33] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 2 ms to minimize.
[2025-06-02 20:18:33] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 2 ms to minimize.
[2025-06-02 20:18:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 192 ms
[2025-06-02 20:18:33] [INFO ] Computed and/alt/rep : 119/604/118 causal constraints (skipped 57 transitions) in 21 ms.
[2025-06-02 20:18:33] [INFO ] Added : 9 causal constraints over 2 iterations in 63 ms. Result :sat
Minimization took 41 ms.
[2025-06-02 20:18:34] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-06-02 20:18:34] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2025-06-02 20:18:34] [INFO ] [Real]Added 57 Read/Feed constraints in 14 ms returned sat
[2025-06-02 20:18:34] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:18:34] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-06-02 20:18:34] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2025-06-02 20:18:34] [INFO ] [Nat]Added 57 Read/Feed constraints in 13 ms returned sat
[2025-06-02 20:18:34] [INFO ] Computed and/alt/rep : 119/604/118 causal constraints (skipped 57 transitions) in 22 ms.
[2025-06-02 20:18:34] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2025-06-02 20:18:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2025-06-02 20:18:34] [INFO ] Added : 22 causal constraints over 5 iterations in 155 ms. Result :sat
Minimization took 75 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 8] Max Struct:[+inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 8] Max Struct:[+inf, +inf, +inf]
Support contains 3 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 222/222 transitions.
Applied a total of 0 rules in 16 ms. Remains 61 /61 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 61/61 places, 222/222 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 222/222 transitions.
Applied a total of 0 rules in 15 ms. Remains 61 /61 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2025-06-02 20:18:34] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
[2025-06-02 20:18:34] [INFO ] Invariant cache hit.
[2025-06-02 20:18:34] [INFO ] Implicit Places using invariants in 159 ms returned []
[2025-06-02 20:18:34] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
[2025-06-02 20:18:34] [INFO ] Invariant cache hit.
[2025-06-02 20:18:34] [INFO ] State equation strengthened by 57 read => feed constraints.
[2025-06-02 20:18:34] [INFO ] Implicit Places using invariants and state equation in 324 ms returned []
Implicit Place search using SMT with State Equation took 486 ms to find 0 implicit places.
[2025-06-02 20:18:35] [INFO ] Redundant transitions in 17 ms returned []
Running 221 sub problems to find dead transitions.
[2025-06-02 20:18:35] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
[2025-06-02 20:18:35] [INFO ] Invariant cache hit.
[2025-06-02 20:18:35] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2025-06-02 20:18:36] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (OVERLAPS) 176/237 variables, 61/70 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 57/127 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 221 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/237 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 237/237 variables, and 127 constraints, problems are : Problem set: 0 solved, 221 unsolved in 8178 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 61/61 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (OVERLAPS) 176/237 variables, 61/70 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 57/127 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD88 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 221/348 constraints. Problems are: Problem set: 43 solved, 178 unsolved
[2025-06-02 20:18:47] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 2 ms to minimize.
[2025-06-02 20:18:47] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 2/350 constraints. Problems are: Problem set: 43 solved, 178 unsolved
[2025-06-02 20:18:49] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2025-06-02 20:18:50] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2025-06-02 20:18:50] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 3/353 constraints. Problems are: Problem set: 43 solved, 178 unsolved
[2025-06-02 20:18:51] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/237 variables, 1/354 constraints. Problems are: Problem set: 43 solved, 178 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/237 variables, 0/354 constraints. Problems are: Problem set: 43 solved, 178 unsolved
At refinement iteration 10 (OVERLAPS) 0/237 variables, 0/354 constraints. Problems are: Problem set: 43 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Int declared 237/237 variables, and 354 constraints, problems are : Problem set: 43 solved, 178 unsolved in 16283 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 61/61 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 7/7 constraints]
After SMT, in 24970ms problems are : Problem set: 43 solved, 178 unsolved
Search for dead transitions found 43 dead transitions in 24994ms
Found 43 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 43 transitions
Dead transitions reduction (with SMT) removed 43 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 61/61 places, 179/222 transitions.
Reduce places removed 9 places and 65 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 52 transition count 114
Reduce places removed 7 places and 31 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 16 place count 45 transition count 83
Reduce places removed 2 places and 11 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 18 place count 43 transition count 72
Reduce places removed 3 places and 12 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 21 place count 40 transition count 60
Reduce places removed 1 places and 4 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 22 place count 39 transition count 56
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 22 rules in 8 ms. Remains 39 /61 variables (removed 22) and now considering 56/179 (removed 123) transitions.
[2025-06-02 20:19:00] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
// Phase 1: matrix 50 rows 39 cols
[2025-06-02 20:19:00] [INFO ] Computed 10 invariants in 1 ms
[2025-06-02 20:19:00] [INFO ] Implicit Places using invariants in 66 ms returned []
[2025-06-02 20:19:00] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:19:00] [INFO ] Invariant cache hit.
[2025-06-02 20:19:00] [INFO ] State equation strengthened by 27 read => feed constraints.
[2025-06-02 20:19:00] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 39/61 places, 56/222 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 25699 ms. Remains : 39/61 places, 56/222 transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
FORMULA Medical-PT-24-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-24-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 20:19:00] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
Found an invariant !
This invariant on transitions {0=1, 41=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1, 41=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[2, 0, 8] Max Struct:[+inf, +inf, +inf]
[2025-06-02 20:19:00] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
// Phase 1: matrix 50 rows 37 cols
[2025-06-02 20:19:00] [INFO ] Computed 8 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2, 0, 8] Max Struct:[+inf, +inf, +inf]
RANDOM walk for 1000011 steps (2 resets) in 542 ms. (1841 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 415 ms. (2403 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[8, 0, 8] Max Struct:[+inf, +inf, +inf]
[2025-06-02 20:19:01] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:19:01] [INFO ] Invariant cache hit.
[2025-06-02 20:19:01] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2025-06-02 20:19:01] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-06-02 20:19:01] [INFO ] State equation strengthened by 27 read => feed constraints.
[2025-06-02 20:19:01] [INFO ] [Real]Added 27 Read/Feed constraints in 6 ms returned sat
[2025-06-02 20:19:01] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:19:01] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-06-02 20:19:01] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2025-06-02 20:19:01] [INFO ] [Nat]Added 27 Read/Feed constraints in 12 ms returned sat
[2025-06-02 20:19:01] [INFO ] Computed and/alt/rep : 44/155/43 causal constraints (skipped 6 transitions) in 8 ms.
[2025-06-02 20:19:01] [INFO ] Added : 21 causal constraints over 5 iterations in 67 ms. Result :sat
Minimization took 26 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[8, 0, 8] Max Struct:[+inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[8, 0, 8] Max Struct:[+inf, +inf, +inf]
Support contains 1 out of 37 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 37/37 places, 56/56 transitions.
Applied a total of 0 rules in 4 ms. Remains 37 /37 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 37/37 places, 56/56 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 37/37 places, 56/56 transitions.
Applied a total of 0 rules in 3 ms. Remains 37 /37 variables (removed 0) and now considering 56/56 (removed 0) transitions.
[2025-06-02 20:19:01] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:19:01] [INFO ] Invariant cache hit.
[2025-06-02 20:19:01] [INFO ] Implicit Places using invariants in 77 ms returned []
[2025-06-02 20:19:01] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:19:01] [INFO ] Invariant cache hit.
[2025-06-02 20:19:01] [INFO ] State equation strengthened by 27 read => feed constraints.
[2025-06-02 20:19:01] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
[2025-06-02 20:19:01] [INFO ] Redundant transitions in 1 ms returned []
Running 55 sub problems to find dead transitions.
[2025-06-02 20:19:01] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:19:01] [INFO ] Invariant cache hit.
[2025-06-02 20:19:01] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (OVERLAPS) 50/87 variables, 37/45 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 27/72 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (OVERLAPS) 0/87 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Real declared 87/87 variables, and 72 constraints, problems are : Problem set: 0 solved, 55 unsolved in 1021 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 37/37 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 55 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (OVERLAPS) 50/87 variables, 37/45 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 27/72 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 55/127 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2025-06-02 20:19:03] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2025-06-02 20:19:03] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (OVERLAPS) 0/87 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Int declared 87/87 variables, and 129 constraints, problems are : Problem set: 0 solved, 55 unsolved in 1732 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 37/37 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 2/2 constraints]
After SMT, in 2785ms problems are : Problem set: 0 solved, 55 unsolved
Search for dead transitions found 0 dead transitions in 2788ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3032 ms. Remains : 37/37 places, 56/56 transitions.
[2025-06-02 20:19:04] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
Found an invariant !
This invariant on transitions {0=1, 41=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1, 41=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[8, 0, 8] Max Struct:[+inf, +inf, +inf]
[2025-06-02 20:19:04] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:19:04] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[8, 0, 8] Max Struct:[+inf, +inf, +inf]
RANDOM walk for 1000003 steps (2 resets) in 550 ms. (1814 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 490 ms. (2036 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[11, 0, 8] Max Struct:[+inf, +inf, +inf]
[2025-06-02 20:19:05] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:19:05] [INFO ] Invariant cache hit.
[2025-06-02 20:19:05] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2025-06-02 20:19:05] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-06-02 20:19:05] [INFO ] State equation strengthened by 27 read => feed constraints.
[2025-06-02 20:19:05] [INFO ] [Real]Added 27 Read/Feed constraints in 5 ms returned sat
[2025-06-02 20:19:05] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:19:05] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-06-02 20:19:05] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2025-06-02 20:19:05] [INFO ] [Nat]Added 27 Read/Feed constraints in 6 ms returned sat
[2025-06-02 20:19:05] [INFO ] Computed and/alt/rep : 44/155/43 causal constraints (skipped 6 transitions) in 4 ms.
[2025-06-02 20:19:05] [INFO ] Added : 21 causal constraints over 5 iterations in 38 ms. Result :sat
Minimization took 16 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[11, 0, 8] Max Struct:[+inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[11, 0, 8] Max Struct:[+inf, +inf, +inf]
Support contains 1 out of 37 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 37/37 places, 56/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 37 /37 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 37/37 places, 56/56 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 37/37 places, 56/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 37 /37 variables (removed 0) and now considering 56/56 (removed 0) transitions.
[2025-06-02 20:19:05] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:19:05] [INFO ] Invariant cache hit.
[2025-06-02 20:19:05] [INFO ] Implicit Places using invariants in 83 ms returned []
[2025-06-02 20:19:05] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:19:05] [INFO ] Invariant cache hit.
[2025-06-02 20:19:05] [INFO ] State equation strengthened by 27 read => feed constraints.
[2025-06-02 20:19:06] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
[2025-06-02 20:19:06] [INFO ] Redundant transitions in 2 ms returned []
Running 55 sub problems to find dead transitions.
[2025-06-02 20:19:06] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:19:06] [INFO ] Invariant cache hit.
[2025-06-02 20:19:06] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (OVERLAPS) 50/87 variables, 37/45 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 27/72 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (OVERLAPS) 0/87 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Real declared 87/87 variables, and 72 constraints, problems are : Problem set: 0 solved, 55 unsolved in 951 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 37/37 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 55 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (OVERLAPS) 50/87 variables, 37/45 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 27/72 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 55/127 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2025-06-02 20:19:07] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2025-06-02 20:19:07] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (OVERLAPS) 0/87 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Int declared 87/87 variables, and 129 constraints, problems are : Problem set: 0 solved, 55 unsolved in 1533 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 37/37 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 2/2 constraints]
After SMT, in 2511ms problems are : Problem set: 0 solved, 55 unsolved
Search for dead transitions found 0 dead transitions in 2513ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2763 ms. Remains : 37/37 places, 56/56 transitions.
[2025-06-02 20:19:08] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
Found an invariant !
This invariant on transitions {0=1, 41=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1, 41=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[11, 0, 8] Max Struct:[+inf, +inf, +inf]
[2025-06-02 20:19:08] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:19:08] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[11, 0, 8] Max Struct:[+inf, +inf, +inf]
RANDOM walk for 1000002 steps (2 resets) in 582 ms. (1715 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 458 ms. (2178 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[11, 0, 8] Max Struct:[+inf, +inf, +inf]
[2025-06-02 20:19:09] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:19:09] [INFO ] Invariant cache hit.
[2025-06-02 20:19:09] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-06-02 20:19:09] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-02 20:19:09] [INFO ] State equation strengthened by 27 read => feed constraints.
[2025-06-02 20:19:09] [INFO ] [Real]Added 27 Read/Feed constraints in 5 ms returned sat
[2025-06-02 20:19:09] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:19:09] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-06-02 20:19:09] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2025-06-02 20:19:09] [INFO ] [Nat]Added 27 Read/Feed constraints in 7 ms returned sat
[2025-06-02 20:19:09] [INFO ] Computed and/alt/rep : 44/155/43 causal constraints (skipped 6 transitions) in 6 ms.
[2025-06-02 20:19:09] [INFO ] Added : 21 causal constraints over 5 iterations in 62 ms. Result :sat
Minimization took 26 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[11, 0, 8] Max Struct:[+inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[11, 0, 8] Max Struct:[+inf, +inf, +inf]
Support contains 1 out of 37 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 37/37 places, 56/56 transitions.
Applied a total of 0 rules in 4 ms. Remains 37 /37 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 37/37 places, 56/56 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 37/37 places, 56/56 transitions.
Applied a total of 0 rules in 3 ms. Remains 37 /37 variables (removed 0) and now considering 56/56 (removed 0) transitions.
[2025-06-02 20:19:09] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:19:09] [INFO ] Invariant cache hit.
[2025-06-02 20:19:09] [INFO ] Implicit Places using invariants in 78 ms returned []
[2025-06-02 20:19:09] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:19:09] [INFO ] Invariant cache hit.
[2025-06-02 20:19:10] [INFO ] State equation strengthened by 27 read => feed constraints.
[2025-06-02 20:19:10] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
[2025-06-02 20:19:10] [INFO ] Redundant transitions in 1 ms returned []
Running 55 sub problems to find dead transitions.
[2025-06-02 20:19:10] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:19:10] [INFO ] Invariant cache hit.
[2025-06-02 20:19:10] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (OVERLAPS) 50/87 variables, 37/45 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 27/72 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (OVERLAPS) 0/87 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Real declared 87/87 variables, and 72 constraints, problems are : Problem set: 0 solved, 55 unsolved in 993 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 37/37 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 55 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (OVERLAPS) 50/87 variables, 37/45 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 27/72 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 55/127 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2025-06-02 20:19:11] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 5 ms to minimize.
[2025-06-02 20:19:11] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (OVERLAPS) 0/87 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Int declared 87/87 variables, and 129 constraints, problems are : Problem set: 0 solved, 55 unsolved in 1395 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 37/37 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 2/2 constraints]
After SMT, in 2416ms problems are : Problem set: 0 solved, 55 unsolved
Search for dead transitions found 0 dead transitions in 2418ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2648 ms. Remains : 37/37 places, 56/56 transitions.
[2025-06-02 20:19:12] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
Found an invariant !
This invariant on transitions {0=1, 41=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1, 41=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[11, 0, 8] Max Struct:[+inf, +inf, +inf]
RANDOM walk for 40059 steps (8 resets) in 231 ms. (172 steps per ms) remains 1/1 properties
BEST_FIRST walk for 26895 steps (5 resets) in 91 ms. (292 steps per ms) remains 0/1 properties
[2025-06-02 20:19:13] [INFO ] Flatten gal took : 60 ms
[2025-06-02 20:19:13] [INFO ] Flatten gal took : 21 ms
[2025-06-02 20:19:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6467458955230478396.gal : 12 ms
[2025-06-02 20:19:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16476821889012094152.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6467458955230478396.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16476821889012094152.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
its-reach command run as :
ITS tools runner thread asked to quit. Dying gracefully.

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:168)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:334)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:270)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:313)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:188)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:177)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:162)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:329)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:396)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:840)
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[11, 0, 8] Max Struct:[+inf, +inf, +inf]
Starting property specific reduction for Medical-PT-24-UpperBounds-11
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2025-06-02 20:19:13] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:19:13] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10011 steps (2 resets) in 10 ms. (910 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 9 ms. (1000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4] Max Struct:[+inf]
[2025-06-02 20:19:13] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:19:13] [INFO ] Invariant cache hit.
[2025-06-02 20:19:13] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-06-02 20:19:13] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2025-06-02 20:19:13] [INFO ] State equation strengthened by 27 read => feed constraints.
[2025-06-02 20:19:13] [INFO ] [Real]Added 27 Read/Feed constraints in 22 ms returned sat
[2025-06-02 20:19:13] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:19:13] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2025-06-02 20:19:13] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2025-06-02 20:19:13] [INFO ] [Nat]Added 27 Read/Feed constraints in 8 ms returned sat
[2025-06-02 20:19:13] [INFO ] Computed and/alt/rep : 44/155/43 causal constraints (skipped 6 transitions) in 9 ms.
[2025-06-02 20:19:13] [INFO ] Added : 15 causal constraints over 3 iterations in 41 ms. Result :sat
Minimization took 20 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4] Max Struct:[+inf]
Support contains 1 out of 37 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 37/37 places, 56/56 transitions.
Applied a total of 0 rules in 3 ms. Remains 37 /37 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 37/37 places, 56/56 transitions.
[2025-06-02 20:19:13] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
Found an invariant !
This invariant on transitions {0=1, 41=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {0=1, 41=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[4] Max Struct:[+inf]
[2025-06-02 20:19:13] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:19:13] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[4] Max Struct:[+inf]
RANDOM walk for 1000014 steps (2 resets) in 432 ms. (2309 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 594 ms. (1680 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[9] Max Struct:[+inf]
[2025-06-02 20:19:14] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:19:14] [INFO ] Invariant cache hit.
[2025-06-02 20:19:14] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-06-02 20:19:14] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-02 20:19:14] [INFO ] State equation strengthened by 27 read => feed constraints.
[2025-06-02 20:19:14] [INFO ] [Real]Added 27 Read/Feed constraints in 9 ms returned sat
[2025-06-02 20:19:14] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:19:14] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-06-02 20:19:14] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2025-06-02 20:19:14] [INFO ] [Nat]Added 27 Read/Feed constraints in 7 ms returned sat
[2025-06-02 20:19:14] [INFO ] Computed and/alt/rep : 44/155/43 causal constraints (skipped 6 transitions) in 5 ms.
[2025-06-02 20:19:14] [INFO ] Added : 21 causal constraints over 5 iterations in 47 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[9] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[9] Max Struct:[+inf]
Support contains 1 out of 37 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 37/37 places, 56/56 transitions.
Applied a total of 0 rules in 3 ms. Remains 37 /37 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 37/37 places, 56/56 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 37/37 places, 56/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 37 /37 variables (removed 0) and now considering 56/56 (removed 0) transitions.
[2025-06-02 20:19:14] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:19:14] [INFO ] Invariant cache hit.
[2025-06-02 20:19:14] [INFO ] Implicit Places using invariants in 54 ms returned []
[2025-06-02 20:19:14] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:19:14] [INFO ] Invariant cache hit.
[2025-06-02 20:19:14] [INFO ] State equation strengthened by 27 read => feed constraints.
[2025-06-02 20:19:14] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
[2025-06-02 20:19:14] [INFO ] Redundant transitions in 1 ms returned []
Running 55 sub problems to find dead transitions.
[2025-06-02 20:19:14] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:19:14] [INFO ] Invariant cache hit.
[2025-06-02 20:19:14] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (OVERLAPS) 50/87 variables, 37/45 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 27/72 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (OVERLAPS) 0/87 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Real declared 87/87 variables, and 72 constraints, problems are : Problem set: 0 solved, 55 unsolved in 649 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 37/37 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 55 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (OVERLAPS) 50/87 variables, 37/45 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 27/72 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 55/127 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2025-06-02 20:19:15] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2025-06-02 20:19:16] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (OVERLAPS) 0/87 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Int declared 87/87 variables, and 129 constraints, problems are : Problem set: 0 solved, 55 unsolved in 1179 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 37/37 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 2/2 constraints]
After SMT, in 1852ms problems are : Problem set: 0 solved, 55 unsolved
Search for dead transitions found 0 dead transitions in 1855ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2034 ms. Remains : 37/37 places, 56/56 transitions.
[2025-06-02 20:19:16] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
Found an invariant !
This invariant on transitions {0=1, 41=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {0=1, 41=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :[2147483647]
Current structural bounds on expressions (after cover walk) : Max Seen:[+inf] Max Struct:[+inf]
[2025-06-02 20:19:16] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2025-06-02 20:19:16] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[+inf] Max Struct:[+inf]
RANDOM walk for 1000007 steps (2 resets) in 553 ms. (1805 steps per ms)
FORMULA Medical-PT-24-UpperBounds-11 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2025-06-02 20:19:17] [INFO ] Flatten gal took : 16 ms
[2025-06-02 20:19:17] [INFO ] Flatten gal took : 14 ms
[2025-06-02 20:19:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9548145035081943765.gal : 5 ms
[2025-06-02 20:19:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality245838891033969160.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9548145035081943765.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality245838891033969160.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for Medical-PT-24-UpperBounds-11 in 4456 ms.
[2025-06-02 20:19:17] [INFO ] Flatten gal took : 14 ms
Total runtime 56088 ms.

BK_STOP 1748895557709

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Medical-PT-24"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool gold2024"
echo " Input is Medical-PT-24, 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 r139-smll-174876533100012"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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