About the Execution of LTSMin+red for Peterson-PT-5
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 3347.668 | 238640.00 | 311774.00 | 682.00 | T??FT?T???TF?FFT | 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.r512-smll-171654407300279.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 Peterson-PT-5, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r512-smll-171654407300279
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 110K Apr 12 02:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 458K Apr 12 02:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 107K Apr 12 02:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 475K Apr 12 02:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 47K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 150K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 40K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 135K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 173K Apr 12 03:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 733K Apr 12 03:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 289K Apr 12 03:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.4M Apr 12 03:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 5.8K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 13K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 535K 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 Peterson-PT-5-ReachabilityFireability-2024-00
FORMULA_NAME Peterson-PT-5-ReachabilityFireability-2024-01
FORMULA_NAME Peterson-PT-5-ReachabilityFireability-2024-02
FORMULA_NAME Peterson-PT-5-ReachabilityFireability-2024-03
FORMULA_NAME Peterson-PT-5-ReachabilityFireability-2024-04
FORMULA_NAME Peterson-PT-5-ReachabilityFireability-2024-05
FORMULA_NAME Peterson-PT-5-ReachabilityFireability-2024-06
FORMULA_NAME Peterson-PT-5-ReachabilityFireability-2024-07
FORMULA_NAME Peterson-PT-5-ReachabilityFireability-2024-08
FORMULA_NAME Peterson-PT-5-ReachabilityFireability-2024-09
FORMULA_NAME Peterson-PT-5-ReachabilityFireability-2024-10
FORMULA_NAME Peterson-PT-5-ReachabilityFireability-2024-11
FORMULA_NAME Peterson-PT-5-ReachabilityFireability-2024-12
FORMULA_NAME Peterson-PT-5-ReachabilityFireability-2024-13
FORMULA_NAME Peterson-PT-5-ReachabilityFireability-2024-14
FORMULA_NAME Peterson-PT-5-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1717273614154
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-PT-5
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 20:26:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 20:26:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 20:26:57] [INFO ] Load time of PNML (sax parser for PT used): 365 ms
[2024-06-01 20:26:57] [INFO ] Transformed 834 places.
[2024-06-01 20:26:57] [INFO ] Transformed 1242 transitions.
[2024-06-01 20:26:57] [INFO ] Found NUPN structural information;
[2024-06-01 20:26:57] [INFO ] Parsed PT model containing 834 places and 1242 transitions and 3828 arcs in 748 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 138 ms.
Working with output stream class java.io.PrintStream
FORMULA Peterson-PT-5-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 2729 ms. (14 steps per ms) remains 9/15 properties
FORMULA Peterson-PT-5-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-5-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-5-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-5-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-5-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-5-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 333 ms. (119 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3130 ms. (12 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 283 ms. (140 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2285 ms. (17 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 231 ms. (172 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 327 ms. (121 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 234 ms. (170 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 270 ms. (147 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 249 ms. (160 steps per ms) remains 9/9 properties
[2024-06-01 20:27:00] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2024-06-01 20:27:00] [INFO ] Computed 23 invariants in 45 ms
[2024-06-01 20:27:00] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/658 variables, 658/658 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/658 variables, 6/664 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/658 variables, 1/665 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/658 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem Peterson-PT-5-ReachabilityFireability-2024-14 is UNSAT
FORMULA Peterson-PT-5-ReachabilityFireability-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 4 (OVERLAPS) 176/834 variables, 11/676 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/834 variables, 176/852 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/834 variables, 5/857 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/834 variables, 0/857 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 1122/1956 variables, 834/1691 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1956 variables, 205/1896 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1956 variables, 0/1896 constraints. Problems are: Problem set: 1 solved, 8 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1956/1956 variables, and 1896 constraints, problems are : Problem set: 1 solved, 8 unsolved in 5083 ms.
Refiners :[Domain max(s): 834/834 constraints, Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 834/834 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/655 variables, 655/655 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/655 variables, 6/661 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/655 variables, 1/662 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/655 variables, 0/662 constraints. Problems are: Problem set: 1 solved, 8 unsolved
Problem Peterson-PT-5-ReachabilityFireability-2024-15 is UNSAT
FORMULA Peterson-PT-5-ReachabilityFireability-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 4 (OVERLAPS) 179/834 variables, 11/673 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/834 variables, 179/852 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/834 variables, 5/857 constraints. Problems are: Problem set: 2 solved, 7 unsolved
[2024-06-01 20:27:11] [INFO ] Deduced a trap composed of 39 places in 875 ms of which 84 ms to minimize.
[2024-06-01 20:27:11] [INFO ] Deduced a trap composed of 41 places in 695 ms of which 13 ms to minimize.
[2024-06-01 20:27:12] [INFO ] Deduced a trap composed of 15 places in 683 ms of which 11 ms to minimize.
[2024-06-01 20:27:13] [INFO ] Deduced a trap composed of 245 places in 651 ms of which 9 ms to minimize.
[2024-06-01 20:27:13] [INFO ] Deduced a trap composed of 19 places in 706 ms of which 10 ms to minimize.
SMT process timed out in 13096ms, After SMT, problems are : Problem set: 2 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 651 out of 834 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 123 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 154 ms. Remains : 834/834 places, 1242/1242 transitions.
RANDOM walk for 40000 steps (8 resets) in 1004 ms. (39 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 333 ms. (119 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4271 ms. (9 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 667 ms. (59 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1189 ms. (33 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 215 ms. (185 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 241325 steps, run timeout after 6001 ms. (steps per millisecond=40 ) properties seen :0 out of 7
Probabilistic random walk after 241325 steps, saw 138900 distinct states, run finished after 6010 ms. (steps per millisecond=40 ) properties seen :0
[2024-06-01 20:27:22] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2024-06-01 20:27:22] [INFO ] Invariant cache hit.
[2024-06-01 20:27:22] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/651 variables, 651/651 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/651 variables, 5/656 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/651 variables, 0/656 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 183/834 variables, 12/668 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/834 variables, 183/851 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/834 variables, 6/857 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/834 variables, 0/857 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 1122/1956 variables, 834/1691 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1956 variables, 205/1896 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1956 variables, 0/1896 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 0/1956 variables, 0/1896 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1956/1956 variables, and 1896 constraints, problems are : Problem set: 0 solved, 7 unsolved in 7282 ms.
Refiners :[Domain max(s): 834/834 constraints, Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 834/834 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/651 variables, 651/651 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/651 variables, 5/656 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 20:27:32] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 1 ms to minimize.
[2024-06-01 20:27:32] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-06-01 20:27:32] [INFO ] Deduced a trap composed of 2 places in 58 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/651 variables, 3/659 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/651 variables, 0/659 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 183/834 variables, 12/671 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/834 variables, 183/854 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/834 variables, 6/860 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 20:27:34] [INFO ] Deduced a trap composed of 28 places in 668 ms of which 6 ms to minimize.
[2024-06-01 20:27:35] [INFO ] Deduced a trap composed of 44 places in 825 ms of which 10 ms to minimize.
[2024-06-01 20:27:35] [INFO ] Deduced a trap composed of 44 places in 770 ms of which 9 ms to minimize.
[2024-06-01 20:27:36] [INFO ] Deduced a trap composed of 11 places in 720 ms of which 7 ms to minimize.
[2024-06-01 20:27:37] [INFO ] Deduced a trap composed of 11 places in 509 ms of which 6 ms to minimize.
[2024-06-01 20:27:37] [INFO ] Deduced a trap composed of 11 places in 505 ms of which 6 ms to minimize.
[2024-06-01 20:27:38] [INFO ] Deduced a trap composed of 63 places in 410 ms of which 6 ms to minimize.
[2024-06-01 20:27:38] [INFO ] Deduced a trap composed of 11 places in 585 ms of which 9 ms to minimize.
[2024-06-01 20:27:39] [INFO ] Deduced a trap composed of 26 places in 639 ms of which 6 ms to minimize.
[2024-06-01 20:27:39] [INFO ] Deduced a trap composed of 11 places in 437 ms of which 6 ms to minimize.
[2024-06-01 20:27:40] [INFO ] Deduced a trap composed of 130 places in 337 ms of which 5 ms to minimize.
[2024-06-01 20:27:40] [INFO ] Deduced a trap composed of 109 places in 506 ms of which 8 ms to minimize.
[2024-06-01 20:27:41] [INFO ] Deduced a trap composed of 94 places in 515 ms of which 8 ms to minimize.
[2024-06-01 20:27:41] [INFO ] Deduced a trap composed of 121 places in 531 ms of which 9 ms to minimize.
[2024-06-01 20:27:42] [INFO ] Deduced a trap composed of 94 places in 501 ms of which 8 ms to minimize.
[2024-06-01 20:27:43] [INFO ] Deduced a trap composed of 94 places in 527 ms of which 9 ms to minimize.
[2024-06-01 20:27:43] [INFO ] Deduced a trap composed of 94 places in 582 ms of which 9 ms to minimize.
[2024-06-01 20:27:44] [INFO ] Deduced a trap composed of 94 places in 532 ms of which 8 ms to minimize.
[2024-06-01 20:27:44] [INFO ] Deduced a trap composed of 63 places in 595 ms of which 8 ms to minimize.
[2024-06-01 20:27:45] [INFO ] Deduced a trap composed of 63 places in 607 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/834 variables, 20/880 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 20:27:46] [INFO ] Deduced a trap composed of 40 places in 889 ms of which 13 ms to minimize.
[2024-06-01 20:27:47] [INFO ] Deduced a trap composed of 104 places in 577 ms of which 6 ms to minimize.
[2024-06-01 20:27:47] [INFO ] Deduced a trap composed of 91 places in 505 ms of which 5 ms to minimize.
[2024-06-01 20:27:48] [INFO ] Deduced a trap composed of 132 places in 505 ms of which 6 ms to minimize.
[2024-06-01 20:27:48] [INFO ] Deduced a trap composed of 131 places in 403 ms of which 6 ms to minimize.
[2024-06-01 20:27:49] [INFO ] Deduced a trap composed of 78 places in 396 ms of which 5 ms to minimize.
[2024-06-01 20:27:49] [INFO ] Deduced a trap composed of 110 places in 572 ms of which 17 ms to minimize.
[2024-06-01 20:27:50] [INFO ] Deduced a trap composed of 91 places in 604 ms of which 8 ms to minimize.
[2024-06-01 20:27:51] [INFO ] Deduced a trap composed of 52 places in 579 ms of which 6 ms to minimize.
[2024-06-01 20:27:51] [INFO ] Deduced a trap composed of 80 places in 502 ms of which 5 ms to minimize.
[2024-06-01 20:27:52] [INFO ] Deduced a trap composed of 78 places in 670 ms of which 9 ms to minimize.
[2024-06-01 20:27:53] [INFO ] Deduced a trap composed of 168 places in 742 ms of which 9 ms to minimize.
[2024-06-01 20:27:53] [INFO ] Deduced a trap composed of 100 places in 688 ms of which 9 ms to minimize.
[2024-06-01 20:27:54] [INFO ] Deduced a trap composed of 70 places in 727 ms of which 10 ms to minimize.
[2024-06-01 20:27:55] [INFO ] Deduced a trap composed of 130 places in 483 ms of which 7 ms to minimize.
[2024-06-01 20:27:56] [INFO ] Deduced a trap composed of 56 places in 712 ms of which 9 ms to minimize.
[2024-06-01 20:27:56] [INFO ] Deduced a trap composed of 45 places in 784 ms of which 10 ms to minimize.
[2024-06-01 20:27:57] [INFO ] Deduced a trap composed of 39 places in 828 ms of which 11 ms to minimize.
[2024-06-01 20:27:58] [INFO ] Deduced a trap composed of 78 places in 428 ms of which 7 ms to minimize.
[2024-06-01 20:27:59] [INFO ] Deduced a trap composed of 78 places in 514 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/834 variables, 20/900 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 20:28:00] [INFO ] Deduced a trap composed of 14 places in 798 ms of which 10 ms to minimize.
[2024-06-01 20:28:01] [INFO ] Deduced a trap composed of 48 places in 703 ms of which 7 ms to minimize.
[2024-06-01 20:28:02] [INFO ] Deduced a trap composed of 48 places in 516 ms of which 7 ms to minimize.
[2024-06-01 20:28:02] [INFO ] Deduced a trap composed of 52 places in 535 ms of which 7 ms to minimize.
[2024-06-01 20:28:03] [INFO ] Deduced a trap composed of 130 places in 580 ms of which 7 ms to minimize.
[2024-06-01 20:28:04] [INFO ] Deduced a trap composed of 136 places in 816 ms of which 10 ms to minimize.
[2024-06-01 20:28:04] [INFO ] Deduced a trap composed of 108 places in 535 ms of which 6 ms to minimize.
[2024-06-01 20:28:05] [INFO ] Deduced a trap composed of 97 places in 771 ms of which 9 ms to minimize.
[2024-06-01 20:28:06] [INFO ] Deduced a trap composed of 108 places in 391 ms of which 6 ms to minimize.
[2024-06-01 20:28:06] [INFO ] Deduced a trap composed of 104 places in 398 ms of which 6 ms to minimize.
[2024-06-01 20:28:07] [INFO ] Deduced a trap composed of 104 places in 383 ms of which 6 ms to minimize.
[2024-06-01 20:28:07] [INFO ] Deduced a trap composed of 105 places in 372 ms of which 6 ms to minimize.
[2024-06-01 20:28:07] [INFO ] Deduced a trap composed of 104 places in 412 ms of which 6 ms to minimize.
[2024-06-01 20:28:08] [INFO ] Deduced a trap composed of 84 places in 809 ms of which 10 ms to minimize.
[2024-06-01 20:28:09] [INFO ] Deduced a trap composed of 173 places in 410 ms of which 6 ms to minimize.
[2024-06-01 20:28:10] [INFO ] Deduced a trap composed of 111 places in 887 ms of which 11 ms to minimize.
[2024-06-01 20:28:11] [INFO ] Deduced a trap composed of 26 places in 873 ms of which 12 ms to minimize.
[2024-06-01 20:28:12] [INFO ] Deduced a trap composed of 49 places in 824 ms of which 10 ms to minimize.
[2024-06-01 20:28:12] [INFO ] Deduced a trap composed of 48 places in 594 ms of which 7 ms to minimize.
[2024-06-01 20:28:13] [INFO ] Deduced a trap composed of 172 places in 551 ms of which 7 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/834 variables, 20/920 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 20:28:15] [INFO ] Deduced a trap composed of 67 places in 639 ms of which 9 ms to minimize.
[2024-06-01 20:28:17] [INFO ] Deduced a trap composed of 144 places in 753 ms of which 10 ms to minimize.
SMT process timed out in 54640ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 651 out of 834 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 81 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 834/834 places, 1242/1242 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 52 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2024-06-01 20:28:17] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2024-06-01 20:28:17] [INFO ] Invariant cache hit.
[2024-06-01 20:28:17] [INFO ] Implicit Places using invariants in 409 ms returned [785, 805, 806, 807, 808, 809]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 429 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 828/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 51 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 535 ms. Remains : 828/834 places, 1242/1242 transitions.
RANDOM walk for 40000 steps (8 resets) in 1318 ms. (30 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 204 ms. (195 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3849 ms. (10 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 346 ms. (115 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1208 ms. (33 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 220 ms. (181 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 238189 steps, run timeout after 6001 ms. (steps per millisecond=39 ) properties seen :0 out of 7
Probabilistic random walk after 238189 steps, saw 137359 distinct states, run finished after 6001 ms. (steps per millisecond=39 ) properties seen :0
[2024-06-01 20:28:25] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 828 cols
[2024-06-01 20:28:25] [INFO ] Computed 17 invariants in 8 ms
[2024-06-01 20:28:25] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/651 variables, 651/651 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/651 variables, 11/662 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/651 variables, 0/662 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 177/828 variables, 6/668 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/828 variables, 177/845 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/828 variables, 0/845 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 1122/1950 variables, 828/1673 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1950 variables, 205/1878 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1950 variables, 0/1878 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 0/1950 variables, 0/1878 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1950/1950 variables, and 1878 constraints, problems are : Problem set: 0 solved, 7 unsolved in 5098 ms.
Refiners :[Domain max(s): 828/828 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 828/828 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/651 variables, 651/651 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/651 variables, 11/662 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/651 variables, 0/662 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 177/828 variables, 6/668 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/828 variables, 177/845 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 20:28:35] [INFO ] Deduced a trap composed of 30 places in 922 ms of which 12 ms to minimize.
[2024-06-01 20:28:36] [INFO ] Deduced a trap composed of 27 places in 880 ms of which 8 ms to minimize.
[2024-06-01 20:28:37] [INFO ] Deduced a trap composed of 79 places in 908 ms of which 15 ms to minimize.
[2024-06-01 20:28:37] [INFO ] Deduced a trap composed of 66 places in 707 ms of which 7 ms to minimize.
[2024-06-01 20:28:38] [INFO ] Deduced a trap composed of 56 places in 760 ms of which 11 ms to minimize.
[2024-06-01 20:28:39] [INFO ] Deduced a trap composed of 11 places in 826 ms of which 10 ms to minimize.
[2024-06-01 20:28:40] [INFO ] Deduced a trap composed of 11 places in 805 ms of which 11 ms to minimize.
[2024-06-01 20:28:41] [INFO ] Deduced a trap composed of 87 places in 799 ms of which 11 ms to minimize.
[2024-06-01 20:28:42] [INFO ] Deduced a trap composed of 139 places in 838 ms of which 11 ms to minimize.
[2024-06-01 20:28:43] [INFO ] Deduced a trap composed of 56 places in 825 ms of which 10 ms to minimize.
[2024-06-01 20:28:43] [INFO ] Deduced a trap composed of 89 places in 538 ms of which 6 ms to minimize.
[2024-06-01 20:28:44] [INFO ] Deduced a trap composed of 70 places in 442 ms of which 6 ms to minimize.
[2024-06-01 20:28:44] [INFO ] Deduced a trap composed of 156 places in 438 ms of which 6 ms to minimize.
[2024-06-01 20:28:45] [INFO ] Deduced a trap composed of 106 places in 514 ms of which 7 ms to minimize.
[2024-06-01 20:28:45] [INFO ] Deduced a trap composed of 44 places in 472 ms of which 6 ms to minimize.
[2024-06-01 20:28:46] [INFO ] Deduced a trap composed of 64 places in 505 ms of which 8 ms to minimize.
[2024-06-01 20:28:46] [INFO ] Deduced a trap composed of 99 places in 574 ms of which 8 ms to minimize.
[2024-06-01 20:28:47] [INFO ] Deduced a trap composed of 32 places in 636 ms of which 6 ms to minimize.
[2024-06-01 20:28:48] [INFO ] Deduced a trap composed of 137 places in 348 ms of which 5 ms to minimize.
[2024-06-01 20:28:48] [INFO ] Deduced a trap composed of 159 places in 361 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/828 variables, 20/865 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 20:28:50] [INFO ] Deduced a trap composed of 15 places in 687 ms of which 7 ms to minimize.
[2024-06-01 20:28:50] [INFO ] Deduced a trap composed of 26 places in 696 ms of which 7 ms to minimize.
[2024-06-01 20:28:51] [INFO ] Deduced a trap composed of 11 places in 721 ms of which 11 ms to minimize.
[2024-06-01 20:28:52] [INFO ] Deduced a trap composed of 22 places in 901 ms of which 11 ms to minimize.
[2024-06-01 20:28:53] [INFO ] Deduced a trap composed of 41 places in 790 ms of which 10 ms to minimize.
[2024-06-01 20:28:54] [INFO ] Deduced a trap composed of 18 places in 765 ms of which 9 ms to minimize.
[2024-06-01 20:28:55] [INFO ] Deduced a trap composed of 19 places in 743 ms of which 9 ms to minimize.
[2024-06-01 20:28:55] [INFO ] Deduced a trap composed of 134 places in 594 ms of which 9 ms to minimize.
[2024-06-01 20:28:56] [INFO ] Deduced a trap composed of 82 places in 418 ms of which 6 ms to minimize.
[2024-06-01 20:28:56] [INFO ] Deduced a trap composed of 82 places in 419 ms of which 7 ms to minimize.
[2024-06-01 20:28:57] [INFO ] Deduced a trap composed of 46 places in 702 ms of which 9 ms to minimize.
[2024-06-01 20:28:57] [INFO ] Deduced a trap composed of 108 places in 320 ms of which 4 ms to minimize.
[2024-06-01 20:28:58] [INFO ] Deduced a trap composed of 108 places in 312 ms of which 5 ms to minimize.
[2024-06-01 20:28:59] [INFO ] Deduced a trap composed of 78 places in 606 ms of which 9 ms to minimize.
[2024-06-01 20:28:59] [INFO ] Deduced a trap composed of 89 places in 580 ms of which 8 ms to minimize.
[2024-06-01 20:29:00] [INFO ] Deduced a trap composed of 67 places in 603 ms of which 8 ms to minimize.
[2024-06-01 20:29:01] [INFO ] Deduced a trap composed of 66 places in 556 ms of which 8 ms to minimize.
[2024-06-01 20:29:01] [INFO ] Deduced a trap composed of 105 places in 665 ms of which 8 ms to minimize.
[2024-06-01 20:29:02] [INFO ] Deduced a trap composed of 78 places in 658 ms of which 8 ms to minimize.
[2024-06-01 20:29:03] [INFO ] Deduced a trap composed of 78 places in 638 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/828 variables, 20/885 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 20:29:05] [INFO ] Deduced a trap composed of 28 places in 969 ms of which 12 ms to minimize.
[2024-06-01 20:29:06] [INFO ] Deduced a trap composed of 11 places in 933 ms of which 11 ms to minimize.
[2024-06-01 20:29:06] [INFO ] Deduced a trap composed of 43 places in 851 ms of which 10 ms to minimize.
[2024-06-01 20:29:07] [INFO ] Deduced a trap composed of 37 places in 726 ms of which 9 ms to minimize.
[2024-06-01 20:29:08] [INFO ] Deduced a trap composed of 72 places in 710 ms of which 9 ms to minimize.
[2024-06-01 20:29:09] [INFO ] Deduced a trap composed of 55 places in 718 ms of which 9 ms to minimize.
[2024-06-01 20:29:10] [INFO ] Deduced a trap composed of 37 places in 733 ms of which 10 ms to minimize.
[2024-06-01 20:29:10] [INFO ] Deduced a trap composed of 41 places in 694 ms of which 9 ms to minimize.
[2024-06-01 20:29:11] [INFO ] Deduced a trap composed of 61 places in 483 ms of which 7 ms to minimize.
[2024-06-01 20:29:11] [INFO ] Deduced a trap composed of 73 places in 483 ms of which 7 ms to minimize.
[2024-06-01 20:29:12] [INFO ] Deduced a trap composed of 118 places in 494 ms of which 7 ms to minimize.
[2024-06-01 20:29:12] [INFO ] Deduced a trap composed of 58 places in 514 ms of which 7 ms to minimize.
[2024-06-01 20:29:13] [INFO ] Deduced a trap composed of 58 places in 482 ms of which 7 ms to minimize.
[2024-06-01 20:29:14] [INFO ] Deduced a trap composed of 58 places in 495 ms of which 7 ms to minimize.
[2024-06-01 20:29:14] [INFO ] Deduced a trap composed of 58 places in 480 ms of which 7 ms to minimize.
[2024-06-01 20:29:15] [INFO ] Deduced a trap composed of 119 places in 512 ms of which 7 ms to minimize.
[2024-06-01 20:29:15] [INFO ] Deduced a trap composed of 73 places in 491 ms of which 7 ms to minimize.
[2024-06-01 20:29:16] [INFO ] Deduced a trap composed of 73 places in 486 ms of which 7 ms to minimize.
[2024-06-01 20:29:16] [INFO ] Deduced a trap composed of 119 places in 487 ms of which 7 ms to minimize.
[2024-06-01 20:29:17] [INFO ] Deduced a trap composed of 20 places in 693 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/828 variables, 20/905 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 20:29:19] [INFO ] Deduced a trap composed of 28 places in 539 ms of which 7 ms to minimize.
[2024-06-01 20:29:20] [INFO ] Deduced a trap composed of 116 places in 720 ms of which 9 ms to minimize.
[2024-06-01 20:29:21] [INFO ] Deduced a trap composed of 63 places in 775 ms of which 10 ms to minimize.
[2024-06-01 20:29:21] [INFO ] Deduced a trap composed of 43 places in 768 ms of which 9 ms to minimize.
[2024-06-01 20:29:22] [INFO ] Deduced a trap composed of 43 places in 751 ms of which 9 ms to minimize.
[2024-06-01 20:29:23] [INFO ] Deduced a trap composed of 58 places in 790 ms of which 10 ms to minimize.
[2024-06-01 20:29:24] [INFO ] Deduced a trap composed of 60 places in 637 ms of which 7 ms to minimize.
[2024-06-01 20:29:25] [INFO ] Deduced a trap composed of 51 places in 467 ms of which 6 ms to minimize.
[2024-06-01 20:29:26] [INFO ] Deduced a trap composed of 19 places in 713 ms of which 8 ms to minimize.
[2024-06-01 20:29:27] [INFO ] Deduced a trap composed of 41 places in 766 ms of which 11 ms to minimize.
[2024-06-01 20:29:28] [INFO ] Deduced a trap composed of 131 places in 599 ms of which 8 ms to minimize.
[2024-06-01 20:29:29] [INFO ] Deduced a trap composed of 67 places in 689 ms of which 9 ms to minimize.
[2024-06-01 20:29:30] [INFO ] Deduced a trap composed of 45 places in 785 ms of which 11 ms to minimize.
[2024-06-01 20:29:30] [INFO ] Deduced a trap composed of 49 places in 865 ms of which 11 ms to minimize.
[2024-06-01 20:29:31] [INFO ] Deduced a trap composed of 53 places in 812 ms of which 11 ms to minimize.
[2024-06-01 20:29:32] [INFO ] Deduced a trap composed of 129 places in 825 ms of which 11 ms to minimize.
[2024-06-01 20:29:33] [INFO ] Deduced a trap composed of 45 places in 680 ms of which 7 ms to minimize.
[2024-06-01 20:29:34] [INFO ] Deduced a trap composed of 108 places in 739 ms of which 10 ms to minimize.
[2024-06-01 20:29:35] [INFO ] Deduced a trap composed of 79 places in 668 ms of which 7 ms to minimize.
[2024-06-01 20:29:35] [INFO ] Deduced a trap composed of 26 places in 667 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/828 variables, 20/925 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 20:29:38] [INFO ] Deduced a trap composed of 37 places in 654 ms of which 10 ms to minimize.
[2024-06-01 20:29:39] [INFO ] Deduced a trap composed of 37 places in 785 ms of which 10 ms to minimize.
[2024-06-01 20:29:39] [INFO ] Deduced a trap composed of 104 places in 544 ms of which 7 ms to minimize.
[2024-06-01 20:29:40] [INFO ] Deduced a trap composed of 104 places in 456 ms of which 7 ms to minimize.
[2024-06-01 20:29:40] [INFO ] Deduced a trap composed of 105 places in 519 ms of which 8 ms to minimize.
[2024-06-01 20:29:42] [INFO ] Deduced a trap composed of 11 places in 870 ms of which 10 ms to minimize.
[2024-06-01 20:29:43] [INFO ] Deduced a trap composed of 216 places in 875 ms of which 11 ms to minimize.
[2024-06-01 20:29:44] [INFO ] Deduced a trap composed of 108 places in 833 ms of which 11 ms to minimize.
[2024-06-01 20:29:45] [INFO ] Deduced a trap composed of 108 places in 859 ms of which 11 ms to minimize.
[2024-06-01 20:29:46] [INFO ] Deduced a trap composed of 134 places in 875 ms of which 11 ms to minimize.
[2024-06-01 20:29:47] [INFO ] Deduced a trap composed of 121 places in 806 ms of which 10 ms to minimize.
[2024-06-01 20:29:48] [INFO ] Deduced a trap composed of 78 places in 933 ms of which 26 ms to minimize.
[2024-06-01 20:29:49] [INFO ] Deduced a trap composed of 52 places in 811 ms of which 11 ms to minimize.
SMT process timed out in 83267ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 651 out of 828 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 828/828 places, 1242/1242 transitions.
Applied a total of 0 rules in 37 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 828/828 places, 1242/1242 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 828/828 places, 1242/1242 transitions.
Applied a total of 0 rules in 35 ms. Remains 828 /828 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2024-06-01 20:29:49] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2024-06-01 20:29:49] [INFO ] Invariant cache hit.
[2024-06-01 20:29:49] [INFO ] Implicit Places using invariants in 359 ms returned []
[2024-06-01 20:29:49] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2024-06-01 20:29:49] [INFO ] Invariant cache hit.
[2024-06-01 20:29:50] [INFO ] State equation strengthened by 205 read => feed constraints.
[2024-06-01 20:29:50] [INFO ] Implicit Places using invariants and state equation in 1072 ms returned []
Implicit Place search using SMT with State Equation took 1440 ms to find 0 implicit places.
[2024-06-01 20:29:50] [INFO ] Redundant transitions in 135 ms returned []
Running 1236 sub problems to find dead transitions.
[2024-06-01 20:29:50] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2024-06-01 20:29:50] [INFO ] Invariant cache hit.
[2024-06-01 20:29:50] [INFO ] State equation strengthened by 205 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/828 variables, 828/828 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
SMT process timed out in 30584ms, After SMT, problems are : Problem set: 0 solved, 1236 unsolved
Search for dead transitions found 0 dead transitions in 30614ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32246 ms. Remains : 828/828 places, 1242/1242 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 828 transition count 1122
Applied a total of 120 rules in 52 ms. Remains 828 /828 variables (removed 0) and now considering 1122/1242 (removed 120) transitions.
Running SMT prover for 7 properties.
// Phase 1: matrix 1122 rows 828 cols
[2024-06-01 20:30:23] [INFO ] Computed 17 invariants in 6 ms
[2024-06-01 20:30:23] [INFO ] [Real]Absence check using 17 positive place invariants in 20 ms returned sat
[2024-06-01 20:30:23] [INFO ] After 442ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-06-01 20:30:24] [INFO ] [Nat]Absence check using 17 positive place invariants in 21 ms returned sat
[2024-06-01 20:30:33] [INFO ] After 9346ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
TRAPS : Iteration 0
[2024-06-01 20:30:42] [INFO ] After 18072ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
[2024-06-01 20:30:50] [INFO ] After 26722ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Over-approximation ignoring read arcs solved 0 properties in 28700 ms.
[2024-06-01 20:30:50] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 76 ms.
[2024-06-01 20:30:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 828 places, 1242 transitions and 3816 arcs took 23 ms.
[2024-06-01 20:30:51] [INFO ] Flatten gal took : 257 ms
Total runtime 234324 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 : Peterson-PT-5-ReachabilityFireability-2024-01
Could not compute solution for formula : Peterson-PT-5-ReachabilityFireability-2024-02
Could not compute solution for formula : Peterson-PT-5-ReachabilityFireability-2024-05
Could not compute solution for formula : Peterson-PT-5-ReachabilityFireability-2024-07
Could not compute solution for formula : Peterson-PT-5-ReachabilityFireability-2024-08
Could not compute solution for formula : Peterson-PT-5-ReachabilityFireability-2024-09
Could not compute solution for formula : Peterson-PT-5-ReachabilityFireability-2024-12
BK_STOP 1717273852794
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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 Peterson-PT-5-ReachabilityFireability-2024-01
rfs formula type EF
rfs formula formula --invariant=/tmp/1057/inv_0_
rfs formula name Peterson-PT-5-ReachabilityFireability-2024-02
rfs formula type EF
rfs formula formula --invariant=/tmp/1057/inv_1_
rfs formula name Peterson-PT-5-ReachabilityFireability-2024-05
rfs formula type EF
rfs formula formula --invariant=/tmp/1057/inv_2_
rfs formula name Peterson-PT-5-ReachabilityFireability-2024-07
rfs formula type AG
rfs formula formula --invariant=/tmp/1057/inv_3_
rfs formula name Peterson-PT-5-ReachabilityFireability-2024-08
rfs formula type EF
rfs formula formula --invariant=/tmp/1057/inv_4_
rfs formula name Peterson-PT-5-ReachabilityFireability-2024-09
rfs formula type AG
rfs formula formula --invariant=/tmp/1057/inv_5_
rfs formula name Peterson-PT-5-ReachabilityFireability-2024-12
rfs formula type AG
rfs formula formula --invariant=/tmp/1057/inv_6_
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="Peterson-PT-5"
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 Peterson-PT-5, 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 r512-smll-171654407300279"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-5.tgz
mv Peterson-PT-5 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 ;