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-171620167200199.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-48b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r468-smll-171620167200199
=====================================================================

--------------------
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 1717201191521

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-48b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 00:19:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 00:19:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 00:19:54] [INFO ] Load time of PNML (sax parser for PT used): 474 ms
[2024-06-01 00:19:54] [INFO ] Transformed 3950 places.
[2024-06-01 00:19:54] [INFO ] Transformed 3936 transitions.
[2024-06-01 00:19:54] [INFO ] Found NUPN structural information;
[2024-06-01 00:19:54] [INFO ] Parsed PT model containing 3950 places and 3936 transitions and 9104 arcs in 880 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 42 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (20 resets) in 2276 ms. (17 steps per ms) remains 7/16 properties
FORMULA AutoFlight-PT-48b-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
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 330 ms. (120 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 409 ms. (97 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1252 ms. (31 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 7/7 properties
// Phase 1: matrix 3936 rows 3950 cols
[2024-06-01 00:19:57] [INFO ] Computed 258 invariants in 125 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 105/105 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 3229/3334 variables, 194/299 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3334 variables, 3229/3528 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3334 variables, 0/3528 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 495/3829 variables, 63/3591 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3829 variables, 495/4086 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3829 variables, 0/4086 constraints. Problems are: Problem set: 0 solved, 7 unsolved
SMT process timed out in 5381ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 105 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 1574 transitions
Trivial Post-agglo rules discarded 1574 transitions
Performed 1574 trivial Post agglomeration. Transition count delta: 1574
Iterating post reduction 0 with 1574 rules applied. Total rules applied 1574 place count 3950 transition count 2362
Reduce places removed 1574 places and 0 transitions.
Ensure Unique test removed 176 transitions
Reduce isomorphic transitions removed 176 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 1 with 1836 rules applied. Total rules applied 3410 place count 2376 transition count 2100
Reduce places removed 86 places and 0 transitions.
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Iterating post reduction 2 with 137 rules applied. Total rules applied 3547 place count 2290 transition count 2049
Reduce places removed 51 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 59 rules applied. Total rules applied 3606 place count 2239 transition count 2041
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3607 place count 2238 transition count 2041
Performed 478 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 478 Pre rules applied. Total rules applied 3607 place count 2238 transition count 1563
Deduced a syphon composed of 478 places in 20 ms
Reduce places removed 478 places and 0 transitions.
Iterating global reduction 5 with 956 rules applied. Total rules applied 4563 place count 1760 transition count 1563
Discarding 313 places :
Symmetric choice reduction at 5 with 313 rule applications. Total rules 4876 place count 1447 transition count 1250
Iterating global reduction 5 with 313 rules applied. Total rules applied 5189 place count 1447 transition count 1250
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 5191 place count 1447 transition count 1248
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 98 Pre rules applied. Total rules applied 5191 place count 1447 transition count 1150
Deduced a syphon composed of 98 places in 10 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 6 with 196 rules applied. Total rules applied 5387 place count 1349 transition count 1150
Performed 313 Post agglomeration using F-continuation condition.Transition count delta: 313
Deduced a syphon composed of 313 places in 4 ms
Reduce places removed 313 places and 0 transitions.
Iterating global reduction 6 with 626 rules applied. Total rules applied 6013 place count 1036 transition count 837
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 6015 place count 1035 transition count 837
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 6021 place count 1035 transition count 831
Free-agglomeration rule applied 129 times.
Iterating global reduction 6 with 129 rules applied. Total rules applied 6150 place count 1035 transition count 702
Reduce places removed 129 places and 0 transitions.
Iterating post reduction 6 with 129 rules applied. Total rules applied 6279 place count 906 transition count 702
Applied a total of 6279 rules in 1672 ms. Remains 906 /3950 variables (removed 3044) and now considering 702/3936 (removed 3234) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1695 ms. Remains : 906/3950 places, 702/3936 transitions.
RANDOM walk for 40000 steps (248 resets) in 1087 ms. (36 steps per ms) remains 3/7 properties
FORMULA AutoFlight-PT-48b-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-48b-ReachabilityFireability-2024-05 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 40003 steps (26 resets) in 270 ms. (147 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (24 resets) in 325 ms. (122 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (28 resets) in 286 ms. (139 steps per ms) remains 3/3 properties
// Phase 1: matrix 702 rows 906 cols
[2024-06-01 00:20:04] [INFO ] Computed 258 invariants in 9 ms
[2024-06-01 00:20:04] [INFO ] State equation strengthened by 325 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) 328/346 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/346 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 485/831 variables, 134/256 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/831 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 75/906 variables, 2/258 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/906 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 702/1608 variables, 906/1164 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1608 variables, 325/1489 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1608 variables, 0/1489 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/1608 variables, 0/1489 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1608/1608 variables, and 1489 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1442 ms.
Refiners :[Positive P Invariants (semi-flows): 256/256 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 906/906 constraints, ReadFeed: 325/325 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) 328/346 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 00:20:06] [INFO ] Deduced a trap composed of 45 places in 120 ms of which 25 ms to minimize.
[2024-06-01 00:20:06] [INFO ] Deduced a trap composed of 40 places in 127 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/346 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 00:20:06] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/346 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/346 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 485/831 variables, 134/259 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 00:20:07] [INFO ] Deduced a trap composed of 6 places in 170 ms of which 5 ms to minimize.
[2024-06-01 00:20:07] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 2 ms to minimize.
[2024-06-01 00:20:07] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 2 ms to minimize.
[2024-06-01 00:20:07] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 3 ms to minimize.
[2024-06-01 00:20:07] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 2 ms to minimize.
[2024-06-01 00:20:07] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 2 ms to minimize.
[2024-06-01 00:20:07] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 3 ms to minimize.
[2024-06-01 00:20:08] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 2 ms to minimize.
[2024-06-01 00:20:08] [INFO ] Deduced a trap composed of 8 places in 89 ms of which 2 ms to minimize.
[2024-06-01 00:20:08] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 2 ms to minimize.
[2024-06-01 00:20:08] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 5 ms to minimize.
[2024-06-01 00:20:08] [INFO ] Deduced a trap composed of 31 places in 120 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/831 variables, 12/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/831 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 75/906 variables, 2/273 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 00:20:09] [INFO ] Deduced a trap composed of 7 places in 632 ms of which 10 ms to minimize.
[2024-06-01 00:20:10] [INFO ] Deduced a trap composed of 283 places in 632 ms of which 10 ms to minimize.
[2024-06-01 00:20:10] [INFO ] Deduced a trap composed of 11 places in 662 ms of which 10 ms to minimize.
[2024-06-01 00:20:11] [INFO ] Deduced a trap composed of 8 places in 637 ms of which 9 ms to minimize.
[2024-06-01 00:20:12] [INFO ] Deduced a trap composed of 54 places in 593 ms of which 10 ms to minimize.
[2024-06-01 00:20:12] [INFO ] Deduced a trap composed of 282 places in 618 ms of which 9 ms to minimize.
[2024-06-01 00:20:13] [INFO ] Deduced a trap composed of 30 places in 298 ms of which 6 ms to minimize.
[2024-06-01 00:20:13] [INFO ] Deduced a trap composed of 294 places in 479 ms of which 9 ms to minimize.
[2024-06-01 00:20:14] [INFO ] Deduced a trap composed of 288 places in 412 ms of which 6 ms to minimize.
[2024-06-01 00:20:14] [INFO ] Deduced a trap composed of 9 places in 381 ms of which 9 ms to minimize.
[2024-06-01 00:20:15] [INFO ] Deduced a trap composed of 32 places in 596 ms of which 9 ms to minimize.
[2024-06-01 00:20:15] [INFO ] Deduced a trap composed of 312 places in 523 ms of which 8 ms to minimize.
[2024-06-01 00:20:16] [INFO ] Deduced a trap composed of 312 places in 566 ms of which 9 ms to minimize.
[2024-06-01 00:20:16] [INFO ] Deduced a trap composed of 48 places in 557 ms of which 6 ms to minimize.
[2024-06-01 00:20:17] [INFO ] Deduced a trap composed of 350 places in 350 ms of which 6 ms to minimize.
[2024-06-01 00:20:17] [INFO ] Deduced a trap composed of 322 places in 534 ms of which 9 ms to minimize.
[2024-06-01 00:20:18] [INFO ] Deduced a trap composed of 72 places in 540 ms of which 8 ms to minimize.
[2024-06-01 00:20:18] [INFO ] Deduced a trap composed of 50 places in 432 ms of which 8 ms to minimize.
[2024-06-01 00:20:19] [INFO ] Deduced a trap composed of 357 places in 361 ms of which 6 ms to minimize.
[2024-06-01 00:20:19] [INFO ] Deduced a trap composed of 350 places in 329 ms of which 7 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/906 variables, 20/293 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 00:20:19] [INFO ] Deduced a trap composed of 352 places in 344 ms of which 6 ms to minimize.
[2024-06-01 00:20:20] [INFO ] Deduced a trap composed of 349 places in 334 ms of which 6 ms to minimize.
[2024-06-01 00:20:20] [INFO ] Deduced a trap composed of 346 places in 307 ms of which 6 ms to minimize.
[2024-06-01 00:20:20] [INFO ] Deduced a trap composed of 389 places in 339 ms of which 6 ms to minimize.
[2024-06-01 00:20:21] [INFO ] Deduced a trap composed of 350 places in 336 ms of which 7 ms to minimize.
[2024-06-01 00:20:21] [INFO ] Deduced a trap composed of 342 places in 356 ms of which 6 ms to minimize.
[2024-06-01 00:20:22] [INFO ] Deduced a trap composed of 343 places in 339 ms of which 5 ms to minimize.
[2024-06-01 00:20:22] [INFO ] Deduced a trap composed of 349 places in 296 ms of which 6 ms to minimize.
[2024-06-01 00:20:22] [INFO ] Deduced a trap composed of 346 places in 308 ms of which 5 ms to minimize.
[2024-06-01 00:20:23] [INFO ] Deduced a trap composed of 54 places in 306 ms of which 5 ms to minimize.
[2024-06-01 00:20:23] [INFO ] Deduced a trap composed of 351 places in 292 ms of which 6 ms to minimize.
[2024-06-01 00:20:23] [INFO ] Deduced a trap composed of 390 places in 299 ms of which 5 ms to minimize.
[2024-06-01 00:20:24] [INFO ] Deduced a trap composed of 344 places in 305 ms of which 5 ms to minimize.
[2024-06-01 00:20:24] [INFO ] Deduced a trap composed of 349 places in 335 ms of which 8 ms to minimize.
[2024-06-01 00:20:24] [INFO ] Deduced a trap composed of 359 places in 429 ms of which 5 ms to minimize.
[2024-06-01 00:20:25] [INFO ] Deduced a trap composed of 347 places in 309 ms of which 6 ms to minimize.
[2024-06-01 00:20:25] [INFO ] Deduced a trap composed of 354 places in 307 ms of which 5 ms to minimize.
[2024-06-01 00:20:25] [INFO ] Deduced a trap composed of 353 places in 308 ms of which 5 ms to minimize.
[2024-06-01 00:20:26] [INFO ] Deduced a trap composed of 353 places in 305 ms of which 6 ms to minimize.
[2024-06-01 00:20:26] [INFO ] Deduced a trap composed of 346 places in 256 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/906 variables, 20/313 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 00:20:26] [INFO ] Deduced a trap composed of 14 places in 336 ms of which 9 ms to minimize.
[2024-06-01 00:20:27] [INFO ] Deduced a trap composed of 390 places in 347 ms of which 6 ms to minimize.
[2024-06-01 00:20:27] [INFO ] Deduced a trap composed of 395 places in 281 ms of which 5 ms to minimize.
[2024-06-01 00:20:27] [INFO ] Deduced a trap composed of 381 places in 312 ms of which 5 ms to minimize.
[2024-06-01 00:20:28] [INFO ] Deduced a trap composed of 387 places in 316 ms of which 5 ms to minimize.
[2024-06-01 00:20:28] [INFO ] Deduced a trap composed of 354 places in 338 ms of which 5 ms to minimize.
[2024-06-01 00:20:28] [INFO ] Deduced a trap composed of 387 places in 357 ms of which 7 ms to minimize.
[2024-06-01 00:20:29] [INFO ] Deduced a trap composed of 357 places in 435 ms of which 6 ms to minimize.
[2024-06-01 00:20:29] [INFO ] Deduced a trap composed of 387 places in 325 ms of which 6 ms to minimize.
[2024-06-01 00:20:30] [INFO ] Deduced a trap composed of 393 places in 317 ms of which 5 ms to minimize.
[2024-06-01 00:20:30] [INFO ] Deduced a trap composed of 393 places in 308 ms of which 5 ms to minimize.
[2024-06-01 00:20:30] [INFO ] Deduced a trap composed of 390 places in 304 ms of which 5 ms to minimize.
[2024-06-01 00:20:31] [INFO ] Deduced a trap composed of 386 places in 315 ms of which 6 ms to minimize.
[2024-06-01 00:20:31] [INFO ] Deduced a trap composed of 367 places in 314 ms of which 5 ms to minimize.
[2024-06-01 00:20:31] [INFO ] Deduced a trap composed of 387 places in 291 ms of which 5 ms to minimize.
[2024-06-01 00:20:32] [INFO ] Deduced a trap composed of 390 places in 286 ms of which 5 ms to minimize.
[2024-06-01 00:20:32] [INFO ] Deduced a trap composed of 360 places in 331 ms of which 8 ms to minimize.
[2024-06-01 00:20:32] [INFO ] Deduced a trap composed of 356 places in 429 ms of which 5 ms to minimize.
[2024-06-01 00:20:33] [INFO ] Deduced a trap composed of 388 places in 312 ms of which 5 ms to minimize.
[2024-06-01 00:20:33] [INFO ] Deduced a trap composed of 393 places in 288 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/906 variables, 20/333 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 00:20:33] [INFO ] Deduced a trap composed of 394 places in 322 ms of which 5 ms to minimize.
[2024-06-01 00:20:34] [INFO ] Deduced a trap composed of 349 places in 313 ms of which 5 ms to minimize.
[2024-06-01 00:20:34] [INFO ] Deduced a trap composed of 392 places in 316 ms of which 5 ms to minimize.
[2024-06-01 00:20:34] [INFO ] Deduced a trap composed of 391 places in 347 ms of which 7 ms to minimize.
[2024-06-01 00:20:35] [INFO ] Deduced a trap composed of 399 places in 428 ms of which 5 ms to minimize.
[2024-06-01 00:20:35] [INFO ] Deduced a trap composed of 350 places in 315 ms of which 5 ms to minimize.
[2024-06-01 00:20:36] [INFO ] Deduced a trap composed of 8 places in 318 ms of which 6 ms to minimize.
[2024-06-01 00:20:36] [INFO ] Deduced a trap composed of 391 places in 294 ms of which 5 ms to minimize.
[2024-06-01 00:20:36] [INFO ] Deduced a trap composed of 352 places in 297 ms of which 5 ms to minimize.
[2024-06-01 00:20:37] [INFO ] Deduced a trap composed of 392 places in 299 ms of which 5 ms to minimize.
[2024-06-01 00:20:37] [INFO ] Deduced a trap composed of 393 places in 299 ms of which 6 ms to minimize.
[2024-06-01 00:20:37] [INFO ] Deduced a trap composed of 391 places in 305 ms of which 5 ms to minimize.
[2024-06-01 00:20:38] [INFO ] Deduced a trap composed of 358 places in 312 ms of which 5 ms to minimize.
[2024-06-01 00:20:38] [INFO ] Deduced a trap composed of 397 places in 290 ms of which 6 ms to minimize.
[2024-06-01 00:20:38] [INFO ] Deduced a trap composed of 354 places in 311 ms of which 5 ms to minimize.
[2024-06-01 00:20:39] [INFO ] Deduced a trap composed of 386 places in 302 ms of which 5 ms to minimize.
[2024-06-01 00:20:39] [INFO ] Deduced a trap composed of 291 places in 357 ms of which 6 ms to minimize.
[2024-06-01 00:20:39] [INFO ] Deduced a trap composed of 293 places in 344 ms of which 6 ms to minimize.
[2024-06-01 00:20:40] [INFO ] Deduced a trap composed of 288 places in 331 ms of which 6 ms to minimize.
[2024-06-01 00:20:40] [INFO ] Deduced a trap composed of 301 places in 348 ms of which 5 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/906 variables, 20/353 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 00:20:41] [INFO ] Deduced a trap composed of 354 places in 330 ms of which 6 ms to minimize.
[2024-06-01 00:20:41] [INFO ] Deduced a trap composed of 361 places in 348 ms of which 11 ms to minimize.
[2024-06-01 00:20:41] [INFO ] Deduced a trap composed of 361 places in 454 ms of which 5 ms to minimize.
[2024-06-01 00:20:42] [INFO ] Deduced a trap composed of 358 places in 303 ms of which 5 ms to minimize.
[2024-06-01 00:20:42] [INFO ] Deduced a trap composed of 393 places in 298 ms of which 5 ms to minimize.
[2024-06-01 00:20:42] [INFO ] Deduced a trap composed of 355 places in 326 ms of which 8 ms to minimize.
[2024-06-01 00:20:43] [INFO ] Deduced a trap composed of 399 places in 442 ms of which 6 ms to minimize.
[2024-06-01 00:20:43] [INFO ] Deduced a trap composed of 397 places in 267 ms of which 5 ms to minimize.
[2024-06-01 00:20:43] [INFO ] Deduced a trap composed of 395 places in 308 ms of which 5 ms to minimize.
[2024-06-01 00:20:44] [INFO ] Deduced a trap composed of 390 places in 302 ms of which 5 ms to minimize.
[2024-06-01 00:20:44] [INFO ] Deduced a trap composed of 392 places in 300 ms of which 6 ms to minimize.
[2024-06-01 00:20:44] [INFO ] Deduced a trap composed of 351 places in 313 ms of which 5 ms to minimize.
[2024-06-01 00:20:45] [INFO ] Deduced a trap composed of 390 places in 295 ms of which 5 ms to minimize.
[2024-06-01 00:20:45] [INFO ] Deduced a trap composed of 354 places in 310 ms of which 5 ms to minimize.
[2024-06-01 00:20:45] [INFO ] Deduced a trap composed of 395 places in 292 ms of which 5 ms to minimize.
[2024-06-01 00:20:46] [INFO ] Deduced a trap composed of 399 places in 326 ms of which 5 ms to minimize.
[2024-06-01 00:20:46] [INFO ] Deduced a trap composed of 362 places in 331 ms of which 5 ms to minimize.
[2024-06-01 00:20:46] [INFO ] Deduced a trap composed of 353 places in 305 ms of which 5 ms to minimize.
[2024-06-01 00:20:47] [INFO ] Deduced a trap composed of 390 places in 314 ms of which 5 ms to minimize.
[2024-06-01 00:20:47] [INFO ] Deduced a trap composed of 392 places in 458 ms of which 7 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/906 variables, 20/373 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 00:20:48] [INFO ] Deduced a trap composed of 6 places in 301 ms of which 5 ms to minimize.
[2024-06-01 00:20:48] [INFO ] Deduced a trap composed of 394 places in 307 ms of which 5 ms to minimize.
[2024-06-01 00:20:48] [INFO ] Deduced a trap composed of 387 places in 296 ms of which 5 ms to minimize.
[2024-06-01 00:20:49] [INFO ] Deduced a trap composed of 386 places in 446 ms of which 7 ms to minimize.
[2024-06-01 00:20:49] [INFO ] Deduced a trap composed of 383 places in 255 ms of which 5 ms to minimize.
[2024-06-01 00:20:49] [INFO ] Deduced a trap composed of 383 places in 307 ms of which 5 ms to minimize.
[2024-06-01 00:20:50] [INFO ] Deduced a trap composed of 357 places in 284 ms of which 5 ms to minimize.
[2024-06-01 00:20:50] [INFO ] Deduced a trap composed of 357 places in 281 ms of which 6 ms to minimize.
[2024-06-01 00:20:50] [INFO ] Deduced a trap composed of 357 places in 295 ms of which 5 ms to minimize.
[2024-06-01 00:20:51] [INFO ] Deduced a trap composed of 350 places in 292 ms of which 5 ms to minimize.
SMT process timed out in 46514ms, 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 906 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 906/906 places, 702/702 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 51 place count 906 transition count 651
Reduce places removed 51 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 52 rules applied. Total rules applied 103 place count 855 transition count 650
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 104 place count 854 transition count 650
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 104 place count 854 transition count 628
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 148 place count 832 transition count 628
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 149 place count 831 transition count 627
Iterating global reduction 3 with 1 rules applied. Total rules applied 150 place count 831 transition count 627
Performed 53 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 53 places in 1 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 3 with 106 rules applied. Total rules applied 256 place count 778 transition count 573
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 257 place count 778 transition count 572
Renaming transitions due to excessive name length > 1024 char.
Free-agglomeration rule applied 13 times.
Iterating global reduction 4 with 13 rules applied. Total rules applied 270 place count 778 transition count 559
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 4 with 13 rules applied. Total rules applied 283 place count 765 transition count 559
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 284 place count 764 transition count 558
Reduce places removed 46 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 5 with 53 rules applied. Total rules applied 337 place count 718 transition count 551
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 344 place count 711 transition count 551
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 39 Pre rules applied. Total rules applied 344 place count 711 transition count 512
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 422 place count 672 transition count 512
Applied a total of 422 rules in 257 ms. Remains 672 /906 variables (removed 234) and now considering 512/702 (removed 190) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 257 ms. Remains : 672/906 places, 512/702 transitions.
RANDOM walk for 40000 steps (315 resets) in 759 ms. (52 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (28 resets) in 300 ms. (132 steps per ms) remains 2/3 properties
FORMULA AutoFlight-PT-48b-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (30 resets) in 352 ms. (113 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (38 resets) in 381 ms. (104 steps per ms) remains 2/2 properties
// Phase 1: matrix 512 rows 672 cols
[2024-06-01 00:20:51] [INFO ] Computed 212 invariants in 4 ms
[2024-06-01 00:20:52] [INFO ] State equation strengthened by 325 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) 91/337 variables, 13/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/337 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 207/544 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/544 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 68/612 variables, 45/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/612 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 512/1124 variables, 612/794 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1124 variables, 325/1119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1124 variables, 0/1119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 60/1184 variables, 60/1179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1184 variables, 30/1209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1184 variables, 0/1209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/1184 variables, 0/1209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1184/1184 variables, and 1209 constraints, problems are : Problem set: 0 solved, 2 unsolved in 782 ms.
Refiners :[Positive P Invariants (semi-flows): 210/210 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 672/672 constraints, ReadFeed: 325/325 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-06-01 00:20:52] [INFO ] Deduced a trap composed of 30 places in 50 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
[2024-06-01 00:20:52] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/246 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 91/337 variables, 13/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 207/544 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/544 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 68/612 variables, 45/184 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 00:20:53] [INFO ] Deduced a trap composed of 358 places in 217 ms of which 4 ms to minimize.
[2024-06-01 00:20:53] [INFO ] Deduced a trap composed of 364 places in 196 ms of which 4 ms to minimize.
[2024-06-01 00:20:53] [INFO ] Deduced a trap composed of 364 places in 234 ms of which 4 ms to minimize.
[2024-06-01 00:20:54] [INFO ] Deduced a trap composed of 364 places in 217 ms of which 5 ms to minimize.
[2024-06-01 00:20:54] [INFO ] Deduced a trap composed of 364 places in 220 ms of which 5 ms to minimize.
[2024-06-01 00:20:54] [INFO ] Deduced a trap composed of 364 places in 218 ms of which 4 ms to minimize.
[2024-06-01 00:20:54] [INFO ] Deduced a trap composed of 362 places in 222 ms of which 4 ms to minimize.
[2024-06-01 00:20:55] [INFO ] Deduced a trap composed of 364 places in 232 ms of which 4 ms to minimize.
[2024-06-01 00:20:55] [INFO ] Deduced a trap composed of 364 places in 221 ms of which 4 ms to minimize.
[2024-06-01 00:20:55] [INFO ] Deduced a trap composed of 366 places in 214 ms of which 4 ms to minimize.
[2024-06-01 00:20:55] [INFO ] Deduced a trap composed of 362 places in 217 ms of which 4 ms to minimize.
[2024-06-01 00:20:55] [INFO ] Deduced a trap composed of 366 places in 199 ms of which 4 ms to minimize.
[2024-06-01 00:20:56] [INFO ] Deduced a trap composed of 364 places in 221 ms of which 5 ms to minimize.
[2024-06-01 00:20:56] [INFO ] Deduced a trap composed of 366 places in 211 ms of which 4 ms to minimize.
[2024-06-01 00:20:56] [INFO ] Deduced a trap composed of 364 places in 200 ms of which 5 ms to minimize.
[2024-06-01 00:20:56] [INFO ] Deduced a trap composed of 364 places in 214 ms of which 4 ms to minimize.
[2024-06-01 00:20:57] [INFO ] Deduced a trap composed of 368 places in 214 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/612 variables, 17/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/612 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 512/1124 variables, 612/813 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1124 variables, 325/1138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1124 variables, 2/1140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1124 variables, 0/1140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 60/1184 variables, 60/1200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1184 variables, 30/1230 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1184 variables, 0/1230 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/1184 variables, 0/1230 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1184/1184 variables, and 1230 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5255 ms.
Refiners :[Positive P Invariants (semi-flows): 210/210 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 672/672 constraints, ReadFeed: 325/325 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 19/19 constraints]
After SMT, in 6065ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 637 ms.
Support contains 16 out of 672 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 672/672 places, 512/512 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 672 transition count 511
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 671 transition count 511
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 671 transition count 509
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 669 transition count 509
Applied a total of 6 rules in 54 ms. Remains 669 /672 variables (removed 3) and now considering 509/512 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 669/672 places, 509/512 transitions.
RANDOM walk for 40000 steps (151 resets) in 696 ms. (57 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (13 resets) in 218 ms. (182 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (21 resets) in 200 ms. (199 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 164530 steps, run timeout after 3001 ms. (steps per millisecond=54 ) properties seen :1 out of 2
Probabilistic random walk after 164530 steps, saw 50883 distinct states, run finished after 3008 ms. (steps per millisecond=54 ) properties seen :1
FORMULA AutoFlight-PT-48b-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 509 rows 669 cols
[2024-06-01 00:21:02] [INFO ] Computed 212 invariants in 3 ms
[2024-06-01 00:21:02] [INFO ] State equation strengthened by 329 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) 91/334 variables, 13/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/334 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 207/541 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/541 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 68/609 variables, 45/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/609 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 509/1118 variables, 609/791 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1118 variables, 329/1120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1118 variables, 0/1120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 60/1178 variables, 60/1180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1178 variables, 30/1210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1178 variables, 0/1210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1178 variables, 0/1210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1178/1178 variables, and 1210 constraints, problems are : Problem set: 0 solved, 1 unsolved in 589 ms.
Refiners :[Positive P Invariants (semi-flows): 210/210 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 669/669 constraints, ReadFeed: 329/329 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) 91/334 variables, 13/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 00:21:02] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/334 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/334 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 207/541 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/541 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 68/609 variables, 45/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/609 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 509/1118 variables, 609/792 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1118 variables, 329/1121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1118 variables, 1/1122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 00:21:03] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1118 variables, 1/1123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1118 variables, 0/1123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 60/1178 variables, 60/1183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1178 variables, 30/1213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1178 variables, 0/1213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1178 variables, 0/1213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1178/1178 variables, and 1213 constraints, problems are : Problem set: 0 solved, 1 unsolved in 890 ms.
Refiners :[Positive P Invariants (semi-flows): 210/210 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 669/669 constraints, ReadFeed: 329/329 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 1499ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 3556 steps, including 198 resets, run visited all 1 properties in 31 ms. (steps per millisecond=114 )
FORMULA AutoFlight-PT-48b-ReachabilityFireability-2024-04 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 38 ms.
All properties solved without resorting to model-checking.
Total runtime 69724 ms.
ITS solved all properties within timeout

BK_STOP 1717201263724

--------------------
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="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-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 r468-smll-171620167200199"
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 ;