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.r025-smll-171620166100199.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is AutoFlight-PT-48b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r025-smll-171620166100199
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 8.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K 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.6K Apr 22 14:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 17:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Apr 12 22:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 92K Apr 12 22:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Apr 12 22:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Apr 12 22:20 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 956K 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-48b-ReachabilityFireability-2024-00
FORMULA_NAME AutoFlight-PT-48b-ReachabilityFireability-2024-01
FORMULA_NAME AutoFlight-PT-48b-ReachabilityFireability-2024-02
FORMULA_NAME AutoFlight-PT-48b-ReachabilityFireability-2024-03
FORMULA_NAME AutoFlight-PT-48b-ReachabilityFireability-2024-04
FORMULA_NAME AutoFlight-PT-48b-ReachabilityFireability-2024-05
FORMULA_NAME AutoFlight-PT-48b-ReachabilityFireability-2024-06
FORMULA_NAME AutoFlight-PT-48b-ReachabilityFireability-2024-07
FORMULA_NAME AutoFlight-PT-48b-ReachabilityFireability-2024-08
FORMULA_NAME AutoFlight-PT-48b-ReachabilityFireability-2024-09
FORMULA_NAME AutoFlight-PT-48b-ReachabilityFireability-2024-10
FORMULA_NAME AutoFlight-PT-48b-ReachabilityFireability-2024-11
FORMULA_NAME AutoFlight-PT-48b-ReachabilityFireability-2024-12
FORMULA_NAME AutoFlight-PT-48b-ReachabilityFireability-2024-13
FORMULA_NAME AutoFlight-PT-48b-ReachabilityFireability-2024-14
FORMULA_NAME AutoFlight-PT-48b-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716326396280

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-48b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 21:19:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 21:19:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 21:19:58] [INFO ] Load time of PNML (sax parser for PT used): 536 ms
[2024-05-21 21:19:59] [INFO ] Transformed 3950 places.
[2024-05-21 21:19:59] [INFO ] Transformed 3936 transitions.
[2024-05-21 21:19:59] [INFO ] Found NUPN structural information;
[2024-05-21 21:19:59] [INFO ] Parsed PT model containing 3950 places and 3936 transitions and 9104 arcs in 1038 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 32 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (20 resets) in 2741 ms. (14 steps per ms) remains 8/16 properties
FORMULA AutoFlight-PT-48b-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-48b-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-48b-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-48b-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-48b-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-48b-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-48b-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-48b-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 314 ms. (126 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 117 ms. (339 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 334 ms. (119 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 905 ms. (44 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 135 ms. (294 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 267 ms. (149 steps per ms) remains 8/8 properties
// Phase 1: matrix 3936 rows 3950 cols
[2024-05-21 21:20:01] [INFO ] Computed 258 invariants in 119 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 3455/3612 variables, 228/385 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3612 variables, 3455/3840 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3612 variables, 0/3840 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 218/3830 variables, 29/3869 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3830 variables, 218/4087 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3830 variables, 0/4087 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 120/3950 variables, 1/4088 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3950 variables, 120/4208 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3950/7886 variables, and 4208 constraints, problems are : Problem set: 0 solved, 8 unsolved in 5093 ms.
Refiners :[Domain max(s): 3950/3950 constraints, Positive P Invariants (semi-flows): 257/257 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/3950 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 3455/3612 variables, 228/385 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3612 variables, 3455/3840 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-21 21:20:10] [INFO ] Deduced a trap composed of 58 places in 2340 ms of which 217 ms to minimize.
[2024-05-21 21:20:13] [INFO ] Deduced a trap composed of 52 places in 2209 ms of which 24 ms to minimize.
SMT process timed out in 11841ms, After SMT, problems are : Problem set: 0 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 157 out of 3950 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3950/3950 places, 3936/3936 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1518 transitions
Trivial Post-agglo rules discarded 1518 transitions
Performed 1518 trivial Post agglomeration. Transition count delta: 1518
Iterating post reduction 0 with 1518 rules applied. Total rules applied 1518 place count 3950 transition count 2418
Reduce places removed 1518 places and 0 transitions.
Ensure Unique test removed 169 transitions
Reduce isomorphic transitions removed 169 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 1 with 1767 rules applied. Total rules applied 3285 place count 2432 transition count 2169
Reduce places removed 80 places and 0 transitions.
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Iterating post reduction 2 with 149 rules applied. Total rules applied 3434 place count 2352 transition count 2100
Reduce places removed 69 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 79 rules applied. Total rules applied 3513 place count 2283 transition count 2090
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3514 place count 2282 transition count 2090
Performed 463 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 463 Pre rules applied. Total rules applied 3514 place count 2282 transition count 1627
Deduced a syphon composed of 463 places in 15 ms
Reduce places removed 463 places and 0 transitions.
Iterating global reduction 5 with 926 rules applied. Total rules applied 4440 place count 1819 transition count 1627
Discarding 300 places :
Symmetric choice reduction at 5 with 300 rule applications. Total rules 4740 place count 1519 transition count 1327
Iterating global reduction 5 with 300 rules applied. Total rules applied 5040 place count 1519 transition count 1327
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 5042 place count 1519 transition count 1325
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 96 Pre rules applied. Total rules applied 5042 place count 1519 transition count 1229
Deduced a syphon composed of 96 places in 27 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 6 with 192 rules applied. Total rules applied 5234 place count 1423 transition count 1229
Performed 316 Post agglomeration using F-continuation condition.Transition count delta: 316
Deduced a syphon composed of 316 places in 3 ms
Reduce places removed 316 places and 0 transitions.
Iterating global reduction 6 with 632 rules applied. Total rules applied 5866 place count 1107 transition count 913
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 5870 place count 1105 transition count 914
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 6 with 10 rules applied. Total rules applied 5880 place count 1105 transition count 904
Free-agglomeration rule applied 126 times.
Iterating global reduction 6 with 126 rules applied. Total rules applied 6006 place count 1105 transition count 778
Reduce places removed 126 places and 0 transitions.
Iterating post reduction 6 with 126 rules applied. Total rules applied 6132 place count 979 transition count 778
Applied a total of 6132 rules in 1645 ms. Remains 979 /3950 variables (removed 2971) and now considering 778/3936 (removed 3158) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1660 ms. Remains : 979/3950 places, 778/3936 transitions.
RANDOM walk for 40000 steps (202 resets) in 1204 ms. (33 steps per ms) remains 4/8 properties
FORMULA AutoFlight-PT-48b-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-48b-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-48b-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-48b-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (19 resets) in 298 ms. (133 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (17 resets) in 349 ms. (114 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (16 resets) in 522 ms. (76 steps per ms) remains 3/4 properties
FORMULA AutoFlight-PT-48b-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (23 resets) in 190 ms. (209 steps per ms) remains 3/3 properties
// Phase 1: matrix 778 rows 979 cols
[2024-05-21 21:20:15] [INFO ] Computed 258 invariants in 13 ms
[2024-05-21 21:20:15] [INFO ] State equation strengthened by 297 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 372/390 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/390 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 510/900 variables, 134/256 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/900 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 79/979 variables, 2/258 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/979 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 778/1757 variables, 979/1237 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1757 variables, 297/1534 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1757 variables, 0/1534 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/1757 variables, 0/1534 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1757/1757 variables, and 1534 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1555 ms.
Refiners :[Positive P Invariants (semi-flows): 256/256 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 979/979 constraints, ReadFeed: 297/297 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 372/390 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 21:20:17] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 2 ms to minimize.
[2024-05-21 21:20:17] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 3 ms to minimize.
[2024-05-21 21:20:17] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 2 ms to minimize.
[2024-05-21 21:20:17] [INFO ] Deduced a trap composed of 35 places in 87 ms of which 2 ms to minimize.
[2024-05-21 21:20:17] [INFO ] Deduced a trap composed of 45 places in 143 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/390 variables, 5/127 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/390 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 510/900 variables, 134/261 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 21:20:18] [INFO ] Deduced a trap composed of 10 places in 129 ms of which 3 ms to minimize.
[2024-05-21 21:20:18] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 3 ms to minimize.
[2024-05-21 21:20:18] [INFO ] Deduced a trap composed of 14 places in 115 ms of which 3 ms to minimize.
[2024-05-21 21:20:18] [INFO ] Deduced a trap composed of 6 places in 117 ms of which 3 ms to minimize.
[2024-05-21 21:20:18] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 3 ms to minimize.
[2024-05-21 21:20:18] [INFO ] Deduced a trap composed of 8 places in 104 ms of which 2 ms to minimize.
[2024-05-21 21:20:18] [INFO ] Deduced a trap composed of 12 places in 127 ms of which 3 ms to minimize.
[2024-05-21 21:20:19] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 2 ms to minimize.
[2024-05-21 21:20:19] [INFO ] Deduced a trap composed of 12 places in 132 ms of which 3 ms to minimize.
[2024-05-21 21:20:19] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 2 ms to minimize.
[2024-05-21 21:20:19] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 2 ms to minimize.
[2024-05-21 21:20:19] [INFO ] Deduced a trap composed of 27 places in 101 ms of which 2 ms to minimize.
[2024-05-21 21:20:19] [INFO ] Deduced a trap composed of 29 places in 111 ms of which 3 ms to minimize.
[2024-05-21 21:20:19] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 3 ms to minimize.
[2024-05-21 21:20:20] [INFO ] Deduced a trap composed of 37 places in 106 ms of which 3 ms to minimize.
[2024-05-21 21:20:20] [INFO ] Deduced a trap composed of 38 places in 104 ms of which 2 ms to minimize.
[2024-05-21 21:20:20] [INFO ] Deduced a trap composed of 34 places in 104 ms of which 3 ms to minimize.
[2024-05-21 21:20:20] [INFO ] Deduced a trap composed of 10 places in 180 ms of which 4 ms to minimize.
[2024-05-21 21:20:20] [INFO ] Deduced a trap composed of 11 places in 194 ms of which 4 ms to minimize.
[2024-05-21 21:20:20] [INFO ] Deduced a trap composed of 9 places in 180 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/900 variables, 20/281 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 21:20:21] [INFO ] Deduced a trap composed of 33 places in 84 ms of which 2 ms to minimize.
[2024-05-21 21:20:21] [INFO ] Deduced a trap composed of 34 places in 81 ms of which 2 ms to minimize.
[2024-05-21 21:20:21] [INFO ] Deduced a trap composed of 8 places in 227 ms of which 5 ms to minimize.
[2024-05-21 21:20:21] [INFO ] Deduced a trap composed of 14 places in 169 ms of which 3 ms to minimize.
[2024-05-21 21:20:21] [INFO ] Deduced a trap composed of 11 places in 227 ms of which 4 ms to minimize.
[2024-05-21 21:20:22] [INFO ] Deduced a trap composed of 15 places in 223 ms of which 4 ms to minimize.
[2024-05-21 21:20:22] [INFO ] Deduced a trap composed of 11 places in 163 ms of which 4 ms to minimize.
[2024-05-21 21:20:22] [INFO ] Deduced a trap composed of 11 places in 211 ms of which 4 ms to minimize.
[2024-05-21 21:20:22] [INFO ] Deduced a trap composed of 13 places in 207 ms of which 4 ms to minimize.
[2024-05-21 21:20:22] [INFO ] Deduced a trap composed of 13 places in 200 ms of which 4 ms to minimize.
[2024-05-21 21:20:23] [INFO ] Deduced a trap composed of 10 places in 204 ms of which 4 ms to minimize.
[2024-05-21 21:20:23] [INFO ] Deduced a trap composed of 14 places in 199 ms of which 3 ms to minimize.
[2024-05-21 21:20:23] [INFO ] Deduced a trap composed of 27 places in 150 ms of which 4 ms to minimize.
[2024-05-21 21:20:23] [INFO ] Deduced a trap composed of 7 places in 299 ms of which 5 ms to minimize.
[2024-05-21 21:20:24] [INFO ] Deduced a trap composed of 5 places in 304 ms of which 7 ms to minimize.
[2024-05-21 21:20:24] [INFO ] Deduced a trap composed of 4 places in 303 ms of which 6 ms to minimize.
[2024-05-21 21:20:24] [INFO ] Deduced a trap composed of 22 places in 312 ms of which 7 ms to minimize.
[2024-05-21 21:20:25] [INFO ] Deduced a trap composed of 21 places in 417 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/900 variables, 18/299 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 21:20:25] [INFO ] Deduced a trap composed of 13 places in 292 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/900 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/900 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 79/979 variables, 2/302 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 21:20:26] [INFO ] Deduced a trap composed of 13 places in 400 ms of which 7 ms to minimize.
[2024-05-21 21:20:26] [INFO ] Deduced a trap composed of 8 places in 405 ms of which 6 ms to minimize.
[2024-05-21 21:20:27] [INFO ] Deduced a trap composed of 10 places in 407 ms of which 6 ms to minimize.
[2024-05-21 21:20:27] [INFO ] Deduced a trap composed of 26 places in 424 ms of which 9 ms to minimize.
[2024-05-21 21:20:28] [INFO ] Deduced a trap composed of 36 places in 458 ms of which 7 ms to minimize.
[2024-05-21 21:20:28] [INFO ] Deduced a trap composed of 266 places in 446 ms of which 9 ms to minimize.
[2024-05-21 21:20:29] [INFO ] Deduced a trap composed of 34 places in 466 ms of which 6 ms to minimize.
[2024-05-21 21:20:29] [INFO ] Deduced a trap composed of 39 places in 444 ms of which 9 ms to minimize.
[2024-05-21 21:20:29] [INFO ] Deduced a trap composed of 36 places in 472 ms of which 7 ms to minimize.
[2024-05-21 21:20:30] [INFO ] Deduced a trap composed of 284 places in 443 ms of which 12 ms to minimize.
[2024-05-21 21:20:30] [INFO ] Deduced a trap composed of 35 places in 463 ms of which 6 ms to minimize.
[2024-05-21 21:20:31] [INFO ] Deduced a trap composed of 284 places in 431 ms of which 12 ms to minimize.
[2024-05-21 21:20:31] [INFO ] Deduced a trap composed of 37 places in 402 ms of which 6 ms to minimize.
[2024-05-21 21:20:32] [INFO ] Deduced a trap composed of 265 places in 390 ms of which 6 ms to minimize.
[2024-05-21 21:20:32] [INFO ] Deduced a trap composed of 81 places in 379 ms of which 6 ms to minimize.
[2024-05-21 21:20:33] [INFO ] Deduced a trap composed of 264 places in 382 ms of which 6 ms to minimize.
[2024-05-21 21:20:33] [INFO ] Deduced a trap composed of 260 places in 447 ms of which 9 ms to minimize.
[2024-05-21 21:20:34] [INFO ] Deduced a trap composed of 271 places in 470 ms of which 6 ms to minimize.
[2024-05-21 21:20:34] [INFO ] Deduced a trap composed of 266 places in 412 ms of which 9 ms to minimize.
[2024-05-21 21:20:34] [INFO ] Deduced a trap composed of 76 places in 484 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/979 variables, 20/322 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 21:20:35] [INFO ] Deduced a trap composed of 268 places in 410 ms of which 9 ms to minimize.
[2024-05-21 21:20:35] [INFO ] Deduced a trap composed of 273 places in 489 ms of which 6 ms to minimize.
[2024-05-21 21:20:36] [INFO ] Deduced a trap composed of 250 places in 418 ms of which 10 ms to minimize.
[2024-05-21 21:20:36] [INFO ] Deduced a trap composed of 275 places in 488 ms of which 6 ms to minimize.
[2024-05-21 21:20:37] [INFO ] Deduced a trap composed of 275 places in 388 ms of which 8 ms to minimize.
[2024-05-21 21:20:37] [INFO ] Deduced a trap composed of 264 places in 518 ms of which 6 ms to minimize.
[2024-05-21 21:20:38] [INFO ] Deduced a trap composed of 254 places in 373 ms of which 6 ms to minimize.
[2024-05-21 21:20:38] [INFO ] Deduced a trap composed of 257 places in 393 ms of which 6 ms to minimize.
[2024-05-21 21:20:39] [INFO ] Deduced a trap composed of 258 places in 377 ms of which 6 ms to minimize.
[2024-05-21 21:20:39] [INFO ] Deduced a trap composed of 267 places in 367 ms of which 8 ms to minimize.
[2024-05-21 21:20:39] [INFO ] Deduced a trap composed of 264 places in 452 ms of which 6 ms to minimize.
[2024-05-21 21:20:40] [INFO ] Deduced a trap composed of 267 places in 411 ms of which 9 ms to minimize.
[2024-05-21 21:20:40] [INFO ] Deduced a trap composed of 267 places in 480 ms of which 6 ms to minimize.
[2024-05-21 21:20:41] [INFO ] Deduced a trap composed of 273 places in 375 ms of which 9 ms to minimize.
[2024-05-21 21:20:41] [INFO ] Deduced a trap composed of 266 places in 506 ms of which 6 ms to minimize.
[2024-05-21 21:20:42] [INFO ] Deduced a trap composed of 268 places in 381 ms of which 6 ms to minimize.
[2024-05-21 21:20:42] [INFO ] Deduced a trap composed of 262 places in 366 ms of which 6 ms to minimize.
[2024-05-21 21:20:43] [INFO ] Deduced a trap composed of 272 places in 359 ms of which 6 ms to minimize.
[2024-05-21 21:20:43] [INFO ] Deduced a trap composed of 276 places in 391 ms of which 8 ms to minimize.
[2024-05-21 21:20:43] [INFO ] Deduced a trap composed of 272 places in 468 ms of which 7 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/979 variables, 20/342 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 21:20:44] [INFO ] Deduced a trap composed of 267 places in 390 ms of which 6 ms to minimize.
[2024-05-21 21:20:44] [INFO ] Deduced a trap composed of 266 places in 397 ms of which 8 ms to minimize.
[2024-05-21 21:20:45] [INFO ] Deduced a trap composed of 271 places in 490 ms of which 6 ms to minimize.
[2024-05-21 21:20:45] [INFO ] Deduced a trap composed of 271 places in 375 ms of which 6 ms to minimize.
[2024-05-21 21:20:46] [INFO ] Deduced a trap composed of 275 places in 363 ms of which 6 ms to minimize.
[2024-05-21 21:20:46] [INFO ] Deduced a trap composed of 260 places in 356 ms of which 6 ms to minimize.
[2024-05-21 21:20:47] [INFO ] Deduced a trap composed of 258 places in 386 ms of which 6 ms to minimize.
[2024-05-21 21:20:47] [INFO ] Deduced a trap composed of 328 places in 375 ms of which 6 ms to minimize.
[2024-05-21 21:20:47] [INFO ] Deduced a trap composed of 298 places in 366 ms of which 6 ms to minimize.
[2024-05-21 21:20:48] [INFO ] Deduced a trap composed of 257 places in 359 ms of which 6 ms to minimize.
[2024-05-21 21:20:48] [INFO ] Deduced a trap composed of 265 places in 376 ms of which 6 ms to minimize.
[2024-05-21 21:20:48] [INFO ] Deduced a trap composed of 271 places in 372 ms of which 6 ms to minimize.
[2024-05-21 21:20:49] [INFO ] Deduced a trap composed of 279 places in 352 ms of which 6 ms to minimize.
[2024-05-21 21:20:49] [INFO ] Deduced a trap composed of 282 places in 367 ms of which 6 ms to minimize.
[2024-05-21 21:20:50] [INFO ] Deduced a trap composed of 301 places in 368 ms of which 6 ms to minimize.
[2024-05-21 21:20:50] [INFO ] Deduced a trap composed of 58 places in 350 ms of which 5 ms to minimize.
[2024-05-21 21:20:51] [INFO ] Deduced a trap composed of 11 places in 514 ms of which 7 ms to minimize.
[2024-05-21 21:20:51] [INFO ] Deduced a trap composed of 243 places in 495 ms of which 7 ms to minimize.
[2024-05-21 21:20:52] [INFO ] Deduced a trap composed of 237 places in 620 ms of which 7 ms to minimize.
[2024-05-21 21:20:52] [INFO ] Deduced a trap composed of 250 places in 533 ms of which 10 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/979 variables, 20/362 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 21:20:53] [INFO ] Deduced a trap composed of 258 places in 427 ms of which 5 ms to minimize.
[2024-05-21 21:20:53] [INFO ] Deduced a trap composed of 269 places in 370 ms of which 6 ms to minimize.
[2024-05-21 21:20:54] [INFO ] Deduced a trap composed of 13 places in 361 ms of which 6 ms to minimize.
[2024-05-21 21:20:54] [INFO ] Deduced a trap composed of 259 places in 353 ms of which 6 ms to minimize.
[2024-05-21 21:20:55] [INFO ] Deduced a trap composed of 270 places in 422 ms of which 8 ms to minimize.
[2024-05-21 21:20:55] [INFO ] Deduced a trap composed of 273 places in 337 ms of which 6 ms to minimize.
[2024-05-21 21:20:55] [INFO ] Deduced a trap composed of 264 places in 358 ms of which 6 ms to minimize.
[2024-05-21 21:20:56] [INFO ] Deduced a trap composed of 336 places in 357 ms of which 6 ms to minimize.
[2024-05-21 21:20:56] [INFO ] Deduced a trap composed of 270 places in 358 ms of which 7 ms to minimize.
[2024-05-21 21:20:56] [INFO ] Deduced a trap composed of 269 places in 369 ms of which 6 ms to minimize.
[2024-05-21 21:20:57] [INFO ] Deduced a trap composed of 270 places in 290 ms of which 5 ms to minimize.
[2024-05-21 21:20:57] [INFO ] Deduced a trap composed of 265 places in 361 ms of which 6 ms to minimize.
[2024-05-21 21:20:58] [INFO ] Deduced a trap composed of 268 places in 348 ms of which 6 ms to minimize.
[2024-05-21 21:20:58] [INFO ] Deduced a trap composed of 336 places in 363 ms of which 6 ms to minimize.
[2024-05-21 21:20:58] [INFO ] Deduced a trap composed of 334 places in 322 ms of which 5 ms to minimize.
[2024-05-21 21:20:59] [INFO ] Deduced a trap composed of 271 places in 314 ms of which 6 ms to minimize.
[2024-05-21 21:20:59] [INFO ] Deduced a trap composed of 334 places in 278 ms of which 5 ms to minimize.
[2024-05-21 21:20:59] [INFO ] Deduced a trap composed of 266 places in 325 ms of which 6 ms to minimize.
[2024-05-21 21:21:00] [INFO ] Deduced a trap composed of 331 places in 329 ms of which 6 ms to minimize.
[2024-05-21 21:21:00] [INFO ] Deduced a trap composed of 269 places in 324 ms of which 6 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/979 variables, 20/382 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 21:21:01] [INFO ] Deduced a trap composed of 338 places in 321 ms of which 6 ms to minimize.
[2024-05-21 21:21:01] [INFO ] Deduced a trap composed of 258 places in 324 ms of which 5 ms to minimize.
[2024-05-21 21:21:01] [INFO ] Deduced a trap composed of 267 places in 316 ms of which 6 ms to minimize.
[2024-05-21 21:21:02] [INFO ] Deduced a trap composed of 333 places in 320 ms of which 5 ms to minimize.
SMT process timed out in 46728ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 18 out of 979 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 979/979 places, 778/778 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 79 place count 979 transition count 699
Reduce places removed 79 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 81 rules applied. Total rules applied 160 place count 900 transition count 697
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 162 place count 898 transition count 697
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 33 Pre rules applied. Total rules applied 162 place count 898 transition count 664
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 228 place count 865 transition count 664
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 231 place count 862 transition count 661
Iterating global reduction 3 with 3 rules applied. Total rules applied 234 place count 862 transition count 661
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 234 place count 862 transition count 660
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 236 place count 861 transition count 660
Performed 84 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 84 places in 1 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 3 with 168 rules applied. Total rules applied 404 place count 777 transition count 573
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 406 place count 777 transition count 571
Renaming transitions due to excessive name length > 1024 char.
Free-agglomeration rule applied 17 times.
Iterating global reduction 4 with 17 rules applied. Total rules applied 423 place count 777 transition count 554
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 4 with 17 rules applied. Total rules applied 440 place count 760 transition count 554
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 441 place count 759 transition count 553
Reduce places removed 50 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 5 with 61 rules applied. Total rules applied 502 place count 709 transition count 542
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 513 place count 698 transition count 542
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 39 Pre rules applied. Total rules applied 513 place count 698 transition count 503
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 7 with 78 rules applied. Total rules applied 591 place count 659 transition count 503
Applied a total of 591 rules in 228 ms. Remains 659 /979 variables (removed 320) and now considering 503/778 (removed 275) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 228 ms. Remains : 659/979 places, 503/778 transitions.
RANDOM walk for 40000 steps (318 resets) in 591 ms. (67 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (35 resets) in 210 ms. (189 steps per ms) remains 2/3 properties
FORMULA AutoFlight-PT-48b-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (29 resets) in 252 ms. (158 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (42 resets) in 184 ms. (216 steps per ms) remains 2/2 properties
// Phase 1: matrix 503 rows 659 cols
[2024-05-21 21:21:02] [INFO ] Computed 208 invariants in 3 ms
[2024-05-21 21:21:02] [INFO ] State equation strengthened by 321 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 230/246 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/246 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 90/336 variables, 13/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/336 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 191/527 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/527 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 80/607 variables, 45/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/607 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 503/1110 variables, 607/789 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1110 variables, 321/1110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1110 variables, 0/1110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 52/1162 variables, 52/1162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1162 variables, 26/1188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1162 variables, 0/1188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/1162 variables, 0/1188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1162/1162 variables, and 1188 constraints, problems are : Problem set: 0 solved, 2 unsolved in 771 ms.
Refiners :[Positive P Invariants (semi-flows): 206/206 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 659/659 constraints, ReadFeed: 321/321 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 230/246 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 21:21:03] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/246 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/246 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 90/336 variables, 13/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 21:21:03] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/336 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 21:21:03] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/336 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/336 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 191/527 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/527 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 80/607 variables, 45/185 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 21:21:04] [INFO ] Deduced a trap composed of 362 places in 227 ms of which 4 ms to minimize.
[2024-05-21 21:21:04] [INFO ] Deduced a trap composed of 364 places in 214 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/607 variables, 2/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/607 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 503/1110 variables, 607/794 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1110 variables, 321/1115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1110 variables, 2/1117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1110 variables, 0/1117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 52/1162 variables, 52/1169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1162 variables, 26/1195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1162 variables, 0/1195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1162 variables, 0/1195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1162/1162 variables, and 1195 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1776 ms.
Refiners :[Positive P Invariants (semi-flows): 206/206 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 659/659 constraints, ReadFeed: 321/321 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
After SMT, in 2567ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 419 ms.
Support contains 16 out of 659 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 659/659 places, 503/503 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 659 transition count 502
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 658 transition count 502
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 658 transition count 500
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 656 transition count 500
Applied a total of 6 rules in 62 ms. Remains 656 /659 variables (removed 3) and now considering 500/503 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 656/659 places, 500/503 transitions.
RANDOM walk for 40000 steps (181 resets) in 673 ms. (59 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (9 resets) in 337 ms. (118 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (30 resets) in 302 ms. (132 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 188588 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :1 out of 2
Probabilistic random walk after 188588 steps, saw 53865 distinct states, run finished after 3007 ms. (steps per millisecond=62 ) properties seen :1
FORMULA AutoFlight-PT-48b-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 500 rows 656 cols
[2024-05-21 21:21:09] [INFO ] Computed 208 invariants in 3 ms
[2024-05-21 21:21:09] [INFO ] State equation strengthened by 325 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 230/243 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/243 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 90/333 variables, 13/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/333 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 191/524 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/524 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 80/604 variables, 45/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/604 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 500/1104 variables, 604/786 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1104 variables, 325/1111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1104 variables, 0/1111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 52/1156 variables, 52/1163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1156 variables, 26/1189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1156 variables, 0/1189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1156 variables, 0/1189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1156/1156 variables, and 1189 constraints, problems are : Problem set: 0 solved, 1 unsolved in 567 ms.
Refiners :[Positive P Invariants (semi-flows): 206/206 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 656/656 constraints, ReadFeed: 325/325 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/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 230/243 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/243 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 90/333 variables, 13/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/333 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 191/524 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/524 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 80/604 variables, 45/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/604 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 500/1104 variables, 604/786 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1104 variables, 325/1111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1104 variables, 1/1112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 21:21:10] [INFO ] Deduced a trap composed of 30 places in 115 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1104 variables, 1/1113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1104 variables, 0/1113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 52/1156 variables, 52/1165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1156 variables, 26/1191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1156 variables, 0/1191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1156 variables, 0/1191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1156/1156 variables, and 1191 constraints, problems are : Problem set: 0 solved, 1 unsolved in 844 ms.
Refiners :[Positive P Invariants (semi-flows): 206/206 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 656/656 constraints, ReadFeed: 325/325 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1430ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 52 ms.
Support contains 13 out of 656 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 656/656 places, 500/500 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 656 transition count 499
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 655 transition count 499
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 655 transition count 497
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 653 transition count 497
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 653 transition count 495
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 10 place count 651 transition count 495
Applied a total of 10 rules in 64 ms. Remains 651 /656 variables (removed 5) and now considering 495/500 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 651/656 places, 495/500 transitions.
RANDOM walk for 40000 steps (8 resets) in 577 ms. (69 steps per ms) remains 1/1 properties
BEST_FIRST walk for 21806 steps (4 resets) in 143 ms. (151 steps per ms) remains 0/1 properties
FORMULA AutoFlight-PT-48b-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 73064 ms.
ITS solved all properties within timeout

BK_STOP 1716326471221

--------------------
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="AutoFlight-PT-48b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is AutoFlight-PT-48b, 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 r025-smll-171620166100199"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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