About the Execution of LTSMin+red for EisenbergMcGuire-PT-08
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1567.936 | 190583.00 | 269778.00 | 658.10 | ?F??T?TFT?FF??TF | 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.r492-smll-171636266300191.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 EisenbergMcGuire-PT-08, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r492-smll-171636266300191
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 8.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.7M May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME EisenbergMcGuire-PT-08-ReachabilityFireability-2024-00
FORMULA_NAME EisenbergMcGuire-PT-08-ReachabilityFireability-2024-01
FORMULA_NAME EisenbergMcGuire-PT-08-ReachabilityFireability-2024-02
FORMULA_NAME EisenbergMcGuire-PT-08-ReachabilityFireability-2024-03
FORMULA_NAME EisenbergMcGuire-PT-08-ReachabilityFireability-2024-04
FORMULA_NAME EisenbergMcGuire-PT-08-ReachabilityFireability-2024-05
FORMULA_NAME EisenbergMcGuire-PT-08-ReachabilityFireability-2024-06
FORMULA_NAME EisenbergMcGuire-PT-08-ReachabilityFireability-2024-07
FORMULA_NAME EisenbergMcGuire-PT-08-ReachabilityFireability-2024-08
FORMULA_NAME EisenbergMcGuire-PT-08-ReachabilityFireability-2023-09
FORMULA_NAME EisenbergMcGuire-PT-08-ReachabilityFireability-2023-10
FORMULA_NAME EisenbergMcGuire-PT-08-ReachabilityFireability-2024-11
FORMULA_NAME EisenbergMcGuire-PT-08-ReachabilityFireability-2023-12
FORMULA_NAME EisenbergMcGuire-PT-08-ReachabilityFireability-2023-13
FORMULA_NAME EisenbergMcGuire-PT-08-ReachabilityFireability-2024-14
FORMULA_NAME EisenbergMcGuire-PT-08-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1717231094850
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 08:38:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 08:38:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 08:38:18] [INFO ] Load time of PNML (sax parser for PT used): 577 ms
[2024-06-01 08:38:18] [INFO ] Transformed 712 places.
[2024-06-01 08:38:18] [INFO ] Transformed 2816 transitions.
[2024-06-01 08:38:18] [INFO ] Found NUPN structural information;
[2024-06-01 08:38:18] [INFO ] Parsed PT model containing 712 places and 2816 transitions and 13440 arcs in 865 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 38 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 2274 ms. (17 steps per ms) remains 15/16 properties
FORMULA EisenbergMcGuire-PT-08-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 96 ms. (41 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 118 ms. (33 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 141 ms. (28 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 15/15 properties
Interrupted probabilistic random walk after 88344 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :2 out of 15
Probabilistic random walk after 88344 steps, saw 70285 distinct states, run finished after 3018 ms. (steps per millisecond=29 ) properties seen :2
FORMULA EisenbergMcGuire-PT-08-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA EisenbergMcGuire-PT-08-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-06-01 08:38:22] [INFO ] Flow matrix only has 1368 transitions (discarded 1448 similar events)
// Phase 1: matrix 1368 rows 712 cols
[2024-06-01 08:38:23] [INFO ] Computed 25 invariants in 27 ms
[2024-06-01 08:38:23] [INFO ] State equation strengthened by 676 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 146/146 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem EisenbergMcGuire-PT-08-ReachabilityFireability-2024-11 is UNSAT
FORMULA EisenbergMcGuire-PT-08-ReachabilityFireability-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 1/147 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 0/147 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 566/712 variables, 16/163 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/712 variables, 566/729 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/712 variables, 8/737 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/712 variables, 0/737 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 1368/2080 variables, 712/1449 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2080 variables, 676/2125 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2080 variables, 0/2125 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 0/2080 variables, 0/2125 constraints. Problems are: Problem set: 1 solved, 12 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
No progress, stopping.
After SMT solving in domain Real declared 2080/2080 variables, and 2125 constraints, problems are : Problem set: 1 solved, 12 unsolved in 5094 ms.
Refiners :[Domain max(s): 712/712 constraints, Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 712/712 constraints, ReadFeed: 676/676 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 122/122 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 1/123 constraints. Problems are: Problem set: 1 solved, 12 unsolved
[2024-06-01 08:38:29] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 15 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 1/124 constraints. Problems are: Problem set: 1 solved, 12 unsolved
[2024-06-01 08:38:29] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 1/125 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/125 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 590/712 variables, 16/141 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/712 variables, 590/731 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/712 variables, 8/739 constraints. Problems are: Problem set: 1 solved, 12 unsolved
[2024-06-01 08:38:30] [INFO ] Deduced a trap composed of 3 places in 408 ms of which 7 ms to minimize.
[2024-06-01 08:38:30] [INFO ] Deduced a trap composed of 3 places in 329 ms of which 5 ms to minimize.
[2024-06-01 08:38:30] [INFO ] Deduced a trap composed of 85 places in 325 ms of which 5 ms to minimize.
[2024-06-01 08:38:31] [INFO ] Deduced a trap composed of 41 places in 292 ms of which 4 ms to minimize.
[2024-06-01 08:38:31] [INFO ] Deduced a trap composed of 22 places in 574 ms of which 9 ms to minimize.
[2024-06-01 08:38:32] [INFO ] Deduced a trap composed of 14 places in 772 ms of which 9 ms to minimize.
[2024-06-01 08:38:33] [INFO ] Deduced a trap composed of 64 places in 919 ms of which 10 ms to minimize.
SMT process timed out in 10800ms, After SMT, problems are : Problem set: 1 solved, 12 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 122 out of 712 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 712/712 places, 2816/2816 transitions.
Performed 174 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 174 Pre rules applied. Total rules applied 0 place count 712 transition count 2642
Deduced a syphon composed of 174 places in 5 ms
Reduce places removed 174 places and 0 transitions.
Iterating global reduction 0 with 348 rules applied. Total rules applied 348 place count 538 transition count 2642
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 390 place count 496 transition count 2306
Iterating global reduction 0 with 42 rules applied. Total rules applied 432 place count 496 transition count 2306
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 12 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 0 with 102 rules applied. Total rules applied 534 place count 445 transition count 2255
Applied a total of 534 rules in 603 ms. Remains 445 /712 variables (removed 267) and now considering 2255/2816 (removed 561) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 626 ms. Remains : 445/712 places, 2255/2816 transitions.
RANDOM walk for 40000 steps (8 resets) in 845 ms. (47 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 128 ms. (310 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 250 ms. (159 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 176 ms. (226 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 301 ms. (132 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 199 ms. (200 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 230 ms. (173 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 217 ms. (183 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 71 ms. (555 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 110880 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :1 out of 12
Probabilistic random walk after 110880 steps, saw 75898 distinct states, run finished after 3001 ms. (steps per millisecond=36 ) properties seen :1
FORMULA EisenbergMcGuire-PT-08-ReachabilityFireability-2023-10 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-06-01 08:38:38] [INFO ] Flow matrix only has 807 transitions (discarded 1448 similar events)
// Phase 1: matrix 807 rows 445 cols
[2024-06-01 08:38:38] [INFO ] Computed 25 invariants in 6 ms
[2024-06-01 08:38:38] [INFO ] State equation strengthened by 382 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 333/444 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/444 variables, 7/24 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/444 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 1/445 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/445 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 807/1252 variables, 445/470 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1252 variables, 382/852 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1252 variables, 0/852 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 0/1252 variables, 0/852 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1252/1252 variables, and 852 constraints, problems are : Problem set: 0 solved, 11 unsolved in 1986 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 445/445 constraints, ReadFeed: 382/382 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 333/444 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/444 variables, 7/24 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 08:38:41] [INFO ] Deduced a trap composed of 3 places in 334 ms of which 5 ms to minimize.
[2024-06-01 08:38:41] [INFO ] Deduced a trap composed of 3 places in 509 ms of which 6 ms to minimize.
[2024-06-01 08:38:42] [INFO ] Deduced a trap composed of 59 places in 484 ms of which 4 ms to minimize.
[2024-06-01 08:38:42] [INFO ] Deduced a trap composed of 30 places in 351 ms of which 3 ms to minimize.
[2024-06-01 08:38:42] [INFO ] Deduced a trap composed of 11 places in 292 ms of which 4 ms to minimize.
[2024-06-01 08:38:43] [INFO ] Deduced a trap composed of 26 places in 229 ms of which 3 ms to minimize.
[2024-06-01 08:38:43] [INFO ] Deduced a trap composed of 25 places in 179 ms of which 3 ms to minimize.
[2024-06-01 08:38:43] [INFO ] Deduced a trap composed of 22 places in 115 ms of which 2 ms to minimize.
[2024-06-01 08:38:43] [INFO ] Deduced a trap composed of 105 places in 470 ms of which 4 ms to minimize.
[2024-06-01 08:38:44] [INFO ] Deduced a trap composed of 83 places in 422 ms of which 4 ms to minimize.
[2024-06-01 08:38:44] [INFO ] Deduced a trap composed of 27 places in 311 ms of which 4 ms to minimize.
[2024-06-01 08:38:45] [INFO ] Deduced a trap composed of 29 places in 375 ms of which 4 ms to minimize.
[2024-06-01 08:38:45] [INFO ] Deduced a trap composed of 19 places in 236 ms of which 3 ms to minimize.
[2024-06-01 08:38:45] [INFO ] Deduced a trap composed of 26 places in 117 ms of which 2 ms to minimize.
[2024-06-01 08:38:45] [INFO ] Deduced a trap composed of 3 places in 300 ms of which 4 ms to minimize.
[2024-06-01 08:38:45] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 1 ms to minimize.
[2024-06-01 08:38:46] [INFO ] Deduced a trap composed of 23 places in 290 ms of which 3 ms to minimize.
[2024-06-01 08:38:46] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 2 ms to minimize.
[2024-06-01 08:38:46] [INFO ] Deduced a trap composed of 27 places in 217 ms of which 3 ms to minimize.
[2024-06-01 08:38:46] [INFO ] Deduced a trap composed of 20 places in 225 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/444 variables, 20/44 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 08:38:47] [INFO ] Deduced a trap composed of 3 places in 467 ms of which 4 ms to minimize.
[2024-06-01 08:38:47] [INFO ] Deduced a trap composed of 49 places in 456 ms of which 6 ms to minimize.
[2024-06-01 08:38:48] [INFO ] Deduced a trap composed of 36 places in 693 ms of which 6 ms to minimize.
[2024-06-01 08:38:48] [INFO ] Deduced a trap composed of 17 places in 376 ms of which 5 ms to minimize.
[2024-06-01 08:38:49] [INFO ] Deduced a trap composed of 83 places in 683 ms of which 7 ms to minimize.
[2024-06-01 08:38:50] [INFO ] Deduced a trap composed of 48 places in 509 ms of which 6 ms to minimize.
[2024-06-01 08:38:50] [INFO ] Deduced a trap composed of 20 places in 276 ms of which 3 ms to minimize.
[2024-06-01 08:38:50] [INFO ] Deduced a trap composed of 44 places in 191 ms of which 2 ms to minimize.
[2024-06-01 08:38:51] [INFO ] Deduced a trap composed of 87 places in 695 ms of which 7 ms to minimize.
[2024-06-01 08:38:52] [INFO ] Deduced a trap composed of 58 places in 598 ms of which 6 ms to minimize.
[2024-06-01 08:38:52] [INFO ] Deduced a trap composed of 69 places in 578 ms of which 6 ms to minimize.
[2024-06-01 08:38:53] [INFO ] Deduced a trap composed of 74 places in 529 ms of which 5 ms to minimize.
[2024-06-01 08:38:53] [INFO ] Deduced a trap composed of 55 places in 512 ms of which 6 ms to minimize.
[2024-06-01 08:38:54] [INFO ] Deduced a trap composed of 80 places in 334 ms of which 4 ms to minimize.
[2024-06-01 08:38:54] [INFO ] Deduced a trap composed of 32 places in 177 ms of which 2 ms to minimize.
[2024-06-01 08:38:54] [INFO ] Deduced a trap composed of 18 places in 649 ms of which 7 ms to minimize.
[2024-06-01 08:38:55] [INFO ] Deduced a trap composed of 45 places in 445 ms of which 4 ms to minimize.
[2024-06-01 08:38:56] [INFO ] Deduced a trap composed of 33 places in 635 ms of which 6 ms to minimize.
[2024-06-01 08:38:56] [INFO ] Deduced a trap composed of 105 places in 602 ms of which 12 ms to minimize.
[2024-06-01 08:38:56] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 1 ms to minimize.
Problem EisenbergMcGuire-PT-08-ReachabilityFireability-2024-15 is UNSAT
FORMULA EisenbergMcGuire-PT-08-ReachabilityFireability-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (INCLUDED_ONLY) 0/444 variables, 20/64 constraints. Problems are: Problem set: 1 solved, 10 unsolved
[2024-06-01 08:38:57] [INFO ] Deduced a trap composed of 91 places in 650 ms of which 7 ms to minimize.
[2024-06-01 08:38:57] [INFO ] Deduced a trap composed of 29 places in 126 ms of which 2 ms to minimize.
[2024-06-01 08:38:58] [INFO ] Deduced a trap composed of 87 places in 655 ms of which 6 ms to minimize.
[2024-06-01 08:38:59] [INFO ] Deduced a trap composed of 59 places in 665 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/444 variables, 4/68 constraints. Problems are: Problem set: 1 solved, 10 unsolved
[2024-06-01 08:39:00] [INFO ] Deduced a trap composed of 85 places in 644 ms of which 6 ms to minimize.
[2024-06-01 08:39:01] [INFO ] Deduced a trap composed of 63 places in 604 ms of which 7 ms to minimize.
[2024-06-01 08:39:01] [INFO ] Deduced a trap composed of 90 places in 664 ms of which 6 ms to minimize.
[2024-06-01 08:39:02] [INFO ] Deduced a trap composed of 94 places in 626 ms of which 6 ms to minimize.
[2024-06-01 08:39:03] [INFO ] Deduced a trap composed of 88 places in 555 ms of which 6 ms to minimize.
[2024-06-01 08:39:03] [INFO ] Deduced a trap composed of 98 places in 541 ms of which 6 ms to minimize.
[2024-06-01 08:39:04] [INFO ] Deduced a trap composed of 83 places in 525 ms of which 6 ms to minimize.
[2024-06-01 08:39:04] [INFO ] Deduced a trap composed of 31 places in 619 ms of which 13 ms to minimize.
[2024-06-01 08:39:05] [INFO ] Deduced a trap composed of 85 places in 545 ms of which 7 ms to minimize.
[2024-06-01 08:39:05] [INFO ] Deduced a trap composed of 82 places in 494 ms of which 5 ms to minimize.
[2024-06-01 08:39:06] [INFO ] Deduced a trap composed of 94 places in 501 ms of which 6 ms to minimize.
[2024-06-01 08:39:06] [INFO ] Deduced a trap composed of 60 places in 527 ms of which 6 ms to minimize.
[2024-06-01 08:39:07] [INFO ] Deduced a trap composed of 118 places in 663 ms of which 7 ms to minimize.
[2024-06-01 08:39:08] [INFO ] Deduced a trap composed of 103 places in 513 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/444 variables, 14/82 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/444 variables, 0/82 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 1/445 variables, 1/83 constraints. Problems are: Problem set: 1 solved, 10 unsolved
[2024-06-01 08:39:09] [INFO ] Deduced a trap composed of 22 places in 696 ms of which 7 ms to minimize.
[2024-06-01 08:39:10] [INFO ] Deduced a trap composed of 23 places in 635 ms of which 6 ms to minimize.
[2024-06-01 08:39:10] [INFO ] Deduced a trap composed of 3 places in 98 ms of which 2 ms to minimize.
[2024-06-01 08:39:11] [INFO ] Deduced a trap composed of 15 places in 614 ms of which 6 ms to minimize.
[2024-06-01 08:39:11] [INFO ] Deduced a trap composed of 20 places in 249 ms of which 3 ms to minimize.
[2024-06-01 08:39:12] [INFO ] Deduced a trap composed of 84 places in 490 ms of which 5 ms to minimize.
[2024-06-01 08:39:12] [INFO ] Deduced a trap composed of 97 places in 445 ms of which 5 ms to minimize.
[2024-06-01 08:39:13] [INFO ] Deduced a trap composed of 84 places in 584 ms of which 7 ms to minimize.
[2024-06-01 08:39:13] [INFO ] Deduced a trap composed of 82 places in 597 ms of which 7 ms to minimize.
[2024-06-01 08:39:14] [INFO ] Deduced a trap composed of 13 places in 522 ms of which 6 ms to minimize.
[2024-06-01 08:39:14] [INFO ] Deduced a trap composed of 114 places in 664 ms of which 7 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/445 variables, 11/94 constraints. Problems are: Problem set: 1 solved, 10 unsolved
[2024-06-01 08:39:15] [INFO ] Deduced a trap composed of 84 places in 536 ms of which 7 ms to minimize.
[2024-06-01 08:39:16] [INFO ] Deduced a trap composed of 106 places in 718 ms of which 7 ms to minimize.
[2024-06-01 08:39:17] [INFO ] Deduced a trap composed of 97 places in 712 ms of which 7 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/445 variables, 3/97 constraints. Problems are: Problem set: 1 solved, 10 unsolved
[2024-06-01 08:39:18] [INFO ] Deduced a trap composed of 69 places in 675 ms of which 7 ms to minimize.
[2024-06-01 08:39:19] [INFO ] Deduced a trap composed of 115 places in 613 ms of which 6 ms to minimize.
[2024-06-01 08:39:19] [INFO ] Deduced a trap composed of 67 places in 598 ms of which 6 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/445 variables, 3/100 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/445 variables, 0/100 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 807/1252 variables, 445/545 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1252 variables, 382/927 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1252 variables, 10/937 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1252 variables, 0/937 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 18 (OVERLAPS) 0/1252 variables, 0/937 constraints. Problems are: Problem set: 1 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1252/1252 variables, and 937 constraints, problems are : Problem set: 1 solved, 10 unsolved in 45006 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 445/445 constraints, ReadFeed: 382/382 constraints, PredecessorRefiner: 10/11 constraints, Known Traps: 75/75 constraints]
After SMT, in 47139ms problems are : Problem set: 1 solved, 10 unsolved
Fused 10 Parikh solutions to 9 different solutions.
FORMULA EisenbergMcGuire-PT-08-ReachabilityFireability-2024-06 TRUE TECHNIQUES PARIKH_WALK
FORMULA EisenbergMcGuire-PT-08-ReachabilityFireability-2024-07 FALSE TECHNIQUES PARIKH_WALK
FORMULA EisenbergMcGuire-PT-08-ReachabilityFireability-2024-04 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 3 properties in 17115 ms.
Support contains 36 out of 445 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 445/445 places, 2255/2255 transitions.
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 26 Pre rules applied. Total rules applied 0 place count 445 transition count 2229
Deduced a syphon composed of 26 places in 5 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 0 with 52 rules applied. Total rules applied 52 place count 419 transition count 2229
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 66 place count 405 transition count 2117
Iterating global reduction 0 with 14 rules applied. Total rules applied 80 place count 405 transition count 2117
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 5 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 88 place count 401 transition count 2113
Applied a total of 88 rules in 203 ms. Remains 401 /445 variables (removed 44) and now considering 2113/2255 (removed 142) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 203 ms. Remains : 401/445 places, 2113/2255 transitions.
RANDOM walk for 40000 steps (8 resets) in 277 ms. (143 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 71 ms. (555 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 242 ms. (164 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 156186 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :0 out of 7
Probabilistic random walk after 156186 steps, saw 91101 distinct states, run finished after 3001 ms. (steps per millisecond=52 ) properties seen :0
[2024-06-01 08:39:46] [INFO ] Flow matrix only has 665 transitions (discarded 1448 similar events)
// Phase 1: matrix 665 rows 401 cols
[2024-06-01 08:39:46] [INFO ] Computed 25 invariants in 4 ms
[2024-06-01 08:39:46] [INFO ] State equation strengthened by 284 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 356/392 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/392 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 9/401 variables, 7/25 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/401 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 665/1066 variables, 401/426 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1066 variables, 284/710 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1066 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 0/1066 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1066/1066 variables, and 710 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1274 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 401/401 constraints, ReadFeed: 284/284 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/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 356/392 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 08:39:47] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/392 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/392 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 9/401 variables, 7/26 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 08:39:48] [INFO ] Deduced a trap composed of 29 places in 412 ms of which 6 ms to minimize.
[2024-06-01 08:39:48] [INFO ] Deduced a trap composed of 27 places in 347 ms of which 4 ms to minimize.
[2024-06-01 08:39:49] [INFO ] Deduced a trap composed of 46 places in 313 ms of which 3 ms to minimize.
[2024-06-01 08:39:49] [INFO ] Deduced a trap composed of 49 places in 213 ms of which 5 ms to minimize.
[2024-06-01 08:39:49] [INFO ] Deduced a trap composed of 3 places in 417 ms of which 5 ms to minimize.
[2024-06-01 08:39:50] [INFO ] Deduced a trap composed of 55 places in 567 ms of which 6 ms to minimize.
[2024-06-01 08:39:51] [INFO ] Deduced a trap composed of 55 places in 576 ms of which 5 ms to minimize.
[2024-06-01 08:39:51] [INFO ] Deduced a trap composed of 23 places in 552 ms of which 6 ms to minimize.
[2024-06-01 08:39:52] [INFO ] Deduced a trap composed of 21 places in 560 ms of which 5 ms to minimize.
[2024-06-01 08:39:52] [INFO ] Deduced a trap composed of 20 places in 565 ms of which 6 ms to minimize.
[2024-06-01 08:39:53] [INFO ] Deduced a trap composed of 11 places in 561 ms of which 6 ms to minimize.
[2024-06-01 08:39:53] [INFO ] Deduced a trap composed of 60 places in 551 ms of which 5 ms to minimize.
[2024-06-01 08:39:54] [INFO ] Deduced a trap composed of 78 places in 568 ms of which 6 ms to minimize.
[2024-06-01 08:39:55] [INFO ] Deduced a trap composed of 3 places in 558 ms of which 5 ms to minimize.
[2024-06-01 08:39:55] [INFO ] Deduced a trap composed of 81 places in 489 ms of which 5 ms to minimize.
[2024-06-01 08:39:56] [INFO ] Deduced a trap composed of 3 places in 492 ms of which 5 ms to minimize.
[2024-06-01 08:39:56] [INFO ] Deduced a trap composed of 81 places in 501 ms of which 5 ms to minimize.
[2024-06-01 08:39:57] [INFO ] Deduced a trap composed of 71 places in 458 ms of which 5 ms to minimize.
[2024-06-01 08:39:57] [INFO ] Deduced a trap composed of 34 places in 480 ms of which 5 ms to minimize.
[2024-06-01 08:39:58] [INFO ] Deduced a trap composed of 25 places in 461 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 20/46 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 08:39:58] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 2 ms to minimize.
[2024-06-01 08:39:58] [INFO ] Deduced a trap composed of 54 places in 605 ms of which 5 ms to minimize.
[2024-06-01 08:39:59] [INFO ] Deduced a trap composed of 53 places in 598 ms of which 6 ms to minimize.
[2024-06-01 08:40:00] [INFO ] Deduced a trap composed of 44 places in 533 ms of which 6 ms to minimize.
[2024-06-01 08:40:00] [INFO ] Deduced a trap composed of 28 places in 607 ms of which 6 ms to minimize.
[2024-06-01 08:40:01] [INFO ] Deduced a trap composed of 30 places in 300 ms of which 3 ms to minimize.
[2024-06-01 08:40:01] [INFO ] Deduced a trap composed of 15 places in 596 ms of which 6 ms to minimize.
[2024-06-01 08:40:01] [INFO ] Deduced a trap composed of 3 places in 98 ms of which 1 ms to minimize.
[2024-06-01 08:40:02] [INFO ] Deduced a trap composed of 21 places in 604 ms of which 6 ms to minimize.
[2024-06-01 08:40:03] [INFO ] Deduced a trap composed of 19 places in 677 ms of which 6 ms to minimize.
[2024-06-01 08:40:03] [INFO ] Deduced a trap composed of 3 places in 627 ms of which 6 ms to minimize.
[2024-06-01 08:40:04] [INFO ] Deduced a trap composed of 17 places in 574 ms of which 5 ms to minimize.
[2024-06-01 08:40:04] [INFO ] Deduced a trap composed of 23 places in 208 ms of which 2 ms to minimize.
[2024-06-01 08:40:04] [INFO ] Deduced a trap composed of 27 places in 218 ms of which 3 ms to minimize.
[2024-06-01 08:40:05] [INFO ] Deduced a trap composed of 101 places in 593 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/401 variables, 15/61 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 08:40:05] [INFO ] Deduced a trap composed of 4 places in 183 ms of which 3 ms to minimize.
[2024-06-01 08:40:05] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2024-06-01 08:40:06] [INFO ] Deduced a trap composed of 68 places in 496 ms of which 6 ms to minimize.
[2024-06-01 08:40:06] [INFO ] Deduced a trap composed of 90 places in 409 ms of which 6 ms to minimize.
[2024-06-01 08:40:07] [INFO ] Deduced a trap composed of 22 places in 472 ms of which 6 ms to minimize.
[2024-06-01 08:40:07] [INFO ] Deduced a trap composed of 70 places in 554 ms of which 6 ms to minimize.
[2024-06-01 08:40:08] [INFO ] Deduced a trap composed of 86 places in 609 ms of which 6 ms to minimize.
[2024-06-01 08:40:09] [INFO ] Deduced a trap composed of 90 places in 610 ms of which 6 ms to minimize.
[2024-06-01 08:40:09] [INFO ] Deduced a trap composed of 94 places in 518 ms of which 6 ms to minimize.
[2024-06-01 08:40:10] [INFO ] Deduced a trap composed of 106 places in 540 ms of which 6 ms to minimize.
[2024-06-01 08:40:10] [INFO ] Deduced a trap composed of 125 places in 543 ms of which 5 ms to minimize.
[2024-06-01 08:40:11] [INFO ] Deduced a trap composed of 84 places in 488 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/401 variables, 12/73 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 08:40:11] [INFO ] Deduced a trap composed of 20 places in 583 ms of which 6 ms to minimize.
[2024-06-01 08:40:12] [INFO ] Deduced a trap composed of 71 places in 603 ms of which 8 ms to minimize.
[2024-06-01 08:40:13] [INFO ] Deduced a trap composed of 22 places in 578 ms of which 6 ms to minimize.
[2024-06-01 08:40:13] [INFO ] Deduced a trap composed of 60 places in 586 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/401 variables, 4/77 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 08:40:14] [INFO ] Deduced a trap composed of 46 places in 564 ms of which 6 ms to minimize.
[2024-06-01 08:40:15] [INFO ] Deduced a trap composed of 27 places in 615 ms of which 6 ms to minimize.
[2024-06-01 08:40:16] [INFO ] Deduced a trap composed of 73 places in 659 ms of which 6 ms to minimize.
[2024-06-01 08:40:16] [INFO ] Deduced a trap composed of 45 places in 543 ms of which 6 ms to minimize.
[2024-06-01 08:40:16] [INFO ] Deduced a trap composed of 49 places in 150 ms of which 2 ms to minimize.
[2024-06-01 08:40:17] [INFO ] Deduced a trap composed of 40 places in 153 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/401 variables, 6/83 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 08:40:17] [INFO ] Deduced a trap composed of 87 places in 586 ms of which 8 ms to minimize.
[2024-06-01 08:40:18] [INFO ] Deduced a trap composed of 63 places in 570 ms of which 5 ms to minimize.
[2024-06-01 08:40:19] [INFO ] Deduced a trap composed of 91 places in 653 ms of which 7 ms to minimize.
[2024-06-01 08:40:19] [INFO ] Deduced a trap composed of 67 places in 641 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/401 variables, 4/87 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 08:40:20] [INFO ] Deduced a trap composed of 43 places in 296 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/401 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 08:40:21] [INFO ] Deduced a trap composed of 13 places in 598 ms of which 6 ms to minimize.
[2024-06-01 08:40:21] [INFO ] Deduced a trap composed of 77 places in 441 ms of which 3 ms to minimize.
[2024-06-01 08:40:22] [INFO ] Deduced a trap composed of 70 places in 336 ms of which 4 ms to minimize.
[2024-06-01 08:40:22] [INFO ] Deduced a trap composed of 76 places in 337 ms of which 3 ms to minimize.
[2024-06-01 08:40:22] [INFO ] Deduced a trap composed of 50 places in 530 ms of which 6 ms to minimize.
[2024-06-01 08:40:23] [INFO ] Deduced a trap composed of 63 places in 582 ms of which 6 ms to minimize.
[2024-06-01 08:40:24] [INFO ] Deduced a trap composed of 65 places in 510 ms of which 5 ms to minimize.
[2024-06-01 08:40:24] [INFO ] Deduced a trap composed of 73 places in 594 ms of which 6 ms to minimize.
[2024-06-01 08:40:25] [INFO ] Deduced a trap composed of 48 places in 539 ms of which 6 ms to minimize.
[2024-06-01 08:40:25] [INFO ] Deduced a trap composed of 53 places in 516 ms of which 5 ms to minimize.
[2024-06-01 08:40:26] [INFO ] Deduced a trap composed of 67 places in 525 ms of which 5 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/401 variables, 11/99 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 08:40:27] [INFO ] Deduced a trap composed of 44 places in 462 ms of which 6 ms to minimize.
[2024-06-01 08:40:27] [INFO ] Deduced a trap composed of 73 places in 581 ms of which 6 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/401 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 08:40:28] [INFO ] Deduced a trap composed of 69 places in 614 ms of which 6 ms to minimize.
[2024-06-01 08:40:29] [INFO ] Deduced a trap composed of 66 places in 472 ms of which 6 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/401 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/401 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 665/1066 variables, 401/504 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1066 variables, 284/788 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1066 variables, 7/795 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 08:40:31] [INFO ] Deduced a trap composed of 65 places in 523 ms of which 6 ms to minimize.
[2024-06-01 08:40:31] [INFO ] Deduced a trap composed of 17 places in 510 ms of which 7 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1066 variables, 2/797 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 08:40:33] [INFO ] Deduced a trap composed of 64 places in 616 ms of which 6 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1066 variables, 1/798 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1066 variables, 0/798 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 23 (OVERLAPS) 0/1066 variables, 0/798 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1066/1066 variables, and 798 constraints, problems are : Problem set: 0 solved, 7 unsolved in 48290 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 401/401 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 81/81 constraints]
After SMT, in 49644ms problems are : Problem set: 0 solved, 7 unsolved
Parikh walk visited 0 properties in 10504 ms.
Support contains 36 out of 401 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 401/401 places, 2113/2113 transitions.
Applied a total of 0 rules in 87 ms. Remains 401 /401 variables (removed 0) and now considering 2113/2113 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 401/401 places, 2113/2113 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 401/401 places, 2113/2113 transitions.
Applied a total of 0 rules in 87 ms. Remains 401 /401 variables (removed 0) and now considering 2113/2113 (removed 0) transitions.
[2024-06-01 08:40:46] [INFO ] Flow matrix only has 665 transitions (discarded 1448 similar events)
[2024-06-01 08:40:46] [INFO ] Invariant cache hit.
[2024-06-01 08:40:47] [INFO ] Implicit Places using invariants in 508 ms returned []
[2024-06-01 08:40:47] [INFO ] Flow matrix only has 665 transitions (discarded 1448 similar events)
[2024-06-01 08:40:47] [INFO ] Invariant cache hit.
[2024-06-01 08:40:47] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-06-01 08:40:50] [INFO ] Implicit Places using invariants and state equation in 3127 ms returned []
Implicit Place search using SMT with State Equation took 3668 ms to find 0 implicit places.
[2024-06-01 08:40:50] [INFO ] Redundant transitions in 225 ms returned []
Running 2105 sub problems to find dead transitions.
[2024-06-01 08:40:50] [INFO ] Flow matrix only has 665 transitions (discarded 1448 similar events)
[2024-06-01 08:40:50] [INFO ] Invariant cache hit.
[2024-06-01 08:40:50] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2105 unsolved
[2024-06-01 08:41:22] [INFO ] Deduced a trap composed of 3 places in 503 ms of which 7 ms to minimize.
[2024-06-01 08:41:22] [INFO ] Deduced a trap composed of 3 places in 254 ms of which 3 ms to minimize.
[2024-06-01 08:41:22] [INFO ] Deduced a trap composed of 3 places in 189 ms of which 3 ms to minimize.
[2024-06-01 08:41:22] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 2 ms to minimize.
SMT process timed out in 32153ms, After SMT, problems are : Problem set: 0 solved, 2105 unsolved
Search for dead transitions found 0 dead transitions in 32201ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36212 ms. Remains : 401/401 places, 2113/2113 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1682 edges and 401 vertex of which 63 / 401 are part of one of the 8 SCC in 7 ms
Free SCC test removed 55 places
Drop transitions (Empty/Sink Transition effects.) removed 212 transitions
Ensure Unique test removed 1401 transitions
Reduce isomorphic transitions removed 1613 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 69 place count 346 transition count 432
Reduce places removed 68 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 70 rules applied. Total rules applied 139 place count 278 transition count 430
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 141 place count 276 transition count 430
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 141 place count 276 transition count 416
Deduced a syphon composed of 14 places in 1 ms
Ensure Unique test removed 6 places
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 175 place count 256 transition count 416
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Deduced a syphon composed of 98 places in 0 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 3 with 196 rules applied. Total rules applied 371 place count 158 transition count 318
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Iterating post reduction 3 with 37 rules applied. Total rules applied 408 place count 158 transition count 281
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 412 place count 156 transition count 282
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 413 place count 156 transition count 281
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 5 with 11 rules applied. Total rules applied 424 place count 156 transition count 270
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 424 place count 156 transition count 269
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 426 place count 155 transition count 269
Free-agglomeration rule applied 58 times.
Iterating global reduction 5 with 58 rules applied. Total rules applied 484 place count 155 transition count 211
Reduce places removed 58 places and 0 transitions.
Iterating post reduction 5 with 58 rules applied. Total rules applied 542 place count 97 transition count 211
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 550 place count 97 transition count 211
Applied a total of 550 rules in 105 ms. Remains 97 /401 variables (removed 304) and now considering 211/2113 (removed 1902) transitions.
Running SMT prover for 7 properties.
// Phase 1: matrix 211 rows 97 cols
[2024-06-01 08:41:22] [INFO ] Computed 19 invariants in 2 ms
[2024-06-01 08:41:22] [INFO ] [Real]Absence check using 17 positive place invariants in 8 ms returned sat
[2024-06-01 08:41:22] [INFO ] [Real]Absence check using 17 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-01 08:41:23] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-06-01 08:41:23] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2024-06-01 08:41:23] [INFO ] [Nat]Absence check using 17 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-01 08:41:23] [INFO ] After 201ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-06-01 08:41:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 08:41:23] [INFO ] After 118ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :7
TRAPS : Iteration 0
[2024-06-01 08:41:23] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-06-01 08:41:23] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-06-01 08:41:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 79 ms
[2024-06-01 08:41:23] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-06-01 08:41:23] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-06-01 08:41:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 69 ms
TRAPS : Iteration 1
[2024-06-01 08:41:23] [INFO ] After 583ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
[2024-06-01 08:41:24] [INFO ] After 1008ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Over-approximation ignoring read arcs solved 0 properties in 1267 ms.
[2024-06-01 08:41:24] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 7 ms.
[2024-06-01 08:41:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 401 places, 2113 transitions and 11138 arcs took 34 ms.
[2024-06-01 08:41:24] [INFO ] Flatten gal took : 412 ms
Total runtime 187479 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 : EisenbergMcGuire-PT-08-ReachabilityFireability-2024-00
Could not compute solution for formula : EisenbergMcGuire-PT-08-ReachabilityFireability-2024-02
Could not compute solution for formula : EisenbergMcGuire-PT-08-ReachabilityFireability-2024-03
Could not compute solution for formula : EisenbergMcGuire-PT-08-ReachabilityFireability-2024-05
Could not compute solution for formula : EisenbergMcGuire-PT-08-ReachabilityFireability-2023-09
Could not compute solution for formula : EisenbergMcGuire-PT-08-ReachabilityFireability-2023-12
Could not compute solution for formula : EisenbergMcGuire-PT-08-ReachabilityFireability-2023-13
BK_STOP 1717231285433
--------------------
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 EisenbergMcGuire-PT-08-ReachabilityFireability-2024-00
rfs formula type EF
rfs formula formula --invariant=/tmp/1078/inv_0_
rfs formula name EisenbergMcGuire-PT-08-ReachabilityFireability-2024-02
rfs formula type AG
rfs formula formula --invariant=/tmp/1078/inv_1_
rfs formula name EisenbergMcGuire-PT-08-ReachabilityFireability-2024-03
rfs formula type EF
rfs formula formula --invariant=/tmp/1078/inv_2_
rfs formula name EisenbergMcGuire-PT-08-ReachabilityFireability-2024-05
rfs formula type EF
rfs formula formula --invariant=/tmp/1078/inv_3_
rfs formula name EisenbergMcGuire-PT-08-ReachabilityFireability-2023-09
rfs formula type EF
rfs formula formula --invariant=/tmp/1078/inv_4_
rfs formula name EisenbergMcGuire-PT-08-ReachabilityFireability-2023-12
rfs formula type EF
rfs formula formula --invariant=/tmp/1078/inv_5_
rfs formula name EisenbergMcGuire-PT-08-ReachabilityFireability-2023-13
rfs formula type AG
rfs formula formula --invariant=/tmp/1078/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="EisenbergMcGuire-PT-08"
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 EisenbergMcGuire-PT-08, 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 r492-smll-171636266300191"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/EisenbergMcGuire-PT-08.tgz
mv EisenbergMcGuire-PT-08 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 ;