fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r223-tall-171649611600533
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for Medical-PT-06

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
893.500 49800.00 74521.00 249.50 0 0 0 0 0 0 0 0 0 0 0 0 0 ? 0 0 normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r223-tall-171649611600533.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool greatspnxred
Input is Medical-PT-06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r223-tall-171649611600533
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.6M
-rw-r--r-- 1 mcc users 8.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 22 14:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 13 15:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K Apr 13 15:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 13 14:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Apr 13 14:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 3.1M May 18 16:42 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

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

=== Now, execution of the tool begins

BK_START 1716567075092

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Medical-PT-06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-24 16:11:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-24 16:11:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 16:11:16] [INFO ] Load time of PNML (sax parser for PT used): 301 ms
[2024-05-24 16:11:16] [INFO ] Transformed 312 places.
[2024-05-24 16:11:16] [INFO ] Transformed 5431 transitions.
[2024-05-24 16:11:16] [INFO ] Parsed PT model containing 312 places and 5431 transitions and 28790 arcs in 443 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Deduced a syphon composed of 242 places in 23 ms
Reduce places removed 242 places and 5204 transitions.
Reduce places removed 1 places and 0 transitions.
FORMULA Medical-PT-06-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-06-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-06-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-06-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-06-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-06-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-06-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-06-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-06-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-06-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-06-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-06-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-06-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0] Max Struct:[+inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0] Max Struct:[+inf, +inf, +inf]
[2024-05-24 16:11:16] [INFO ] Flow matrix only has 182 transitions (discarded 45 similar events)
// Phase 1: matrix 182 rows 69 cols
[2024-05-24 16:11:16] [INFO ] Computed 10 invariants in 15 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[+inf, 1, +inf]
RANDOM walk for 10000 steps (62 resets) in 35 ms. (277 steps per ms)
BEST_FIRST walk for 30003 steps (30 resets) in 39 ms. (750 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 14] Max Struct:[+inf, 1, +inf]
[2024-05-24 16:11:16] [INFO ] Flow matrix only has 182 transitions (discarded 45 similar events)
[2024-05-24 16:11:16] [INFO ] Invariant cache hit.
[2024-05-24 16:11:17] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2024-05-24 16:11:17] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2024-05-24 16:11:17] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-24 16:11:17] [INFO ] [Real]Added 56 Read/Feed constraints in 12 ms returned sat
[2024-05-24 16:11:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 16:11:17] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-24 16:11:17] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2024-05-24 16:11:17] [INFO ] [Nat]Added 56 Read/Feed constraints in 10 ms returned sat
[2024-05-24 16:11:17] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 7 ms to minimize.
[2024-05-24 16:11:17] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2024-05-24 16:11:17] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 1 ms to minimize.
[2024-05-24 16:11:17] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-05-24 16:11:17] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-24 16:11:17] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
[2024-05-24 16:11:17] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 0 ms to minimize.
[2024-05-24 16:11:17] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 0 ms to minimize.
[2024-05-24 16:11:17] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2024-05-24 16:11:17] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
[2024-05-24 16:11:17] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-24 16:11:17] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-24 16:11:18] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 0 ms to minimize.
[2024-05-24 16:11:18] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 829 ms
[2024-05-24 16:11:18] [INFO ] Computed and/alt/rep : 122/716/121 causal constraints (skipped 56 transitions) in 28 ms.
[2024-05-24 16:11:18] [INFO ] Added : 25 causal constraints over 5 iterations in 100 ms. Result :sat
Minimization took 47 ms.
[2024-05-24 16:11:18] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-24 16:11:18] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2024-05-24 16:11:18] [INFO ] [Real]Added 56 Read/Feed constraints in 8 ms returned sat
[2024-05-24 16:11:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 16:11:18] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-24 16:11:18] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2024-05-24 16:11:18] [INFO ] [Nat]Added 56 Read/Feed constraints in 8 ms returned sat
[2024-05-24 16:11:18] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 1 ms to minimize.
[2024-05-24 16:11:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2024-05-24 16:11:18] [INFO ] Computed and/alt/rep : 122/716/121 causal constraints (skipped 56 transitions) in 24 ms.
[2024-05-24 16:11:18] [INFO ] Added : 19 causal constraints over 5 iterations in 91 ms. Result :sat
Minimization took 46 ms.
[2024-05-24 16:11:18] [INFO ] [Real]Absence check using 10 positive place invariants in 1 ms returned sat
[2024-05-24 16:11:18] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2024-05-24 16:11:18] [INFO ] [Real]Added 56 Read/Feed constraints in 12 ms returned sat
[2024-05-24 16:11:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 16:11:18] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-24 16:11:18] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2024-05-24 16:11:18] [INFO ] [Nat]Added 56 Read/Feed constraints in 9 ms returned sat
[2024-05-24 16:11:18] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-05-24 16:11:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2024-05-24 16:11:18] [INFO ] Computed and/alt/rep : 122/716/121 causal constraints (skipped 56 transitions) in 16 ms.
[2024-05-24 16:11:18] [INFO ] Added : 23 causal constraints over 6 iterations in 95 ms. Result :sat
Minimization took 41 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 14] Max Struct:[+inf, 1, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 14] Max Struct:[+inf, 1, +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.1 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 0 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 45 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 54 ms. Remains : 61/69 places, 222/227 transitions.
[2024-05-24 16:11:19] [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 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :[0, 0, 1]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 14] Max Struct:[+inf, 1, +inf]
[2024-05-24 16:11:19] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
// Phase 1: matrix 176 rows 61 cols
[2024-05-24 16:11:19] [INFO ] Computed 8 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 14] Max Struct:[+inf, 1, +inf]
RANDOM walk for 1000004 steps (2 resets) in 619 ms. (1612 steps per ms)
BEST_FIRST walk for 3000001 steps (6 resets) in 1707 ms. (1756 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 20] Max Struct:[+inf, 1, +inf]
[2024-05-24 16:11:21] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
[2024-05-24 16:11:21] [INFO ] Invariant cache hit.
[2024-05-24 16:11:21] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-24 16:11:21] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-24 16:11:21] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-24 16:11:21] [INFO ] [Real]Added 57 Read/Feed constraints in 8 ms returned sat
[2024-05-24 16:11:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 16:11:21] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-24 16:11:21] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-24 16:11:21] [INFO ] [Nat]Added 57 Read/Feed constraints in 10 ms returned sat
[2024-05-24 16:11:21] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 0 ms to minimize.
[2024-05-24 16:11:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2024-05-24 16:11:21] [INFO ] Computed and/alt/rep : 119/604/118 causal constraints (skipped 57 transitions) in 15 ms.
[2024-05-24 16:11:22] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-24 16:11:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2024-05-24 16:11:22] [INFO ] Added : 44 causal constraints over 10 iterations in 193 ms. Result :sat
Minimization took 44 ms.
[2024-05-24 16:11:22] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-24 16:11:22] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-24 16:11:22] [INFO ] [Real]Added 57 Read/Feed constraints in 7 ms returned sat
[2024-05-24 16:11:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 16:11:22] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-24 16:11:22] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-05-24 16:11:22] [INFO ] [Nat]Added 57 Read/Feed constraints in 8 ms returned sat
[2024-05-24 16:11:22] [INFO ] Computed and/alt/rep : 119/604/118 causal constraints (skipped 57 transitions) in 14 ms.
[2024-05-24 16:11:22] [INFO ] Added : 42 causal constraints over 9 iterations in 123 ms. Result :sat
Minimization took 49 ms.
[2024-05-24 16:11:22] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-24 16:11:22] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2024-05-24 16:11:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 16:11:22] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-24 16:11:22] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2024-05-24 16:11:22] [INFO ] [Nat]Added 57 Read/Feed constraints in 8 ms returned sat
[2024-05-24 16:11:22] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 2 ms to minimize.
[2024-05-24 16:11:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2024-05-24 16:11:22] [INFO ] Computed and/alt/rep : 119/604/118 causal constraints (skipped 57 transitions) in 14 ms.
[2024-05-24 16:11:22] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-05-24 16:11:22] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
[2024-05-24 16:11:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 88 ms
[2024-05-24 16:11:22] [INFO ] Added : 32 causal constraints over 7 iterations in 201 ms. Result :sat
Minimization took 43 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 20] Max Struct:[+inf, 1, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 20] Max Struct:[+inf, 1, +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 7 ms. Remains 61 /61 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2024-05-24 16:11:22] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
[2024-05-24 16:11:22] [INFO ] Invariant cache hit.
[2024-05-24 16:11:22] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-24 16:11:22] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
[2024-05-24 16:11:22] [INFO ] Invariant cache hit.
[2024-05-24 16:11:23] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-24 16:11:23] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
[2024-05-24 16:11:23] [INFO ] Redundant transitions in 7 ms returned []
Running 221 sub problems to find dead transitions.
[2024-05-24 16:11:23] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
[2024-05-24 16:11:23] [INFO ] Invariant cache hit.
[2024-05-24 16:11:23] [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
[2024-05-24 16:11:23] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 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
[2024-05-24 16:11:26] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2024-05-24 16:11:26] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
Problem TDEAD73 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD83 is UNSAT
[2024-05-24 16:11:26] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (OVERLAPS) 0/237 variables, 3/130 constraints. Problems are: Problem set: 3 solved, 218 unsolved
[2024-05-24 16:11:27] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 0 ms to minimize.
[2024-05-24 16:11:27] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
Problem TDEAD35 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD56 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 2/132 constraints. Problems are: Problem set: 7 solved, 214 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/237 variables, 0/132 constraints. Problems are: Problem set: 7 solved, 214 unsolved
At refinement iteration 9 (OVERLAPS) 0/237 variables, 0/132 constraints. Problems are: Problem set: 7 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 237/237 variables, and 132 constraints, problems are : Problem set: 7 solved, 214 unsolved in 7184 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: 6/6 constraints]
Escalating to Integer solving :Problem set: 7 solved, 214 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 8/8 constraints. Problems are: Problem set: 7 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 6/14 constraints. Problems are: Problem set: 7 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/14 constraints. Problems are: Problem set: 7 solved, 214 unsolved
At refinement iteration 3 (OVERLAPS) 176/237 variables, 61/75 constraints. Problems are: Problem set: 7 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 57/132 constraints. Problems are: Problem set: 7 solved, 214 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 TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 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 TDEAD88 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 214/346 constraints. Problems are: Problem set: 43 solved, 178 unsolved
[2024-05-24 16:11:33] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
[2024-05-24 16:11:33] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 2/348 constraints. Problems are: Problem set: 43 solved, 178 unsolved
[2024-05-24 16:11:34] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
Problem TDEAD89 is UNSAT
[2024-05-24 16:11:35] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 2/350 constraints. Problems are: Problem set: 44 solved, 177 unsolved
[2024-05-24 16:11:36] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/237 variables, 1/351 constraints. Problems are: Problem set: 44 solved, 177 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/237 variables, 0/351 constraints. Problems are: Problem set: 44 solved, 177 unsolved
At refinement iteration 10 (OVERLAPS) 0/237 variables, 0/351 constraints. Problems are: Problem set: 44 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Int declared 237/237 variables, and 351 constraints, problems are : Problem set: 44 solved, 177 unsolved in 11917 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 61/61 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 214/221 constraints, Known Traps: 11/11 constraints]
After SMT, in 19311ms problems are : Problem set: 44 solved, 177 unsolved
Search for dead transitions found 44 dead transitions in 19323ms
Found 44 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 44 transitions
Dead transitions reduction (with SMT) removed 44 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 61/61 places, 178/222 transitions.
Reduce places removed 9 places and 64 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/178 (removed 122) transitions.
[2024-05-24 16:11:42] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
// Phase 1: matrix 50 rows 39 cols
[2024-05-24 16:11:42] [INFO ] Computed 10 invariants in 1 ms
[2024-05-24 16:11:42] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-24 16:11:42] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2024-05-24 16:11:42] [INFO ] Invariant cache hit.
[2024-05-24 16:11:42] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-24 16:11:42] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 104 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 19667 ms. Remains : 39/61 places, 56/222 transitions.
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
FORMULA Medical-PT-06-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-06-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-24 16:11:42] [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 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[1, 0, 20] Max Struct:[+inf, 1, +inf]
[2024-05-24 16:11:42] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
// Phase 1: matrix 50 rows 37 cols
[2024-05-24 16:11:42] [INFO ] Computed 8 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 20] Max Struct:[+inf, 1, +inf]
RANDOM walk for 1000000 steps (2 resets) in 386 ms. (2583 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 339 ms. (2941 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[6, 0, 20] Max Struct:[+inf, 1, +inf]
[2024-05-24 16:11:43] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2024-05-24 16:11:43] [INFO ] Invariant cache hit.
[2024-05-24 16:11:43] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-24 16:11:43] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-24 16:11:43] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-24 16:11:43] [INFO ] [Real]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-24 16:11:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 16:11:43] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-24 16:11:43] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-24 16:11:43] [INFO ] [Nat]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-24 16:11:43] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-05-24 16:11:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2024-05-24 16:11:43] [INFO ] Computed and/alt/rep : 44/155/43 causal constraints (skipped 6 transitions) in 11 ms.
[2024-05-24 16:11:43] [INFO ] Added : 17 causal constraints over 4 iterations in 40 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[6, 0, 20] Max Struct:[+inf, 1, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6, 0, 20] Max Struct:[+inf, 1, +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 4 ms. Remains 37 /37 variables (removed 0) and now considering 56/56 (removed 0) transitions.
[2024-05-24 16:11:43] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2024-05-24 16:11:43] [INFO ] Invariant cache hit.
[2024-05-24 16:11:43] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-24 16:11:43] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2024-05-24 16:11:43] [INFO ] Invariant cache hit.
[2024-05-24 16:11:43] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-24 16:11:43] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2024-05-24 16:11:43] [INFO ] Redundant transitions in 1 ms returned []
Running 55 sub problems to find dead transitions.
[2024-05-24 16:11:43] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2024-05-24 16:11:43] [INFO ] Invariant cache hit.
[2024-05-24 16:11:43] [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 429 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
[2024-05-24 16:11:44] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-24 16:11:44] [INFO ] Deduced a trap composed of 8 places in 22 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 796 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 1245ms problems are : Problem set: 0 solved, 55 unsolved
Search for dead transitions found 0 dead transitions in 1246ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1346 ms. Remains : 37/37 places, 56/56 transitions.
[2024-05-24 16:11:44] [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 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[6, 0, 20] Max Struct:[+inf, 1, +inf]
[2024-05-24 16:11:44] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2024-05-24 16:11:44] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[6, 0, 20] Max Struct:[+inf, 1, +inf]
RANDOM walk for 1000003 steps (2 resets) in 347 ms. (2873 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 345 ms. (2890 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[7, 0, 20] Max Struct:[+inf, 1, +inf]
[2024-05-24 16:11:45] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2024-05-24 16:11:45] [INFO ] Invariant cache hit.
[2024-05-24 16:11:45] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-24 16:11:45] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-24 16:11:45] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-24 16:11:45] [INFO ] [Real]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-24 16:11:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 16:11:45] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-24 16:11:45] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-24 16:11:45] [INFO ] [Nat]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-24 16:11:45] [INFO ] Computed and/alt/rep : 44/155/43 causal constraints (skipped 6 transitions) in 3 ms.
[2024-05-24 16:11:45] [INFO ] Added : 16 causal constraints over 4 iterations in 28 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[7, 0, 20] Max Struct:[+inf, 1, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[7, 0, 20] Max Struct:[+inf, 1, +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 2 ms. Remains 37 /37 variables (removed 0) and now considering 56/56 (removed 0) transitions.
[2024-05-24 16:11:45] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2024-05-24 16:11:45] [INFO ] Invariant cache hit.
[2024-05-24 16:11:45] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-24 16:11:45] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2024-05-24 16:11:45] [INFO ] Invariant cache hit.
[2024-05-24 16:11:45] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-24 16:11:45] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
[2024-05-24 16:11:45] [INFO ] Redundant transitions in 1 ms returned []
Running 55 sub problems to find dead transitions.
[2024-05-24 16:11:45] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2024-05-24 16:11:45] [INFO ] Invariant cache hit.
[2024-05-24 16:11:45] [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 409 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
[2024-05-24 16:11:46] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 3 ms to minimize.
[2024-05-24 16:11:46] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 0 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 807 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 1232ms problems are : Problem set: 0 solved, 55 unsolved
Search for dead transitions found 0 dead transitions in 1234ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1345 ms. Remains : 37/37 places, 56/56 transitions.
[2024-05-24 16:11:47] [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 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[7, 0, 20] Max Struct:[+inf, 1, +inf]
[2024-05-24 16:11:47] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2024-05-24 16:11:47] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[7, 0, 20] Max Struct:[+inf, 1, +inf]
RANDOM walk for 1000005 steps (2 resets) in 363 ms. (2747 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 326 ms. (3058 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[7, 0, 20] Max Struct:[+inf, 1, +inf]
[2024-05-24 16:11:47] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2024-05-24 16:11:47] [INFO ] Invariant cache hit.
[2024-05-24 16:11:47] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-24 16:11:47] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-24 16:11:47] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-24 16:11:47] [INFO ] [Real]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-24 16:11:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 16:11:47] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-24 16:11:47] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-24 16:11:47] [INFO ] [Nat]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-24 16:11:47] [INFO ] Computed and/alt/rep : 44/155/43 causal constraints (skipped 6 transitions) in 3 ms.
[2024-05-24 16:11:47] [INFO ] Added : 16 causal constraints over 4 iterations in 22 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[7, 0, 20] Max Struct:[+inf, 1, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[7, 0, 20] Max Struct:[+inf, 1, +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 5 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.
[2024-05-24 16:11:48] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2024-05-24 16:11:48] [INFO ] Invariant cache hit.
[2024-05-24 16:11:48] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-24 16:11:48] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2024-05-24 16:11:48] [INFO ] Invariant cache hit.
[2024-05-24 16:11:48] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-24 16:11:48] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2024-05-24 16:11:48] [INFO ] Redundant transitions in 1 ms returned []
Running 55 sub problems to find dead transitions.
[2024-05-24 16:11:48] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2024-05-24 16:11:48] [INFO ] Invariant cache hit.
[2024-05-24 16:11:48] [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 407 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
[2024-05-24 16:11:48] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-24 16:11:48] [INFO ] Deduced a trap composed of 8 places in 21 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 790 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 1212ms problems are : Problem set: 0 solved, 55 unsolved
Search for dead transitions found 0 dead transitions in 1213ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1318 ms. Remains : 37/37 places, 56/56 transitions.
[2024-05-24 16:11:49] [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 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[7, 0, 20] Max Struct:[+inf, 1, +inf]
RANDOM walk for 40003 steps (8 resets) in 246 ms. (161 steps per ms) remains 1/1 properties
BEST_FIRST walk for 25056 steps (5 resets) in 59 ms. (417 steps per ms) remains 0/1 properties
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[7, 0, 20] Max Struct:[+inf, 1, +inf]
Starting property specific reduction for Medical-PT-06-UpperBounds-13
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]
[2024-05-24 16:11:49] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2024-05-24 16:11:49] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10003 steps (2 resets) in 6 ms. (1429 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5] Max Struct:[+inf]
[2024-05-24 16:11:49] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2024-05-24 16:11:49] [INFO ] Invariant cache hit.
[2024-05-24 16:11:49] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-24 16:11:49] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-24 16:11:49] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-24 16:11:49] [INFO ] [Real]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-24 16:11:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 16:11:49] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-05-24 16:11:49] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-24 16:11:49] [INFO ] [Nat]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-24 16:11:49] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 1 ms to minimize.
[2024-05-24 16:11:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 26 ms
[2024-05-24 16:11:49] [INFO ] Computed and/alt/rep : 44/155/43 causal constraints (skipped 6 transitions) in 3 ms.
[2024-05-24 16:11:49] [INFO ] Added : 24 causal constraints over 5 iterations in 27 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5] 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.
[2024-05-24 16:11:49] [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 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[5] Max Struct:[+inf]
[2024-05-24 16:11:49] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2024-05-24 16:11:49] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[5] Max Struct:[+inf]
RANDOM walk for 1000005 steps (2 resets) in 394 ms. (2531 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 331 ms. (3012 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[11] Max Struct:[+inf]
[2024-05-24 16:11:50] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2024-05-24 16:11:50] [INFO ] Invariant cache hit.
[2024-05-24 16:11:50] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-24 16:11:50] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-24 16:11:50] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-24 16:11:50] [INFO ] [Real]Added 27 Read/Feed constraints in 4 ms returned sat
[2024-05-24 16:11:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 16:11:50] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-24 16:11:50] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-24 16:11:50] [INFO ] [Nat]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-24 16:11:50] [INFO ] Computed and/alt/rep : 44/155/43 causal constraints (skipped 6 transitions) in 2 ms.
[2024-05-24 16:11:50] [INFO ] Added : 16 causal constraints over 4 iterations in 20 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[11] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[11] 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 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 3 ms. Remains 37 /37 variables (removed 0) and now considering 56/56 (removed 0) transitions.
[2024-05-24 16:11:50] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2024-05-24 16:11:50] [INFO ] Invariant cache hit.
[2024-05-24 16:11:50] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-24 16:11:50] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2024-05-24 16:11:50] [INFO ] Invariant cache hit.
[2024-05-24 16:11:50] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-24 16:11:50] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2024-05-24 16:11:50] [INFO ] Redundant transitions in 5 ms returned []
Running 55 sub problems to find dead transitions.
[2024-05-24 16:11:50] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2024-05-24 16:11:50] [INFO ] Invariant cache hit.
[2024-05-24 16:11:50] [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 412 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
[2024-05-24 16:11:51] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-24 16:11:51] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 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 768 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 1195ms problems are : Problem set: 0 solved, 55 unsolved
Search for dead transitions found 0 dead transitions in 1196ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1294 ms. Remains : 37/37 places, 56/56 transitions.
[2024-05-24 16:11:51] [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 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[11] Max Struct:[+inf]
[2024-05-24 16:11:51] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2024-05-24 16:11:51] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[11] Max Struct:[+inf]
RANDOM walk for 1000001 steps (2 resets) in 361 ms. (2762 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 312 ms. (3194 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[15] Max Struct:[+inf]
[2024-05-24 16:11:52] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2024-05-24 16:11:52] [INFO ] Invariant cache hit.
[2024-05-24 16:11:52] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-24 16:11:52] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-24 16:11:52] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-24 16:11:52] [INFO ] [Real]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-24 16:11:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 16:11:52] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-24 16:11:52] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-24 16:11:52] [INFO ] [Nat]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-24 16:11:52] [INFO ] Computed and/alt/rep : 44/155/43 causal constraints (skipped 6 transitions) in 2 ms.
[2024-05-24 16:11:52] [INFO ] Added : 16 causal constraints over 4 iterations in 31 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[15] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[15] 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.
[2024-05-24 16:11:52] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2024-05-24 16:11:52] [INFO ] Invariant cache hit.
[2024-05-24 16:11:52] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-24 16:11:52] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2024-05-24 16:11:52] [INFO ] Invariant cache hit.
[2024-05-24 16:11:52] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-24 16:11:52] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2024-05-24 16:11:52] [INFO ] Redundant transitions in 0 ms returned []
Running 55 sub problems to find dead transitions.
[2024-05-24 16:11:52] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2024-05-24 16:11:52] [INFO ] Invariant cache hit.
[2024-05-24 16:11:52] [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 403 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
[2024-05-24 16:11:53] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-24 16:11:53] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 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 790 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 1205ms problems are : Problem set: 0 solved, 55 unsolved
Search for dead transitions found 0 dead transitions in 1205ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1301 ms. Remains : 37/37 places, 56/56 transitions.
[2024-05-24 16:11:54] [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 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[15] Max Struct:[+inf]
[2024-05-24 16:11:54] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2024-05-24 16:11:54] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[15] Max Struct:[+inf]
RANDOM walk for 1000002 steps (2 resets) in 340 ms. (2932 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 323 ms. (3086 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[15] Max Struct:[+inf]
[2024-05-24 16:11:54] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2024-05-24 16:11:54] [INFO ] Invariant cache hit.
[2024-05-24 16:11:54] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-24 16:11:54] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-24 16:11:54] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-24 16:11:54] [INFO ] [Real]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-24 16:11:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 16:11:54] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-24 16:11:54] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-24 16:11:54] [INFO ] [Nat]Added 27 Read/Feed constraints in 3 ms returned sat
[2024-05-24 16:11:54] [INFO ] Computed and/alt/rep : 44/155/43 causal constraints (skipped 6 transitions) in 3 ms.
[2024-05-24 16:11:54] [INFO ] Added : 16 causal constraints over 4 iterations in 20 ms. Result :sat
Minimization took 21 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[15] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[15] 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 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 2 ms. Remains 37 /37 variables (removed 0) and now considering 56/56 (removed 0) transitions.
[2024-05-24 16:11:54] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2024-05-24 16:11:54] [INFO ] Invariant cache hit.
[2024-05-24 16:11:54] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-24 16:11:54] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2024-05-24 16:11:54] [INFO ] Invariant cache hit.
[2024-05-24 16:11:54] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-24 16:11:54] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2024-05-24 16:11:54] [INFO ] Redundant transitions in 1 ms returned []
Running 55 sub problems to find dead transitions.
[2024-05-24 16:11:54] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2024-05-24 16:11:54] [INFO ] Invariant cache hit.
[2024-05-24 16:11:54] [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 408 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
[2024-05-24 16:11:55] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-24 16:11:55] [INFO ] Deduced a trap composed of 8 places in 16 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 747 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 1168ms problems are : Problem set: 0 solved, 55 unsolved
Search for dead transitions found 0 dead transitions in 1169ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1263 ms. Remains : 37/37 places, 56/56 transitions.
[2024-05-24 16:11:56] [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 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[15] Max Struct:[+inf]
RANDOM walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2503838 steps, run timeout after 3001 ms. (steps per millisecond=834 ) properties seen :0 out of 1
Probabilistic random walk after 2503838 steps, saw 1463630 distinct states, run finished after 3004 ms. (steps per millisecond=833 ) properties seen :0
[2024-05-24 16:11:59] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2024-05-24 16:11:59] [INFO ] Invariant cache hit.
[2024-05-24 16:11:59] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 30/36 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 34/70 variables, 17/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/70 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/70 variables, 11/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/70 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 15/85 variables, 11/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/85 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/85 variables, 5/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/85 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/87 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/87 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/87 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/87 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 87/87 variables, and 72 constraints, problems are : Problem set: 0 solved, 1 unsolved in 56 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 37/37 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 30/36 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 34/70 variables, 17/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/70 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/70 variables, 11/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/70 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 16:11:59] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/70 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/70 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 15/85 variables, 11/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/85 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/85 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 16:11:59] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/85 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/85 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/87 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/87 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/87 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/87 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 87/87 variables, and 75 constraints, problems are : Problem set: 0 solved, 1 unsolved in 108 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 37/37 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 168ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 19 ms.
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 2 ms. Remains : 37/37 places, 56/56 transitions.
RANDOM walk for 40007 steps (8 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2478321 steps, run timeout after 3001 ms. (steps per millisecond=825 ) properties seen :0 out of 1
Probabilistic random walk after 2478321 steps, saw 1448320 distinct states, run finished after 3001 ms. (steps per millisecond=825 ) properties seen :0
[2024-05-24 16:12:02] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2024-05-24 16:12:02] [INFO ] Invariant cache hit.
[2024-05-24 16:12:02] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 30/36 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 34/70 variables, 17/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/70 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/70 variables, 11/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/70 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 15/85 variables, 11/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/85 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/85 variables, 5/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/85 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/87 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/87 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/87 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/87 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 87/87 variables, and 72 constraints, problems are : Problem set: 0 solved, 1 unsolved in 54 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 37/37 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 30/36 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 34/70 variables, 17/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/70 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/70 variables, 11/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/70 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 16:12:02] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/70 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/70 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 15/85 variables, 11/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/85 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/85 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 16:12:02] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/85 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/85 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/87 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/87 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/87 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/87 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 87/87 variables, and 75 constraints, problems are : Problem set: 0 solved, 1 unsolved in 119 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 37/37 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 176ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 17 ms.
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 2 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 1 ms. Remains 37 /37 variables (removed 0) and now considering 56/56 (removed 0) transitions.
[2024-05-24 16:12:02] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2024-05-24 16:12:02] [INFO ] Invariant cache hit.
[2024-05-24 16:12:02] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-24 16:12:02] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2024-05-24 16:12:02] [INFO ] Invariant cache hit.
[2024-05-24 16:12:02] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-24 16:12:02] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2024-05-24 16:12:02] [INFO ] Redundant transitions in 1 ms returned []
Running 55 sub problems to find dead transitions.
[2024-05-24 16:12:02] [INFO ] Flow matrix only has 50 transitions (discarded 6 similar events)
[2024-05-24 16:12:02] [INFO ] Invariant cache hit.
[2024-05-24 16:12:02] [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 413 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
[2024-05-24 16:12:03] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-24 16:12:03] [INFO ] Deduced a trap composed of 8 places in 16 ms of which 0 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 789 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 1215ms problems are : Problem set: 0 solved, 55 unsolved
Search for dead transitions found 0 dead transitions in 1216ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1310 ms. Remains : 37/37 places, 56/56 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 87 edges and 37 vertex of which 35 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 35 transition count 45
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 14 place count 33 transition count 45
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 19 place count 30 transition count 43
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 24 place count 27 transition count 55
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 27 transition count 58
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 29 place count 24 transition count 58
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 30 place count 24 transition count 81
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 31 place count 23 transition count 81
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 32 place count 23 transition count 81
Applied a total of 32 rules in 13 ms. Remains 23 /37 variables (removed 14) and now considering 81/56 (removed -25) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 81 rows 23 cols
[2024-05-24 16:12:03] [INFO ] Computed 5 invariants in 1 ms
[2024-05-24 16:12:03] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-24 16:12:04] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 16:12:04] [INFO ] [Nat]Absence check using 5 positive place invariants in 0 ms returned sat
[2024-05-24 16:12:04] [INFO ] After 17ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 16:12:04] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-24 16:12:04] [INFO ] After 3ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-24 16:12:04] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-24 16:12:04] [INFO ] After 50ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 110 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[15] Max Struct:[+inf]
Ending property specific reduction for Medical-PT-06-UpperBounds-13 in 14577 ms.
[2024-05-24 16:12:04] [INFO ] Flatten gal took : 27 ms
[2024-05-24 16:12:04] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2024-05-24 16:12:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 37 places, 56 transitions and 275 arcs took 3 ms.
Total runtime 48054 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Medical-PT-06

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 37
TRANSITIONS: 56
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.002s, Sys 0.000s]


SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 987
MODEL NAME: /home/mcc/execution/412/model
37 places, 56 transitions.
Enabling coverability test.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Building monolithic NSF...
Building monolithic NSF...
Start RS construction.
coverability test failed!!
Convergence in 3 steps.
The state space is infinite.
CANNOT_COMPUTE
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716567124892

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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-06"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is Medical-PT-06, 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 r223-tall-171649611600533"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Medical-PT-06.tgz
mv Medical-PT-06 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;