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.r468-smll-171620167000119.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 ltsminxred
Input is AutoFlight-PT-04b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r468-smll-171620167000119
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 22:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Apr 12 22:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 12 22:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 12 22:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 91K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717186929186

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-04b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 20:22:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 20:22:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 20:22:11] [INFO ] Load time of PNML (sax parser for PT used): 211 ms
[2024-05-31 20:22:11] [INFO ] Transformed 390 places.
[2024-05-31 20:22:11] [INFO ] Transformed 388 transitions.
[2024-05-31 20:22:11] [INFO ] Found NUPN structural information;
[2024-05-31 20:22:11] [INFO ] Parsed PT model containing 390 places and 388 transitions and 906 arcs in 388 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 190 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (196 resets) in 2308 ms. (17 steps per ms) remains 9/16 properties
FORMULA AutoFlight-PT-04b-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (19 resets) in 273 ms. (146 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (25 resets) in 715 ms. (55 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (18 resets) in 125 ms. (317 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (24 resets) in 150 ms. (264 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (18 resets) in 122 ms. (325 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (15 resets) in 180 ms. (221 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (17 resets) in 584 ms. (68 steps per ms) remains 8/9 properties
FORMULA AutoFlight-PT-04b-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (18 resets) in 129 ms. (307 steps per ms) remains 7/8 properties
FORMULA AutoFlight-PT-04b-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (19 resets) in 588 ms. (67 steps per ms) remains 7/7 properties
// Phase 1: matrix 388 rows 390 cols
[2024-05-31 20:22:13] [INFO ] Computed 28 invariants in 20 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 138/138 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 234/372 variables, 27/165 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/372 variables, 234/399 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/372 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 18/390 variables, 1/400 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/390 variables, 18/418 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/390 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 388/778 variables, 390/808 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/778 variables, 0/808 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 0/778 variables, 0/808 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 778/778 variables, and 808 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1409 ms.
Refiners :[Domain max(s): 390/390 constraints, Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 390/390 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 138/138 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem AutoFlight-PT-04b-ReachabilityFireability-2024-10 is UNSAT
FORMULA AutoFlight-PT-04b-ReachabilityFireability-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 234/372 variables, 27/165 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/372 variables, 234/399 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-05-31 20:22:15] [INFO ] Deduced a trap composed of 21 places in 162 ms of which 30 ms to minimize.
[2024-05-31 20:22:15] [INFO ] Deduced a trap composed of 31 places in 117 ms of which 2 ms to minimize.
[2024-05-31 20:22:15] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 2 ms to minimize.
[2024-05-31 20:22:15] [INFO ] Deduced a trap composed of 37 places in 92 ms of which 3 ms to minimize.
[2024-05-31 20:22:16] [INFO ] Deduced a trap composed of 31 places in 162 ms of which 2 ms to minimize.
[2024-05-31 20:22:16] [INFO ] Deduced a trap composed of 28 places in 110 ms of which 2 ms to minimize.
[2024-05-31 20:22:16] [INFO ] Deduced a trap composed of 39 places in 99 ms of which 2 ms to minimize.
[2024-05-31 20:22:16] [INFO ] Deduced a trap composed of 43 places in 107 ms of which 2 ms to minimize.
[2024-05-31 20:22:16] [INFO ] Deduced a trap composed of 42 places in 103 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/372 variables, 9/408 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-05-31 20:22:16] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 2 ms to minimize.
[2024-05-31 20:22:16] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 6 ms to minimize.
[2024-05-31 20:22:16] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2024-05-31 20:22:17] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 7 ms to minimize.
[2024-05-31 20:22:17] [INFO ] Deduced a trap composed of 50 places in 127 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 5/413 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 0/413 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 18/390 variables, 1/414 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/390 variables, 18/432 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-05-31 20:22:17] [INFO ] Deduced a trap composed of 59 places in 118 ms of which 3 ms to minimize.
[2024-05-31 20:22:17] [INFO ] Deduced a trap composed of 69 places in 145 ms of which 2 ms to minimize.
[2024-05-31 20:22:17] [INFO ] Deduced a trap composed of 61 places in 149 ms of which 3 ms to minimize.
[2024-05-31 20:22:18] [INFO ] Deduced a trap composed of 44 places in 104 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/390 variables, 4/436 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/390 variables, 0/436 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 388/778 variables, 390/826 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/778 variables, 6/832 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-05-31 20:22:18] [INFO ] Deduced a trap composed of 24 places in 103 ms of which 3 ms to minimize.
[2024-05-31 20:22:18] [INFO ] Deduced a trap composed of 47 places in 109 ms of which 2 ms to minimize.
[2024-05-31 20:22:19] [INFO ] Deduced a trap composed of 52 places in 94 ms of which 2 ms to minimize.
[2024-05-31 20:22:19] [INFO ] Deduced a trap composed of 69 places in 123 ms of which 8 ms to minimize.
[2024-05-31 20:22:19] [INFO ] Deduced a trap composed of 33 places in 109 ms of which 2 ms to minimize.
[2024-05-31 20:22:19] [INFO ] Deduced a trap composed of 61 places in 131 ms of which 2 ms to minimize.
[2024-05-31 20:22:19] [INFO ] Deduced a trap composed of 44 places in 246 ms of which 2 ms to minimize.
[2024-05-31 20:22:19] [INFO ] Deduced a trap composed of 56 places in 83 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 778/778 variables, and 840 constraints, problems are : Problem set: 1 solved, 6 unsolved in 5012 ms.
Refiners :[Domain max(s): 390/390 constraints, Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 390/390 constraints, PredecessorRefiner: 6/7 constraints, Known Traps: 26/26 constraints]
After SMT, in 6583ms problems are : Problem set: 1 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 124 out of 390 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 390/390 places, 388/388 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 47 place count 390 transition count 341
Reduce places removed 47 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 53 rules applied. Total rules applied 100 place count 343 transition count 335
Reduce places removed 2 places and 0 transitions.
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Iterating post reduction 2 with 33 rules applied. Total rules applied 133 place count 341 transition count 304
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 33 rules applied. Total rules applied 166 place count 310 transition count 302
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 26 Pre rules applied. Total rules applied 166 place count 310 transition count 276
Deduced a syphon composed of 26 places in 3 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 52 rules applied. Total rules applied 218 place count 284 transition count 276
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 233 place count 269 transition count 261
Iterating global reduction 4 with 15 rules applied. Total rules applied 248 place count 269 transition count 261
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 248 place count 269 transition count 260
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 250 place count 268 transition count 260
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 8 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 4 with 54 rules applied. Total rules applied 304 place count 241 transition count 233
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 313 place count 241 transition count 224
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 315 place count 240 transition count 223
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 316 place count 240 transition count 222
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 317 place count 239 transition count 222
Applied a total of 317 rules in 165 ms. Remains 239 /390 variables (removed 151) and now considering 222/388 (removed 166) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 181 ms. Remains : 239/390 places, 222/388 transitions.
RANDOM walk for 40000 steps (316 resets) in 485 ms. (82 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (33 resets) in 73 ms. (540 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (43 resets) in 257 ms. (155 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (32 resets) in 54 ms. (727 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (29 resets) in 145 ms. (273 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (33 resets) in 54 ms. (727 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (32 resets) in 166 ms. (239 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 662376 steps, run timeout after 3001 ms. (steps per millisecond=220 ) properties seen :0 out of 6
Probabilistic random walk after 662376 steps, saw 97748 distinct states, run finished after 3013 ms. (steps per millisecond=219 ) properties seen :0
// Phase 1: matrix 222 rows 239 cols
[2024-05-31 20:22:23] [INFO ] Computed 28 invariants in 4 ms
[2024-05-31 20:22:23] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 103/227 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 12/239 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 222/461 variables, 239/267 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/461 variables, 4/271 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/461 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/461 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 461/461 variables, and 271 constraints, problems are : Problem set: 0 solved, 6 unsolved in 872 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 239/239 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 103/227 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-31 20:22:24] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 2 ms to minimize.
[2024-05-31 20:22:24] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-05-31 20:22:24] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2024-05-31 20:22:24] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 2 ms to minimize.
[2024-05-31 20:22:25] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-31 20:22:25] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 1 ms to minimize.
[2024-05-31 20:22:25] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 2 ms to minimize.
[2024-05-31 20:22:25] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 2 ms to minimize.
[2024-05-31 20:22:25] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 9/36 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-31 20:22:25] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 2 ms to minimize.
[2024-05-31 20:22:25] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 2 ms to minimize.
[2024-05-31 20:22:25] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/227 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-31 20:22:25] [INFO ] Deduced a trap composed of 42 places in 51 ms of which 1 ms to minimize.
[2024-05-31 20:22:25] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 3 ms to minimize.
[2024-05-31 20:22:25] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 2 ms to minimize.
[2024-05-31 20:22:25] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 4/43 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-31 20:22:25] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-05-31 20:22:26] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 12/239 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-31 20:22:26] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-05-31 20:22:26] [INFO ] Deduced a trap composed of 49 places in 81 ms of which 2 ms to minimize.
[2024-05-31 20:22:26] [INFO ] Deduced a trap composed of 36 places in 77 ms of which 2 ms to minimize.
[2024-05-31 20:22:26] [INFO ] Deduced a trap composed of 45 places in 81 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/239 variables, 4/50 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/239 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 222/461 variables, 239/289 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/461 variables, 4/293 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/461 variables, 6/299 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-31 20:22:27] [INFO ] Deduced a trap composed of 53 places in 57 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/461 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-31 20:22:27] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 2 ms to minimize.
[2024-05-31 20:22:27] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/461 variables, 2/302 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-31 20:22:27] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 2 ms to minimize.
[2024-05-31 20:22:27] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 2 ms to minimize.
[2024-05-31 20:22:27] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/461 variables, 3/305 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/461 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 0/461 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 461/461 variables, and 305 constraints, problems are : Problem set: 0 solved, 6 unsolved in 4130 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 239/239 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 28/28 constraints]
After SMT, in 5061ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 0 properties in 2642 ms.
Support contains 124 out of 239 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 239/239 places, 222/222 transitions.
Applied a total of 0 rules in 13 ms. Remains 239 /239 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 239/239 places, 222/222 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 239/239 places, 222/222 transitions.
Applied a total of 0 rules in 8 ms. Remains 239 /239 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2024-05-31 20:22:31] [INFO ] Invariant cache hit.
[2024-05-31 20:22:31] [INFO ] Implicit Places using invariants in 204 ms returned []
[2024-05-31 20:22:31] [INFO ] Invariant cache hit.
[2024-05-31 20:22:31] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-31 20:22:31] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 472 ms to find 0 implicit places.
[2024-05-31 20:22:31] [INFO ] Redundant transitions in 10 ms returned []
Running 221 sub problems to find dead transitions.
[2024-05-31 20:22:31] [INFO ] Invariant cache hit.
[2024-05-31 20:22:31] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/239 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-31 20:22:34] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 2 ms to minimize.
[2024-05-31 20:22:34] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 2 ms to minimize.
[2024-05-31 20:22:34] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 12 ms to minimize.
[2024-05-31 20:22:34] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 1 ms to minimize.
[2024-05-31 20:22:34] [INFO ] Deduced a trap composed of 52 places in 90 ms of which 2 ms to minimize.
[2024-05-31 20:22:34] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 2 ms to minimize.
[2024-05-31 20:22:34] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 2 ms to minimize.
[2024-05-31 20:22:35] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 1 ms to minimize.
[2024-05-31 20:22:35] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-31 20:22:35] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 2 ms to minimize.
[2024-05-31 20:22:35] [INFO ] Deduced a trap composed of 46 places in 68 ms of which 2 ms to minimize.
[2024-05-31 20:22:35] [INFO ] Deduced a trap composed of 52 places in 77 ms of which 2 ms to minimize.
[2024-05-31 20:22:35] [INFO ] Deduced a trap composed of 53 places in 57 ms of which 1 ms to minimize.
[2024-05-31 20:22:35] [INFO ] Deduced a trap composed of 22 places in 104 ms of which 3 ms to minimize.
[2024-05-31 20:22:35] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 2 ms to minimize.
[2024-05-31 20:22:35] [INFO ] Deduced a trap composed of 25 places in 123 ms of which 3 ms to minimize.
[2024-05-31 20:22:36] [INFO ] Deduced a trap composed of 13 places in 112 ms of which 3 ms to minimize.
[2024-05-31 20:22:36] [INFO ] Deduced a trap composed of 19 places in 119 ms of which 2 ms to minimize.
[2024-05-31 20:22:36] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 2 ms to minimize.
[2024-05-31 20:22:36] [INFO ] Deduced a trap composed of 14 places in 107 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-31 20:22:38] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 2 ms to minimize.
[2024-05-31 20:22:38] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 2 ms to minimize.
[2024-05-31 20:22:38] [INFO ] Deduced a trap composed of 17 places in 104 ms of which 3 ms to minimize.
[2024-05-31 20:22:38] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2024-05-31 20:22:38] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 2 ms to minimize.
[2024-05-31 20:22:38] [INFO ] Deduced a trap composed of 45 places in 59 ms of which 2 ms to minimize.
[2024-05-31 20:22:38] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-31 20:22:38] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 2 ms to minimize.
[2024-05-31 20:22:38] [INFO ] Deduced a trap composed of 45 places in 49 ms of which 1 ms to minimize.
[2024-05-31 20:22:39] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 2 ms to minimize.
[2024-05-31 20:22:39] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 2 ms to minimize.
[2024-05-31 20:22:39] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 2 ms to minimize.
[2024-05-31 20:22:39] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-31 20:22:39] [INFO ] Deduced a trap composed of 46 places in 66 ms of which 2 ms to minimize.
[2024-05-31 20:22:39] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 1 ms to minimize.
[2024-05-31 20:22:39] [INFO ] Deduced a trap composed of 63 places in 67 ms of which 2 ms to minimize.
[2024-05-31 20:22:39] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 2 ms to minimize.
[2024-05-31 20:22:39] [INFO ] Deduced a trap composed of 47 places in 67 ms of which 2 ms to minimize.
[2024-05-31 20:22:39] [INFO ] Deduced a trap composed of 55 places in 60 ms of which 2 ms to minimize.
[2024-05-31 20:22:40] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-31 20:22:40] [INFO ] Deduced a trap composed of 51 places in 62 ms of which 1 ms to minimize.
[2024-05-31 20:22:40] [INFO ] Deduced a trap composed of 52 places in 79 ms of which 2 ms to minimize.
[2024-05-31 20:22:40] [INFO ] Deduced a trap composed of 49 places in 73 ms of which 2 ms to minimize.
[2024-05-31 20:22:40] [INFO ] Deduced a trap composed of 51 places in 71 ms of which 2 ms to minimize.
[2024-05-31 20:22:41] [INFO ] Deduced a trap composed of 47 places in 79 ms of which 2 ms to minimize.
[2024-05-31 20:22:41] [INFO ] Deduced a trap composed of 66 places in 76 ms of which 2 ms to minimize.
[2024-05-31 20:22:41] [INFO ] Deduced a trap composed of 59 places in 64 ms of which 2 ms to minimize.
[2024-05-31 20:22:41] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 2 ms to minimize.
[2024-05-31 20:22:41] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 1 ms to minimize.
[2024-05-31 20:22:41] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 2 ms to minimize.
[2024-05-31 20:22:41] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 2 ms to minimize.
[2024-05-31 20:22:41] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 2 ms to minimize.
[2024-05-31 20:22:42] [INFO ] Deduced a trap composed of 45 places in 71 ms of which 1 ms to minimize.
[2024-05-31 20:22:42] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 2 ms to minimize.
[2024-05-31 20:22:42] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2024-05-31 20:22:42] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 2 ms to minimize.
[2024-05-31 20:22:42] [INFO ] Deduced a trap composed of 38 places in 69 ms of which 1 ms to minimize.
[2024-05-31 20:22:42] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 2 ms to minimize.
[2024-05-31 20:22:42] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
[2024-05-31 20:22:42] [INFO ] Deduced a trap composed of 61 places in 67 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 20/88 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-31 20:22:43] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-31 20:22:43] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-05-31 20:22:43] [INFO ] Deduced a trap composed of 58 places in 62 ms of which 2 ms to minimize.
[2024-05-31 20:22:44] [INFO ] Deduced a trap composed of 57 places in 65 ms of which 2 ms to minimize.
[2024-05-31 20:22:44] [INFO ] Deduced a trap composed of 53 places in 63 ms of which 2 ms to minimize.
[2024-05-31 20:22:44] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 2 ms to minimize.
[2024-05-31 20:22:44] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 2 ms to minimize.
[2024-05-31 20:22:44] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 1 ms to minimize.
[2024-05-31 20:22:44] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 2 ms to minimize.
[2024-05-31 20:22:44] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
[2024-05-31 20:22:44] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 2 ms to minimize.
[2024-05-31 20:22:44] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 2 ms to minimize.
[2024-05-31 20:22:44] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
[2024-05-31 20:22:44] [INFO ] Deduced a trap composed of 57 places in 64 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 14/102 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-31 20:22:46] [INFO ] Deduced a trap composed of 37 places in 75 ms of which 2 ms to minimize.
[2024-05-31 20:22:47] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-31 20:22:48] [INFO ] Deduced a trap composed of 56 places in 66 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/239 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/239 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 10 (OVERLAPS) 222/461 variables, 239/344 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/461 variables, 4/348 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/461 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 13 (OVERLAPS) 0/461 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 461/461 variables, and 348 constraints, problems are : Problem set: 0 solved, 221 unsolved in 26367 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 239/239 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 77/77 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/239 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 77/105 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-31 20:23:00] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (OVERLAPS) 222/461 variables, 239/345 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/461 variables, 4/349 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/461 variables, 221/570 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-31 20:23:05] [INFO ] Deduced a trap composed of 36 places in 73 ms of which 3 ms to minimize.
[2024-05-31 20:23:05] [INFO ] Deduced a trap composed of 41 places in 76 ms of which 2 ms to minimize.
[2024-05-31 20:23:06] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 2 ms to minimize.
[2024-05-31 20:23:07] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 2 ms to minimize.
[2024-05-31 20:23:08] [INFO ] Deduced a trap composed of 50 places in 47 ms of which 2 ms to minimize.
[2024-05-31 20:23:08] [INFO ] Deduced a trap composed of 37 places in 58 ms of which 1 ms to minimize.
[2024-05-31 20:23:08] [INFO ] Deduced a trap composed of 53 places in 83 ms of which 2 ms to minimize.
[2024-05-31 20:23:09] [INFO ] Deduced a trap composed of 41 places in 87 ms of which 2 ms to minimize.
[2024-05-31 20:23:09] [INFO ] Deduced a trap composed of 40 places in 77 ms of which 2 ms to minimize.
[2024-05-31 20:23:09] [INFO ] Deduced a trap composed of 41 places in 87 ms of which 2 ms to minimize.
[2024-05-31 20:23:09] [INFO ] Deduced a trap composed of 40 places in 87 ms of which 3 ms to minimize.
[2024-05-31 20:23:09] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 2 ms to minimize.
[2024-05-31 20:23:09] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/461 variables, 13/583 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-31 20:23:13] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 2 ms to minimize.
[2024-05-31 20:23:16] [INFO ] Deduced a trap composed of 42 places in 49 ms of which 1 ms to minimize.
[2024-05-31 20:23:16] [INFO ] Deduced a trap composed of 52 places in 48 ms of which 2 ms to minimize.
[2024-05-31 20:23:17] [INFO ] Deduced a trap composed of 42 places in 46 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/461 variables, 4/587 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-31 20:23:21] [INFO ] Deduced a trap composed of 51 places in 64 ms of which 2 ms to minimize.
[2024-05-31 20:23:21] [INFO ] Deduced a trap composed of 53 places in 68 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 461/461 variables, and 589 constraints, problems are : Problem set: 0 solved, 221 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 239/239 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 97/97 constraints]
After SMT, in 56441ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 56446ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56952 ms. Remains : 239/239 places, 222/222 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 382 edges and 239 vertex of which 236 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 1 place count 236 transition count 219
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 233 transition count 219
Applied a total of 7 rules in 32 ms. Remains 233 /239 variables (removed 6) and now considering 219/222 (removed 3) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 219 rows 233 cols
[2024-05-31 20:23:28] [INFO ] Computed 25 invariants in 4 ms
[2024-05-31 20:23:28] [INFO ] [Real]Absence check using 24 positive place invariants in 15 ms returned sat
[2024-05-31 20:23:28] [INFO ] [Real]Absence check using 24 positive and 1 generalized place invariants in 4 ms returned sat
[2024-05-31 20:23:28] [INFO ] After 189ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-31 20:23:28] [INFO ] [Nat]Absence check using 24 positive place invariants in 15 ms returned sat
[2024-05-31 20:23:28] [INFO ] [Nat]Absence check using 24 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 20:23:29] [INFO ] After 440ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2024-05-31 20:23:29] [INFO ] Deduced a trap composed of 58 places in 98 ms of which 3 ms to minimize.
[2024-05-31 20:23:29] [INFO ] Deduced a trap composed of 49 places in 167 ms of which 3 ms to minimize.
[2024-05-31 20:23:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 315 ms
[2024-05-31 20:23:29] [INFO ] Deduced a trap composed of 21 places in 113 ms of which 3 ms to minimize.
[2024-05-31 20:23:29] [INFO ] Deduced a trap composed of 40 places in 98 ms of which 3 ms to minimize.
[2024-05-31 20:23:30] [INFO ] Deduced a trap composed of 30 places in 116 ms of which 3 ms to minimize.
[2024-05-31 20:23:30] [INFO ] Deduced a trap composed of 42 places in 92 ms of which 3 ms to minimize.
[2024-05-31 20:23:30] [INFO ] Deduced a trap composed of 41 places in 115 ms of which 3 ms to minimize.
[2024-05-31 20:23:30] [INFO ] Deduced a trap composed of 50 places in 92 ms of which 2 ms to minimize.
[2024-05-31 20:23:30] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 761 ms
[2024-05-31 20:23:30] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 2 ms to minimize.
[2024-05-31 20:23:30] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 2 ms to minimize.
[2024-05-31 20:23:30] [INFO ] Deduced a trap composed of 73 places in 70 ms of which 1 ms to minimize.
[2024-05-31 20:23:30] [INFO ] Deduced a trap composed of 44 places in 112 ms of which 2 ms to minimize.
[2024-05-31 20:23:31] [INFO ] Deduced a trap composed of 46 places in 111 ms of which 3 ms to minimize.
[2024-05-31 20:23:31] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 514 ms
[2024-05-31 20:23:31] [INFO ] Deduced a trap composed of 32 places in 114 ms of which 3 ms to minimize.
[2024-05-31 20:23:31] [INFO ] Deduced a trap composed of 36 places in 92 ms of which 3 ms to minimize.
[2024-05-31 20:23:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 265 ms
TRAPS : Iteration 1
[2024-05-31 20:23:31] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-31 20:23:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
[2024-05-31 20:23:31] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-31 20:23:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
TRAPS : Iteration 2
[2024-05-31 20:23:32] [INFO ] Deduced a trap composed of 51 places in 114 ms of which 3 ms to minimize.
[2024-05-31 20:23:32] [INFO ] Deduced a trap composed of 37 places in 144 ms of which 3 ms to minimize.
[2024-05-31 20:23:32] [INFO ] Deduced a trap composed of 47 places in 100 ms of which 2 ms to minimize.
[2024-05-31 20:23:32] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 3 ms to minimize.
[2024-05-31 20:23:32] [INFO ] Deduced a trap composed of 38 places in 105 ms of which 3 ms to minimize.
[2024-05-31 20:23:32] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 2 ms to minimize.
[2024-05-31 20:23:32] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 3 ms to minimize.
[2024-05-31 20:23:32] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 948 ms
[2024-05-31 20:23:33] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-05-31 20:23:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2024-05-31 20:23:33] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 2 ms to minimize.
[2024-05-31 20:23:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
TRAPS : Iteration 3
[2024-05-31 20:23:33] [INFO ] Deduced a trap composed of 38 places in 88 ms of which 2 ms to minimize.
[2024-05-31 20:23:33] [INFO ] Deduced a trap composed of 58 places in 107 ms of which 3 ms to minimize.
[2024-05-31 20:23:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 265 ms
TRAPS : Iteration 4
[2024-05-31 20:23:34] [INFO ] Deduced a trap composed of 52 places in 73 ms of which 3 ms to minimize.
[2024-05-31 20:23:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2024-05-31 20:23:34] [INFO ] Deduced a trap composed of 48 places in 78 ms of which 3 ms to minimize.
[2024-05-31 20:23:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 114 ms
TRAPS : Iteration 5
[2024-05-31 20:23:34] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 2 ms to minimize.
[2024-05-31 20:23:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2024-05-31 20:23:35] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 3 ms to minimize.
[2024-05-31 20:23:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 153 ms
[2024-05-31 20:23:35] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 2 ms to minimize.
[2024-05-31 20:23:35] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 3 ms to minimize.
[2024-05-31 20:23:35] [INFO ] Deduced a trap composed of 42 places in 88 ms of which 2 ms to minimize.
[2024-05-31 20:23:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 347 ms
TRAPS : Iteration 6
[2024-05-31 20:23:35] [INFO ] Deduced a trap composed of 38 places in 111 ms of which 3 ms to minimize.
[2024-05-31 20:23:36] [INFO ] Deduced a trap composed of 49 places in 98 ms of which 3 ms to minimize.
[2024-05-31 20:23:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 260 ms
TRAPS : Iteration 7
[2024-05-31 20:23:36] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-31 20:23:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
TRAPS : Iteration 8
[2024-05-31 20:23:36] [INFO ] Deduced a trap composed of 38 places in 108 ms of which 3 ms to minimize.
[2024-05-31 20:23:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 148 ms
TRAPS : Iteration 9
[2024-05-31 20:23:37] [INFO ] Deduced a trap composed of 40 places in 80 ms of which 3 ms to minimize.
[2024-05-31 20:23:37] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 2 ms to minimize.
[2024-05-31 20:23:37] [INFO ] Deduced a trap composed of 45 places in 73 ms of which 2 ms to minimize.
[2024-05-31 20:23:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 307 ms
[2024-05-31 20:23:37] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 2 ms to minimize.
[2024-05-31 20:23:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
TRAPS : Iteration 10
[2024-05-31 20:23:38] [INFO ] Deduced a trap composed of 49 places in 58 ms of which 2 ms to minimize.
[2024-05-31 20:23:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
TRAPS : Iteration 11
[2024-05-31 20:23:38] [INFO ] After 9693ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2024-05-31 20:23:38] [INFO ] After 10199ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Over-approximation ignoring read arcs solved 0 properties in 10470 ms.
[2024-05-31 20:23:38] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 11 ms.
[2024-05-31 20:23:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 239 places, 222 transitions and 574 arcs took 10 ms.
[2024-05-31 20:23:39] [INFO ] Flatten gal took : 98 ms
Total runtime 88262 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : AutoFlight-PT-04b-ReachabilityFireability-2024-00
Could not compute solution for formula : AutoFlight-PT-04b-ReachabilityFireability-2024-04
Could not compute solution for formula : AutoFlight-PT-04b-ReachabilityFireability-2024-08
Could not compute solution for formula : AutoFlight-PT-04b-ReachabilityFireability-2024-12
Could not compute solution for formula : AutoFlight-PT-04b-ReachabilityFireability-2024-14
Could not compute solution for formula : AutoFlight-PT-04b-ReachabilityFireability-2024-15

BK_STOP 1717187019793

--------------------
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
mcc2024
rfs formula name AutoFlight-PT-04b-ReachabilityFireability-2024-00
rfs formula type EF
rfs formula formula --invariant=/tmp/1136/inv_0_
rfs formula name AutoFlight-PT-04b-ReachabilityFireability-2024-04
rfs formula type AG
rfs formula formula --invariant=/tmp/1136/inv_1_
rfs formula name AutoFlight-PT-04b-ReachabilityFireability-2024-08
rfs formula type EF
rfs formula formula --invariant=/tmp/1136/inv_2_
rfs formula name AutoFlight-PT-04b-ReachabilityFireability-2024-12
rfs formula type AG
rfs formula formula --invariant=/tmp/1136/inv_3_
rfs formula name AutoFlight-PT-04b-ReachabilityFireability-2024-14
rfs formula type AG
rfs formula formula --invariant=/tmp/1136/inv_4_
rfs formula name AutoFlight-PT-04b-ReachabilityFireability-2024-15
rfs formula type EF
rfs formula formula --invariant=/tmp/1136/inv_5_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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="AutoFlight-PT-04b"
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 AutoFlight-PT-04b, 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 r468-smll-171620167000119"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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