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.r377-smll-171683809800126.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 SieveSingleMsgMbox-PT-d2m36, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r377-smll-171683809800126
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 19:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 158K Apr 12 19:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 12 19:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 12 19:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.1M May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716921130361

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d2m36
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 18:32:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-28 18:32:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 18:32:13] [INFO ] Load time of PNML (sax parser for PT used): 511 ms
[2024-05-28 18:32:13] [INFO ] Transformed 2398 places.
[2024-05-28 18:32:13] [INFO ] Transformed 1954 transitions.
[2024-05-28 18:32:13] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 764 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 47 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1984 places in 32 ms
Reduce places removed 1984 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8826 resets) in 3907 ms. (10 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3699 resets) in 680 ms. (58 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (3682 resets) in 812 ms. (49 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 162855 steps, run timeout after 3001 ms. (steps per millisecond=54 ) properties seen :0 out of 2
Probabilistic random walk after 162855 steps, saw 74294 distinct states, run finished after 3007 ms. (steps per millisecond=54 ) properties seen :0
// Phase 1: matrix 1954 rows 414 cols
[2024-05-28 18:32:18] [INFO ] Computed 6 invariants in 61 ms
[2024-05-28 18:32:18] [INFO ] State equation strengthened by 1674 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 147/152 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 52/204 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-2024-12 is UNSAT
FORMULA SieveSingleMsgMbox-PT-d2m36-ReachabilityCardinality-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 210/414 variables, 3/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/414 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1954/2368 variables, 414/420 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2368/2368 variables, and 2094 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2716 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 414/414 constraints, ReadFeed: 1674/1674 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 148/151 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 52/203 variables, 2/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 211/414 variables, 3/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-28 18:32:22] [INFO ] Deduced a trap composed of 25 places in 684 ms of which 34 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/414 variables, 1/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/414 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1954/2368 variables, 414/421 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2368 variables, 1674/2095 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2368 variables, 1/2096 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-28 18:32:24] [INFO ] Deduced a trap composed of 178 places in 568 ms of which 64 ms to minimize.
[2024-05-28 18:32:24] [INFO ] Deduced a trap composed of 44 places in 79 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/2368 variables, 2/2098 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2368 variables, 0/2098 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/2368 variables, 0/2098 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2368/2368 variables, and 2098 constraints, problems are : Problem set: 1 solved, 1 unsolved in 3977 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 414/414 constraints, ReadFeed: 1674/1674 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 6996ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 146 ms.
Support contains 3 out of 414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1954/1954 transitions.
Graph (complete) has 2618 edges and 414 vertex of which 388 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.7 ms
Discarding 26 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 828 transitions
Reduce isomorphic transitions removed 830 transitions.
Iterating post reduction 0 with 830 rules applied. Total rules applied 831 place count 388 transition count 1124
Discarding 117 places :
Symmetric choice reduction at 1 with 117 rule applications. Total rules 948 place count 271 transition count 379
Iterating global reduction 1 with 117 rules applied. Total rules applied 1065 place count 271 transition count 379
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 1075 place count 271 transition count 369
Discarding 91 places :
Symmetric choice reduction at 2 with 91 rule applications. Total rules 1166 place count 180 transition count 278
Iterating global reduction 2 with 91 rules applied. Total rules applied 1257 place count 180 transition count 278
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 2 with 39 rules applied. Total rules applied 1296 place count 180 transition count 239
Discarding 38 places :
Symmetric choice reduction at 3 with 38 rule applications. Total rules 1334 place count 142 transition count 186
Iterating global reduction 3 with 38 rules applied. Total rules applied 1372 place count 142 transition count 186
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 3 with 23 rules applied. Total rules applied 1395 place count 142 transition count 163
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1404 place count 133 transition count 150
Iterating global reduction 4 with 9 rules applied. Total rules applied 1413 place count 133 transition count 150
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1422 place count 124 transition count 141
Iterating global reduction 4 with 9 rules applied. Total rules applied 1431 place count 124 transition count 141
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1436 place count 119 transition count 135
Iterating global reduction 4 with 5 rules applied. Total rules applied 1441 place count 119 transition count 135
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1443 place count 119 transition count 133
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1447 place count 115 transition count 129
Iterating global reduction 5 with 4 rules applied. Total rules applied 1451 place count 115 transition count 129
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1452 place count 114 transition count 128
Iterating global reduction 5 with 1 rules applied. Total rules applied 1453 place count 114 transition count 128
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1454 place count 113 transition count 127
Iterating global reduction 5 with 1 rules applied. Total rules applied 1455 place count 113 transition count 127
Applied a total of 1455 rules in 170 ms. Remains 113 /414 variables (removed 301) and now considering 127/1954 (removed 1827) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 189 ms. Remains : 113/414 places, 127/1954 transitions.
RANDOM walk for 40000 steps (8954 resets) in 246 ms. (161 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (4187 resets) in 103 ms. (384 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2154327 steps, run timeout after 3005 ms. (steps per millisecond=716 ) properties seen :0 out of 1
Probabilistic random walk after 2154327 steps, saw 1003657 distinct states, run finished after 3005 ms. (steps per millisecond=716 ) properties seen :0
// Phase 1: matrix 127 rows 113 cols
[2024-05-28 18:32:28] [INFO ] Computed 4 invariants in 6 ms
[2024-05-28 18:32:28] [INFO ] State equation strengthened by 48 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/73 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 9/82 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 97/179 variables, 82/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/179 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 34/213 variables, 17/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/213 variables, 35/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/213 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 27/240 variables, 14/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/240 variables, 13/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/240 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/240 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 240/240 variables, and 165 constraints, problems are : Problem set: 0 solved, 1 unsolved in 171 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 113/113 constraints, ReadFeed: 48/48 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/73 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 9/82 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 97/179 variables, 82/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/179 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 34/213 variables, 17/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/213 variables, 35/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/213 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/213 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 27/240 variables, 14/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/240 variables, 13/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 18:32:29] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/240 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/240 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/240 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 240/240 variables, and 167 constraints, problems are : Problem set: 0 solved, 1 unsolved in 301 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 113/113 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 487ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 30 ms.
Support contains 3 out of 113 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 113/113 places, 127/127 transitions.
Applied a total of 0 rules in 11 ms. Remains 113 /113 variables (removed 0) and now considering 127/127 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 113/113 places, 127/127 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 113/113 places, 127/127 transitions.
Applied a total of 0 rules in 10 ms. Remains 113 /113 variables (removed 0) and now considering 127/127 (removed 0) transitions.
[2024-05-28 18:32:29] [INFO ] Invariant cache hit.
[2024-05-28 18:32:29] [INFO ] Implicit Places using invariants in 158 ms returned []
[2024-05-28 18:32:29] [INFO ] Invariant cache hit.
[2024-05-28 18:32:29] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-05-28 18:32:30] [INFO ] Implicit Places using invariants and state equation in 319 ms returned []
Implicit Place search using SMT with State Equation took 488 ms to find 0 implicit places.
[2024-05-28 18:32:30] [INFO ] Redundant transitions in 4 ms returned []
Running 126 sub problems to find dead transitions.
[2024-05-28 18:32:30] [INFO ] Invariant cache hit.
[2024-05-28 18:32:30] [INFO ] State equation strengthened by 48 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (OVERLAPS) 1/113 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (OVERLAPS) 127/240 variables, 113/117 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 48/165 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-28 18:32:35] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 4 ms to minimize.
Problem TDEAD117 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD56 is UNSAT
At refinement iteration 8 (OVERLAPS) 0/240 variables, 1/166 constraints. Problems are: Problem set: 3 solved, 123 unsolved
[2024-05-28 18:32:36] [INFO ] Deduced a trap composed of 46 places in 46 ms of which 2 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 1/167 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 0/167 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 11 (OVERLAPS) 0/240 variables, 0/167 constraints. Problems are: Problem set: 3 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 240/240 variables, and 167 constraints, problems are : Problem set: 3 solved, 123 unsolved in 9811 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 113/113 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 3 solved, 123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 2 (OVERLAPS) 4/113 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 2/4 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 2/6 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 0/6 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 6 (OVERLAPS) 127/240 variables, 113/119 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 48/167 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 123/290 constraints. Problems are: Problem set: 3 solved, 123 unsolved
[2024-05-28 18:32:43] [INFO ] Deduced a trap composed of 48 places in 77 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 1/291 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 0/291 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 11 (OVERLAPS) 0/240 variables, 0/291 constraints. Problems are: Problem set: 3 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 240/240 variables, and 291 constraints, problems are : Problem set: 3 solved, 123 unsolved in 14555 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 113/113 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 123/126 constraints, Known Traps: 3/3 constraints]
After SMT, in 24682ms problems are : Problem set: 3 solved, 123 unsolved
Search for dead transitions found 3 dead transitions in 24687ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 113/113 places, 124/127 transitions.
Graph (complete) has 316 edges and 113 vertex of which 110 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 11 ms. Remains 110 /113 variables (removed 3) and now considering 124/124 (removed 0) transitions.
// Phase 1: matrix 124 rows 110 cols
[2024-05-28 18:32:54] [INFO ] Computed 3 invariants in 2 ms
[2024-05-28 18:32:54] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-05-28 18:32:54] [INFO ] Invariant cache hit.
[2024-05-28 18:32:54] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-05-28 18:32:55] [INFO ] Implicit Places using invariants and state equation in 396 ms returned []
Implicit Place search using SMT with State Equation took 544 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 110/113 places, 124/127 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 25757 ms. Remains : 110/113 places, 124/127 transitions.
RANDOM walk for 40000 steps (8955 resets) in 181 ms. (219 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (4188 resets) in 77 ms. (512 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2021453 steps, run timeout after 3001 ms. (steps per millisecond=673 ) properties seen :0 out of 1
Probabilistic random walk after 2021453 steps, saw 946162 distinct states, run finished after 3001 ms. (steps per millisecond=673 ) properties seen :0
[2024-05-28 18:32:58] [INFO ] Invariant cache hit.
[2024-05-28 18:32:58] [INFO ] State equation strengthened by 47 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 62/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/69 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 85/154 variables, 69/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 41/195 variables, 18/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 31/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 39/234 variables, 23/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 16/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/234 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 234/234 variables, and 160 constraints, problems are : Problem set: 0 solved, 1 unsolved in 185 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 110/110 constraints, ReadFeed: 47/47 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 62/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/69 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 18:32:58] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 5 ms to minimize.
[2024-05-28 18:32:58] [INFO ] Deduced a trap composed of 46 places in 44 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 85/154 variables, 69/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 41/195 variables, 18/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 31/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/195 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/195 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 39/234 variables, 23/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/234 variables, 16/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 18:32:58] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/234 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/234 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/234 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 234/234 variables, and 164 constraints, problems are : Problem set: 0 solved, 1 unsolved in 383 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 110/110 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 588ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 166 ms.
Support contains 3 out of 110 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 110/110 places, 124/124 transitions.
Applied a total of 0 rules in 9 ms. Remains 110 /110 variables (removed 0) and now considering 124/124 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 110/110 places, 124/124 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 110/110 places, 124/124 transitions.
Applied a total of 0 rules in 8 ms. Remains 110 /110 variables (removed 0) and now considering 124/124 (removed 0) transitions.
[2024-05-28 18:32:59] [INFO ] Invariant cache hit.
[2024-05-28 18:32:59] [INFO ] Implicit Places using invariants in 173 ms returned []
[2024-05-28 18:32:59] [INFO ] Invariant cache hit.
[2024-05-28 18:32:59] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-05-28 18:32:59] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 503 ms to find 0 implicit places.
[2024-05-28 18:32:59] [INFO ] Redundant transitions in 4 ms returned []
Running 123 sub problems to find dead transitions.
[2024-05-28 18:32:59] [INFO ] Invariant cache hit.
[2024-05-28 18:32:59] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (OVERLAPS) 1/110 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 123 unsolved
Problem TDEAD49 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD112 is UNSAT
At refinement iteration 4 (OVERLAPS) 124/234 variables, 110/113 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 47/160 constraints. Problems are: Problem set: 3 solved, 120 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 0/160 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 0/234 variables, 0/160 constraints. Problems are: Problem set: 3 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 234/234 variables, and 160 constraints, problems are : Problem set: 3 solved, 120 unsolved in 4688 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 110/110 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/107 variables, 2/3 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 123/230 variables, 107/110 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/230 variables, 46/156 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 16/172 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/230 variables, 0/172 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 8 (OVERLAPS) 4/234 variables, 3/175 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 1/176 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 104/280 constraints. Problems are: Problem set: 3 solved, 120 unsolved
[2024-05-28 18:33:10] [INFO ] Deduced a trap composed of 46 places in 37 ms of which 1 ms to minimize.
[2024-05-28 18:33:10] [INFO ] Deduced a trap composed of 46 places in 41 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 2/282 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/282 constraints. Problems are: Problem set: 3 solved, 120 unsolved
At refinement iteration 13 (OVERLAPS) 0/234 variables, 0/282 constraints. Problems are: Problem set: 3 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 234/234 variables, and 282 constraints, problems are : Problem set: 3 solved, 120 unsolved in 15990 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 110/110 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 120/123 constraints, Known Traps: 2/2 constraints]
After SMT, in 20905ms problems are : Problem set: 3 solved, 120 unsolved
Search for dead transitions found 3 dead transitions in 20908ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 110/110 places, 121/124 transitions.
Graph (complete) has 307 edges and 110 vertex of which 107 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 ms. Remains 107 /110 variables (removed 3) and now considering 121/121 (removed 0) transitions.
// Phase 1: matrix 121 rows 107 cols
[2024-05-28 18:33:20] [INFO ] Computed 3 invariants in 1 ms
[2024-05-28 18:33:20] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-28 18:33:20] [INFO ] Invariant cache hit.
[2024-05-28 18:33:20] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-28 18:33:20] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 385 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 107/110 places, 121/124 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 21822 ms. Remains : 107/110 places, 121/124 transitions.
RANDOM walk for 40000 steps (9046 resets) in 89 ms. (444 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (4157 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2177135 steps, run timeout after 3001 ms. (steps per millisecond=725 ) properties seen :0 out of 1
Probabilistic random walk after 2177135 steps, saw 1014681 distinct states, run finished after 3001 ms. (steps per millisecond=725 ) properties seen :0
[2024-05-28 18:33:24] [INFO ] Invariant cache hit.
[2024-05-28 18:33:24] [INFO ] State equation strengthened by 46 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/69 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 85/154 variables, 69/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/154 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 38/192 variables, 17/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 31/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/192 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 36/228 variables, 21/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/228 variables, 15/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/228 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/228 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 228/228 variables, and 156 constraints, problems are : Problem set: 0 solved, 1 unsolved in 167 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 107/107 constraints, ReadFeed: 46/46 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/69 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 85/154 variables, 69/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 18:33:24] [INFO ] Deduced a trap composed of 46 places in 44 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/154 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/154 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 38/192 variables, 17/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/192 variables, 31/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/192 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/192 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 36/228 variables, 21/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/228 variables, 15/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/228 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/228 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 228/228 variables, and 158 constraints, problems are : Problem set: 0 solved, 1 unsolved in 241 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 107/107 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 431ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 26 ms.
Support contains 3 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 121/121 transitions.
Applied a total of 0 rules in 10 ms. Remains 107 /107 variables (removed 0) and now considering 121/121 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 107/107 places, 121/121 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 121/121 transitions.
Applied a total of 0 rules in 10 ms. Remains 107 /107 variables (removed 0) and now considering 121/121 (removed 0) transitions.
[2024-05-28 18:33:24] [INFO ] Invariant cache hit.
[2024-05-28 18:33:24] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-05-28 18:33:24] [INFO ] Invariant cache hit.
[2024-05-28 18:33:24] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-28 18:33:25] [INFO ] Implicit Places using invariants and state equation in 400 ms returned []
Implicit Place search using SMT with State Equation took 566 ms to find 0 implicit places.
[2024-05-28 18:33:25] [INFO ] Redundant transitions in 5 ms returned []
Running 120 sub problems to find dead transitions.
[2024-05-28 18:33:25] [INFO ] Invariant cache hit.
[2024-05-28 18:33:25] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (OVERLAPS) 1/107 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (OVERLAPS) 121/228 variables, 107/110 constraints. Problems are: Problem set: 0 solved, 120 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 46/156 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (OVERLAPS) 0/228 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 228/228 variables, and 156 constraints, problems are : Problem set: 0 solved, 120 unsolved in 4657 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 107/107 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (OVERLAPS) 1/107 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (OVERLAPS) 121/228 variables, 107/110 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 46/156 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 120/276 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 18:33:33] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 1 ms to minimize.
Problem TDEAD12 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/228 variables, 1/277 constraints. Problems are: Problem set: 5 solved, 115 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/228 variables, 0/277 constraints. Problems are: Problem set: 5 solved, 115 unsolved
At refinement iteration 10 (OVERLAPS) 0/228 variables, 0/277 constraints. Problems are: Problem set: 5 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Int declared 228/228 variables, and 277 constraints, problems are : Problem set: 5 solved, 115 unsolved in 14407 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 107/107 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 1/1 constraints]
After SMT, in 19368ms problems are : Problem set: 5 solved, 115 unsolved
Search for dead transitions found 5 dead transitions in 19372ms
Found 5 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 5 transitions
Dead transitions reduction (with SMT) removed 5 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 107/107 places, 116/121 transitions.
Graph (complete) has 294 edges and 107 vertex of which 102 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 102 transition count 115
Applied a total of 2 rules in 10 ms. Remains 102 /107 variables (removed 5) and now considering 115/116 (removed 1) transitions.
// Phase 1: matrix 115 rows 102 cols
[2024-05-28 18:33:44] [INFO ] Computed 2 invariants in 2 ms
[2024-05-28 18:33:44] [INFO ] Implicit Places using invariants in 165 ms returned []
[2024-05-28 18:33:44] [INFO ] Invariant cache hit.
[2024-05-28 18:33:44] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-28 18:33:44] [INFO ] Implicit Places using invariants and state equation in 371 ms returned []
Implicit Place search using SMT with State Equation took 539 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 102/107 places, 115/121 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 20515 ms. Remains : 102/107 places, 115/121 transitions.
RANDOM walk for 40000 steps (8892 resets) in 101 ms. (392 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (4218 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2274681 steps, run timeout after 3001 ms. (steps per millisecond=757 ) properties seen :0 out of 1
Probabilistic random walk after 2274681 steps, saw 1062979 distinct states, run finished after 3001 ms. (steps per millisecond=757 ) properties seen :0
[2024-05-28 18:33:48] [INFO ] Invariant cache hit.
[2024-05-28 18:33:48] [INFO ] State equation strengthened by 44 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 36/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/41 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 61/102 variables, 41/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 68/170 variables, 31/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 27/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/170 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 47/217 variables, 30/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/217 variables, 17/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/217 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/217 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 217/217 variables, and 148 constraints, problems are : Problem set: 0 solved, 1 unsolved in 114 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 102/102 constraints, ReadFeed: 44/44 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 36/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/41 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 61/102 variables, 41/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 68/170 variables, 31/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 27/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/170 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/170 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 47/217 variables, 30/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/217 variables, 17/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/217 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/217 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 217/217 variables, and 149 constraints, problems are : Problem set: 0 solved, 1 unsolved in 139 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 102/102 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 274ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 111 ms.
Support contains 3 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 115/115 transitions.
Applied a total of 0 rules in 8 ms. Remains 102 /102 variables (removed 0) and now considering 115/115 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 102/102 places, 115/115 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 115/115 transitions.
Applied a total of 0 rules in 6 ms. Remains 102 /102 variables (removed 0) and now considering 115/115 (removed 0) transitions.
[2024-05-28 18:33:48] [INFO ] Invariant cache hit.
[2024-05-28 18:33:48] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-05-28 18:33:48] [INFO ] Invariant cache hit.
[2024-05-28 18:33:48] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-28 18:33:48] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 424 ms to find 0 implicit places.
[2024-05-28 18:33:48] [INFO ] Redundant transitions in 4 ms returned []
Running 114 sub problems to find dead transitions.
[2024-05-28 18:33:48] [INFO ] Invariant cache hit.
[2024-05-28 18:33:48] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (OVERLAPS) 1/102 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (OVERLAPS) 115/217 variables, 102/104 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/217 variables, 44/148 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-28 18:33:51] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/217 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 8 (OVERLAPS) 0/217 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Real declared 217/217 variables, and 149 constraints, problems are : Problem set: 0 solved, 114 unsolved in 6153 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 102/102 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 114 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (OVERLAPS) 1/102 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (OVERLAPS) 115/217 variables, 102/105 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 44/149 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/217 variables, 114/263 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/217 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 9 (OVERLAPS) 0/217 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Int declared 217/217 variables, and 263 constraints, problems are : Problem set: 0 solved, 114 unsolved in 8071 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 102/102 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 1/1 constraints]
After SMT, in 14369ms problems are : Problem set: 0 solved, 114 unsolved
Search for dead transitions found 0 dead transitions in 14372ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14813 ms. Remains : 102/102 places, 115/115 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 102 transition count 107
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 96 transition count 107
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 14 place count 96 transition count 91
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 46 place count 80 transition count 91
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 56 place count 75 transition count 86
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 58 place count 74 transition count 94
Applied a total of 58 rules in 22 ms. Remains 74 /102 variables (removed 28) and now considering 94/115 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 74 cols
[2024-05-28 18:34:03] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 18:34:03] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 18:34:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-28 18:34:03] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 18:34:03] [INFO ] After 75ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-28 18:34:03] [INFO ] After 94ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-28 18:34:03] [INFO ] After 150ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 226 ms.
[2024-05-28 18:34:03] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2024-05-28 18:34:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 102 places, 115 transitions and 455 arcs took 9 ms.
[2024-05-28 18:34:03] [INFO ] Flatten gal took : 53 ms
Total runtime 110995 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running SieveSingleMsgMbox-PT-d2m36

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: 102
TRANSITIONS: 115
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.000s, Sys 0.004s]


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


----------------------------------------------------------------------
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: 722
MODEL NAME: /home/mcc/execution/412/model
102 places, 115 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
CANNOT_COMPUTE
EXITCODE: 87
----------------------------------------------------------------------

BK_STOP 1716923408608

--------------------
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 ReachabilityCardinality -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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="SieveSingleMsgMbox-PT-d2m36"
export BK_EXAMINATION="ReachabilityCardinality"
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 SieveSingleMsgMbox-PT-d2m36, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r377-smll-171683809800126"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d2m36.tgz
mv SieveSingleMsgMbox-PT-d2m36 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;