About the Execution of LTSMin+red for AutoFlight-PT-96b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 980.079 | 169019.00 | 206822.00 | 555.60 | TFFTTTFFTTTFTFTT | normal |
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-171620167200215.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-96b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r468-smll-171620167200215
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.4M
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K 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.4K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 22:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K Apr 12 22:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Apr 12 22:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Apr 12 22: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 1.9M 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-96b-ReachabilityFireability-2024-00
FORMULA_NAME AutoFlight-PT-96b-ReachabilityFireability-2024-01
FORMULA_NAME AutoFlight-PT-96b-ReachabilityFireability-2024-02
FORMULA_NAME AutoFlight-PT-96b-ReachabilityFireability-2024-03
FORMULA_NAME AutoFlight-PT-96b-ReachabilityFireability-2024-04
FORMULA_NAME AutoFlight-PT-96b-ReachabilityFireability-2024-05
FORMULA_NAME AutoFlight-PT-96b-ReachabilityFireability-2024-06
FORMULA_NAME AutoFlight-PT-96b-ReachabilityFireability-2024-07
FORMULA_NAME AutoFlight-PT-96b-ReachabilityFireability-2024-08
FORMULA_NAME AutoFlight-PT-96b-ReachabilityFireability-2024-09
FORMULA_NAME AutoFlight-PT-96b-ReachabilityFireability-2024-10
FORMULA_NAME AutoFlight-PT-96b-ReachabilityFireability-2024-11
FORMULA_NAME AutoFlight-PT-96b-ReachabilityFireability-2024-12
FORMULA_NAME AutoFlight-PT-96b-ReachabilityFireability-2024-13
FORMULA_NAME AutoFlight-PT-96b-ReachabilityFireability-2024-14
FORMULA_NAME AutoFlight-PT-96b-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1717209052228
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-96b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 02:30:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 02:30:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 02:30:54] [INFO ] Load time of PNML (sax parser for PT used): 618 ms
[2024-06-01 02:30:54] [INFO ] Transformed 7894 places.
[2024-06-01 02:30:54] [INFO ] Transformed 7868 transitions.
[2024-06-01 02:30:54] [INFO ] Found NUPN structural information;
[2024-06-01 02:30:55] [INFO ] Parsed PT model containing 7894 places and 7868 transitions and 18200 arcs in 1189 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 28 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 2611 ms. (15 steps per ms) remains 9/16 properties
FORMULA AutoFlight-PT-96b-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-96b-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-96b-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-96b-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-96b-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-96b-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-96b-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 553 ms. (72 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 237 ms. (168 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 386 ms. (103 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 407 ms. (98 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 426 ms. (93 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 123 ms. (322 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 230 ms. (173 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 9/9 properties
// Phase 1: matrix 7868 rows 7894 cols
[2024-06-01 02:30:57] [INFO ] Computed 514 invariants in 218 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 163/163 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 7379/7542 variables, 480/643 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7542 variables, 7379/8022 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 7542/15762 variables, and 8022 constraints, problems are : Problem set: 0 solved, 9 unsolved in 5058 ms.
Refiners :[Domain max(s): 7542/7894 constraints, Positive P Invariants (semi-flows): 480/513 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/7894 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 163/163 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 7379/7542 variables, 480/643 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7542 variables, 7379/8022 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 02:31:10] [INFO ] Deduced a trap composed of 46 places in 3587 ms of which 299 ms to minimize.
SMT process timed out in 12937ms, After SMT, problems are : Problem set: 0 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 163 out of 7894 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7894/7894 places, 7868/7868 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3201 transitions
Trivial Post-agglo rules discarded 3201 transitions
Performed 3201 trivial Post agglomeration. Transition count delta: 3201
Iterating post reduction 0 with 3201 rules applied. Total rules applied 3201 place count 7894 transition count 4667
Reduce places removed 3201 places and 0 transitions.
Ensure Unique test removed 351 transitions
Reduce isomorphic transitions removed 351 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 166 transitions
Trivial Post-agglo rules discarded 166 transitions
Performed 166 trivial Post agglomeration. Transition count delta: 166
Iterating post reduction 1 with 3718 rules applied. Total rules applied 6919 place count 4693 transition count 4150
Reduce places removed 166 places and 0 transitions.
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Iterating post reduction 2 with 243 rules applied. Total rules applied 7162 place count 4527 transition count 4073
Reduce places removed 77 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 88 rules applied. Total rules applied 7250 place count 4450 transition count 4062
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 7251 place count 4449 transition count 4062
Performed 968 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 968 Pre rules applied. Total rules applied 7251 place count 4449 transition count 3094
Deduced a syphon composed of 968 places in 108 ms
Reduce places removed 968 places and 0 transitions.
Iterating global reduction 5 with 1936 rules applied. Total rules applied 9187 place count 3481 transition count 3094
Discarding 641 places :
Symmetric choice reduction at 5 with 641 rule applications. Total rules 9828 place count 2840 transition count 2453
Iterating global reduction 5 with 641 rules applied. Total rules applied 10469 place count 2840 transition count 2453
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 6 rules applied. Total rules applied 10475 place count 2840 transition count 2447
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 10476 place count 2839 transition count 2447
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 200 Pre rules applied. Total rules applied 10476 place count 2839 transition count 2247
Deduced a syphon composed of 200 places in 36 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 7 with 400 rules applied. Total rules applied 10876 place count 2639 transition count 2247
Performed 632 Post agglomeration using F-continuation condition.Transition count delta: 632
Deduced a syphon composed of 632 places in 6 ms
Reduce places removed 632 places and 0 transitions.
Iterating global reduction 7 with 1264 rules applied. Total rules applied 12140 place count 2007 transition count 1615
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 7 with 12 rules applied. Total rules applied 12152 place count 2001 transition count 1616
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 7 with 12 rules applied. Total rules applied 12164 place count 2001 transition count 1604
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 12174 place count 1996 transition count 1599
Free-agglomeration rule applied 271 times.
Iterating global reduction 7 with 271 rules applied. Total rules applied 12445 place count 1996 transition count 1328
Reduce places removed 271 places and 0 transitions.
Iterating post reduction 7 with 271 rules applied. Total rules applied 12716 place count 1725 transition count 1328
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 12717 place count 1724 transition count 1327
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 12719 place count 1722 transition count 1327
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 2 Pre rules applied. Total rules applied 12719 place count 1722 transition count 1325
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 12723 place count 1720 transition count 1325
Applied a total of 12723 rules in 3475 ms. Remains 1720 /7894 variables (removed 6174) and now considering 1325/7868 (removed 6543) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3493 ms. Remains : 1720/7894 places, 1325/7868 transitions.
RANDOM walk for 40000 steps (179 resets) in 817 ms. (48 steps per ms) remains 5/9 properties
FORMULA AutoFlight-PT-96b-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-96b-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-96b-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-96b-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (14 resets) in 552 ms. (72 steps per ms) remains 4/5 properties
FORMULA AutoFlight-PT-96b-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (12 resets) in 511 ms. (78 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (16 resets) in 331 ms. (120 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (12 resets) in 415 ms. (96 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (13 resets) in 356 ms. (112 steps per ms) remains 4/4 properties
// Phase 1: matrix 1325 rows 1720 cols
[2024-06-01 02:31:14] [INFO ] Computed 512 invariants in 24 ms
[2024-06-01 02:31:14] [INFO ] State equation strengthened by 683 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1318/1425 variables, 467/467 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1425 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 217/1642 variables, 42/509 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1642 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AutoFlight-PT-96b-ReachabilityFireability-2024-07 is UNSAT
FORMULA AutoFlight-PT-96b-ReachabilityFireability-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 76/1718 variables, 2/511 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1718 variables, 0/511 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1325/3043 variables, 1718/2229 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3043 variables, 683/2912 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3043 variables, 0/2912 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 2/3045 variables, 2/2914 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3045 variables, 1/2915 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3045 variables, 0/2915 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/3045 variables, 0/2915 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3045/3045 variables, and 2915 constraints, problems are : Problem set: 1 solved, 3 unsolved in 2882 ms.
Refiners :[Positive P Invariants (semi-flows): 510/510 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1720/1720 constraints, ReadFeed: 683/683 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1311/1366 variables, 459/459 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-06-01 02:31:19] [INFO ] Deduced a trap composed of 5 places in 1381 ms of which 12 ms to minimize.
[2024-06-01 02:31:20] [INFO ] Deduced a trap composed of 8 places in 1038 ms of which 12 ms to minimize.
[2024-06-01 02:31:21] [INFO ] Deduced a trap composed of 8 places in 1171 ms of which 12 ms to minimize.
[2024-06-01 02:31:22] [INFO ] Deduced a trap composed of 6 places in 980 ms of which 11 ms to minimize.
[2024-06-01 02:31:23] [INFO ] Deduced a trap composed of 8 places in 1091 ms of which 12 ms to minimize.
[2024-06-01 02:31:25] [INFO ] Deduced a trap composed of 8 places in 1172 ms of which 17 ms to minimize.
[2024-06-01 02:31:26] [INFO ] Deduced a trap composed of 8 places in 1124 ms of which 12 ms to minimize.
[2024-06-01 02:31:27] [INFO ] Deduced a trap composed of 8 places in 1088 ms of which 17 ms to minimize.
[2024-06-01 02:31:28] [INFO ] Deduced a trap composed of 10 places in 983 ms of which 11 ms to minimize.
[2024-06-01 02:31:29] [INFO ] Deduced a trap composed of 9 places in 1141 ms of which 16 ms to minimize.
[2024-06-01 02:31:30] [INFO ] Deduced a trap composed of 9 places in 1199 ms of which 12 ms to minimize.
[2024-06-01 02:31:31] [INFO ] Deduced a trap composed of 10 places in 1033 ms of which 11 ms to minimize.
[2024-06-01 02:31:32] [INFO ] Deduced a trap composed of 10 places in 855 ms of which 11 ms to minimize.
[2024-06-01 02:31:33] [INFO ] Deduced a trap composed of 8 places in 903 ms of which 12 ms to minimize.
[2024-06-01 02:31:34] [INFO ] Deduced a trap composed of 9 places in 1111 ms of which 11 ms to minimize.
[2024-06-01 02:31:35] [INFO ] Deduced a trap composed of 11 places in 1089 ms of which 17 ms to minimize.
[2024-06-01 02:31:37] [INFO ] Deduced a trap composed of 10 places in 1237 ms of which 17 ms to minimize.
[2024-06-01 02:31:38] [INFO ] Deduced a trap composed of 9 places in 885 ms of which 11 ms to minimize.
[2024-06-01 02:31:39] [INFO ] Deduced a trap composed of 12 places in 1162 ms of which 12 ms to minimize.
[2024-06-01 02:31:40] [INFO ] Deduced a trap composed of 9 places in 1046 ms of which 16 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1366 variables, 20/479 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-06-01 02:31:41] [INFO ] Deduced a trap composed of 10 places in 1231 ms of which 17 ms to minimize.
[2024-06-01 02:31:42] [INFO ] Deduced a trap composed of 9 places in 1132 ms of which 12 ms to minimize.
[2024-06-01 02:31:43] [INFO ] Deduced a trap composed of 9 places in 1128 ms of which 21 ms to minimize.
[2024-06-01 02:31:44] [INFO ] Deduced a trap composed of 10 places in 927 ms of which 12 ms to minimize.
[2024-06-01 02:31:46] [INFO ] Deduced a trap composed of 9 places in 1145 ms of which 17 ms to minimize.
[2024-06-01 02:31:47] [INFO ] Deduced a trap composed of 10 places in 1149 ms of which 11 ms to minimize.
[2024-06-01 02:31:48] [INFO ] Deduced a trap composed of 8 places in 1023 ms of which 11 ms to minimize.
[2024-06-01 02:31:49] [INFO ] Deduced a trap composed of 12 places in 1042 ms of which 16 ms to minimize.
[2024-06-01 02:31:50] [INFO ] Deduced a trap composed of 9 places in 1190 ms of which 17 ms to minimize.
[2024-06-01 02:31:51] [INFO ] Deduced a trap composed of 13 places in 1113 ms of which 11 ms to minimize.
[2024-06-01 02:31:52] [INFO ] Deduced a trap composed of 9 places in 1095 ms of which 11 ms to minimize.
[2024-06-01 02:31:54] [INFO ] Deduced a trap composed of 15 places in 1127 ms of which 16 ms to minimize.
[2024-06-01 02:31:55] [INFO ] Deduced a trap composed of 8 places in 1032 ms of which 13 ms to minimize.
[2024-06-01 02:31:56] [INFO ] Deduced a trap composed of 9 places in 1125 ms of which 11 ms to minimize.
[2024-06-01 02:31:57] [INFO ] Deduced a trap composed of 11 places in 1140 ms of which 11 ms to minimize.
[2024-06-01 02:31:58] [INFO ] Deduced a trap composed of 14 places in 872 ms of which 11 ms to minimize.
[2024-06-01 02:31:59] [INFO ] Deduced a trap composed of 8 places in 1085 ms of which 16 ms to minimize.
[2024-06-01 02:32:00] [INFO ] Deduced a trap composed of 8 places in 964 ms of which 11 ms to minimize.
[2024-06-01 02:32:00] [INFO ] Deduced a trap composed of 44 places in 233 ms of which 5 ms to minimize.
[2024-06-01 02:32:00] [INFO ] Deduced a trap composed of 25 places in 190 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1366 variables, 20/499 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-06-01 02:32:02] [INFO ] Deduced a trap composed of 9 places in 1240 ms of which 12 ms to minimize.
[2024-06-01 02:32:03] [INFO ] Deduced a trap composed of 8 places in 1112 ms of which 12 ms to minimize.
SMT process timed out in 48629ms, After SMT, problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 55 out of 1720 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1720/1720 places, 1325/1325 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 55 place count 1720 transition count 1270
Reduce places removed 55 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 56 rules applied. Total rules applied 111 place count 1665 transition count 1269
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 112 place count 1664 transition count 1269
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 112 place count 1664 transition count 1237
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 176 place count 1632 transition count 1237
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 177 place count 1631 transition count 1236
Iterating global reduction 3 with 1 rules applied. Total rules applied 178 place count 1631 transition count 1236
Performed 66 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 66 places in 1 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 132 rules applied. Total rules applied 310 place count 1565 transition count 1168
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 315 place count 1565 transition count 1163
Renaming transitions due to excessive name length > 1024 char.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 319 place count 1563 transition count 1161
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 323 place count 1561 transition count 1163
Free-agglomeration rule applied 13 times.
Iterating global reduction 4 with 13 rules applied. Total rules applied 336 place count 1561 transition count 1150
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 4 with 13 rules applied. Total rules applied 349 place count 1548 transition count 1150
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 350 place count 1547 transition count 1149
Applied a total of 350 rules in 635 ms. Remains 1547 /1720 variables (removed 173) and now considering 1149/1325 (removed 176) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 635 ms. Remains : 1547/1720 places, 1149/1325 transitions.
RANDOM walk for 40000 steps (208 resets) in 1245 ms. (32 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (15 resets) in 627 ms. (63 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (12 resets) in 755 ms. (52 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (18 resets) in 424 ms. (94 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 78350 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :0 out of 3
Probabilistic random walk after 78350 steps, saw 31775 distinct states, run finished after 3008 ms. (steps per millisecond=26 ) properties seen :0
// Phase 1: matrix 1149 rows 1547 cols
[2024-06-01 02:32:08] [INFO ] Computed 512 invariants in 9 ms
[2024-06-01 02:32:08] [INFO ] State equation strengthened by 728 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1167/1222 variables, 459/459 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1222 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 8/1230 variables, 2/461 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1230 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 243/1473 variables, 2/463 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1473 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 72/1545 variables, 48/511 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1545 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1149/2694 variables, 1545/2056 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2694 variables, 728/2784 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2694 variables, 0/2784 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 2/2696 variables, 2/2786 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2696 variables, 1/2787 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2696 variables, 0/2787 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/2696 variables, 0/2787 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2696/2696 variables, and 2787 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2380 ms.
Refiners :[Positive P Invariants (semi-flows): 510/510 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1547/1547 constraints, ReadFeed: 728/728 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/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1167/1222 variables, 459/459 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 02:32:11] [INFO ] Deduced a trap composed of 3 places in 770 ms of which 11 ms to minimize.
[2024-06-01 02:32:12] [INFO ] Deduced a trap composed of 6 places in 780 ms of which 11 ms to minimize.
[2024-06-01 02:32:13] [INFO ] Deduced a trap composed of 3 places in 709 ms of which 10 ms to minimize.
[2024-06-01 02:32:13] [INFO ] Deduced a trap composed of 5 places in 572 ms of which 10 ms to minimize.
[2024-06-01 02:32:14] [INFO ] Deduced a trap composed of 6 places in 737 ms of which 10 ms to minimize.
[2024-06-01 02:32:15] [INFO ] Deduced a trap composed of 5 places in 759 ms of which 11 ms to minimize.
[2024-06-01 02:32:16] [INFO ] Deduced a trap composed of 5 places in 890 ms of which 10 ms to minimize.
[2024-06-01 02:32:16] [INFO ] Deduced a trap composed of 5 places in 811 ms of which 15 ms to minimize.
[2024-06-01 02:32:17] [INFO ] Deduced a trap composed of 5 places in 894 ms of which 15 ms to minimize.
[2024-06-01 02:32:18] [INFO ] Deduced a trap composed of 5 places in 883 ms of which 15 ms to minimize.
[2024-06-01 02:32:19] [INFO ] Deduced a trap composed of 5 places in 865 ms of which 10 ms to minimize.
[2024-06-01 02:32:20] [INFO ] Deduced a trap composed of 8 places in 900 ms of which 10 ms to minimize.
[2024-06-01 02:32:21] [INFO ] Deduced a trap composed of 6 places in 803 ms of which 15 ms to minimize.
[2024-06-01 02:32:22] [INFO ] Deduced a trap composed of 6 places in 866 ms of which 16 ms to minimize.
[2024-06-01 02:32:23] [INFO ] Deduced a trap composed of 7 places in 868 ms of which 10 ms to minimize.
[2024-06-01 02:32:24] [INFO ] Deduced a trap composed of 5 places in 881 ms of which 10 ms to minimize.
[2024-06-01 02:32:24] [INFO ] Deduced a trap composed of 6 places in 794 ms of which 15 ms to minimize.
[2024-06-01 02:32:25] [INFO ] Deduced a trap composed of 6 places in 844 ms of which 10 ms to minimize.
[2024-06-01 02:32:26] [INFO ] Deduced a trap composed of 6 places in 751 ms of which 10 ms to minimize.
[2024-06-01 02:32:27] [INFO ] Deduced a trap composed of 6 places in 826 ms of which 16 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1222 variables, 20/479 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 02:32:28] [INFO ] Deduced a trap composed of 7 places in 804 ms of which 10 ms to minimize.
[2024-06-01 02:32:29] [INFO ] Deduced a trap composed of 5 places in 830 ms of which 15 ms to minimize.
[2024-06-01 02:32:29] [INFO ] Deduced a trap composed of 6 places in 785 ms of which 9 ms to minimize.
[2024-06-01 02:32:30] [INFO ] Deduced a trap composed of 8 places in 753 ms of which 15 ms to minimize.
[2024-06-01 02:32:31] [INFO ] Deduced a trap composed of 6 places in 867 ms of which 11 ms to minimize.
[2024-06-01 02:32:32] [INFO ] Deduced a trap composed of 5 places in 601 ms of which 10 ms to minimize.
[2024-06-01 02:32:33] [INFO ] Deduced a trap composed of 6 places in 719 ms of which 10 ms to minimize.
[2024-06-01 02:32:33] [INFO ] Deduced a trap composed of 5 places in 799 ms of which 10 ms to minimize.
[2024-06-01 02:32:34] [INFO ] Deduced a trap composed of 5 places in 728 ms of which 10 ms to minimize.
[2024-06-01 02:32:35] [INFO ] Deduced a trap composed of 6 places in 751 ms of which 15 ms to minimize.
[2024-06-01 02:32:36] [INFO ] Deduced a trap composed of 6 places in 864 ms of which 15 ms to minimize.
[2024-06-01 02:32:37] [INFO ] Deduced a trap composed of 5 places in 836 ms of which 10 ms to minimize.
[2024-06-01 02:32:37] [INFO ] Deduced a trap composed of 6 places in 768 ms of which 15 ms to minimize.
[2024-06-01 02:32:38] [INFO ] Deduced a trap composed of 6 places in 806 ms of which 10 ms to minimize.
[2024-06-01 02:32:39] [INFO ] Deduced a trap composed of 6 places in 673 ms of which 10 ms to minimize.
[2024-06-01 02:32:40] [INFO ] Deduced a trap composed of 11 places in 708 ms of which 10 ms to minimize.
[2024-06-01 02:32:41] [INFO ] Deduced a trap composed of 8 places in 862 ms of which 10 ms to minimize.
[2024-06-01 02:32:41] [INFO ] Deduced a trap composed of 6 places in 735 ms of which 15 ms to minimize.
[2024-06-01 02:32:42] [INFO ] Deduced a trap composed of 6 places in 751 ms of which 10 ms to minimize.
[2024-06-01 02:32:43] [INFO ] Deduced a trap composed of 6 places in 772 ms of which 14 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1222 variables, 20/499 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 02:32:44] [INFO ] Deduced a trap composed of 7 places in 803 ms of which 15 ms to minimize.
[2024-06-01 02:32:45] [INFO ] Deduced a trap composed of 6 places in 815 ms of which 10 ms to minimize.
[2024-06-01 02:32:46] [INFO ] Deduced a trap composed of 6 places in 853 ms of which 10 ms to minimize.
[2024-06-01 02:32:46] [INFO ] Deduced a trap composed of 4 places in 136 ms of which 3 ms to minimize.
[2024-06-01 02:32:46] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 3 ms to minimize.
[2024-06-01 02:32:46] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 3 ms to minimize.
[2024-06-01 02:32:46] [INFO ] Deduced a trap composed of 4 places in 133 ms of which 3 ms to minimize.
[2024-06-01 02:32:46] [INFO ] Deduced a trap composed of 6 places in 131 ms of which 3 ms to minimize.
[2024-06-01 02:32:46] [INFO ] Deduced a trap composed of 28 places in 125 ms of which 3 ms to minimize.
[2024-06-01 02:32:47] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 4 ms to minimize.
[2024-06-01 02:32:47] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1222 variables, 11/510 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1222 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 8/1230 variables, 2/512 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 02:32:48] [INFO ] Deduced a trap composed of 6 places in 740 ms of which 15 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1230 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1230 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 243/1473 variables, 2/515 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 02:32:49] [INFO ] Deduced a trap composed of 9 places in 1023 ms of which 12 ms to minimize.
Problem AutoFlight-PT-96b-ReachabilityFireability-2024-09 is UNSAT
FORMULA AutoFlight-PT-96b-ReachabilityFireability-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
[2024-06-01 02:32:49] [INFO ] Deduced a trap composed of 26 places in 180 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1473 variables, 2/517 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-06-01 02:32:50] [INFO ] Deduced a trap composed of 33 places in 159 ms of which 4 ms to minimize.
[2024-06-01 02:32:50] [INFO ] Deduced a trap composed of 31 places in 168 ms of which 9 ms to minimize.
[2024-06-01 02:32:50] [INFO ] Deduced a trap composed of 6 places in 178 ms of which 3 ms to minimize.
[2024-06-01 02:32:50] [INFO ] Deduced a trap composed of 6 places in 172 ms of which 5 ms to minimize.
[2024-06-01 02:32:50] [INFO ] Deduced a trap composed of 7 places in 174 ms of which 4 ms to minimize.
[2024-06-01 02:32:51] [INFO ] Deduced a trap composed of 6 places in 156 ms of which 3 ms to minimize.
[2024-06-01 02:32:51] [INFO ] Deduced a trap composed of 34 places in 159 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1473 variables, 7/524 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1473 variables, 0/524 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 72/1545 variables, 48/572 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-06-01 02:32:52] [INFO ] Deduced a trap composed of 774 places in 685 ms of which 9 ms to minimize.
[2024-06-01 02:32:53] [INFO ] Deduced a trap composed of 774 places in 714 ms of which 9 ms to minimize.
[2024-06-01 02:32:54] [INFO ] Deduced a trap composed of 770 places in 826 ms of which 9 ms to minimize.
[2024-06-01 02:32:54] [INFO ] Deduced a trap composed of 776 places in 756 ms of which 13 ms to minimize.
[2024-06-01 02:32:55] [INFO ] Deduced a trap composed of 776 places in 696 ms of which 9 ms to minimize.
[2024-06-01 02:32:56] [INFO ] Deduced a trap composed of 718 places in 738 ms of which 13 ms to minimize.
[2024-06-01 02:32:57] [INFO ] Deduced a trap composed of 778 places in 832 ms of which 13 ms to minimize.
[2024-06-01 02:32:58] [INFO ] Deduced a trap composed of 711 places in 807 ms of which 9 ms to minimize.
[2024-06-01 02:32:59] [INFO ] Deduced a trap composed of 774 places in 846 ms of which 9 ms to minimize.
[2024-06-01 02:32:59] [INFO ] Deduced a trap composed of 776 places in 735 ms of which 14 ms to minimize.
[2024-06-01 02:33:00] [INFO ] Deduced a trap composed of 771 places in 691 ms of which 8 ms to minimize.
[2024-06-01 02:33:01] [INFO ] Deduced a trap composed of 709 places in 678 ms of which 9 ms to minimize.
[2024-06-01 02:33:02] [INFO ] Deduced a trap composed of 806 places in 746 ms of which 9 ms to minimize.
[2024-06-01 02:33:02] [INFO ] Deduced a trap composed of 770 places in 774 ms of which 14 ms to minimize.
[2024-06-01 02:33:03] [INFO ] Deduced a trap composed of 711 places in 790 ms of which 9 ms to minimize.
[2024-06-01 02:33:04] [INFO ] Deduced a trap composed of 777 places in 817 ms of which 9 ms to minimize.
[2024-06-01 02:33:05] [INFO ] Deduced a trap composed of 776 places in 734 ms of which 13 ms to minimize.
[2024-06-01 02:33:06] [INFO ] Deduced a trap composed of 777 places in 809 ms of which 11 ms to minimize.
[2024-06-01 02:33:07] [INFO ] Deduced a trap composed of 778 places in 815 ms of which 10 ms to minimize.
[2024-06-01 02:33:07] [INFO ] Deduced a trap composed of 776 places in 740 ms of which 13 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1545 variables, 20/592 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-06-01 02:33:08] [INFO ] Deduced a trap composed of 772 places in 805 ms of which 14 ms to minimize.
[2024-06-01 02:33:09] [INFO ] Deduced a trap composed of 766 places in 839 ms of which 8 ms to minimize.
[2024-06-01 02:33:10] [INFO ] Deduced a trap composed of 767 places in 865 ms of which 9 ms to minimize.
[2024-06-01 02:33:11] [INFO ] Deduced a trap composed of 768 places in 703 ms of which 8 ms to minimize.
[2024-06-01 02:33:12] [INFO ] Deduced a trap composed of 770 places in 675 ms of which 9 ms to minimize.
[2024-06-01 02:33:12] [INFO ] Deduced a trap composed of 769 places in 700 ms of which 13 ms to minimize.
[2024-06-01 02:33:13] [INFO ] Deduced a trap composed of 718 places in 798 ms of which 9 ms to minimize.
[2024-06-01 02:33:14] [INFO ] Deduced a trap composed of 774 places in 734 ms of which 13 ms to minimize.
[2024-06-01 02:33:15] [INFO ] Deduced a trap composed of 770 places in 788 ms of which 9 ms to minimize.
[2024-06-01 02:33:16] [INFO ] Deduced a trap composed of 768 places in 833 ms of which 9 ms to minimize.
[2024-06-01 02:33:17] [INFO ] Deduced a trap composed of 783 places in 842 ms of which 9 ms to minimize.
[2024-06-01 02:33:17] [INFO ] Deduced a trap composed of 779 places in 708 ms of which 11 ms to minimize.
[2024-06-01 02:33:18] [INFO ] Deduced a trap composed of 770 places in 724 ms of which 9 ms to minimize.
[2024-06-01 02:33:19] [INFO ] Deduced a trap composed of 770 places in 732 ms of which 13 ms to minimize.
[2024-06-01 02:33:20] [INFO ] Deduced a trap composed of 776 places in 832 ms of which 9 ms to minimize.
[2024-06-01 02:33:21] [INFO ] Deduced a trap composed of 772 places in 849 ms of which 9 ms to minimize.
[2024-06-01 02:33:21] [INFO ] Deduced a trap composed of 768 places in 812 ms of which 13 ms to minimize.
[2024-06-01 02:33:22] [INFO ] Deduced a trap composed of 776 places in 629 ms of which 8 ms to minimize.
[2024-06-01 02:33:23] [INFO ] Deduced a trap composed of 774 places in 773 ms of which 13 ms to minimize.
[2024-06-01 02:33:24] [INFO ] Deduced a trap composed of 768 places in 807 ms of which 14 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1545 variables, 20/612 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-06-01 02:33:25] [INFO ] Deduced a trap composed of 770 places in 822 ms of which 9 ms to minimize.
[2024-06-01 02:33:26] [INFO ] Deduced a trap composed of 770 places in 827 ms of which 9 ms to minimize.
SMT process timed out in 78063ms, After SMT, problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 52 out of 1547 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1547/1547 places, 1149/1149 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1547 transition count 1148
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1546 transition count 1148
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 1546 transition count 1147
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 1545 transition count 1147
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 1543 transition count 1145
Applied a total of 8 rules in 157 ms. Remains 1543 /1547 variables (removed 4) and now considering 1145/1149 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 158 ms. Remains : 1543/1547 places, 1145/1149 transitions.
RANDOM walk for 40000 steps (193 resets) in 1068 ms. (37 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (14 resets) in 808 ms. (49 steps per ms) remains 1/2 properties
FORMULA AutoFlight-PT-96b-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (19 resets) in 558 ms. (71 steps per ms) remains 1/1 properties
// Phase 1: matrix 1145 rows 1543 cols
[2024-06-01 02:33:27] [INFO ] Computed 512 invariants in 9 ms
[2024-06-01 02:33:27] [INFO ] State equation strengthened by 729 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 108/120 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1082/1202 variables, 445/457 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1202 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 258/1460 variables, 2/459 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1460 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 81/1541 variables, 52/511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1541 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1145/2686 variables, 1541/2052 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2686 variables, 729/2781 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2686 variables, 0/2781 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/2688 variables, 2/2783 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2688 variables, 1/2784 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2688 variables, 0/2784 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/2688 variables, 0/2784 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2688/2688 variables, and 2784 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1402 ms.
Refiners :[Positive P Invariants (semi-flows): 510/510 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1543/1543 constraints, ReadFeed: 729/729 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/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 108/120 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1082/1202 variables, 445/457 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 02:33:29] [INFO ] Deduced a trap composed of 7 places in 323 ms of which 5 ms to minimize.
[2024-06-01 02:33:29] [INFO ] Deduced a trap composed of 4 places in 304 ms of which 5 ms to minimize.
[2024-06-01 02:33:29] [INFO ] Deduced a trap composed of 4 places in 295 ms of which 5 ms to minimize.
[2024-06-01 02:33:30] [INFO ] Deduced a trap composed of 4 places in 308 ms of which 5 ms to minimize.
[2024-06-01 02:33:30] [INFO ] Deduced a trap composed of 4 places in 306 ms of which 5 ms to minimize.
[2024-06-01 02:33:30] [INFO ] Deduced a trap composed of 4 places in 296 ms of which 5 ms to minimize.
[2024-06-01 02:33:31] [INFO ] Deduced a trap composed of 4 places in 424 ms of which 7 ms to minimize.
[2024-06-01 02:33:31] [INFO ] Deduced a trap composed of 4 places in 292 ms of which 5 ms to minimize.
[2024-06-01 02:33:31] [INFO ] Deduced a trap composed of 4 places in 305 ms of which 4 ms to minimize.
[2024-06-01 02:33:32] [INFO ] Deduced a trap composed of 4 places in 304 ms of which 5 ms to minimize.
[2024-06-01 02:33:32] [INFO ] Deduced a trap composed of 6 places in 299 ms of which 5 ms to minimize.
[2024-06-01 02:33:32] [INFO ] Deduced a trap composed of 9 places in 292 ms of which 5 ms to minimize.
[2024-06-01 02:33:33] [INFO ] Deduced a trap composed of 12 places in 287 ms of which 5 ms to minimize.
[2024-06-01 02:33:33] [INFO ] Deduced a trap composed of 6 places in 283 ms of which 5 ms to minimize.
[2024-06-01 02:33:33] [INFO ] Deduced a trap composed of 7 places in 264 ms of which 4 ms to minimize.
[2024-06-01 02:33:34] [INFO ] Deduced a trap composed of 5 places in 369 ms of which 6 ms to minimize.
[2024-06-01 02:33:34] [INFO ] Deduced a trap composed of 4 places in 287 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1202 variables, 17/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1202 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 258/1460 variables, 2/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 02:33:34] [INFO ] Deduced a trap composed of 5 places in 350 ms of which 5 ms to minimize.
[2024-06-01 02:33:35] [INFO ] Deduced a trap composed of 5 places in 363 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1460 variables, 2/478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1460 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 81/1541 variables, 52/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 02:33:36] [INFO ] Deduced a trap composed of 22 places in 166 ms of which 3 ms to minimize.
[2024-06-01 02:33:36] [INFO ] Deduced a trap composed of 30 places in 174 ms of which 3 ms to minimize.
[2024-06-01 02:33:36] [INFO ] Deduced a trap composed of 8 places in 158 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1541 variables, 3/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1541 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1145/2686 variables, 1541/2074 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2686 variables, 729/2803 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2686 variables, 1/2804 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2686 variables, 0/2804 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/2688 variables, 2/2806 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2688 variables, 1/2807 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2688 variables, 0/2807 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/2688 variables, 0/2807 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2688/2688 variables, and 2807 constraints, problems are : Problem set: 0 solved, 1 unsolved in 12688 ms.
Refiners :[Positive P Invariants (semi-flows): 510/510 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1543/1543 constraints, ReadFeed: 729/729 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 22/22 constraints]
After SMT, in 14129ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 176 steps, including 1 resets, run visited all 1 properties in 3 ms. (steps per millisecond=58 )
FORMULA AutoFlight-PT-96b-ReachabilityFireability-2024-15 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 14 ms.
All properties solved without resorting to model-checking.
Total runtime 167259 ms.
ITS solved all properties within timeout
BK_STOP 1717209221247
--------------------
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-96b"
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-96b, 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-171620167200215"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-96b.tgz
mv AutoFlight-PT-96b 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 '
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 ;