Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r516-tajo-171654446700247.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is PolyORBLF-PT-S02J06T06, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654446700247
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 22K Apr 11 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 124K Apr 11 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 17K Apr 11 16:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 101K Apr 11 16:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 9.9K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 24K Apr 11 17:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Apr 11 17:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 43K Apr 11 17:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 216K Apr 11 17:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.2K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 601K 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 PolyORBLF-PT-S02J06T06-ReachabilityFireability-2024-00
FORMULA_NAME PolyORBLF-PT-S02J06T06-ReachabilityFireability-2024-01
FORMULA_NAME PolyORBLF-PT-S02J06T06-ReachabilityFireability-2024-02
FORMULA_NAME PolyORBLF-PT-S02J06T06-ReachabilityFireability-2024-03
FORMULA_NAME PolyORBLF-PT-S02J06T06-ReachabilityFireability-2024-04
FORMULA_NAME PolyORBLF-PT-S02J06T06-ReachabilityFireability-2024-05
FORMULA_NAME PolyORBLF-PT-S02J06T06-ReachabilityFireability-2024-06
FORMULA_NAME PolyORBLF-PT-S02J06T06-ReachabilityFireability-2024-07
FORMULA_NAME PolyORBLF-PT-S02J06T06-ReachabilityFireability-2024-08
FORMULA_NAME PolyORBLF-PT-S02J06T06-ReachabilityFireability-2024-09
FORMULA_NAME PolyORBLF-PT-S02J06T06-ReachabilityFireability-2024-10
FORMULA_NAME PolyORBLF-PT-S02J06T06-ReachabilityFireability-2024-11
FORMULA_NAME PolyORBLF-PT-S02J06T06-ReachabilityFireability-2024-12
FORMULA_NAME PolyORBLF-PT-S02J06T06-ReachabilityFireability-2024-13
FORMULA_NAME PolyORBLF-PT-S02J06T06-ReachabilityFireability-2024-14
FORMULA_NAME PolyORBLF-PT-S02J06T06-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717253064848

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S02J06T06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 14:44:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 14:44:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 14:44:26] [INFO ] Load time of PNML (sax parser for PT used): 227 ms
[2024-06-01 14:44:26] [INFO ] Transformed 536 places.
[2024-06-01 14:44:26] [INFO ] Transformed 1064 transitions.
[2024-06-01 14:44:26] [INFO ] Parsed PT model containing 536 places and 1064 transitions and 4866 arcs in 393 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 28 ms.
Working with output stream class java.io.PrintStream
[2024-06-01 14:44:26] [INFO ] Reduced 66 identical enabling conditions.
[2024-06-01 14:44:26] [INFO ] Reduced 24 identical enabling conditions.
[2024-06-01 14:44:26] [INFO ] Reduced 24 identical enabling conditions.
[2024-06-01 14:44:26] [INFO ] Reduced 66 identical enabling conditions.
[2024-06-01 14:44:26] [INFO ] Reduced 6 identical enabling conditions.
[2024-06-01 14:44:26] [INFO ] Reduced 24 identical enabling conditions.
[2024-06-01 14:44:26] [INFO ] Reduced 66 identical enabling conditions.
Ensure Unique test removed 96 transitions
Reduce redundant transitions removed 96 transitions.
RANDOM walk for 40000 steps (10 resets) in 2014 ms. (19 steps per ms) remains 4/16 properties
FORMULA PolyORBLF-PT-S02J06T06-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T06-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T06-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T06-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T06-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T06-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T06-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T06-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T06-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T06-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T06-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T06-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40001 steps (10 resets) in 3060 ms. (13 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (9 resets) in 792 ms. (50 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (8 resets) in 268 ms. (148 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (10 resets) in 193 ms. (206 steps per ms) remains 4/4 properties
[2024-06-01 14:44:29] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
// Phase 1: matrix 956 rows 536 cols
[2024-06-01 14:44:29] [INFO ] Computed 50 invariants in 40 ms
[2024-06-01 14:44:29] [INFO ] State equation strengthened by 72 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/429 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/429 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/429 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 18/447 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/447 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/447 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem PolyORBLF-PT-S02J06T06-ReachabilityFireability-2024-01 is UNSAT
FORMULA PolyORBLF-PT-S02J06T06-ReachabilityFireability-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S02J06T06-ReachabilityFireability-2024-03 is UNSAT
FORMULA PolyORBLF-PT-S02J06T06-ReachabilityFireability-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBLF-PT-S02J06T06-ReachabilityFireability-2024-08 is UNSAT
FORMULA PolyORBLF-PT-S02J06T06-ReachabilityFireability-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (OVERLAPS) 89/536 variables, 22/50 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/536 variables, 0/50 constraints. Problems are: Problem set: 3 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1492/1492 variables, and 586 constraints, problems are : Problem set: 3 solved, 1 unsolved in 1972 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 536/536 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 49/52 variables, 2/2 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 348/400 variables, 7/9 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 0/9 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 63/463 variables, 15/24 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 0/24 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 70/533 variables, 24/48 constraints. Problems are: Problem set: 3 solved, 1 unsolved
[2024-06-01 14:44:33] [INFO ] Deduced a trap composed of 74 places in 384 ms of which 22 ms to minimize.
[2024-06-01 14:44:34] [INFO ] Deduced a trap composed of 73 places in 139 ms of which 2 ms to minimize.
[2024-06-01 14:44:34] [INFO ] Deduced a trap composed of 74 places in 60 ms of which 1 ms to minimize.
[2024-06-01 14:44:34] [INFO ] Deduced a trap composed of 73 places in 80 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/533 variables, 4/52 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/533 variables, 0/52 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/534 variables, 1/53 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/534 variables, 0/53 constraints. Problems are: Problem set: 3 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1490/1492 variables, and 587 constraints, problems are : Problem set: 3 solved, 1 unsolved in 3158 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 534/536 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/4 constraints, Known Traps: 4/4 constraints]
After SMT, in 7167ms problems are : Problem set: 3 solved, 1 unsolved
Parikh walk visited 0 properties in 143 ms.
Support contains 3 out of 536 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 536/536 places, 968/968 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 52 rules applied. Total rules applied 52 place count 534 transition count 918
Reduce places removed 50 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 52 rules applied. Total rules applied 104 place count 484 transition count 916
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 106 place count 482 transition count 916
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 106 place count 482 transition count 856
Deduced a syphon composed of 60 places in 2 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 226 place count 422 transition count 856
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 322 place count 374 transition count 808
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 3 with 12 rules applied. Total rules applied 334 place count 374 transition count 796
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 346 place count 362 transition count 796
Applied a total of 346 rules in 306 ms. Remains 362 /536 variables (removed 174) and now considering 796/968 (removed 172) transitions.
Running 794 sub problems to find dead transitions.
[2024-06-01 14:44:36] [INFO ] Flow matrix only has 784 transitions (discarded 12 similar events)
// Phase 1: matrix 784 rows 362 cols
[2024-06-01 14:44:36] [INFO ] Computed 48 invariants in 22 ms
[2024-06-01 14:44:36] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 794 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/360 variables, 28/46 constraints. Problems are: Problem set: 0 solved, 794 unsolved
[2024-06-01 14:44:42] [INFO ] Deduced a trap composed of 45 places in 79 ms of which 1 ms to minimize.
[2024-06-01 14:44:43] [INFO ] Deduced a trap composed of 45 places in 56 ms of which 0 ms to minimize.
[2024-06-01 14:44:43] [INFO ] Deduced a trap composed of 25 places in 262 ms of which 4 ms to minimize.
[2024-06-01 14:44:43] [INFO ] Deduced a trap composed of 45 places in 133 ms of which 43 ms to minimize.
[2024-06-01 14:44:43] [INFO ] Deduced a trap composed of 45 places in 67 ms of which 1 ms to minimize.
[2024-06-01 14:44:43] [INFO ] Deduced a trap composed of 46 places in 41 ms of which 0 ms to minimize.
[2024-06-01 14:44:43] [INFO ] Deduced a trap composed of 45 places in 64 ms of which 1 ms to minimize.
[2024-06-01 14:44:44] [INFO ] Deduced a trap composed of 15 places in 165 ms of which 3 ms to minimize.
[2024-06-01 14:44:44] [INFO ] Deduced a trap composed of 54 places in 203 ms of which 2 ms to minimize.
[2024-06-01 14:44:46] [INFO ] Deduced a trap composed of 206 places in 155 ms of which 2 ms to minimize.
[2024-06-01 14:44:46] [INFO ] Deduced a trap composed of 117 places in 129 ms of which 2 ms to minimize.
[2024-06-01 14:44:47] [INFO ] Deduced a trap composed of 109 places in 182 ms of which 3 ms to minimize.
[2024-06-01 14:44:47] [INFO ] Deduced a trap composed of 126 places in 176 ms of which 2 ms to minimize.
[2024-06-01 14:44:48] [INFO ] Deduced a trap composed of 134 places in 201 ms of which 3 ms to minimize.
[2024-06-01 14:44:48] [INFO ] Deduced a trap composed of 135 places in 138 ms of which 2 ms to minimize.
[2024-06-01 14:44:48] [INFO ] Deduced a trap composed of 142 places in 152 ms of which 2 ms to minimize.
[2024-06-01 14:44:48] [INFO ] Deduced a trap composed of 122 places in 200 ms of which 2 ms to minimize.
[2024-06-01 14:44:49] [INFO ] Deduced a trap composed of 114 places in 206 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 18/64 constraints. Problems are: Problem set: 0 solved, 794 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/360 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 794 unsolved
SMT process timed out in 21236ms, After SMT, problems are : Problem set: 0 solved, 794 unsolved
Search for dead transitions found 0 dead transitions in 21263ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21614 ms. Remains : 362/536 places, 796/968 transitions.
RANDOM walk for 40000 steps (27 resets) in 457 ms. (87 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (10 resets) in 348 ms. (114 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 257187 steps, run timeout after 3001 ms. (steps per millisecond=85 ) properties seen :0 out of 1
Probabilistic random walk after 257187 steps, saw 150962 distinct states, run finished after 3004 ms. (steps per millisecond=85 ) properties seen :0
[2024-06-01 14:45:01] [INFO ] Flow matrix only has 784 transitions (discarded 12 similar events)
[2024-06-01 14:45:01] [INFO ] Invariant cache hit.
[2024-06-01 14:45:01] [INFO ] State equation strengthened by 72 read => feed constraints.
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) 134/137 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 127/264 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/270 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 88/358 variables, 30/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/358 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/360 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/360 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 784/1144 variables, 360/407 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1144 variables, 72/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1144 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/1146 variables, 2/481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1146 variables, 1/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1146 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1146 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1146/1146 variables, and 482 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1036 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 362/362 constraints, ReadFeed: 72/72 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) 134/137 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 127/264 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/270 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 14:45:02] [INFO ] Deduced a trap composed of 104 places in 176 ms of which 4 ms to minimize.
[2024-06-01 14:45:02] [INFO ] Deduced a trap composed of 104 places in 165 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 88/358 variables, 30/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 14:45:03] [INFO ] Deduced a trap composed of 45 places in 132 ms of which 1 ms to minimize.
[2024-06-01 14:45:03] [INFO ] Deduced a trap composed of 44 places in 93 ms of which 1 ms to minimize.
[2024-06-01 14:45:03] [INFO ] Deduced a trap composed of 45 places in 58 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/358 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/358 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/360 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/360 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 784/1144 variables, 360/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1144 variables, 72/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1144 variables, 1/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1144 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/1146 variables, 2/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1146 variables, 1/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1146 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1146 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1146/1146 variables, and 488 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4825 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 362/362 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 5876ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 305 ms.
Support contains 3 out of 362 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 362/362 places, 796/796 transitions.
Applied a total of 0 rules in 23 ms. Remains 362 /362 variables (removed 0) and now considering 796/796 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 362/362 places, 796/796 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 362/362 places, 796/796 transitions.
Applied a total of 0 rules in 24 ms. Remains 362 /362 variables (removed 0) and now considering 796/796 (removed 0) transitions.
[2024-06-01 14:45:07] [INFO ] Flow matrix only has 784 transitions (discarded 12 similar events)
[2024-06-01 14:45:07] [INFO ] Invariant cache hit.
[2024-06-01 14:45:08] [INFO ] Implicit Places using invariants in 578 ms returned [71, 79, 161, 171, 206, 339]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 584 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 356/362 places, 796/796 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 353 transition count 793
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 353 transition count 793
Applied a total of 6 rules in 69 ms. Remains 353 /356 variables (removed 3) and now considering 793/796 (removed 3) transitions.
[2024-06-01 14:45:08] [INFO ] Flow matrix only has 781 transitions (discarded 12 similar events)
// Phase 1: matrix 781 rows 353 cols
[2024-06-01 14:45:08] [INFO ] Computed 42 invariants in 25 ms
[2024-06-01 14:45:08] [INFO ] Implicit Places using invariants in 550 ms returned []
[2024-06-01 14:45:08] [INFO ] Flow matrix only has 781 transitions (discarded 12 similar events)
[2024-06-01 14:45:08] [INFO ] Invariant cache hit.
[2024-06-01 14:45:09] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 14:45:12] [INFO ] Implicit Places using invariants and state equation in 3374 ms returned []
Implicit Place search using SMT with State Equation took 3928 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 353/362 places, 793/796 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 4606 ms. Remains : 353/362 places, 793/796 transitions.
RANDOM walk for 40000 steps (24 resets) in 376 ms. (106 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (12 resets) in 134 ms. (296 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 274206 steps, run timeout after 3001 ms. (steps per millisecond=91 ) properties seen :0 out of 1
Probabilistic random walk after 274206 steps, saw 154265 distinct states, run finished after 3001 ms. (steps per millisecond=91 ) properties seen :0
[2024-06-01 14:45:15] [INFO ] Flow matrix only has 781 transitions (discarded 12 similar events)
[2024-06-01 14:45:15] [INFO ] Invariant cache hit.
[2024-06-01 14:45:15] [INFO ] State equation strengthened by 72 read => feed constraints.
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) 31/34 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 281/315 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/315 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/327 variables, 12/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/327 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 24/351 variables, 16/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/351 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 781/1132 variables, 351/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1132 variables, 72/464 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1132 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/1134 variables, 2/466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1134 variables, 1/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1134 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1134 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1134/1134 variables, and 467 constraints, problems are : Problem set: 0 solved, 1 unsolved in 719 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 353/353 constraints, ReadFeed: 72/72 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) 31/34 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 281/315 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/315 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/327 variables, 12/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/327 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 24/351 variables, 16/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 14:45:16] [INFO ] Deduced a trap composed of 45 places in 94 ms of which 2 ms to minimize.
[2024-06-01 14:45:16] [INFO ] Deduced a trap composed of 45 places in 79 ms of which 1 ms to minimize.
[2024-06-01 14:45:16] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/351 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/351 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 781/1132 variables, 351/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1132 variables, 72/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1132 variables, 1/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1132 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/1134 variables, 2/470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1134 variables, 1/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1134 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1134 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1134/1134 variables, and 471 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2279 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 353/353 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 3020ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 295 ms.
Support contains 3 out of 353 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 353/353 places, 793/793 transitions.
Applied a total of 0 rules in 20 ms. Remains 353 /353 variables (removed 0) and now considering 793/793 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 353/353 places, 793/793 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 353/353 places, 793/793 transitions.
Applied a total of 0 rules in 19 ms. Remains 353 /353 variables (removed 0) and now considering 793/793 (removed 0) transitions.
[2024-06-01 14:45:18] [INFO ] Flow matrix only has 781 transitions (discarded 12 similar events)
[2024-06-01 14:45:18] [INFO ] Invariant cache hit.
[2024-06-01 14:45:19] [INFO ] Implicit Places using invariants in 461 ms returned []
[2024-06-01 14:45:19] [INFO ] Flow matrix only has 781 transitions (discarded 12 similar events)
[2024-06-01 14:45:19] [INFO ] Invariant cache hit.
[2024-06-01 14:45:19] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 14:45:22] [INFO ] Implicit Places using invariants and state equation in 3722 ms returned []
Implicit Place search using SMT with State Equation took 4187 ms to find 0 implicit places.
[2024-06-01 14:45:22] [INFO ] Redundant transitions in 81 ms returned []
Running 791 sub problems to find dead transitions.
[2024-06-01 14:45:22] [INFO ] Flow matrix only has 781 transitions (discarded 12 similar events)
[2024-06-01 14:45:22] [INFO ] Invariant cache hit.
[2024-06-01 14:45:22] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 791 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 18/33 constraints. Problems are: Problem set: 0 solved, 791 unsolved
[2024-06-01 14:45:30] [INFO ] Deduced a trap composed of 3 places in 112 ms of which 2 ms to minimize.
[2024-06-01 14:45:30] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/351 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 791 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/351 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 791 unsolved
Problem TDEAD692 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD697 is UNSAT
Problem TDEAD698 is UNSAT
Problem TDEAD699 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD701 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD703 is UNSAT
Problem TDEAD704 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD716 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD720 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD723 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD727 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD780 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD784 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD787 is UNSAT
At refinement iteration 4 (OVERLAPS) 2/353 variables, 9/44 constraints. Problems are: Problem set: 66 solved, 725 unsolved
[2024-06-01 14:45:41] [INFO ] Deduced a trap composed of 45 places in 89 ms of which 2 ms to minimize.
[2024-06-01 14:45:41] [INFO ] Deduced a trap composed of 45 places in 89 ms of which 2 ms to minimize.
[2024-06-01 14:45:41] [INFO ] Deduced a trap composed of 45 places in 60 ms of which 1 ms to minimize.
[2024-06-01 14:45:41] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 0 ms to minimize.
[2024-06-01 14:45:42] [INFO ] Deduced a trap composed of 25 places in 122 ms of which 1 ms to minimize.
[2024-06-01 14:45:42] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2024-06-01 14:45:42] [INFO ] Deduced a trap composed of 46 places in 31 ms of which 1 ms to minimize.
[2024-06-01 14:45:42] [INFO ] Deduced a trap composed of 43 places in 129 ms of which 2 ms to minimize.
[2024-06-01 14:45:43] [INFO ] Deduced a trap composed of 31 places in 191 ms of which 2 ms to minimize.
[2024-06-01 14:45:43] [INFO ] Deduced a trap composed of 40 places in 159 ms of which 2 ms to minimize.
[2024-06-01 14:45:43] [INFO ] Deduced a trap composed of 49 places in 160 ms of which 3 ms to minimize.
[2024-06-01 14:45:43] [INFO ] Deduced a trap composed of 112 places in 218 ms of which 3 ms to minimize.
[2024-06-01 14:45:45] [INFO ] Deduced a trap composed of 122 places in 142 ms of which 2 ms to minimize.
[2024-06-01 14:45:46] [INFO ] Deduced a trap composed of 155 places in 159 ms of which 2 ms to minimize.
[2024-06-01 14:45:46] [INFO ] Deduced a trap composed of 114 places in 164 ms of which 2 ms to minimize.
[2024-06-01 14:45:47] [INFO ] Deduced a trap composed of 117 places in 155 ms of which 2 ms to minimize.
[2024-06-01 14:45:47] [INFO ] Deduced a trap composed of 129 places in 241 ms of which 5 ms to minimize.
[2024-06-01 14:45:47] [INFO ] Deduced a trap composed of 130 places in 164 ms of which 2 ms to minimize.
[2024-06-01 14:45:48] [INFO ] Deduced a trap composed of 137 places in 177 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 19/63 constraints. Problems are: Problem set: 66 solved, 725 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 353/1134 variables, and 63 constraints, problems are : Problem set: 66 solved, 725 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 0/353 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 791/791 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 66 solved, 725 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 15/15 constraints. Problems are: Problem set: 66 solved, 725 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 18/33 constraints. Problems are: Problem set: 66 solved, 725 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/351 variables, 16/49 constraints. Problems are: Problem set: 66 solved, 725 unsolved
[2024-06-01 14:45:55] [INFO ] Deduced a trap composed of 3 places in 120 ms of which 2 ms to minimize.
[2024-06-01 14:45:55] [INFO ] Deduced a trap composed of 3 places in 130 ms of which 2 ms to minimize.
[2024-06-01 14:45:56] [INFO ] Deduced a trap composed of 110 places in 144 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/351 variables, 3/52 constraints. Problems are: Problem set: 66 solved, 725 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/351 variables, 0/52 constraints. Problems are: Problem set: 66 solved, 725 unsolved
At refinement iteration 5 (OVERLAPS) 2/353 variables, 9/61 constraints. Problems are: Problem set: 66 solved, 725 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 5/66 constraints. Problems are: Problem set: 66 solved, 725 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 0/66 constraints. Problems are: Problem set: 66 solved, 725 unsolved
SMT process timed out in 61122ms, After SMT, problems are : Problem set: 66 solved, 725 unsolved
Search for dead transitions found 66 dead transitions in 61134ms
Found 66 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 66 transitions
Dead transitions reduction (with SMT) removed 66 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 353/353 places, 727/793 transitions.
Reduce places removed 1 places and 12 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 352 transition count 715
Reduce places removed 12 places and 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 13 place count 340 transition count 703
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 13 rules in 35 ms. Remains 340 /353 variables (removed 13) and now considering 703/727 (removed 24) transitions.
[2024-06-01 14:46:24] [INFO ] Flow matrix only has 691 transitions (discarded 12 similar events)
// Phase 1: matrix 691 rows 340 cols
[2024-06-01 14:46:24] [INFO ] Computed 43 invariants in 9 ms
[2024-06-01 14:46:24] [INFO ] Implicit Places using invariants in 383 ms returned []
[2024-06-01 14:46:24] [INFO ] Flow matrix only has 691 transitions (discarded 12 similar events)
[2024-06-01 14:46:24] [INFO ] Invariant cache hit.
[2024-06-01 14:46:25] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-01 14:46:27] [INFO ] Implicit Places using invariants and state equation in 2571 ms returned []
Implicit Place search using SMT with State Equation took 2962 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 340/353 places, 703/793 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 68435 ms. Remains : 340/353 places, 703/793 transitions.
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
FORMULA PolyORBLF-PT-S02J06T06-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
All properties solved without resorting to model-checking.
Total runtime 120736 ms.
ITS solved all properties within timeout

BK_STOP 1717253187267

--------------------
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 ReachabilityFireability -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="PolyORBLF-PT-S02J06T06"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is PolyORBLF-PT-S02J06T06, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r516-tajo-171654446700247"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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