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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 696K
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K 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.5K Apr 22 14:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.1K Apr 13 02:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 67K Apr 13 02:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Apr 13 01:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 13 01:13 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 309K 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-48a-ReachabilityFireability-2024-00
FORMULA_NAME AutoFlight-PT-48a-ReachabilityFireability-2024-01
FORMULA_NAME AutoFlight-PT-48a-ReachabilityFireability-2024-02
FORMULA_NAME AutoFlight-PT-48a-ReachabilityFireability-2024-03
FORMULA_NAME AutoFlight-PT-48a-ReachabilityFireability-2024-04
FORMULA_NAME AutoFlight-PT-48a-ReachabilityFireability-2024-05
FORMULA_NAME AutoFlight-PT-48a-ReachabilityFireability-2024-06
FORMULA_NAME AutoFlight-PT-48a-ReachabilityFireability-2024-07
FORMULA_NAME AutoFlight-PT-48a-ReachabilityFireability-2024-08
FORMULA_NAME AutoFlight-PT-48a-ReachabilityFireability-2024-09
FORMULA_NAME AutoFlight-PT-48a-ReachabilityFireability-2024-10
FORMULA_NAME AutoFlight-PT-48a-ReachabilityFireability-2024-11
FORMULA_NAME AutoFlight-PT-48a-ReachabilityFireability-2024-12
FORMULA_NAME AutoFlight-PT-48a-ReachabilityFireability-2024-13
FORMULA_NAME AutoFlight-PT-48a-ReachabilityFireability-2024-14
FORMULA_NAME AutoFlight-PT-48a-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717198999324

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-48a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 23:43:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 23:43:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 23:43:21] [INFO ] Load time of PNML (sax parser for PT used): 306 ms
[2024-05-31 23:43:21] [INFO ] Transformed 1127 places.
[2024-05-31 23:43:21] [INFO ] Transformed 1113 transitions.
[2024-05-31 23:43:21] [INFO ] Found NUPN structural information;
[2024-05-31 23:43:21] [INFO ] Parsed PT model containing 1127 places and 1113 transitions and 3458 arcs in 500 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 192 transitions
Reduce redundant transitions removed 192 transitions.
RANDOM walk for 40000 steps (276 resets) in 3776 ms. (10 steps per ms) remains 10/16 properties
FORMULA AutoFlight-PT-48a-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-48a-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-48a-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-48a-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-48a-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-48a-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 754 ms. (52 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 311 ms. (128 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 489 ms. (81 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 387 ms. (103 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 497 ms. (80 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 857 ms. (46 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 464 ms. (86 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 471 ms. (84 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 336 ms. (118 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 290 ms. (137 steps per ms) remains 10/10 properties
// Phase 1: matrix 921 rows 1127 cols
[2024-05-31 23:43:24] [INFO ] Computed 258 invariants in 56 ms
[2024-05-31 23:43:24] [INFO ] State equation strengthened by 192 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/221 variables, 221/221 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/221 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem AutoFlight-PT-48a-ReachabilityFireability-2024-11 is UNSAT
FORMULA AutoFlight-PT-48a-ReachabilityFireability-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 523/744 variables, 125/346 constraints. Problems are: Problem set: 1 solved, 9 unsolved
Problem AutoFlight-PT-48a-ReachabilityFireability-2024-02 is UNSAT
FORMULA AutoFlight-PT-48a-ReachabilityFireability-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem AutoFlight-PT-48a-ReachabilityFireability-2024-03 is UNSAT
FORMULA AutoFlight-PT-48a-ReachabilityFireability-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (INCLUDED_ONLY) 0/744 variables, 523/869 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/744 variables, 0/869 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 277/1021 variables, 132/1001 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1021 variables, 277/1278 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1021 variables, 0/1278 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 106/1127 variables, 1/1279 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1127 variables, 106/1385 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1127 variables, 0/1385 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 921/2048 variables, 1127/2512 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2048 variables, 192/2704 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2048 variables, 0/2704 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 0/2048 variables, 0/2704 constraints. Problems are: Problem set: 3 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2048/2048 variables, and 2704 constraints, problems are : Problem set: 3 solved, 7 unsolved in 5000 ms.
Refiners :[Domain max(s): 1127/1127 constraints, Positive P Invariants (semi-flows): 257/257 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 1127/1127 constraints, ReadFeed: 192/192 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 179/179 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/179 variables, 0/179 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 503/682 variables, 105/284 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/682 variables, 503/787 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/682 variables, 0/787 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 338/1020 variables, 152/939 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1020 variables, 338/1277 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1020 variables, 0/1277 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 107/1127 variables, 1/1278 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1127 variables, 107/1385 constraints. Problems are: Problem set: 3 solved, 7 unsolved
[2024-05-31 23:43:31] [INFO ] Deduced a trap composed of 584 places in 690 ms of which 81 ms to minimize.
[2024-05-31 23:43:32] [INFO ] Deduced a trap composed of 592 places in 513 ms of which 9 ms to minimize.
[2024-05-31 23:43:33] [INFO ] Deduced a trap composed of 589 places in 552 ms of which 7 ms to minimize.
[2024-05-31 23:43:33] [INFO ] Deduced a trap composed of 590 places in 437 ms of which 8 ms to minimize.
[2024-05-31 23:43:34] [INFO ] Deduced a trap composed of 600 places in 502 ms of which 8 ms to minimize.
[2024-05-31 23:43:34] [INFO ] Deduced a trap composed of 601 places in 520 ms of which 7 ms to minimize.
[2024-05-31 23:43:35] [INFO ] Deduced a trap composed of 585 places in 498 ms of which 7 ms to minimize.
SMT process timed out in 10556ms, After SMT, problems are : Problem set: 3 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 179 out of 1127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1127/1127 places, 921/921 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 140 transitions
Trivial Post-agglo rules discarded 140 transitions
Performed 140 trivial Post agglomeration. Transition count delta: 140
Iterating post reduction 0 with 140 rules applied. Total rules applied 140 place count 1127 transition count 781
Reduce places removed 140 places and 0 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Iterating post reduction 1 with 160 rules applied. Total rules applied 300 place count 987 transition count 761
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 320 place count 967 transition count 761
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 54 Pre rules applied. Total rules applied 320 place count 967 transition count 707
Deduced a syphon composed of 54 places in 2 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 108 rules applied. Total rules applied 428 place count 913 transition count 707
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 3 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 482 place count 886 transition count 680
Free-agglomeration rule applied 35 times.
Iterating global reduction 3 with 35 rules applied. Total rules applied 517 place count 886 transition count 645
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 3 with 35 rules applied. Total rules applied 552 place count 851 transition count 645
Applied a total of 552 rules in 397 ms. Remains 851 /1127 variables (removed 276) and now considering 645/921 (removed 276) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 411 ms. Remains : 851/1127 places, 645/921 transitions.
RANDOM walk for 40000 steps (593 resets) in 958 ms. (41 steps per ms) remains 6/7 properties
FORMULA AutoFlight-PT-48a-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (23 resets) in 530 ms. (75 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (22 resets) in 464 ms. (86 steps per ms) remains 5/6 properties
FORMULA AutoFlight-PT-48a-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (21 resets) in 312 ms. (127 steps per ms) remains 4/5 properties
FORMULA AutoFlight-PT-48a-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (22 resets) in 305 ms. (130 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (23 resets) in 236 ms. (168 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (24 resets) in 222 ms. (179 steps per ms) remains 3/4 properties
FORMULA AutoFlight-PT-48a-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 645 rows 851 cols
[2024-05-31 23:43:36] [INFO ] Computed 258 invariants in 12 ms
[2024-05-31 23:43:36] [INFO ] State equation strengthened by 290 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 103/103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 346/449 variables, 69/172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/449 variables, 346/518 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/449 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 325/774 variables, 188/706 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/774 variables, 325/1031 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/774 variables, 0/1031 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 77/851 variables, 1/1032 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/851 variables, 77/1109 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/851 variables, 0/1109 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 645/1496 variables, 851/1960 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1496 variables, 290/2250 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1496 variables, 0/2250 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/1496 variables, 0/2250 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1496/1496 variables, and 2250 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1263 ms.
Refiners :[Domain max(s): 851/851 constraints, Positive P Invariants (semi-flows): 257/257 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 851/851 constraints, ReadFeed: 290/290 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/103 variables, 103/103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 346/449 variables, 69/172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/449 variables, 346/518 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/449 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 325/774 variables, 188/706 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/774 variables, 325/1031 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/774 variables, 0/1031 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 77/851 variables, 1/1032 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/851 variables, 77/1109 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 23:43:38] [INFO ] Deduced a trap composed of 421 places in 345 ms of which 6 ms to minimize.
[2024-05-31 23:43:39] [INFO ] Deduced a trap composed of 427 places in 368 ms of which 5 ms to minimize.
[2024-05-31 23:43:39] [INFO ] Deduced a trap composed of 427 places in 353 ms of which 5 ms to minimize.
[2024-05-31 23:43:39] [INFO ] Deduced a trap composed of 419 places in 325 ms of which 6 ms to minimize.
[2024-05-31 23:43:40] [INFO ] Deduced a trap composed of 423 places in 321 ms of which 6 ms to minimize.
[2024-05-31 23:43:40] [INFO ] Deduced a trap composed of 423 places in 317 ms of which 5 ms to minimize.
[2024-05-31 23:43:40] [INFO ] Deduced a trap composed of 435 places in 321 ms of which 6 ms to minimize.
[2024-05-31 23:43:41] [INFO ] Deduced a trap composed of 420 places in 335 ms of which 5 ms to minimize.
[2024-05-31 23:43:41] [INFO ] Deduced a trap composed of 432 places in 296 ms of which 5 ms to minimize.
[2024-05-31 23:43:41] [INFO ] Deduced a trap composed of 429 places in 275 ms of which 6 ms to minimize.
[2024-05-31 23:43:42] [INFO ] Deduced a trap composed of 437 places in 374 ms of which 7 ms to minimize.
[2024-05-31 23:43:42] [INFO ] Deduced a trap composed of 435 places in 308 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/851 variables, 12/1121 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/851 variables, 0/1121 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 645/1496 variables, 851/1972 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1496 variables, 290/2262 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1496 variables, 3/2265 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 23:43:43] [INFO ] Deduced a trap composed of 444 places in 299 ms of which 5 ms to minimize.
[2024-05-31 23:43:44] [INFO ] Deduced a trap composed of 455 places in 283 ms of which 5 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1496 variables, 2/2267 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1496 variables, 0/2267 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/1496 variables, 0/2267 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1496/1496 variables, and 2267 constraints, problems are : Problem set: 0 solved, 3 unsolved in 7263 ms.
Refiners :[Domain max(s): 851/851 constraints, Positive P Invariants (semi-flows): 257/257 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 851/851 constraints, ReadFeed: 290/290 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 14/14 constraints]
After SMT, in 8625ms problems are : Problem set: 0 solved, 3 unsolved
FORMULA AutoFlight-PT-48a-ReachabilityFireability-2024-13 FALSE TECHNIQUES PARIKH_WALK
FORMULA AutoFlight-PT-48a-ReachabilityFireability-2024-12 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 839 ms.
Support contains 65 out of 851 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 851/851 places, 645/645 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 851 transition count 619
Reduce places removed 26 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 32 rules applied. Total rules applied 58 place count 825 transition count 613
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 64 place count 819 transition count 613
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 64 place count 819 transition count 600
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 90 place count 806 transition count 600
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 140 place count 781 transition count 575
Free-agglomeration rule applied 19 times.
Iterating global reduction 3 with 19 rules applied. Total rules applied 159 place count 781 transition count 556
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 3 with 19 rules applied. Total rules applied 178 place count 762 transition count 556
Applied a total of 178 rules in 133 ms. Remains 762 /851 variables (removed 89) and now considering 556/645 (removed 89) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 133 ms. Remains : 762/851 places, 556/645 transitions.
RANDOM walk for 40000 steps (703 resets) in 426 ms. (93 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (60 resets) in 591 ms. (67 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 207155 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :0 out of 1
Probabilistic random walk after 207155 steps, saw 83536 distinct states, run finished after 3007 ms. (steps per millisecond=68 ) properties seen :0
// Phase 1: matrix 556 rows 762 cols
[2024-05-31 23:43:49] [INFO ] Computed 258 invariants in 5 ms
[2024-05-31 23:43:49] [INFO ] State equation strengthened by 340 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 65/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 285/350 variables, 49/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/350 variables, 285/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/350 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 338/688 variables, 208/607 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/688 variables, 338/945 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/688 variables, 0/945 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 74/762 variables, 1/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/762 variables, 74/1020 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/762 variables, 0/1020 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 556/1318 variables, 762/1782 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1318 variables, 340/2122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1318 variables, 0/2122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1318 variables, 0/2122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1318/1318 variables, and 2122 constraints, problems are : Problem set: 0 solved, 1 unsolved in 718 ms.
Refiners :[Domain max(s): 762/762 constraints, Positive P Invariants (semi-flows): 257/257 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 762/762 constraints, ReadFeed: 340/340 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/65 variables, 65/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 285/350 variables, 49/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/350 variables, 285/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/350 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 338/688 variables, 208/607 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/688 variables, 338/945 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/688 variables, 0/945 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 74/762 variables, 1/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/762 variables, 74/1020 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/762 variables, 0/1020 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 556/1318 variables, 762/1782 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1318 variables, 340/2122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1318 variables, 1/2123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1318 variables, 0/2123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1318 variables, 0/2123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1318/1318 variables, and 2123 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1031 ms.
Refiners :[Domain max(s): 762/762 constraints, Positive P Invariants (semi-flows): 257/257 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 762/762 constraints, ReadFeed: 340/340 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1787ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 51 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=25 )
FORMULA AutoFlight-PT-48a-ReachabilityFireability-2024-05 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 8 ms.
All properties solved without resorting to model-checking.
Total runtime 30113 ms.
ITS solved all properties within timeout

BK_STOP 1717199031327

--------------------
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-48a"
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-48a, 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-171620167200191"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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