About the Execution of LTSMin+red for MultiCrashLeafsetExtension-PT-S24C02
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5822.092 | 486362.00 | 558868.00 | 975.90 | FTFTT??TFFT?TFTT | 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.r508-tall-171654350800063.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 MultiCrashLeafsetExtension-PT-S24C02, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r508-tall-171654350800063
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 8.1M
-rw-r--r-- 1 mcc users 9.7K 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 9.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.0K Apr 22 14:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K Apr 22 14:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 22 14:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K Apr 12 05:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Apr 12 05:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 12 05:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 12 05:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Apr 22 14:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Apr 22 14:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 7.6M May 18 16:43 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 MultiCrashLeafsetExtension-PT-S24C02-ReachabilityFireability-2024-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-ReachabilityFireability-2024-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-ReachabilityFireability-2024-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-ReachabilityFireability-2024-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-ReachabilityFireability-2024-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-ReachabilityFireability-2024-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-ReachabilityFireability-2024-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-ReachabilityFireability-2024-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-ReachabilityFireability-2024-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-ReachabilityFireability-2024-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-ReachabilityFireability-2024-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-ReachabilityFireability-2024-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-ReachabilityFireability-2024-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-ReachabilityFireability-2024-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-ReachabilityFireability-2024-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C02-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1717199831184
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S24C02
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 23:57:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 23:57:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 23:57:13] [INFO ] Load time of PNML (sax parser for PT used): 509 ms
[2024-05-31 23:57:13] [INFO ] Transformed 7032 places.
[2024-05-31 23:57:13] [INFO ] Transformed 10855 transitions.
[2024-05-31 23:57:13] [INFO ] Parsed PT model containing 7032 places and 10855 transitions and 46214 arcs in 665 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (1881 resets) in 2367 ms. (16 steps per ms) remains 12/16 properties
FORMULA MultiCrashLeafsetExtension-PT-S24C02-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C02-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C02-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C02-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (340 resets) in 403 ms. (99 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (340 resets) in 368 ms. (108 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (340 resets) in 682 ms. (58 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (340 resets) in 284 ms. (140 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (340 resets) in 249 ms. (160 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (340 resets) in 168 ms. (236 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (340 resets) in 1199 ms. (33 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (340 resets) in 211 ms. (188 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (340 resets) in 196 ms. (203 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (340 resets) in 154 ms. (258 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (340 resets) in 218 ms. (182 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (340 resets) in 240 ms. (165 steps per ms) remains 12/12 properties
[2024-05-31 23:57:15] [INFO ] Flow matrix only has 10255 transitions (discarded 600 similar events)
// Phase 1: matrix 10255 rows 7032 cols
[2024-05-31 23:57:15] [INFO ] Computed 813 invariants in 592 ms
[2024-05-31 23:57:16] [INFO ] State equation strengthened by 3202 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem MultiCrashLeafsetExtension-PT-S24C02-ReachabilityFireability-2024-08 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S24C02-ReachabilityFireability-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S24C02-ReachabilityFireability-2024-15 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S24C02-ReachabilityFireability-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 2296/2533 variables, 23/50 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2533 variables, 7/57 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2533 variables, 0/57 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 10/2543 variables, 10/67 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2543 variables, 0/67 constraints. Problems are: Problem set: 2 solved, 10 unsolved
Problem MultiCrashLeafsetExtension-PT-S24C02-ReachabilityFireability-2024-03 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S24C02-ReachabilityFireability-2024-03 TRUE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S24C02-ReachabilityFireability-2024-09 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S24C02-ReachabilityFireability-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 8 (OVERLAPS) 3240/5783 variables, 366/433 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5783 variables, 0/433 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 1249/7032 variables, 380/813 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/7032 variables, 0/813 constraints. Problems are: Problem set: 4 solved, 8 unsolved
SMT process timed out in 6148ms, After SMT, problems are : Problem set: 4 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 80 out of 7032 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7032/7032 places, 10855/10855 transitions.
Graph (complete) has 26261 edges and 7032 vertex of which 7000 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.30 ms
Discarding 32 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1158 transitions
Trivial Post-agglo rules discarded 1158 transitions
Performed 1158 trivial Post agglomeration. Transition count delta: 1158
Iterating post reduction 0 with 1158 rules applied. Total rules applied 1159 place count 7000 transition count 9697
Reduce places removed 1158 places and 0 transitions.
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Iterating post reduction 1 with 1194 rules applied. Total rules applied 2353 place count 5842 transition count 9661
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 2 with 36 rules applied. Total rules applied 2389 place count 5806 transition count 9661
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 96 Pre rules applied. Total rules applied 2389 place count 5806 transition count 9565
Deduced a syphon composed of 96 places in 10 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 2581 place count 5710 transition count 9565
Discarding 1091 places :
Symmetric choice reduction at 3 with 1091 rule applications. Total rules 3672 place count 4619 transition count 8474
Iterating global reduction 3 with 1091 rules applied. Total rules applied 4763 place count 4619 transition count 8474
Discarding 538 places :
Symmetric choice reduction at 3 with 538 rule applications. Total rules 5301 place count 4081 transition count 7398
Iterating global reduction 3 with 538 rules applied. Total rules applied 5839 place count 4081 transition count 7398
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 5 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 5879 place count 4061 transition count 7378
Free-agglomeration rule (complex) applied 238 times.
Iterating global reduction 3 with 238 rules applied. Total rules applied 6117 place count 4061 transition count 7140
Reduce places removed 238 places and 0 transitions.
Iterating post reduction 3 with 238 rules applied. Total rules applied 6355 place count 3823 transition count 7140
Partial Free-agglomeration rule applied 97 times.
Drop transitions (Partial Free agglomeration) removed 97 transitions
Iterating global reduction 4 with 97 rules applied. Total rules applied 6452 place count 3823 transition count 7140
Applied a total of 6452 rules in 4396 ms. Remains 3823 /7032 variables (removed 3209) and now considering 7140/10855 (removed 3715) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4413 ms. Remains : 3823/7032 places, 7140/10855 transitions.
RANDOM walk for 40000 steps (2627 resets) in 769 ms. (51 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (356 resets) in 146 ms. (272 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (356 resets) in 232 ms. (171 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (360 resets) in 167 ms. (238 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (356 resets) in 151 ms. (263 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (356 resets) in 131 ms. (303 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (358 resets) in 138 ms. (287 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (356 resets) in 112 ms. (354 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (356 resets) in 172 ms. (231 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 22842 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :0 out of 8
Probabilistic random walk after 22842 steps, saw 10495 distinct states, run finished after 3004 ms. (steps per millisecond=7 ) properties seen :0
[2024-05-31 23:57:29] [INFO ] Flow matrix only has 6302 transitions (discarded 838 similar events)
// Phase 1: matrix 6302 rows 3823 cols
[2024-05-31 23:57:29] [INFO ] Computed 781 invariants in 151 ms
[2024-05-31 23:57:29] [INFO ] State equation strengthened by 2664 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 2731/2811 variables, 28/34 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2811 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2811 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 4/2815 variables, 4/39 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2815 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 855/3670 variables, 589/628 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3670 variables, 0/628 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 12/3682 variables, 12/640 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3682 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 141/3823 variables, 141/781 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3823 variables, 0/781 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 6302/10125 variables, 3823/4604 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem MultiCrashLeafsetExtension-PT-S24C02-ReachabilityFireability-2024-01 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S24C02-ReachabilityFireability-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S24C02-ReachabilityFireability-2024-02 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S24C02-ReachabilityFireability-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S24C02-ReachabilityFireability-2024-07 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S24C02-ReachabilityFireability-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S24C02-ReachabilityFireability-2024-10 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S24C02-ReachabilityFireability-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S24C02-ReachabilityFireability-2024-13 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S24C02-ReachabilityFireability-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 15 (INCLUDED_ONLY) 0/10125 variables, 2664/7268 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/10125 variables, 0/7268 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/10125 variables, 0/7268 constraints. Problems are: Problem set: 5 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 10125/10125 variables, and 7268 constraints, problems are : Problem set: 5 solved, 3 unsolved in 9604 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, Generalized P Invariants (flows): 732/732 constraints, State Equation: 3823/3823 constraints, ReadFeed: 2664/2664 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 1/1 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 2754/2764 variables, 8/9 constraints. Problems are: Problem set: 5 solved, 3 unsolved
[2024-05-31 23:57:41] [INFO ] Deduced a trap composed of 489 places in 1170 ms of which 104 ms to minimize.
[2024-05-31 23:57:42] [INFO ] Deduced a trap composed of 662 places in 1022 ms of which 11 ms to minimize.
[2024-05-31 23:57:43] [INFO ] Deduced a trap composed of 477 places in 1006 ms of which 13 ms to minimize.
[2024-05-31 23:57:44] [INFO ] Deduced a trap composed of 399 places in 1064 ms of which 11 ms to minimize.
[2024-05-31 23:57:45] [INFO ] Deduced a trap composed of 339 places in 1062 ms of which 11 ms to minimize.
[2024-05-31 23:57:46] [INFO ] Deduced a trap composed of 339 places in 1015 ms of which 11 ms to minimize.
[2024-05-31 23:57:47] [INFO ] Deduced a trap composed of 341 places in 956 ms of which 10 ms to minimize.
[2024-05-31 23:57:48] [INFO ] Deduced a trap composed of 422 places in 973 ms of which 11 ms to minimize.
[2024-05-31 23:57:49] [INFO ] Deduced a trap composed of 364 places in 955 ms of which 10 ms to minimize.
[2024-05-31 23:57:50] [INFO ] Deduced a trap composed of 419 places in 1057 ms of which 11 ms to minimize.
[2024-05-31 23:57:51] [INFO ] Deduced a trap composed of 353 places in 1063 ms of which 12 ms to minimize.
[2024-05-31 23:57:52] [INFO ] Deduced a trap composed of 452 places in 1040 ms of which 11 ms to minimize.
[2024-05-31 23:57:54] [INFO ] Deduced a trap composed of 405 places in 1669 ms of which 16 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/2764 variables, 13/22 constraints. Problems are: Problem set: 5 solved, 3 unsolved
[2024-05-31 23:57:56] [INFO ] Deduced a trap composed of 364 places in 1108 ms of which 13 ms to minimize.
[2024-05-31 23:57:57] [INFO ] Deduced a trap composed of 414 places in 1011 ms of which 11 ms to minimize.
[2024-05-31 23:57:58] [INFO ] Deduced a trap composed of 373 places in 1053 ms of which 10 ms to minimize.
[2024-05-31 23:57:59] [INFO ] Deduced a trap composed of 370 places in 1042 ms of which 12 ms to minimize.
[2024-05-31 23:58:00] [INFO ] Deduced a trap composed of 345 places in 1045 ms of which 11 ms to minimize.
[2024-05-31 23:58:01] [INFO ] Deduced a trap composed of 398 places in 1035 ms of which 11 ms to minimize.
[2024-05-31 23:58:02] [INFO ] Deduced a trap composed of 363 places in 962 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/2764 variables, 7/29 constraints. Problems are: Problem set: 5 solved, 3 unsolved
[2024-05-31 23:58:03] [INFO ] Deduced a trap composed of 384 places in 1032 ms of which 11 ms to minimize.
[2024-05-31 23:58:04] [INFO ] Deduced a trap composed of 373 places in 1026 ms of which 11 ms to minimize.
[2024-05-31 23:58:05] [INFO ] Deduced a trap composed of 420 places in 1024 ms of which 11 ms to minimize.
[2024-05-31 23:58:06] [INFO ] Deduced a trap composed of 364 places in 1002 ms of which 11 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/2764 variables, 4/33 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2764 variables, 0/33 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 876/3640 variables, 589/622 constraints. Problems are: Problem set: 5 solved, 3 unsolved
[2024-05-31 23:58:10] [INFO ] Deduced a trap composed of 6 places in 3084 ms of which 22 ms to minimize.
[2024-05-31 23:58:13] [INFO ] Deduced a trap composed of 61 places in 3110 ms of which 23 ms to minimize.
[2024-05-31 23:58:16] [INFO ] Deduced a trap composed of 92 places in 3088 ms of which 21 ms to minimize.
[2024-05-31 23:58:20] [INFO ] Deduced a trap composed of 92 places in 2987 ms of which 23 ms to minimize.
[2024-05-31 23:58:23] [INFO ] Deduced a trap composed of 260 places in 3195 ms of which 23 ms to minimize.
[2024-05-31 23:58:26] [INFO ] Deduced a trap composed of 137 places in 3049 ms of which 21 ms to minimize.
SMT process timed out in 56768ms, After SMT, problems are : Problem set: 5 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 10 out of 3823 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3823/3823 places, 7140/7140 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 3823 transition count 7135
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 3818 transition count 7135
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 10 place count 3818 transition count 7131
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 18 place count 3814 transition count 7131
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 24 place count 3808 transition count 7122
Iterating global reduction 2 with 6 rules applied. Total rules applied 30 place count 3808 transition count 7122
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 33 place count 3805 transition count 7116
Iterating global reduction 2 with 3 rules applied. Total rules applied 36 place count 3805 transition count 7116
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 42 place count 3802 transition count 7113
Free-agglomeration rule (complex) applied 95 times.
Iterating global reduction 2 with 95 rules applied. Total rules applied 137 place count 3802 transition count 7551
Reduce places removed 95 places and 0 transitions.
Iterating post reduction 2 with 95 rules applied. Total rules applied 232 place count 3707 transition count 7551
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 237 place count 3702 transition count 7546
Iterating global reduction 3 with 5 rules applied. Total rules applied 242 place count 3702 transition count 7546
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 243 place count 3702 transition count 7546
Applied a total of 243 rules in 3104 ms. Remains 3702 /3823 variables (removed 121) and now considering 7546/7140 (removed -406) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3104 ms. Remains : 3702/3823 places, 7546/7140 transitions.
RANDOM walk for 40000 steps (3047 resets) in 760 ms. (52 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (364 resets) in 129 ms. (307 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (364 resets) in 118 ms. (336 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (364 resets) in 123 ms. (322 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 25903 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :0 out of 3
Probabilistic random walk after 25903 steps, saw 11662 distinct states, run finished after 3001 ms. (steps per millisecond=8 ) properties seen :0
[2024-05-31 23:58:32] [INFO ] Flow matrix only has 6671 transitions (discarded 875 similar events)
// Phase 1: matrix 6671 rows 3702 cols
[2024-05-31 23:58:33] [INFO ] Computed 781 invariants in 176 ms
[2024-05-31 23:58:33] [INFO ] State equation strengthened by 3191 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 2641/2651 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 23:58:34] [INFO ] Deduced a trap composed of 446 places in 1167 ms of which 16 ms to minimize.
[2024-05-31 23:58:35] [INFO ] Deduced a trap composed of 367 places in 1228 ms of which 13 ms to minimize.
[2024-05-31 23:58:37] [INFO ] Deduced a trap composed of 334 places in 1155 ms of which 12 ms to minimize.
[2024-05-31 23:58:38] [INFO ] Deduced a trap composed of 453 places in 1197 ms of which 12 ms to minimize.
[2024-05-31 23:58:39] [INFO ] Deduced a trap composed of 470 places in 1176 ms of which 12 ms to minimize.
[2024-05-31 23:58:40] [INFO ] Deduced a trap composed of 349 places in 1174 ms of which 12 ms to minimize.
[2024-05-31 23:58:42] [INFO ] Deduced a trap composed of 421 places in 1213 ms of which 12 ms to minimize.
[2024-05-31 23:58:43] [INFO ] Deduced a trap composed of 305 places in 1153 ms of which 12 ms to minimize.
[2024-05-31 23:58:44] [INFO ] Deduced a trap composed of 329 places in 1178 ms of which 13 ms to minimize.
[2024-05-31 23:58:45] [INFO ] Deduced a trap composed of 279 places in 1177 ms of which 13 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/2651 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2651 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 846/3497 variables, 567/586 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/3497 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 40/3537 variables, 40/626 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3537 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 165/3702 variables, 165/791 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3702 variables, 0/791 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 6671/10373 variables, 3702/4493 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/10373 variables, 3191/7684 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/10373 variables, 0/7684 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/10373 variables, 0/7684 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 10373/10373 variables, and 7684 constraints, problems are : Problem set: 0 solved, 3 unsolved in 19954 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, Generalized P Invariants (flows): 732/732 constraints, State Equation: 3702/3702 constraints, ReadFeed: 3191/3191 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 2641/2651 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2651 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 23:58:54] [INFO ] Deduced a trap composed of 292 places in 1233 ms of which 12 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/2651 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2651 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 846/3497 variables, 567/587 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 23:58:58] [INFO ] Deduced a trap composed of 5 places in 3461 ms of which 23 ms to minimize.
[2024-05-31 23:59:02] [INFO ] Deduced a trap composed of 160 places in 3421 ms of which 20 ms to minimize.
[2024-05-31 23:59:05] [INFO ] Deduced a trap composed of 158 places in 3339 ms of which 25 ms to minimize.
[2024-05-31 23:59:09] [INFO ] Deduced a trap composed of 92 places in 3398 ms of which 25 ms to minimize.
[2024-05-31 23:59:12] [INFO ] Deduced a trap composed of 191 places in 3402 ms of which 33 ms to minimize.
[2024-05-31 23:59:16] [INFO ] Deduced a trap composed of 182 places in 3434 ms of which 24 ms to minimize.
[2024-05-31 23:59:19] [INFO ] Deduced a trap composed of 202 places in 3309 ms of which 23 ms to minimize.
[2024-05-31 23:59:22] [INFO ] Deduced a trap composed of 208 places in 3288 ms of which 23 ms to minimize.
[2024-05-31 23:59:25] [INFO ] Deduced a trap composed of 183 places in 3207 ms of which 24 ms to minimize.
[2024-05-31 23:59:29] [INFO ] Deduced a trap composed of 167 places in 3100 ms of which 24 ms to minimize.
[2024-05-31 23:59:32] [INFO ] Deduced a trap composed of 187 places in 3307 ms of which 22 ms to minimize.
[2024-05-31 23:59:35] [INFO ] Deduced a trap composed of 161 places in 3106 ms of which 20 ms to minimize.
[2024-05-31 23:59:38] [INFO ] Deduced a trap composed of 189 places in 3130 ms of which 22 ms to minimize.
[2024-05-31 23:59:42] [INFO ] Deduced a trap composed of 177 places in 3226 ms of which 23 ms to minimize.
[2024-05-31 23:59:45] [INFO ] Deduced a trap composed of 141 places in 3221 ms of which 23 ms to minimize.
[2024-05-31 23:59:48] [INFO ] Deduced a trap composed of 221 places in 3345 ms of which 25 ms to minimize.
[2024-05-31 23:59:51] [INFO ] Deduced a trap composed of 189 places in 3133 ms of which 24 ms to minimize.
[2024-05-31 23:59:55] [INFO ] Deduced a trap composed of 206 places in 3526 ms of which 25 ms to minimize.
[2024-05-31 23:59:58] [INFO ] Deduced a trap composed of 188 places in 3096 ms of which 19 ms to minimize.
[2024-06-01 00:00:01] [INFO ] Deduced a trap composed of 173 places in 3170 ms of which 23 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/3497 variables, 20/607 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 00:00:05] [INFO ] Deduced a trap composed of 120 places in 3288 ms of which 22 ms to minimize.
[2024-06-01 00:00:08] [INFO ] Deduced a trap composed of 210 places in 3338 ms of which 24 ms to minimize.
SMT process timed out in 95845ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 10 out of 3702 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3702/3702 places, 7546/7546 transitions.
Applied a total of 0 rules in 529 ms. Remains 3702 /3702 variables (removed 0) and now considering 7546/7546 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 529 ms. Remains : 3702/3702 places, 7546/7546 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3702/3702 places, 7546/7546 transitions.
Applied a total of 0 rules in 529 ms. Remains 3702 /3702 variables (removed 0) and now considering 7546/7546 (removed 0) transitions.
[2024-06-01 00:00:09] [INFO ] Flow matrix only has 6671 transitions (discarded 875 similar events)
[2024-06-01 00:00:09] [INFO ] Invariant cache hit.
[2024-06-01 00:00:17] [INFO ] Implicit Places using invariants in 7355 ms returned [4, 7, 9, 10, 11, 15, 21, 29, 39, 51, 65, 81, 99, 119, 141, 164, 186, 187, 188, 208, 226, 242, 256, 268, 278, 287, 293, 297, 300, 307, 313, 315, 316, 317, 319, 323, 330, 338, 348, 360, 374, 390, 408, 428, 449, 469, 470, 471, 489, 505, 519, 531, 541, 549, 556, 560, 562, 564, 571, 577, 579, 580, 581, 583, 585, 589, 595, 603, 613, 625, 639, 655, 673, 692, 710, 711, 712, 728, 742, 754, 764, 772, 778, 783, 785, 787, 789, 796, 802, 804, 805, 806, 808, 810, 812, 816, 822, 830, 840, 852, 866, 882, 899, 915, 916, 917, 931, 943, 953, 961, 967, 971, 974, 976, 978, 980, 987, 993, 995, 996, 997, 999, 1001, 1003, 1005, 1009, 1015, 1023, 1033, 1045, 1059, 1074, 1088, 1089, 1090, 1102, 1112, 1120, 1126, 1130, 1132, 1134, 1136, 1138, 1140, 1147, 1153, 1155, 1156, 1157, 1159, 1161, 1163, 1165, 1167, 1171, 1177, 1185, 1195, 1207, 1220, 1233, 1234, 1235, 1245, 1253, 1259, 1263, 1265, 1267, 1269, 1271, 1273, 1275, 1282, 1288, 1290, 1291, 1292, 1294, 1296, 1298, 1300, 1302, 1304, 1308, 1314, 1322, 1332, 1343, 1353, 1354, 1355, 1363, 1369, 1373, 1375, 1377, 1379, 1381, 1383, 1385, 1387, 1394, 1400, 1402, 1403, 1404, 1406, 1408, 1410, 1412, 1414, 1416, 1418, 1422, 1428, 1436, 1445, 1453, 1454, 1455, 1461, 1465, 1467, 1469, 1471, 1473, 1475, 1477, 1479, 1481, 1488, 1494, 1496, 1497, 1498, 1500, 1502, 1504, 1506, 1508, 1510, 1512, 1514, 1518, 1524, 1531, 1537, 1538, 1539, 1543, 1545, 1547, 1549, 1551, 1553, 1555, 1557, 1559, 1561, 1568, 1574, 1576, 1577, 1578, 1580, 1582, 1584, 1586, 1588, 1590, 1592, 1594, 1596, 1600, 1605, 1609, 1610, 1611, 1613, 1615, 1617, 1619, 1621, 1623, 1625, 1627, 1629, 1631, 1638, 1644, 1646, 1647, 1648, 1650, 1652, 1654, 1656, 1658, 1660, 1662, 1664, 1666, 1668, 1671, 1673, 1674, 1675, 1677, 1679, 1681, 1683, 1685, 1687, 1689, 1691, 1693, 1695, 1702, 1708, 1710, 1711, 1712, 1714, 1716, 1718, 1720, 1722, 1724, 1726, 1728, 1730, 1732, 1734, 1736, 1737, 1738, 1740, 1742, 1744, 1746, 1748, 1750, 1752, 1754, 1756, 1758, 1765, 1767, 1770, 1772, 1773, 1774, 1776, 1778, 1780, 1782, 1784, 1786, 1788, 1790, 1792, 1794, 1796, 1798, 1799, 1800, 1802, 1804, 1806, 1808, 1810, 1812, 1814, 1816, 1818, 1820, 1827, 1833, 1835, 1836, 1837, 1839, 1841, 1843, 1845, 1847, 1849, 1851, 1853, 1855, 1857, 1859, 1861, 1862, 1863, 1865, 1867, 1869, 1871, 1873, 1875, 1877, 1879, 1881, 1883, 1890, 1896, 1898, 1899, 1900, 1902, 1904, 1906, 1908, 1910, 1912, 1914, 1916, 1918, 1920, 1922, 1925, 1926, 1927, 1929, 1931, 1933, 1935, 1937, 1939, 1941, 1943, 1945, 1947, 1954, 1960, 1962, 1963, 1964, 1966, 1968, 1970, 1972, 1974, 1976, 1978, 1980, 1982, 1984, 1988, 1993, 1994, 1995, 1999, 2001, 2003, 2005, 2007, 2009, 2011, 2013, 2015, 2017, 2024, 2030, 2032, 2033, 2034, 2036, 2038, 2040, 2042, 2044, 2046, 2048, 2050, 2052, 2056, 2062, 2069, 2070, 2071, 2077, 2081, 2083, 2085, 2087, 2089, 2091, 2093, 2095, 2097, 2104, 2110, 2112, 2114, 2116, 2118, 2120, 2122, 2124, 2128, 2130, 2132, 2136, 2142, 2150, 2159, 2160, 2161, 2169, 2175, 2179, 2181, 2183, 2185, 2187, 2189, 2191, 2193, 2200, 2206, 2208, 2209, 2210, 2212, 2214, 2216, 2218, 2220, 2222, 2224, 2228, 2234, 2242, 2252, 2263, 2264, 2265, 2275, 2283, 2289, 2293, 2295, 2297, 2299, 2301, 2303, 2305, 2312, 2318, 2320, 2321, 2322, 2324, 2326, 2328, 2330, 2332, 2334, 2338, 2344, 2352, 2362, 2374, 2387, 2388, 2389, 2401, 2411, 2419, 2425, 2429, 2431, 2433, 2435, 2437, 2439, 2446, 2453, 2455, 2456, 2457, 2459, 2461, 2463, 2465, 2467, 2471, 2477, 2485, 2495, 2507, 2521, 2536, 2537, 2538, 2552, 2564, 2574, 2582, 2588, 2592, 2594, 2596, 2598, 2600, 2607, 2613, 2615, 2616, 2617, 2619, 2621, 2623, 2625, 2629, 2635, 2643, 2653, 2665, 2679, 2695, 2712, 2713, 2714, 2730, 2744, 2756, 2766, 2774, 2780, 2784, 2787, 2789, 2791, 2798, 2804, 2806, 2807, 2808, 2810, 2812, 2814, 2818, 2824, 2832, 2842, 2854, 2868, 2884, 2902, 2921, 2922, 2923, 2941, 2957, 2971, 2983, 2993, 3001, 3007, 3012, 3014, 3016, 3023, 3030, 3032, 3033, 3034, 3036, 3038, 3042, 3048, 3056, 3066, 3078, 3092, 3108, 3126, 3146, 3167, 3168, 3169, 3189, 3207, 3223, 3237, 3249, 3259, 3267, 3274, 3278, 3280, 3287, 3289, 3292, 3294, 3295, 3296, 3298, 3302, 3308, 3316, 3326, 3338, 3352, 3368, 3386, 3406, 3428, 3451, 3452, 3453, 3475, 3495, 3513, 3529, 3543, 3555, 3565, 3574, 3580, 3584, 3592]
[2024-06-01 00:00:17] [INFO ] Actually due to overlaps returned [307, 571, 796, 987, 1147, 1282, 1394, 1488, 1568, 1638, 1702, 1765, 1827, 1890, 1954, 2024, 2104, 2200, 2312, 2446, 2607, 2798, 3023, 3287, 3592, 4, 9, 10, 186, 187, 315, 316, 469, 470, 579, 580, 710, 711, 804, 805, 915, 916, 995, 996, 1088, 1089, 1155, 1156, 1233, 1234, 1290, 1291, 1353, 1354, 1402, 1403, 1453, 1454, 1496, 1497, 1537, 1538, 1576, 1577, 1609, 1610, 1646, 1647, 1673, 1674, 1710, 1711, 1736, 1737, 1767, 1772, 1773, 1798, 1799, 1835, 1836, 1861, 1862, 1898, 1899, 1925, 1926, 1962, 1963, 1993, 1994, 2032, 2033, 2069, 2070, 2112, 2159, 2160, 2208, 2209, 2263, 2264, 2320, 2321, 2387, 2388, 2455, 2456, 2536, 2537, 2615, 2616, 2712, 2713, 2806, 2807, 2921, 2922, 3032, 3033, 3167, 3168, 3289, 3294, 3295, 3451, 3452]
Discarding 127 places :
Implicit Place search using SMT only with invariants took 7383 ms to find 127 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 3575/3702 places, 7546/7546 transitions.
Discarding 95 places :
Symmetric choice reduction at 0 with 95 rule applications. Total rules 95 place count 3480 transition count 7451
Iterating global reduction 0 with 95 rules applied. Total rules applied 190 place count 3480 transition count 7451
Discarding 95 places :
Symmetric choice reduction at 0 with 95 rule applications. Total rules 285 place count 3385 transition count 7356
Iterating global reduction 0 with 95 rules applied. Total rules applied 380 place count 3385 transition count 7356
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 383 place count 3385 transition count 7353
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 386 place count 3382 transition count 7353
Applied a total of 386 rules in 1780 ms. Remains 3382 /3575 variables (removed 193) and now considering 7353/7546 (removed 193) transitions.
[2024-06-01 00:00:18] [INFO ] Flow matrix only has 6478 transitions (discarded 875 similar events)
// Phase 1: matrix 6478 rows 3382 cols
[2024-06-01 00:00:19] [INFO ] Computed 654 invariants in 148 ms
[2024-06-01 00:00:25] [INFO ] Implicit Places using invariants in 6309 ms returned [6, 8, 12, 18, 26, 36, 48, 62, 78, 96, 116, 138, 161, 183, 203, 221, 237, 251, 263, 273, 282, 288, 292, 295, 306, 308, 310, 314, 321, 329, 339, 351, 365, 381, 399, 419, 440, 460, 478, 494, 508, 520, 530, 538, 545, 549, 551, 553, 561, 563, 565, 567, 571, 577, 585, 595, 607, 621, 637, 655, 674, 692, 708, 722, 734, 744, 752, 758, 763, 765, 767, 769, 777, 779, 781, 783, 785, 789, 795, 803, 813, 825, 839, 855, 872, 888, 902, 914, 924, 932, 938, 942, 945, 947, 949, 951, 959, 961, 963, 965, 967, 969, 973, 979, 987, 997, 1009, 1023, 1038, 1052, 1064, 1074, 1082, 1088, 1092, 1094, 1096, 1098, 1100, 1102, 1110, 1112, 1114, 1116, 1118, 1120, 1122, 1126, 1132, 1140, 1150, 1162, 1175, 1188, 1198, 1206, 1212, 1216, 1218, 1220, 1222, 1224, 1226, 1228, 1236, 1238, 1240, 1242, 1244, 1246, 1248, 1250, 1254, 1260, 1268, 1278, 1289, 1299, 1307, 1313, 1317, 1319, 1321, 1323, 1325, 1327, 1329, 1331, 1339, 1341, 1343, 1345, 1347, 1349, 1351, 1353, 1355, 1359, 1365, 1373, 1382, 1390, 1396, 1400, 1402, 1404, 1406, 1408, 1410, 1412, 1414, 1416, 1424, 1426, 1428, 1430, 1432, 1434, 1436, 1438, 1440, 1442, 1446, 1452, 1459, 1465, 1469, 1471, 1473, 1475, 1477, 1479, 1481, 1483, 1485, 1487, 1495, 1497, 1499, 1501, 1503, 1505, 1507, 1509, 1511, 1513, 1515, 1519, 1524, 1528, 1530, 1532, 1534, 1536, 1538, 1540, 1542, 1544, 1546, 1548, 1556, 1558, 1560, 1562, 1564, 1566, 1568, 1570, 1572, 1574, 1576, 1578, 1581, 1583, 1585, 1587, 1589, 1591, 1593, 1595, 1597, 1599, 1601, 1603, 1611, 1613, 1615, 1617, 1619, 1621, 1623, 1625, 1627, 1629, 1631, 1633, 1635, 1637, 1639, 1641, 1643, 1645, 1647, 1649, 1651, 1653, 1655, 1657, 1663, 1665, 1667, 1669, 1671, 1673, 1675, 1677, 1679, 1681, 1683, 1685, 1687, 1689, 1691, 1693, 1695, 1697, 1699, 1701, 1703, 1705, 1707, 1709, 1716, 1718, 1720, 1722, 1724, 1726, 1728, 1730, 1732, 1734, 1736, 1738, 1740, 1742, 1744, 1746, 1748, 1750, 1752, 1754, 1756, 1758, 1760, 1762, 1770, 1772, 1774, 1776, 1778, 1780, 1782, 1784, 1786, 1788, 1790, 1792, 1794, 1797, 1799, 1801, 1803, 1805, 1807, 1809, 1811, 1813, 1815, 1817, 1825, 1827, 1829, 1831, 1833, 1835, 1837, 1839, 1841, 1843, 1845, 1847, 1851, 1856, 1860, 1862, 1864, 1866, 1868, 1870, 1872, 1874, 1876, 1878, 1886, 1888, 1890, 1892, 1894, 1896, 1898, 1900, 1902, 1904, 1906, 1910, 1916, 1923, 1929, 1933, 1935, 1937, 1939, 1941, 1943, 1945, 1947, 1949, 1957, 1960, 1962, 1964, 1966, 1968, 1970, 1974, 1976, 1978, 1982, 1988, 1996, 2005, 2013, 2019, 2023, 2025, 2027, 2029, 2031, 2033, 2035, 2037, 2046, 2048, 2050, 2052, 2054, 2056, 2058, 2060, 2062, 2066, 2072, 2080, 2090, 2101, 2111, 2119, 2125, 2129, 2131, 2133, 2135, 2137, 2139, 2141, 2149, 2151, 2153, 2155, 2157, 2159, 2161, 2163, 2167, 2173, 2181, 2191, 2203, 2216, 2228, 2238, 2246, 2252, 2256, 2258, 2260, 2262, 2264, 2266, 2275, 2277, 2279, 2281, 2283, 2285, 2287, 2291, 2297, 2305, 2315, 2327, 2341, 2356, 2370, 2382, 2392, 2400, 2406, 2410, 2412, 2414, 2416, 2418, 2426, 2428, 2430, 2432, 2434, 2436, 2440, 2446, 2454, 2464, 2476, 2490, 2506, 2523, 2539, 2553, 2565, 2575, 2583, 2589, 2593, 2596, 2598, 2600, 2608, 2610, 2612, 2614, 2616, 2620, 2626, 2634, 2644, 2656, 2670, 2686, 2704, 2723, 2741, 2757, 2771, 2783, 2793, 2801, 2807, 2812, 2814, 2816, 2825, 2827, 2829, 2831, 2835, 2841, 2849, 2859, 2871, 2885, 2901, 2919, 2939, 2960, 2980, 2998, 3014, 3028, 3040, 3050, 3058, 3065, 3069, 3071, 3077, 3079, 3081, 3085, 3091, 3099, 3109, 3121, 3135, 3151, 3169, 3189, 3211, 3234, 3256, 3276, 3294, 3310, 3324, 3336, 3346, 3355, 3361, 3365]
Discarding 600 places :
Implicit Place search using SMT only with invariants took 6334 ms to find 600 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2782/3702 places, 7353/7546 transitions.
Applied a total of 0 rules in 367 ms. Remains 2782 /2782 variables (removed 0) and now considering 7353/7353 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 16396 ms. Remains : 2782/3702 places, 7353/7546 transitions.
RANDOM walk for 40000 steps (3312 resets) in 752 ms. (53 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (228 resets) in 88 ms. (449 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (176 resets) in 77 ms. (512 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (207 resets) in 80 ms. (493 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 27005 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :0 out of 3
Probabilistic random walk after 27005 steps, saw 11205 distinct states, run finished after 3001 ms. (steps per millisecond=8 ) properties seen :0
[2024-06-01 00:00:28] [INFO ] Flow matrix only has 6478 transitions (discarded 875 similar events)
// Phase 1: matrix 6478 rows 2782 cols
[2024-06-01 00:00:29] [INFO ] Computed 54 invariants in 172 ms
[2024-06-01 00:00:29] [INFO ] State equation strengthened by 3191 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 2698/2708 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 00:00:31] [INFO ] Deduced a trap composed of 389 places in 1948 ms of which 18 ms to minimize.
[2024-06-01 00:00:33] [INFO ] Deduced a trap composed of 213 places in 1905 ms of which 17 ms to minimize.
[2024-06-01 00:00:35] [INFO ] Deduced a trap composed of 91 places in 1888 ms of which 16 ms to minimize.
[2024-06-01 00:00:37] [INFO ] Deduced a trap composed of 155 places in 1793 ms of which 17 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/2708 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2708 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 30/2738 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/2738 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 40/2778 variables, 40/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2778 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 4/2782 variables, 4/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2782 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 6478/9260 variables, 2782/2840 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/9260 variables, 3191/6031 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/9260 variables, 0/6031 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/9260 variables, 0/6031 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 9260/9260 variables, and 6031 constraints, problems are : Problem set: 0 solved, 3 unsolved in 14780 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 2782/2782 constraints, ReadFeed: 3191/3191 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 2698/2708 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2708 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 00:00:46] [INFO ] Deduced a trap composed of 251 places in 1956 ms of which 18 ms to minimize.
[2024-06-01 00:00:48] [INFO ] Deduced a trap composed of 247 places in 1848 ms of which 17 ms to minimize.
[2024-06-01 00:00:50] [INFO ] Deduced a trap composed of 101 places in 1931 ms of which 17 ms to minimize.
[2024-06-01 00:00:52] [INFO ] Deduced a trap composed of 115 places in 1914 ms of which 17 ms to minimize.
[2024-06-01 00:00:54] [INFO ] Deduced a trap composed of 84 places in 1950 ms of which 17 ms to minimize.
[2024-06-01 00:00:56] [INFO ] Deduced a trap composed of 234 places in 1938 ms of which 17 ms to minimize.
[2024-06-01 00:00:58] [INFO ] Deduced a trap composed of 181 places in 1923 ms of which 18 ms to minimize.
[2024-06-01 00:01:00] [INFO ] Deduced a trap composed of 91 places in 1936 ms of which 18 ms to minimize.
[2024-06-01 00:01:02] [INFO ] Deduced a trap composed of 229 places in 1955 ms of which 18 ms to minimize.
[2024-06-01 00:01:03] [INFO ] Deduced a trap composed of 133 places in 1909 ms of which 17 ms to minimize.
[2024-06-01 00:01:05] [INFO ] Deduced a trap composed of 229 places in 1916 ms of which 17 ms to minimize.
[2024-06-01 00:01:07] [INFO ] Deduced a trap composed of 155 places in 1878 ms of which 17 ms to minimize.
[2024-06-01 00:01:09] [INFO ] Deduced a trap composed of 115 places in 1897 ms of which 17 ms to minimize.
[2024-06-01 00:01:11] [INFO ] Deduced a trap composed of 85 places in 1909 ms of which 17 ms to minimize.
[2024-06-01 00:01:13] [INFO ] Deduced a trap composed of 84 places in 1913 ms of which 17 ms to minimize.
[2024-06-01 00:01:15] [INFO ] Deduced a trap composed of 85 places in 1913 ms of which 17 ms to minimize.
[2024-06-01 00:01:17] [INFO ] Deduced a trap composed of 181 places in 1932 ms of which 16 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/2708 variables, 17/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2708 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 30/2738 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 00:01:19] [INFO ] Deduced a trap composed of 5 places in 2061 ms of which 17 ms to minimize.
[2024-06-01 00:01:22] [INFO ] Deduced a trap composed of 39 places in 2034 ms of which 16 ms to minimize.
[2024-06-01 00:01:24] [INFO ] Deduced a trap composed of 90 places in 1995 ms of which 18 ms to minimize.
[2024-06-01 00:01:24] [INFO ] Deduced a trap composed of 70 places in 569 ms of which 8 ms to minimize.
[2024-06-01 00:01:26] [INFO ] Deduced a trap composed of 77 places in 2165 ms of which 17 ms to minimize.
[2024-06-01 00:01:28] [INFO ] Deduced a trap composed of 89 places in 2071 ms of which 19 ms to minimize.
[2024-06-01 00:01:31] [INFO ] Deduced a trap composed of 91 places in 2087 ms of which 20 ms to minimize.
[2024-06-01 00:01:31] [INFO ] Deduced a trap composed of 70 places in 647 ms of which 9 ms to minimize.
[2024-06-01 00:01:34] [INFO ] Deduced a trap composed of 97 places in 2179 ms of which 21 ms to minimize.
[2024-06-01 00:01:36] [INFO ] Deduced a trap composed of 78 places in 2179 ms of which 19 ms to minimize.
[2024-06-01 00:01:38] [INFO ] Deduced a trap composed of 87 places in 2217 ms of which 18 ms to minimize.
[2024-06-01 00:01:40] [INFO ] Deduced a trap composed of 108 places in 2104 ms of which 18 ms to minimize.
[2024-06-01 00:01:41] [INFO ] Deduced a trap composed of 115 places in 587 ms of which 8 ms to minimize.
[2024-06-01 00:01:43] [INFO ] Deduced a trap composed of 75 places in 2038 ms of which 18 ms to minimize.
[2024-06-01 00:01:45] [INFO ] Deduced a trap composed of 89 places in 2106 ms of which 18 ms to minimize.
[2024-06-01 00:01:47] [INFO ] Deduced a trap composed of 94 places in 1922 ms of which 17 ms to minimize.
[2024-06-01 00:01:49] [INFO ] Deduced a trap composed of 110 places in 1938 ms of which 18 ms to minimize.
[2024-06-01 00:01:50] [INFO ] Deduced a trap composed of 98 places in 569 ms of which 8 ms to minimize.
[2024-06-01 00:01:50] [INFO ] Deduced a trap composed of 98 places in 569 ms of which 7 ms to minimize.
[2024-06-01 00:01:52] [INFO ] Deduced a trap composed of 78 places in 1960 ms of which 17 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/2738 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 00:01:54] [INFO ] Deduced a trap composed of 89 places in 1990 ms of which 18 ms to minimize.
[2024-06-01 00:01:55] [INFO ] Deduced a trap composed of 70 places in 574 ms of which 8 ms to minimize.
[2024-06-01 00:01:57] [INFO ] Deduced a trap composed of 141 places in 1892 ms of which 16 ms to minimize.
[2024-06-01 00:01:59] [INFO ] Deduced a trap composed of 132 places in 1968 ms of which 18 ms to minimize.
[2024-06-01 00:01:59] [INFO ] Deduced a trap composed of 140 places in 580 ms of which 8 ms to minimize.
[2024-06-01 00:02:02] [INFO ] Deduced a trap composed of 107 places in 2086 ms of which 18 ms to minimize.
[2024-06-01 00:02:04] [INFO ] Deduced a trap composed of 84 places in 2069 ms of which 18 ms to minimize.
[2024-06-01 00:02:06] [INFO ] Deduced a trap composed of 83 places in 2058 ms of which 16 ms to minimize.
[2024-06-01 00:02:08] [INFO ] Deduced a trap composed of 98 places in 2029 ms of which 18 ms to minimize.
[2024-06-01 00:02:09] [INFO ] Deduced a trap composed of 70 places in 612 ms of which 9 ms to minimize.
[2024-06-01 00:02:11] [INFO ] Deduced a trap composed of 116 places in 2033 ms of which 18 ms to minimize.
[2024-06-01 00:02:11] [INFO ] Deduced a trap composed of 140 places in 597 ms of which 8 ms to minimize.
[2024-06-01 00:02:13] [INFO ] Deduced a trap composed of 121 places in 2141 ms of which 32 ms to minimize.
SMT process timed out in 105076ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 10 out of 2782 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2782/2782 places, 7353/7353 transitions.
Applied a total of 0 rules in 409 ms. Remains 2782 /2782 variables (removed 0) and now considering 7353/7353 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 409 ms. Remains : 2782/2782 places, 7353/7353 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2782/2782 places, 7353/7353 transitions.
Applied a total of 0 rules in 394 ms. Remains 2782 /2782 variables (removed 0) and now considering 7353/7353 (removed 0) transitions.
[2024-06-01 00:02:14] [INFO ] Flow matrix only has 6478 transitions (discarded 875 similar events)
[2024-06-01 00:02:14] [INFO ] Invariant cache hit.
[2024-06-01 00:02:19] [INFO ] Implicit Places using invariants in 4336 ms returned []
[2024-06-01 00:02:19] [INFO ] Flow matrix only has 6478 transitions (discarded 875 similar events)
[2024-06-01 00:02:19] [INFO ] Invariant cache hit.
[2024-06-01 00:02:21] [INFO ] State equation strengthened by 3191 read => feed constraints.
[2024-06-01 00:02:51] [INFO ] Performed 861/2782 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-06-01 00:03:22] [INFO ] Performed 1209/2782 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-06-01 00:03:52] [INFO ] Performed 1434/2782 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2024-06-01 00:04:22] [INFO ] Performed 1689/2782 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2024-06-01 00:04:22] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2024-06-01 00:04:22] [INFO ] Implicit Places using invariants and state equation in 123242 ms returned []
Implicit Place search using SMT with State Equation took 127580 ms to find 0 implicit places.
[2024-06-01 00:04:23] [INFO ] Redundant transitions in 731 ms returned []
Running 7259 sub problems to find dead transitions.
[2024-06-01 00:04:23] [INFO ] Flow matrix only has 6478 transitions (discarded 875 similar events)
[2024-06-01 00:04:23] [INFO ] Invariant cache hit.
[2024-06-01 00:04:23] [INFO ] State equation strengthened by 3191 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2780 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 7259 unsolved
SMT process timed out in 53305ms, After SMT, problems are : Problem set: 0 solved, 7259 unsolved
Search for dead transitions found 0 dead transitions in 53374ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 182128 ms. Remains : 2782/2782 places, 7353/7353 transitions.
[2024-06-01 00:05:16] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2024-06-01 00:05:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2782 places, 7353 transitions and 35735 arcs took 45 ms.
[2024-06-01 00:05:17] [INFO ] Flatten gal took : 446 ms
Total runtime 484737 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : MultiCrashLeafsetExtension-PT-S24C02-ReachabilityFireability-2024-05
Could not compute solution for formula : MultiCrashLeafsetExtension-PT-S24C02-ReachabilityFireability-2024-06
Could not compute solution for formula : MultiCrashLeafsetExtension-PT-S24C02-ReachabilityFireability-2024-11
BK_STOP 1717200317546
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
mcc2024
rfs formula name MultiCrashLeafsetExtension-PT-S24C02-ReachabilityFireability-2024-05
rfs formula type AG
rfs formula formula --invariant=/tmp/918/inv_0_
rfs formula name MultiCrashLeafsetExtension-PT-S24C02-ReachabilityFireability-2024-06
rfs formula type EF
rfs formula formula --invariant=/tmp/918/inv_1_
rfs formula name MultiCrashLeafsetExtension-PT-S24C02-ReachabilityFireability-2024-11
rfs formula type AG
rfs formula formula --invariant=/tmp/918/inv_2_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MultiCrashLeafsetExtension-PT-S24C02"
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 MultiCrashLeafsetExtension-PT-S24C02, 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 r508-tall-171654350800063"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S24C02.tgz
mv MultiCrashLeafsetExtension-PT-S24C02 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 ;